A Distributed Max-Min Flow Control Algorithm for Multi-rate Multicast Flows
2004 (English)In: GLOBECOM '04: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6, IEEE Press, 2004, 1140-1146 p.Conference paper (Refereed)
We present a distributed algorithm to compute bandwidth max-min fair rates in a multi-rate multicast network. The significance of the algorithm, compared to previous algorithms , [21, , is that it is more scalable in that it does not require each link to maintain the saturation status of all sessions and virtual sessions travelling through it, more stable in that it converges asymptotically to the desired equilibrium satisfying the minimum plus max-min fairness even in presence of heterogeneous round-trip delays, and has explicit link buffer control in that the buffer occupancy of every bottlenecked link in the network asymptotically converges to the pre-defined value. In addition, we propose an efficient feedback consolidation algorithm which is computationally simpler than its hard-synchronization based counterpart and eliminates unnecessary consolidation delay by preventing it from awaiting backward control packets(BCPs) that do not directly contribute to the session rate. Through simulations we verity the performance of the proposed multi-rate multicast flow control scheme based on these two algorithms.
Place, publisher, year, edition, pages
IEEE Press, 2004. 1140-1146 p.
, IEEE Global Telecommunications Conference (Globecom), ISSN 1930-529X
Multi-rate multicast, max-min flow control, feedback consolidation
IdentifiersURN: urn:nbn:se:kth:diva-90223DOI: 10.1109/GLOCOM.2004.1378135ISI: 000226689900217ISBN: 0-7803-8794-5OAI: oai:DiVA.org:kth-90223DiVA: diva2:504460
IEEE Global Telecommunications Conference (Globecom 2004), Dallas, NOV 29-DEC 03, 2004
© 2004 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
QC 201202222012-02-222012-02-202012-02-22Bibliographically approved