On the Scalability of Fair Queueing

The scalability of fair queueing depends on the number of flows that have, or recently have had, packets in the queue. Applying known facts about statistical traffic characteristics at flow level, we demonstrate that this number is typically very small for any link capacity. This suggests fair queueing may be perfectly feasible opening interesting possibilities for the development of the Internet architecture. The evaluation is based on trace simulations and an analytical traffic model.

[1]  kc claffy,et al.  Understanding Internet traffic streams: dragonflies and tortoises , 2002, IEEE Commun. Mag..

[2]  Scott Shenker,et al.  On the characteristics and origins of internet flow rates , 2002, SIGCOMM.

[3]  Sally Floyd,et al.  Difficulties in simulating the internet , 2001, TNET.

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

[5]  A. Kortebi,et al.  Cross-protect: implicit service differentiation and admission control , 2004, 2004 Workshop on High Performance Switching and Routing, 2004. HPSR..

[6]  John B. Nagle,et al.  On Packet Switches with Infinite Storage , 1987, IEEE Trans. Commun..

[7]  Richard G. Baraniuk,et al.  Connection-level analysis and modeling of network traffic , 2001, IMW '01.

[8]  Shun-Chen Niu,et al.  Duality and Other Results for M/G/1 and GI/M/1 Queues, Via a New Ballot Theorem , 1989, Math. Oper. Res..

[9]  George Varghese,et al.  Efficient fair queueing using deficit round-robin , 1996, TNET.

[10]  Guido Appenzeller,et al.  Sizing router buffers , 2004, SIGCOMM '04.

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

[12]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM 1996.

[13]  Thomas Bonald,et al.  Statistical bandwidth sharing: a study of congestion at flow level , 2001, SIGCOMM.

[14]  Scott Shenker,et al.  Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks , 2003, TNET.

[15]  Jorma Virtamo.  Idle and busy period distributions of an infinite capacity N * D/D/1 queue , 1994 .

[16]  Scott Shenker,et al.  A flow table-based design to approximate fairness , 2002, Proceedings 10th Symposium on High Performance Interconnects.