Decentralized Computation of Weighted Max-Min Fair Bandwidth Allocation in Networks with Multicast Flows

We consider the problem of designing decentralized algorithms to achieve max-min fairness in multicast networks. Starting with a convex program formulation, we show that there exists an algorithm to compute the fairshare at each link using only the total arrival rate at each link. Further this information can be conveyed to the multicast receivers using a simple marking mechanism. The mechanisms required to implement the algorithm at the routers have low complexity since they do not require any per-flow information.

[1]  Sanjoy Paul,et al.  Layered video multicast with retransmissions (LVMR): evaluation of hierarchical rate control , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[2]  Martin Vetterli,et al.  Receiver-driven layered multicast , 1996, SIGCOMM 1996.

[3]  Sally Floyd,et al.  TCP and explicit congestion notification , 1994, CCRV.

[4]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[5]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[6]  Steven Low,et al.  Random early marking: an optimisation approach to Internet congestion control , 1999, IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243).

[7]  D. Lapsley,et al.  Random early marking for Internet congestion control , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[8]  Jon Crowcroft,et al.  TCP-like congestion control for layered multicast data transfer , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[9]  Leandros Tassiulas,et al.  Fair allocation of discrete bandwidth layers in multicast networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[10]  K. K. Ramakrishnan,et al.  A Proposal to add Explicit Congestion Notification (ECN) to IP , 1999, RFC.

[11]  Kai-Yeung Siu,et al.  On Max-Min Fair Congestion Control for Multicast ABR Service in ATM , 1997, IEEE J. Sel. Areas Commun..

[12]  R. Srikant,et al.  A time scale decomposition approach to adaptive ECN marking , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[13]  Richard J. Gibbens,et al.  Resource pricing and the evolution of congestion control , 1999, at - Automatisierungstechnik.

[14]  Richard J. Gibbens,et al.  Distributed connection acceptance control for a connectionless network , 1999 .

[15]  R. Srikant,et al.  End-to-end congestion control schemes: utility functions, random losses and ECN marks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[16]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[17]  Donald F. Towsley,et al.  The impact of multicast layering on network fairness , 1999, SIGCOMM '99.

[18]  Leandros Tassiulas,et al.  Distributed algorithms for computation of fair rates in multirate multicast trees , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).