Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bertsekas D and Gallager R: ’Data Networks’, Second Edition, Prentice Hall, Upper Saddle River, New Jersey (1992).
Stevens W R: ’TCP/IP Illustrated, Volume 1: The Protocols’, Addison-Wesley, Reading, Massachusetts (1994).
Floyd S and Fall K: ’Promoting the use of end-to-end congestion control in the Internet’, IEEE/ACM Transactions on Networking, 7, No 4, pp 458–472 (1999).
Shreedhar M and Varghese G: ’Efficient fair queuing using deficit round robin’, Proc of ACM SIGCOMM’95, Cambridge, Massachusetts, USA, pp 231–243 (September 1995).
Lin D and Morris R: ’Dynamics of random early detection’, Proc of ACM SIGCOMM’97, Cannes, France, pp 127–137 (September 1997).
Mahajan R, Floyd S and Wetherall D: ’Controlling high bandwidth flows at the congested router’, Proc of ICNP’01, Riverside, California, USA, pp 192–201 (November 2001).
Pan R, Prabhakar B and Psounis K: ’CHOKe: a stateless active queue management scheme for approximating fair bandwidth allocation’, Proc of IEEE INFOCOM’00, Tel Aviv, Israel, pp 942–951 (March 2000).
Feng W, Shin K, Kandlur D and Saha D: ’The blue active queue management algorithms’, IEEE/ACM Transactions on Networking, 10, No 4, pp 513–528 (2002).
Stoica I, Shenker S and Zhang H: ’Core stateless fair queuing: a scalable architecture to approximate fair bandwidth allocations in high speed networks’, Proc of ACM SIGCOMM’98, Vancouver, Canada, pp 118–130 (September 1998).
Cao Z, Wang Z and Zegura E: ’Rainbow fair queuing: fair bandwidth sharing without per-flow state’, Proc of IEEE INFOCOM’00, Tel Aviv, Israel, pp 922–931 (March 2000).
Sivakumar R, Kim T E, Venkitaraman N, Li J R and Bharghavan V: ’Achieving per-flow weighted rate fairness in a core stateless network’, Proc of IEEE ICDCS’00, Taipei, Taiwan, pp 188–196 (April 2000).
Clerget A and Dabbous W: ’TUF: tag-based unified fairness’, Proc of IEEE INFOCOM’01, Anchorage, Alaska, pp 498–507 (April 2001).
Demers A, Keshav S and Shenker S: ’Analysis and simulation of a fair queuing algorithm’, Journal of Internetworking Research and Experience, 1, No 1, pp 3–26 (1990).
McKenney P E: ’Stochastic fairness queuing’, Proc of IEEE INFOCOM’90, San Francisco, California, USA, pp 733–740 (June 1990).
UCL/LBNL/VINT, Network Simulator (version 2) — http://www.isi.edu/nsnam/ns/
Floyd S and Jacobson V: ’Random early detection gateways for congestion avoidance’, IEEE/ACM Transactions on Networking, 1, No 4, pp 397–413 (1993).
About this article
Cite this article
Liew, H.S., Chien, S.F., Tan, S.W. et al. Approximate fair bandwidth sharing in high-speed multimedia networks. BT Technol J 24, 85–89 (2006). https://doi.org/10.1007/s10550-006-0043-8
Issue Date:
DOI: https://doi.org/10.1007/s10550-006-0043-8