Linear-complexity algorithms for QoS support in input-queued switches with no speedup

IEEE Journal on Selected Areas in Communications

Volumn 17, Issue 6, 1999, Pages 1040-1056

  Kam, Anthony C ^a   Siu, Kai Yeung ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; QUEUEING NETWORKS; SCHEDULING; SWITCHING SYSTEMS; TELECOMMUNICATION SERVICES;

INPUT QUEUED SWITCHES; QUALITY OF SERVICE; TRANSMISSION RATE;

DATA COMMUNICATION SYSTEMS;

EID: 0032637236     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.772432     Document Type: Article

References (40)

1. A. Kam, K.-Y. Siu, R. A. Barry, and E. Swanson, "A cell switching WDM broadcast LAN with bandwidth guarantee and fair access," J. Lightwave Technol., vol. 16, pp. 2265-2280. Dec. 1998.
2. A. Kam and K.-Y. Siu, "Linear complexity algorithms for bandwidth reservations and delay guarantees in input-queued switches with no speedup," in Proc. IEEE Int. Conf. Network Protocols, Austin, TX, Oct. 1998, pp. 2-11.
3. S. Keshav and R. Sharma, "Issues and trends in router design," IEEE Commun. Mag., pp. 144-151, May 1998.
4. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Automat. Contr., vol. 37, pp. 1936-1948, Dec. 1992.
5. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queued switchs," in Proc. IEEE INFOCOM 98, San Francisco, CA, pp. 533-539.
6. N. McKeown, V. Anantharam, and J. Walrand, "Achieving 100% throughput in an input-queued switch," in Proc. IEEE INFOCOM, San Francisco, CA, Mar. 1996, pp. 296-302.
7. A. Mekkittikul and N. McKeown, "A starvation-free algorithm for achieving 100% throughput in an input-queued switch," in Proc. ICCCN, 1996.
8. _, "A practical scheduling algorithm to achieve 100% throughput in input-queued switches," in Proc. IEEE INFOCOM '98, San Francisco, CA, pp. 792-799.
9. N. McKeown, "Scheduling Algorithms for Input-Queued Cell Switches," Ph.D. dissertation, Univ. California, Berkeley, CA, May 1995.
10. N. McKeown, M. Izzard, A. Mekkittikul, W. Ellersick, and M. Horowitz, "The Tiny Tera: A packet switch core," IEEE Micro, vol. 17, pp. 27-33, Jan./Feb. 1997.
11. B. Prabhakar and N. McKeown, "On the speedup required for combined input and output queued switching," Stanford Univ., Stanford, CA, Computer Science Lab Tech. Rep., 1997.
12. A. Charny, P. Krishna, N. Patel, and R. Simcoe, "Algorithms for providing bandwidth and delay guarantees in input-buffered crossbars with speedup," in Proc. IWQoS, 1998.
13. P. Krishna, N. Patel, A. Charny, and R. Simcoe, "On the speedup required for work-conserving crossbar switches," in Proc. IWQoS, 1998.
14. I. Stoica and H. Zhang, "Exact emulation of in output queueing switch by a combined input output queueing switch," in Proc. IWQoS, 1998.
15. S. T. Chuang, A. Goel, N. McKeown, and B. Prabhakar, "Matching output queueing with a combined input output queued switch," Stanford Univ., Stanford, CA, Tech. Rep. CSL-TR-98-758, Apr. 1998.
16. S. Li and N. Ansari, "Provisioning QoS features for input-queued ATM switches," Electron. Lett., vol. 34, no. 19, pp. 1826-1827, 1998.
17. F. Chiussi, J. Kneuer, and V. P. Kumar, "Low-cost scalable switching solutions for broadband networking: The ATLANTA architecture and chipset," IEEE Commun. Mag., vol. 35, pp. 44-53, Dec. 1997.
18. E. Oki and N. Yamanaka, "Tandem-crosspoint ATM switch with input and output buffers," IEEE Commun. Lett., vol. 2, pp. 189-191, July 1998.
19. M. Karol, M. Hluchyj, and S. Morgan, "Input versus output queueing on a space division switch," IEEE Trans. Commun., vol. 35, pp. 1347-1356, 1987.
20. I. I. Makhamreh, "Throughput analysis of input-buffered ATM switch," in Proc. Inst. Elect. Eng. Commun., vol. 145, pp. 15-19, Feb. 1998.
21. J. W. Son, H. T. Lee, and S. B. Lee, "Performance of an input-queued ATM switch with even/old switching planes," Electron. Lett., vol. 33, no. 14, 1997, pp. 1192-1193.
22. M. Karol and M. Hluchyj, "Queueing in high-performance packet-switching," IEEE J. Select. Areas. Commun., vol. 6, pp. 1587-1597, Dec. 1998.
23. T. Anderson, S. Owicki, J. Saxe, and C. Thacker, "High-speed switch scheduling for local-area networks," ACM Trans. Comput. Syst., vol. 11, pp. 319-352, Nov. 1993.
24. M. Shreedhar and G. Varghese, "Efficient fair queuing using deficit round robin," IEEE/ACM Trans. Networking, pp. 375-385, June 1996.
25. L. Zhang, "Virtual clock: A new traffic control algorithm for packet switching networks," in Proc. ACM SIGCOMM, 1990, pp. 19-29.
26. A. Parekh and R. Gallager, "A generalized processor sharing approach to flow control - The single node case," in Proc. IEEE InfoCom, 1992, pp. 915-924.
27. H. Zhang, "Service disciplines for guaranteed performance service in packet-switching networks," Proc. IEEE, vol. 83, pp. 1374-96, Oct. 1995.
28. I. Iliadis and W. E. Denzel, "Performance of packet switches with input and output queueing," in Proc. ICC, Atlanta, GA, 1990, pp. 747-753.
29. A. L. Gupta and N. D. Georganas, "Analysis of a packet switch with input and output buffers and speed constraints," in Proc. IEEE InfoCom, Bal Harbour, FL, 1991, pp. 694-700.
30. Y. Oie, M. Murara, K. Kubota, and H. Miyahara, "Effect of speedup in nonblocking packet switch," in Proc. ICC, Boston, MA, 1989, pp. 410-414.
31. J. S.-C. Chen and T. E. Stern, "Throughput analysis, optimal buffer allocation, and traffic imbalance study of a generic nonblocking packet switch," IEEE J. Select. Areas Commun., vol. 9, pp. 439-449, Apr. 1991.
32. D. Gale and L. S. Shapley, "College Admissions and the stability of marriage," American Math. Monthly, vol. 69, pp. 9-15, 1962.
33. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1993.
34. J. Turner, "New directions in communications (or which way to the information age)," IEEE Commun. Mag., vol. 24, pp. 8-15, 1986.
35. L. Zhang, "A New Architecture for Packet Switching Network Protocols," Ph.D. dissertation, MIT, Cambridge, MA, 1989.
36. R. Cruz, "A calculus for network delay, part I: Network elements in isolation," IEEE Trans. Inform. Theory, vol. 37, pp. 114-121, 1991.
37. R. Cruz, "A calculus for network delay, part II: Network elements in isolation," IEEE Trans. Inform. Theory, vol. 37, pp. 121-141, 1991.
38. H. Sariowan, "A Service Curve Approach to Performance Guarantees in Integrated Service Networks," Ph.D. dissertation, Univ. California, San Diego, CA, 1996.
39. L. Georgiadis, R. Guerin, V. Peris, and K. Sivarajan, "Efficient network QoS provisioning based on per node traffic shaping," IEEE/ACM Trans. Networking, vol. 4, Aug. 1996.
40. D. Bertsekas and R. Gallager, Data Networks, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall 1992, p. 524.