A Low-Jitter Guaranteed-Rate Scheduling

A Guaranteed-Rate scheduling algorithm for packet-switched IP routers with rate, delay and jitter guarantees is proposed. The algorithm can be used to schedule traffic with 100% throughput in Input-Queued IP routers with unity speedup. The traffic is scheduled according to transmission frames of duration F time-slots. An ������ doubly stochastic traffic rate matrix specifies a traffic rate between each pair of IO ports. The matrix is quantized and recursively decomposed into a sequence of F permutations. Each permutation is used to configure the crossbar switch for one time-slot without requiring additional scheduling. The recursive fair stochastic matrix de- composition is based upon the routing of a permutation through a binary rearrangeable network. In the resulting transmission schedule, the expected Inter-Departure Time (IDT) of a cell equals the Ideal IDT (IIDT), and the maximum IDT and service lag of a cell are bounded by an integer number of IIDTs. The delay and delay jitter experienced along an end-to-end path in a packet-switched IP/MPLS network are therefore small and bounded by an integer number of IIDTs, and the buffer sizes within the IP routers are small and bounded. The proposed algorithm can be used to schedule Guaranteed-Rate traffi ci n packet-switched IP/MPLS networks, to provide near-optimal queueing delays and essentially-zero delay jitter along end-to- end paths when playback buffers are employed.

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

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

[3]  H. R. Ramanujam.  Decomposition of Permutation Networks , 1973, IEEE Transactions on Computers.

[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]  Nick McKeown,et al.  ATM input-buffered switches with the guaranteed-rate property , 1998, Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166).

[7]  Y. K. Chiu,et al.  Comment on 'Novel algorithm for Clos-type networks' (and reply) , 1991 .

[8]  M. Paull.  Reswitching of connection networks , 1962 .

[9]  F. Hwang,et al.  The Mathematical Theory of Nonblocking Switching Networks (Series on Applied Mathematics) , 2004 .

[10]  Ted H. Szymanski,et al.  Randomized routing of virtual connections in essentially nonblocking log N-depth networks , 1995, IEEE Trans. Commun..

[11]  C. Cardot.  Comments on "A Simple Algorithm for the Control of Rearrangeable Switching Networks" , 1986, IEEE Trans. Commun..

[12]  Dave Gilbert,et al.  Provisioning mission-critical telerobotic control systems over internet backbone networks with essentially-perfect QoS , 2010, IEEE Journal on Selected Areas in Communications.

[13]  S. Srikanthan,et al.  Novel algorithm for Clos-type networks , 1990 .

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

[15]  Cheng-Shang Chang,et al.  On service guarantees for input-buffered crossbar switches: a capacity decomposition approach by Birkhoff and von Neumann , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[16]  D. C. Opferman,et al.  On a class of rearrangeable switching networks part I: Control algorithm , 1971 .

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

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

[19]  Bruce Hajek,et al.  Scheduling nonuniform traffic in a packet-switching system with small propagation delay , 1997, TNET.

[20]  Andrzej Jajszczyk.  A Simple Algorithm for the Control of Rearrangeable Switching Networks , 1985, IEEE Trans. Commun..

[21]  V. Benes,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[22]  Marek Kubale.  Comments on "Decomposition of Permutation Networks" , 1982, IEEE Trans. Computers.

[23]  Nick McKeown,et al.  A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1999 .

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

[25]  A. Yavuz Oruç,et al.  A nonbacktracking matrix decomposition algorithm for routing on Clos networks , 1993, IEEE Trans. Commun..

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

[27]  S. Andresen.  The Looping Algorithm Extended to Base 2tRearrangeable Switching Networks , 1977, IEEE Trans. Commun..

[28]  Marco Ajmone Marsan,et al.  Bounds on delays and queue lengths in input-queued cell switches , 2003, JACM.

[29]  Frank K. Hwang,et al.  Control Algorithms for Rearrangeable Clos Networks , 1983, IEEE Trans. Commun..

[30]  William J. Dally,et al.  Guaranteed scheduling for switches with configuration overhead , 2003, IEEE/ACM Trans. Netw..

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

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

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

[34]  T.H. Szymanski.  Bounds on end-to-end delay and jitter in input-buffered and internally-buffered IP networks , 2009, 2009 IEEE Sarnoff Symposium.

[35]  Frank Hwang,et al.  The Mathematical Theory of Nonblocking Switching Networks , 1998 .

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

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

[38]  Masayoshi Nabeshima.  Performance Evaluation of a Combined Input- and Crosspoint-Queued Switch , 2000 .

[39]  Nick McKeown,et al.  Matching output queueing with a combined input/output-queued switch , 1999, IEEE J. Sel. Areas Commun..

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

[41]  Andrzej Jajszczyk.  Nonblocking, repackable, and rearrangeable Clos networks: fifty years of the theory evolution , 2003, IEEE Commun. Mag..

[42]  T. Inukai,et al.  An Efficient SS/TDMA Time Slot Assignment Algorithm , 1979, IEEE Trans. Commun..

[43]  Harrick M. Vin,et al.  Generalized guaranteed rate scheduling algorithms: a framework , 1997, TNET.

[44]  T.H. Szymanski,et al.  Delivery of Guaranteed Rate Internet Traffic with Very Low Delay Jitter , 2007, 2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing.