An efficient packet scheduling algorithm with deadline guarantees for input-queued switches

IEEE/ACM Transactions on Networking

Volumn 15, Issue 1, 2007, Pages 212-225

  Lee, Yong ^a   Lou, Jianyu ^a   Luo, Junzhou ^b   Shen, Xiaojun ^b  

^a SOUTHEAST UNIVERSITY   (China)

^b UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

Input queued switch; Network flow; Packet scheduling; Quality of service; Real time scheduling

Indexed keywords

HEURISTIC ALGORITHMS; PACKET SWITCHING; QUALITY OF SERVICE; QUEUEING NETWORKS;

EARLIEST-DEADLINE-FIRST (EDF); INPUT-QUEUED SWITCH; MINIMUM-LAXITY-FIRST (MLF); PACKET SCHEDULING; REAL TIME SCHEDULING;

PACKET NETWORKS;

EID: 33947502760     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2006.890097     Document Type: Article

References (27)

1. M. Karol, M. Hluchyj, and S. Morgan, "Input versus output queueing on a space-division packet switch," IEEE Trans. Commun., vol. COM-35, no. 12, pp. 1347-1356, Dec. 1987.
2. T. Anderson, S. Owicki, J. Saxe, and C. Thacker, "High-speed switch scheduling for local-area networks," ACM Trans. Comput. Syst., vol. 11, no. 4, pp. 319-352, Nov. 1993.
3. N. McKeown, V. Anantharam, and J. Warland, "Achieving 100% throughput in an input-queued switch," in Proc. IEEE INFOCOM, 1996, pp. 296-302.
4. A. Mekkittikul and N. McKeown, "A practical scheduling algorithm to achieve 100% throughput in input-queued switches," in Proc. IEEE INFOCOM, 1998, pp. 792-799.
5. A. Kam and K. Siu, "Linear-complexity algorithms for QoS support in input-queued switches with no speedup," IEEE J. Sel. Areas Commun., vol. 17, no. 6, pp. 1040-1056, Jun. 1999.
6. N. Mckeown, "The iSLIP scheduling algorithm for input-queued switches," IEEE/ACM Trans. Networking, vol. 7, no. 2, pp. 188-201, Apr. 1999.
7. D. Stiliadis and A. Varma, "Providing bandwidth guarantees in an input-buffered crossbar switch," in Proc. IEEE INFOCOM, 1995, pp. 960-968.
8. A. Hung, G. Kesidis, and N. Mckeown, "ATM input-buffered switches with the guaranteed rate property," in Proc. IEEE Symp. Computers and Communications (ISCC'98), 1998, pp. 331-335.
9. T. Lee and C. Lam, "Path switching - A quasi-static routing scheme for large scale ATM packet switches," IEEE J. Sel. Areas Commun., vol. 15, no. 5, pp. 914-924, Jun. 1997.
10. S. Chuang, A. Goel, N. McKeown, and B. Prabhakar, "Matching output queueing with a combined input/output-queued switch," IEEE J. Sel. Areas Commun., vol. 17, no. 6, pp. 1030-1039, Jun. 1999.
11. I. Stoica and H. Zhang, "Exact emulation of an output queueing switch by a combined input output queueing switch," in Proc. IWQoS 1998, pp. 218-224.
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, pp. 235-244.
13. T. Inukai, "An efficient SS/TDMA time slot assignment algorithm," IEEE Trans. Commun., vol. COM-27, no. 10, pp. 1449-1455, Oct. 1979.
14. S. Li and N. Ansari, "Input-queued switching with QoS guarantees," in Proc. IEEE INFOCOM, 1999, pp. 1152-1159.
15. C. Chang, W. Chen, and H. Huang, "Birkhoff-von Neumann input buffered crossbar switches," in Proc. IEEE INFOCOM, 2000, pp. 1614-1623.
16. R. K. Aluja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1993.
17. M. A. Bonuccelli and M. C. Clò, "Scheduling of real-time messages in optical broadcast-and-select networks," IEEE/ACM Trans. Networking, vol. 9, no. 5, pp. 541-552, Oct. 2001.
18. C. L. Liu and W. Layland, "Scheduling algorithms for multiprogramming in a hard real-time environment," J. ACM, vol. 20, pp. 46-61, Jan. 1973.
19. S. Even, Graph Algorithms. Rockville, MD: Computer Science Press, 1979.
20. I. R. Philp and J. W. Liu, "A switching problem for real time periodic messages," Real-Time Systems Lab., Univ. Illinois, Urbana-Champaign. [Online]. Available: http://www-rtsl.cs.uiuc.edu/papers
21. V. Tabatabaee, L. Georgiadis, and L. Tassiulas, "QoS provisioning and tracking fluid policies in input queueing switches," IEEE/ACM Trans. Networking, vol. 9, no. 5, pp. 605-617, Oct. 2001.
22. J. Giles and B. Hajek, "Scheduling multirate periodic traffic in a packet switch," in Proc. 1997 Conf. Information Sciences and Systems at John Hopkins Univ., Baltimore, MD, Mar. 1997, pp. 691-703.
23. A. D. Goldberg and R. E. Tarjan, "A new approach to the maximal flow problem," J. ACM, vol. 35, pp. 921-940, 1988.
24. M. Andrews and L. Zhang, "Achieving stability in networks of input-queued switches," in Proc. IEEE INFOCOM, 2001, pp. 1673-1679.
25. M. A. Marsan, E. Leonardi, M. Mellia, and F. Neri, "On the throughput achievable by isolated and interconnected input-queueing switches under multiclass traffic," in Proc. IEEE INFOCOM, 2002, pp. 1605-1614.
26. A. Bianco, P. Giaccone, E. Leonardi, and F. Neri, "A framework for differential frame-based matching algorithms in input-queued switches," in Proc. IEEE INFOCOM, 2004, pp. 1147-1157.
27. Z.-L. Zhang, Z. Duan, and Y. T. Hou, "Virtual time reference system: A unifying scheduling framework for scalable support of guaranteed services," IEEE J. Sel. Areas Commun., vol. 18, no. 12, pp. 2684-2695, Dec. 2000.