An efficient randomized algorithm for input-queued switch scheduling

Proceedings - Symposium on the High Performance Interconnects, Hot Interconnects

Volumn 2001-January, Issue , 2001, Pages 3-8

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

^a STANFORD UNIVERSITY   (United States)

^b POLITECNICO DI TORINO   (Italy)

Author keywords

Algorithm design and analysis; Bandwidth; Bipartite graph; Books; Impedance matching; Load management; Packet switching; Scalability; Scheduling algorithm; Switches

Indexed keywords

ALGORITHMS; BANDWIDTH; ELECTRIC LOAD MANAGEMENT; IMPEDANCE MATCHING (ELECTRIC); PACKET SWITCHING; ROUTERS; SCALABILITY; SCHEDULING; SWITCHES; SWITCHING NETWORKS; TIME SWITCHES;

ALGORITHM DESIGN AND ANALYSIS; BIPARTITE GRAPHS; BOOKS; ESSENTIAL PROBLEMS; INPUT QUEUED SWITCH; MAXIMUM WEIGHT MATCHING; RANDOMIZED ALGORITHMS; SWITCH SCHEDULING;

SCHEDULING ALGORITHMS;

EID: 0037773179     PISSN: 15504794     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HIS.2001.946686     Document Type: Conference Paper

References (19)

1. Tassiulas L., "Linear complexity algorithms for maximum throughput in radio networks and input queued switches", IEEE INFOCOM'98, vol. 2, New York, 1998, pp. 533-539
2. Azar Y., Broder A., Karlin A.,Upfal E., "Balanced Allocations", ACM STOC, 1994, pp. 593-602
3. Mitzenmacher M., "The power of two choices in randomized load balancing", PhD thesis, University of California, Berkeley, 1996.
4. Vvedenskaya N., Dobrushin R., Karpelevich F., "Queueing system with selection of the shortest of two queues : An asymptotic appro Problems of Information Transmission, 1996.
5. Psounis K., Prabhakar B., "A randomized web-cache replacement scheme", IEEE INFOCOM'01, Anchorage, Alaska, April 22-26, 2001.
6. Motwani R., Raghavan P., "Randomized algorithms", Cambridge Univ. Press, 1995
7. Karol M., Hluchyj M., Morgan S., "Input versus output queuing on a space division switch", IEEE Trans. on Communications, vol. 35, n. 12, Dec. 1987, pp. 1347-1356
8. McKeown N., Anantharan V., Walrand J., "Achieving 100% throughput in an input-queued switch" IEEE Infocom '96, vol. 1,San Francisco, Mar. 1996, pp. 296-302
9. Tassiulas L., Ephremides, A., "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks". IEEE Trans. on Automatic Control, vol. 37, n. 12, Dec. 1992, pp. 1936-1948.
10. Dai J., Prabhakar B., "The throughput of data switches with and without speedup", IEEE INFOCOM 2000, vol. 2, Tel Aviv, Mar. 2000, pp. 556-564
11. Tarjan R.E., Data structures and network algorithms, Society for Industrial and Applied Mathematics, Pennsylvania, Nov. 1983
12. Keshav S., Sharma R., "Issues and trends in router design", IEEE Communications Magazine, vol. 36, n. 5, May 1998, pp.144-151
13. McKeown N., "iSLIP: a scheduling algorithm for input-queued switches", IEEE Trans. on Networking, vol. 7, n. 2, Apr. 1999, pp. 188-201
14. McKeown N., "Scheduling algorithms for input-queued cell switches", Ph.D. Thesis, Un. of California at Berkeley, 1995
15. Ajmone Marsan M., Bianco A., Leonardi E., Milia L., "RPA: a flexible scheduling algorithm for input buffered switches", IEEE Trans. on Communications, vol. 47, n. 12, Dec. 1999, pp. 1921-33
16. Duan H., Lockwood J.W., Kang S.M., Will J.D., "A high performance OC12/OC48 queue design prototype for input buffered ATM switches", IEEE INFOCOM'97, vol. 1, Kobe, 1997, pp. 20-28.
17. Ajmone Marsan M., Bianco A., Filippi E., Giaccone P., Leonardi E., Neri F., "On the behavior of input queuing switch architectures", European Trans. on Telecommunications, vol. 10, n. 2, Mar. 1999, pp. 111-124
18. Goudreau M.W., Kolliopoulos S.G., Rao S.B., "Scheduling algorithms for input-queued switches: randomized techniques and experimental evaluation", IEEE INFOCOM 2000, vol. 3, Tel-Aviv, Mar. 2000, pp. 1634-1643
19. 2.5 algorithm for maximum matching in bipartite graphs", Society for Industrial and Applied Mathematics J. Comput., vol. 2, 1973, pp. 225-231