Approximate fair bandwidth sharing in high-speed multimedia networks

Existing fair-queuing algorithms use complicated flow management mechanisms, thus making them expensive to deploy in current high-bandwidth networks. In this paper we propose a scalable SCORE (stateless core) approach to provide fair bandwidth sharing for a traffic environment composed of TCP and UDP flows. At an edge router, the arrival rates of each flow are estimated, each packet then being labelled with this estimate. The outgoing link’s fair share at a router is estimated based on UDP traffic. Probabilistic dropping is used to regulate those flows that send more than the fair share. At a core router, all the functions performed by an edge router are repeated, excluding the flow rate estimation. The simulation results show that the degree of fairness achieved by the proposed solution is comparable to that of other algorithms, but with a lower implementation cost.

[1]  Walid Dabbous,et al.  TUF: tag-based unified fairness , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[2]  Vaduvur Bharghavan,et al.  Achieving per-flow weighted rate fairness in a core stateless network , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[3]  Kang G. Shin,et al.  The BLUE active queue management algorithms , 2002, TNET.

[4]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[5]  Ratul Mahajan,et al.  Controlling high-bandwidth flows at the congested router , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[6]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[7]  Ellen W. Zegura,et al.  Rainbow fair queueing: fair bandwidth sharing without per-flow state , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[8]  Robert Tappan Morris,et al.  Dynamics of random early detection , 1997, SIGCOMM '97.

[9]  George Varghese,et al.  Efficient fair queueing using deficit round robin , 1995, SIGCOMM '95.

[10]  Scott Shenker,et al.  Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks , 1998, SIGCOMM '98.

[11]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[12]  Konstantinos Psounis,et al.  CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[13]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .