Switch scheduling via randomized edge coloring

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2003-January, Issue , 2003, Pages 502-512

  Aggarwal, G ^a   Motwani, R ^a   Shah, D ^a   Zhu, An ^a  

^a Stanford University   (United States)

Author keywords

Bipartite graph; Communication switching; Hardware; Internet; Packet switching; Routing; Scheduling algorithm; Stochastic processes; Switches; Traffic control

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE; DIRECTED GRAPHS; GRAPH THEORY; INTERNET; PACKET SWITCHING; RANDOM PROCESSES; SCHEDULING; STOCHASTIC SYSTEMS; SWITCHES; TRAFFIC CONTROL;

BIPARTITE GRAPHS; BIPARTITE MATCHINGS; BIPARTITE MULTIGRAPHS; COMMUNICATION SWITCHING; EDGE COLORING PROBLEMS; EDGE-COLORING ALGORITHMS; RANDOMIZED ALGORITHMS; ROUTING;

SCHEDULING ALGORITHMS;

EID: 77950857130     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2003.1238223     Document Type: Conference Paper

References (18)

1. S. Asmussen. Applied Probability and Queues. New York: Wiley, 1987.
2. A. Bar-Noy, R. Motwani and J. Naor. The Greedy Algorithm is Optimal for On-Line Edge Coloring. Information Processing Letters, 44 (1992), pages 251-253.
3. Cisco 12000 Gigabit Switch Router. Product overview, www.cisco.com, Feb. 2000.
4. R. Cole, K. Ost and S. Schirra. Edge Coloring Bipartite Multigraphs in O(E log D) Time. Combinatorica 21(1):5-12, 2001.
5. J. Dai and B. Prabhakar. The Throughput of Data Switches With and Without Speedup. Proceedings of INFOCOM 2000.
6. M.R. Garey and D.S. Johnson. Computers and intractability - a Guide to the Theory of NP-completeness. W.H. Freeman, 1979.
7. P. Giaccone, B. Prabhakar and D. Shah. Towards Simple, High-Performance Schedulers for High-aggregate bandwidth. Proceedings of INFOCOM 2002.
8. D. Grable and A. Panconesi. Nearly Optimal Distributed Edge Coloring in O(log log n) Rounds. http://citeseer.nj.nec.com/140887.html.
9. D. Dubhashi, D. Grable and A. Panconesi. Near-Optimal, Distributed Edge Coloring via the Nibble Method. Proceedings of ESA 1995.
10. N. McKeown, V. Anantharan and J. Walrand. Achieving 100% Throughput in an Input-Queued Switch. Proceedings of INFOCOM 1996.
11. N. McKeown. Scheduling algorithms for Input-Queued Switches. PhD Thesis, UC Berkeley, 1995.
12. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
13. A. Panconesi and A. Srinivasan. Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding bounds. Proceedings of PODC, 1992, pages 251-262.
14. D. Shah and M. Kopikare. Delay Bounds for Approximate Maximum Weight Matching Algorithms for Input-Queued Switches. Proceedings of INFOCOM 2002.
15. L. Tassiulas. Linear Complexity Algorithms for Maximum Throughput in Radio Networks and Input Queued Switches. Proceedings of INFOCOM 1998.
16. A. Rasala and G. Wilfong. Strictly non-blocking WDM cross-connects. Proceedings of SODA 2002.
17. L. Tassiulas and A. Ephremides. Stability Properties of Constrained Queueing Systems and Scheduling for Maximum Throughput in Multihop Radio Networks. IEEE Transactions on Automatic Control, Vol. 37, No. 12, pp. 1936-1949, December 1992.
18. V.G. Vizing. On an Estimate of the Chromatic Class of a p-graph. Metody Diskret. Analiz. 3 (1964), pages 25-30.