A low-jitter Guaranteed-Rate scheduling algorithm for packet-switched IP routers

IEEE Transactions on Communications

Volumn 57, Issue 11, 2009, Pages 3446-3459

  Szymanski, T H ^a  

^a MCMASTER UNIVERSITY   (Canada)

Author keywords

Guaranteed rate; Low jitter; Multicasting; QoS; Quality of service; Recursive fair stochastic matrix decomposition; Scheduling; Switching

Indexed keywords

BUFFER SIZES; CROSSBAR SWITCH; DELAY AND JITTER; DELAY JITTERS; DEPARTURE TIME; DOUBLY STOCHASTIC; END-TO-END PATH; GUARANTEED RATE; INPUT-QUEUED; INTEGER NUMBERS; IO PORTS; IP ROUTERS; IP/MPLS NETWORKS; LOW JITTER; MATRIX; PACKET-SWITCHED; QOS; QUEUEING DELAYS; REARRANGEABLE NETWORKS; STOCHASTIC MATRICES; TIME SLOTS; TRAFFIC RATE; TRANSMISSION FRAMES; ZERO DELAY;

JITTER; MATRIX ALGEBRA; MULTICASTING; PACKET NETWORKS; QUALITY CONTROL; QUALITY OF SERVICE; ROUTERS; STOCHASTIC SYSTEMS; SWITCHING CIRCUITS;

SCHEDULING ALGORITHMS;

EID: 77952194673     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2009.11.070666     Document Type: Article

References (54)

1. Cisco News Release, "Bell Canada uses CISCO technology to help deliver surgical grade network to power historic telerobotics assisted surgery", Mar. 2003. [Online]. Available: www.cisco.com
2. Cisco Systems White Paper, "Optimizing video transport in your IP triple play network", 2006. [Online]. Available: www.cisco.com
3. M. Hluchyi, M. Karol, and S. Morgan, "Input versus output queueing on a space division switch", IEEE Trans. Commun., vol. 35, 1987.
4. R. Cruz, "A calculus for network delays-part 1: network elements in isolation", IEEE Trans. Inf. Theory, vol. 37, no. 1, pp. 114-131, Jan. 1991.
5. R. Cruz, "A calculus for network delays-part 2: network delay", IEEE Trans. Inf. Theory, vol. 37, no. 1, pp. 132-141, Jan. 1991.
6. A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated service networks: the single node case", IEEE/ACM Trans. Networking, vol. 1, pp. 344-357, 1993.
7. A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated service networks: the multiple node case", IEEE/ACM Trans. Networking, vol. 2, no. 2, pp. 137-150, 1994.
8. V. Anantharam, N. McKeown, A. Mekittikul, and J. Walrand, "Achieving 100% throughput in an input queued switch", IEEE Trans. Commun., vol. 47, no. 8, pp. 1260-1267, 1999.
9. E. Leonardi, M. Mellia, F. Neri, and M. A. Marsan, "Bounds on the delay and queue lengths in input-queued cell switches", J. ACM, vol. 50, no. 4, pp. 520-550, July 2003.
10. S. T. Chuang, A. Goel, N. McKeown, and B. Prabhakar, "Matching output queueing with a combined input/output-queued switch", IEEE J. Sel. Areas Commun., vol. 17, no. 6, pp. 1030-1039, June 1999.
11. N. Nabeshima, "Performance evaluation of a combined input and crosspoint queued switch", IEICE Trans. Commun., vol. E83-B, no. 3, pp. 737-741, Mar. 2000.
12. C. E Koksal, R. G. Gallager, and C. E. Rohrs, "Rate quantization and service quality over single crossbar switches", in Proc. IEEE Infocom., 2004.
13. P. Gopya and H. M. Vin, "Generalized guaranteed rate scheduling algorithms: a framework", IEE/ACM Trans. Networking, vol. 5, no. 4, pp. 561-571, Aug. 1977.
14. I. Keslassy, M. Kodialam, T. V. Lakshamn, and D. Stiliadis, "On guaranteed smooth scheduling for input-queued switches", IEEE/ACM Trans. Networking, vol. 13, no. 6, Dec. 2005.
15. M. S. Kodialam, T. V. Lakshman, and D. Stilladis, "Scheduling of guaranteed-bandwidth low-jitter traffic in input-buffered switches", US Patent Application 20030227901, 2003.
16. M. Hall, Combinatorial Theory. Waltham, MA: Blaisdell.
17. V. E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, 1965.
18. F. K. Hwang, The Mathematical Theory of Nonblocking Switching Networks", World Scientific Series on Applied Mathematics. New Jersey: 1998.
19. A. Jajszczyk, "Nonblocking, repackable and rearrangeable Clos networks: fifty years of the theory evolution", IEEE Commun. Mag., pp. 28-33, Oct. 2003.
20. J. S. Turner and R. Melen, "Multirate Clos networks: 50Th anniversary of Clos networks", IEEE Commun. Mag., pp. 38-44, 2003.
21. T. Inukai, "An efficient SS/TDMA time slot assignment algorithm", IEEE Trans. Commun., no. 10, pp. 1449-1455, 1979.
22. T. Weller and B. Hajek, "Scheduling nonuniform traffic in a packet switching system with small propagation delay", IEEE/ACM Trans. Networking, vol. 5, no. 6, pp. 813-823, 1997.
23. A. Hung, G. Kesidis, and N. McKeown, "ATM input buffered switches with guaranteed rate property", in Proc. IEEE ISCC, 1998.
24. B. Towles and W. J. Dally, "Guaranteed scheduling for switches with configuration overhead", IEEE Trans. Networking, vol. 11, no. 5, pp. 835-847, Oct. 2003.
25. W. J. Chen, C.-S. Chang, and H.-Y. Huang, "Birkhoff-von Neumann input buffered crossbar switches", in Proc. IEEE Infocom, 2000.
26. C.-S. Chang, W. J. Chen, and H.-Y. Huang, "On service guarantees for input buffered crossbar wwitches: a capacity decomposition approach by Birkhoff and von Neuman", in Proc. IEEE iWQoS, pp. 79-86, 1999.
27. S. R. Mohanty and L. N. Bhuyan, "Guaranteed smooth switch scheduling with low complexity", in Proc. IEEE Globecom, 2005, pp. 626-630.
28. M. C. Paull, "Reswitching of connection networks", Bell Syst. Tech. J., vol. 41, pp. 833-855, 1962.
29. D. C. Opferman and N. T. Tsao-Wu, "On a class of rearrangeable switching networks-part I: control algorithm", Bell Syst. Tech. J., vol. 5O, no. 5, pp. 1579-1600, May-June 1971.
30. S. Andresen, "The looping algorithm extended to base 2 rearrangeable switching networks", IEEE Trans. Commun., vol. 25, no. 10, pp. 1057-1063, Oct. 1977.
31. F. Hwang, "Control algorithms for rearrangeable Clos networks", IEEE Trans. Commun., vol. 31, pp. 952-954, Aug. 1983.
32. J. Gordon and S. Srikanthan, "Novel algorithm for Clos-type networks", IEEE Electron. Lett., vol. 26, no. 21, pp. 1772-1774, Oct. 1990.
33. Y. K. Chiu and W. C. Siu, "Comment: novel algorithm for Clos-type networks", IEEE Electron. Lett., vol. 27, no. 6, pp. 524-526, Mar. 1991.
34. H. R. Ramanujam, "Decomposition of permutation networks", IEEE Trans. Comput., vol. C-22, pp. 639-643, July 1973.
35. M. Kubale, "Comments on decomposition of permutation networks", IEEE Trans. Comput., vol. C-31, pp. 265, Mar. 1982.
36. A. Jajszczyk, "A simple algorithm for the control of rearrangeable switching networks", IEEE Trans. Commun., vol. 33, pp. 169-171, Feb. 1985. (Pubitemid 15459838)
37. C. Cardot, "Comments on a simple control algorithm for the control of rearrangeable switching networks", IEEE Trans. Commun., vol. 34, p. 395, Apr. 1986.
38. J. D. Carpinelli and A. Y. Oruc, "A nonbacktracking matrix decomposition algorithm for routing on Clos networks", IEEE Trans. Commun., vol. 41, no. 8, pp. 1245-1251, Aug. 1993.
39. Y. Ganjali and N. McKeown, "Update on buffer sizing in Internet routers", ACM Sigcomm Comp. Commun. Rev., vol. 36, no. 5, pp. 67-70, Oct. 2006.
40. G. Appenzeller, I. Keslassy, and N. McKeown, "Sizing router buffers", in Proc. Sigcomm, pp. 281-292, ACM Press, 2004.
41. G. Raina and D. Wishick, "Buffer sizes for large multiplexers: TCP queueing theory and instability analysis", in Proc. EuroNGI, Apr. 2005.
42. M. Enachescu, Y. Ganjali, A. Goel, N. McKeown, and T. Roughgarden, "Routers with very small buffers", in Proc. IEEE Infocom., Apr. 2006
43. A. Dhamdhere and C. Dovrolis, "Open issues in router buffer sizing", ACM/SIGCOMM Comp. Commun. Rev., vol. 36, no. 1, pp. 87-92, Jan. 2006.
44. G. Vu-Brugier, R. S. Stanojevic, D. J. Leith, and R. N. Shorten, "A critique of recently proposed buffer sizing strategies", ACM/SIGCOMM Comp. Commun. Rev., vol. 37, no. 1, pp. 43-47, May 2007.
45. T. H. Szymanski, "QoS switch scheduling using recursive fair stochastic matrix decomposition", in Proc. IEEE High Performance Switching and Routing (HPSR) Conf., 2006, pp. 417-424.
46. T. H. Szymanski, "Method and apparatus to schedule packets through a crossbar switch with delay guarantees", US Patent Application, submitted.
47. T. H. Szymanski and C. Feng, "Randomized routing of virtual connections in an essentially nonblocking log N-depth network", IEEE Trans. Commun., vol. 43, no. 9, pp. 2521-2531, Sep. 1995.
48. T. H. Szymanski and D. Gilbert, "Delivery of guaranteed rate internet traffic with very low delay jitter", in Proc. IEEE Pacific Rim Conf. Control, Commun. Signal Processing, Aug. 2007, pp. 450-455.
49. T. H. Szymanski and D. Gilbert, "Low-jitter guaranteed-rate communications for cluster computing systems" (invited), Pacific Rim Special Issue, Int. J. Computer Networks Distributed Syst., vol. 2. no. 1, pp. 140-160, 2008.
50. T. H. Szymanski and D. Gilbert, "Internet multicasting of IPTV with essentially zero delay fitter", IEEE Trans. Broadcast., vol. 55, no. 1, pp. 20-30, Mar. 2009.
51. T. H. Szymanski, "Bounds on the end-to-end delay and jitter in inputbuffered and internally buffered IP networks", in Proc. IEEE Sarnoff Symposium, Apr. 2009.
52. T. H. Szymanski, "A conflict-free low-jitter guaranteed rate MAC protocol for base-station communications in a wireless mesh network." in Proc. Int. Conf. Accessnets, Oct. 2008.
53. T. H. Szymanski, "Throughput and QoS optimization in nonuniform wireless mesh networks", in Proc. ACM Int. Workshop Q2SWINET, Nov. 2008, pp. 9-19.
54. T. H. Szymanski and D. Gilbert, "Provisioning mission-critical telerobotic control systems over Internet backbone networks with essentiallyperfect QoS", submitted.