Randomized scheduling algorithms for high-aggregate bandwidth switches

IEEE Journal on Selected Areas in Communications

Volumn 21, Issue 4, 2003, Pages 546-559

  Giaccone, Paolo ^a   Prabhakar, Balaji ^b   Shah, Devavrat ^b  

^a POLITECNICO DI TORINO   (Italy)

^b Stanford University   (United States)

Author keywords

Input queued switch scheduling; Packet switching; Randomized scheduling algorithms

Indexed keywords

ALGORITHMS; BANDWIDTH; PACKET NETWORKS; QUEUEING NETWORKS; RANDOM PROCESSES; ROUTERS; SCHEDULING; TELECOMMUNICATION TRAFFIC;

RANDOMIZED SCHEDULING ALGORITHMS;

SWITCHING NETWORKS;

EID: 0038623639     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2003.810496     Document Type: Article

References (28)

1. M. M.Marsan M. Ajmone, A. Bianco, E. Leonardi, and L. Milia, "RPA: a flexible scheduling algorithm for input buffered switches," IEEE Trans. Commun., vol. 47, pp. 1921-1933, Dec. 1999.
2. 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-351, Nov. 1993.
3. C.S. Chang, D.S. Lee, and Y. S. Jou, "Load balanced Birkhoff-von Neumann switches," in Proc. 2001 IEEE Workshop on High Performance Switching and Routing, 2001, pp. 276-280.
4. S.-T. Chuang, A. Goel, N. McKeown, and B. Prabhakar, "Matching output queueing with a combined input output queued switch," IEEE J. Select. Areas Commun., vol. 17, pp. 1030-1039, 1999.
5. J. Dai and B. Prabhakar, "The throughput of data switches with and without speedup," in Proc. IEEE INFOCOM 2000, vol. 2, Tel-Aviv, Israel, Mar. 2000, pp. 556-564.
6. H. Duan, J. W. Lockwood, S. M. Kang, and J. D. Will, "A high performance OC12/OC48 queue design prototype for input buffered ATM switches," in Proc. IEEE INFOCOM'97, vol. 1, Kobe, Japan, 1997, pp. 20-28.
7. R. Durrett, Probability: Theory and Examples, 2nd ed. Belmont, CA: Duxbury, 1995.
8. Y. Ganjali, A. Kesavarzian, and D. Shah, "Input queued switch: packet v/s cell scheduling," presented at the IEEE INFOCOM'03, San Francisco, CA, Apr. 2003.
9. P. Giaccone, D. Shah, and B. Prabhakar, "An implementable parallel scheduler for input-queued switches," in Proc. Hot Interconnects 9, Stanford, CA, Aug. 2001, pp. 9-14.
10. P. Giaccone, "Queueing and scheduling algorithms for high performance routers," Ph.D. dissertation, Politecnico di Torino, Italy, Feb. 2002.
11. M. W. Goudreau, S. G. Kolliopoulos, and S. B. Rao, "Scheduling algorithms for input-queued switches: randomized techniques and experimental evaluation," in Proc. IEEE INFOCOM 2000, vol. 3, Tel-Aviv, Israel, Mar. 2000, pp. 1634-1643.
12. S. Iyer and N. McKeown, "Making parallel packet switches practical," in Proc. IEEE INFOCOM'01, vol. 3, Anchorage, AK, Apr. 22-26, 2001, pp. 1680-1687.
13. S. Keshav and R. Sharma, "Issues and trends in router design," IEEE Commun. Mag., vol. 36, pp. 144-151, May 1998.
14. P. Krishna, N. S. Patel, A. Chamy, and R. J. Simcoe, "On the speedup required for work-conserving crossbar switches," IEEE J. Select. Areas Commun., vol. 17, pp. 1057-1066, June 1999.
15. E. Leonardi, M. Mellia, F. Neri, and M. A. Marsan, "Bounds on average delays and queue size averages and variances in input queued cell-based switches," in Proc. IEEE INFOCOM 2001, vol. 3, Anchorage, AK, Apr. 22-26, 2001, pp. 1095-1103.
16. N. McKeown, V. Anantharan, and J. Walrand, "Achieving 100% throughput in an input-queued switch," in Proc. IEEE INFOCOM'96, vol. 1, San Francisco, CA, Mar. 1996, pp. 296-302.
17. N. McKeown, "Scheduling algorithms for input-queued cell switches," Ph.D. dissertation, Univ. California, Berkeley, CA, 1995.
18. _, "iSLIP: a scheduling algorithm for input-queued switches," IEEE Trans. Networking, vol. 7, pp. 188-201, Apr. 1999.
19. A. Mekkittikul and N. McKeown, "A practical scheduling algorithm to achieve 100% throughput in input-queued switches," in Proc, IEEE INFOCOM '98, vol. 2, Apr. 1998, pp. 792-799.
20. M. Mitzenmacher, "The power of two choices in randomized load balancing," Ph.D. dissertation, Univ. California, Berkeley, CA, 1996.
21. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
22. A. Nijenhuis and H. Wilf, Combinatorial Algorithms: for Computers and Calculators, 2nd ed. New York: Academic, 1978, ch. 7, p. 56.
23. K. Psounis and B. Prabhakar, "A randomized web-cache replacement scheme," in Proc. IEEE INFOCOM'01, Anchorage, AK, Apr. 22-26, 2001, pp. 1407-1415.
24. B. Prabhakar and N. McKeown, "On the speedup required for combined input and output queued switching," Automatica, vol. 35, no. 12, pp. 1909-1920, 1999.
25. D. Shah, P. Giaccone, and B. Prabhakar, "An efficient randomized algorithm for input-queued switch scheduling," in Proc. Hot Interconnects 9, Stanford, CA, Aug. 2001, pp. 3-8.
26. Y. Tamir and H.-C. Chi, "Symmetric crossbar arbiters for VLSI communication switches," IEEE Trans. Parallel Distrib. Syst., vol. 4, pp. 13-27, Jan. 1993.
27. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queued switches," in Proc. IEEE INFOCOM'98, vol. 2. New York, 1998, pp. 533-539.
28. 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.