Providing deterministic end-to-end fairness guarantees in core-stateless networks

End-to-end fairness guarantee is an important service semantics that network providers would like to offer to their customers. A network provider can offer such service semantics by deploying a network where each router employs a fair packet scheduling algorithm. Unfortunately, these scheduling algorithms require every router to maintain per-flow state and perform per-packet flow classification; these requirements limit the scalability of the routers. In this paper, we propose the Core-stateless Guaranteed Fair (CSGF) network architecture--the first work-conserving architecture that, without maintaining per-flow state or performing per-packet flow classification in core routers, provides to flows fairness guarantees similar to those provided by a network of core-stateful fair routers.

[1]  Andrew M. Odlyzko,et al.  The Size and Growth Rate of the Internet , 1999, First Monday.

[2]  Lixia Zhang,et al.  Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks , 1990, SIGCOMM.

[3]  Yiwei Thomas Hou,et al.  Virtual time reference system: a unifying scheduling framework for scalable support of guaranteed services , 2000, IEEE Journal on Selected Areas in Communications.

[4]  Harrick M. Vin,et al.  Core-stateless guaranteed throughput networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[5]  Harrick M. Vin,et al.  End-to-end fairness analysis of fair queuing networks , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[6]  ZhangHui,et al.  Comparison of rate-based service disciplines , 1991 .

[7]  Lixia Zhang,et al.  VirtualClock: a new traffic control algorithm for packet-switched networks , 1991, TOCS.

[8]  Edward W. Knightly,et al.  Coordinated network scheduling: a framework for end-to-end services , 2000, Proceedings 2000 International Conference on Network Protocols.

[9]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[10]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[11]  Jean-Yves Le Boudec,et al.  Delay jitter bounds and packet scale rate guarantee for expedited forwarding , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[12]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1997, TNET.

[13]  Jean-Yves Le Boudec,et al.  Delay jitter bounds and packet scale rate guarantee for expedited forwarding , 2002, TNET.

[14]  B. R. Badrinath,et al.  Distributed admission control to support guaranteed services in core-stateless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[16]  Hui Zhang,et al.  Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.

[17]  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).

[18]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

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

[20]  Srinivasan Keshav,et al.  Comparison of rate-based service disciplines , 1991, SIGCOMM '91.

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

[22]  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).

[23]  Yiwei Thomas Hou,et al.  Decoupling QoS control from core routers: a novel bandwidth broker architecture for scalable support of guaranteed services , 2000, SIGCOMM 2000.

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

[25]  Harrick M. Vin,et al.  Core-stateless guaranteed rate scheduling algorithms , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[26]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM 1996.

[27]  Ion Stoica,et al.  Providing guaranteed services without per flow management , 1999, SIGCOMM '99.

[28]  Vikas Agarwal,et al.  Clock rate versus IPC: the end of the road for conventional microarchitectures , 2000, Proceedings of 27th International Symposium on Computer Architecture (IEEE Cat. No.RS00201).

[29]  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).