Optimal scheduling algorithms for input-queued switches

Proceedings - IEEE INFOCOM

Volumn , Issue , 2006, Pages

  Shah, Devavrat ^a   Wischik, Damon ^b  

^a Dept of Aeronautics and Astronautics

^b Science and Technology Studies Department

Author keywords

[No Author keywords available]

Indexed keywords

INGRESS PORTS; INPUT-QUEUED SWITCHES; INTERNET ROUTERS;

MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; QUEUEING NETWORKS; SWITCHING NETWORKS;

SCHEDULING ALGORITHMS;

EID: 39049126638     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2006.238     Document Type: Conference Paper

References (18)

1. N. McKeown, V. Anantharam, and J. Walrand, "Achieving 100% throughput in an input-queued switch," in Proceedings of IEEE Infocom, 1996, pp. 296-302.
2. I. Keslassy and N. McKeown, "Analysis of scheduling algorithms that provide 100% throughput in input-queued switches," in Proceedings of Allerton Conference on Communication, Control and Computing, 2001.
3. D. Shah, "Stable algorithms for input queued switches," in Proceedings of Allerton Conference on Communication, Control and Computing, 2001. [Online]. Available: http://www.stanford.edu/~devavrat/ ilqf.ps
4. D. Shah and M. Kopikare, "Delay bounds for the approximate Maximum Weight matching algorithm for input queued switches," in Proceedings of IEEE Infocom, 2002.
5. M. Karol, M. Hluchyj, and S. Morgan, "Input versus output queueing on a space division packet switch," IEEE Transactions on Communications, vol. 35, no. 12, pp. 1347-1356, 1987.
6. Y. Tamir and H. Chi, "Symmetric crossbar arbiters for vlsi communication switches," IEEE Transaction on Parallel and Distributed Systems, vol. 4, no. 1, pp. 13-27, 1993.
7. T. Anderson, S. Owicki, J. Saxe, and C. Thacker, "High speed switch scheduling for local area networks," ACM Transactions on Computer Systems, vol. 11, pp. 319-351, 1993.
8. M. Karol, K. Eng, and H. Obara, "Improving the performance of input-queued atm packet switch," in IEEE INFOCOM, 1992, pp. 110-115.
9. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Transactions on Automatic Control, vol. 37, pp. 1936-1948, 1992.
10. J. Dai and B. Prabhakar, "The throughput of switches with and without speed-up," in Proceedings of IEEE Infocom, 2000, pp. 556-564.
11. M. A. Marsan, P. Giaccone, E. Leonardi, and F. Neri, "On the stability of local scheduling policies in networks of packet switches with input queues," IEEE Journal on Selected Areas in Communications "High-performance electronic switches/routers for high-speed internet", vol. 21, no. 4, pp. 642-655, 2003.
12. A. L. Stolyar, "MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic," Annals of Applied Probability, vol. 14, no. 1, pp. 1-53, 2004.
13. N. McKeown, "iSLIP: a scheduling algorithm for input-queued switches," IEEE Transaction on Networking, vol. 7, no. 2, pp. 188-201, 1999.
14. P. Giaccone, B. Prabhakar, and D. Shah, "Randomized scheduling algorithms for high-aggregate bandwidth switches," IEEE Journal on Selected Areas in Communications High-performance electronic switches/routers for high-speed internet, vol. 21, no. 4, pp. 546-559, 2003.
15. M. Bramson, "State space collapse with application to heavy traffic limits for multiclass queueing networks," Queueing Systems, vol. 30, pp. 89-148, 1998.
16. D. Shah, "Randomization and heavy traffic theory: New approaches to the design and analysis of switch algorithms," Ph.D. dissertation, Computer Science, Stanford University, October, 2004.
17. R. Williams, "Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse," Queueing Systems, vol. 30, pp. 27-88, 1998.
18. A. Mekkittikul and N. McKeown, "A practical scheduling algorithm to achieve 100% throughput in input-queued switches," in IEEE INFOCOM, 1998, pp. 792-799.