Bounds on end-to-end delay and jitter in input-buffered and internally-buffered IP networks

Bounds on the end-to-end delay, jitter and service lead/lag for all statically-provisioned multimedia traffic flows routed through any network of Input-Queued (IQ) switches are presented. A Recursive Fair Stochastic Matrix Decomposition (RFSMD) algorithm is used to determine near-optimal transmission schedules for each switch, where the jitter and service lead/lag of all flows are simultaneously bounded by K · IIDT time-slots for small constant K, where IIDT denotes the Ideal Inter-Departure Time for each flow. It is established that: (a) the number of buffered cells per flow per switch is near-minimal and bounded by O(K) cells, (b) the end-to-end queueing delay along an H-hop path is near-minimal and bounded by O(KH · IIDT ) time-slots, (c) the end-to-end jitter and service lead/lag are near-minimal and bounded byO(K · IIDT ) time-slots (the jitter is not cumulative), and (d) all network-introduced jitter can be provably removed using small playback buffers with O(K) cells. It follows that all statically-provisioned traffic flows, including VOIP, IPTV and Video-on-Demand traffic, can be delivered with essentially-perfect QoS even at 100% loads, thereby achieving the optimal statistical multiplexing gain. The bounds also apply when the crossbar switches use a combination of IQs and crosspoint queues. These theories explain several exhaustive results which have recently been presented in the literature.

[1]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

[2]  Amogh Dhamdhere,et al.  Open issues in router buffer sizing , 2006, CCRV.

[3]  T.H. Szymanski.  A QoS switch scheduling algorithm based on recursive fair stochastic matrix decomposition , 2006, 2006 Workshop on High Performance Switching and Routing.

[4]  Dave Gilbert,et al.  Low jitter guaranteed-rate communications for cluster computing systems , 2008 .

[5]  Ted H. Szymanski.  A Conflict-Free Low-Jitter Guaranteed-Rate MAC Protocol for Base-Station Communications in Wireless Mesh Networks , 2008, AccessNets.

[6]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.

[7]  Ted H. Szymanski.  Throughput and QoS optimization in nonuniform multichannel wireless mesh networks , 2008, Q2SWinet '08.

[8]  Cheng-Shang Chang,et al.  Birkhoff-von Neumann input-buffered crossbar switches for guaranteed-rate services , 2001, IEEE Trans. Commun..

[9]  Tim Roughgarden,et al.  Routers with Very Small Buffers , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[10]  Murali S. Kodialam,et al.  On guaranteed smooth scheduling for input-queued switches , 2005, IEEE/ACM Transactions on Networking.

[11]  Nick McKeown,et al.  The iSLIP scheduling algorithm for input-queued switches , 1999, TNET.

[12]  G. Raina,et al.  Buffer sizes for large multiplexers: TCP queueing theory and instability analysis , 2005, Next Generation Internet Networks, 2005.

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

[14]  Dave Gilbert,et al.  Internet Multicasting of IPTV With Essentially-Zero Delay Jitter , 2009, IEEE Transactions on Broadcasting.

[15]  Laxmi N. Bhuyan,et al.  Guaranteed smooth switch scheduling with low complexity , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[16]  Can Emre Koksal,et al.  Rate quantization and service quality over single crossbar switches , 2004, IEEE INFOCOM 2004.

[17]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[18]  Cheng-Shang Chang,et al.  Birkhoff-von Neumann input buffered crossbar switches , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[19]  Rade Stanojevic,et al.  A critique of recently proposed buffer-sizing strategies , 2007, CCRV.

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

[21]  Ted H. Szymanski,et al.  A low-jitter guaranteed-rate scheduling algorithm for packet-switched ip routers , 2009, IEEE Transactions on Communications.

[22]  Nick McKeown,et al.  Update on buffer sizing in internet routers , 2006, CCRV.