MNCM: A critical node matching approach to scheduling for input buffered switches with no speedup

IEEE/ACM Transactions on Networking

Volumn 17, Issue 1, 2009, Pages 294-304

  Tabatabaee, Vahid ^a   Tassiulas, Leandros ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b UNIVERSITY OF THESSALY   (Greece)

Author keywords

Input queued switch fabrics; Scheduling; Stability analysis

Indexed keywords

COMPUTATIONAL COMPLEXITY; FABRICS; PACKET NETWORKS; ROUTERS; SCHEDULING; SWITCHES; SWITCHING NETWORKS;

ARRIVAL PROCESS; BUFFERING REQUIREMENTS; CRITICAL NODES; DELAY PERFORMANCE; FLUID MODELS; INCOMING TRAFFICS; INPUT BUFFERED-SWITCHES; INPUT-QUEUED SWITCH FABRICS; LOW COMPLEXITY; MATCHING ALGORITHMS; MAXIMAL SIZE MATCHING; NEW CLASS; NEW RESULTS; STABILITY ANALYSIS; STRONG LAW OF LARGE NUMBERS; UPPER BOUNDS;

SCHEDULING ALGORITHMS;

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

References (20)

1. T. Anderson, S. Owicki, J. Saxe, and C. Thacker, "High speed switch scheduling for local area networks," ACM Trans. Comput. Syst., pp. 319-352, Nov. 1993.
2. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, 1990.
3. J. G. Dai, "Stability of fluid and stochastic processing networks," Miscellanea Publication, Denmark, 1999 [Online]. Available: http:/www.maphysto.dk/
4. J. G. Dai and B. Prabhakar, "The throughput of data switches with and without speedup," in Proc. IEEE INFOCOM, Tel Aviv, Israel, Mar. 2000, pp. 556-564.
5. J. Edmonds and R. M. Karp, "Theoretical improvements in the algorithmic efficiency for network flow problems," J. ACM, vol. 19, pp. 248-264, 1972.
6. P. Giaccone, B. Prabhakar, and D. Shah, "Towards simple, high-performance schedulers for high-aggregate bandwidth switches," in Proc. IEEE INFOCOM, New York, Jun. 2002, pp. 1160-1169.
7. /2 algorithm for maximum matching in bipartite graphs," SIAM J. Computing, vol. 2, no. 4, pp. 225-231, 1973.
8. M. J. Karol, M. G. Hluchyj, and S. P. Morgan, "Input versus output queueing on a space-division packet switch," IEEE Trans. Commun., vol. 35, no. 10, pp. 1347-1356, Oct. 1987.
9. N. McKeown, V. Anantharam, and J. Warland, "Achieving 100% throughput in an input-queued switch," in Proc. IEEE INFOCOM, San Francisco, CA, Mar. 1996, pp. 296-302.
10. A. Mekkittikul and N. McKeown, "A practical scheduling algorithm to achieve 100% throughput in input-queued switches," in Proc. IEEE INFOCOM, San Francisco, CA, Apr. 1998, pp. 792-799.
11. A. Mekkittikul and N. McKeown, "Scheduling VOQ switches under non-uniform traffic," Stanford Univ., Stanford, CA, CSL Technical Report, CSL-TR-97-747, 1997.
12. N. McKeown, "iSLIP: A scheduling algorithm for input-queued switches," IEEE/ACM Trans. Networking, vol. 7, no. 2, pp. 188-201, Apr. 1999.
13. M. Rosenblum, M. X. Goemans, and V. Tarokh, "Universal bounds on buffer size for packetizing fluid policies in input queued, crossbar switches," in Proc. IEEE INFOCOM, Hong Kong, Mar. 2004, pp. 1127-1135.
14. K. Ross and N. Bambos, "Local search scheduling algorithms for maximal throughput in packet switches," in Proc. IEEE INFOCOM, Hong Kong, Mar. 2004, pp. 1159-1170.
15. G. L. Frazier and Y. Tamir, "The design and implementation of a multiqueue buffer for VLSI communication switches," in Proc. Int. Conf. Comput. Design, Cambridge, MA, 1989, pp. 466-471.
16. 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.
17. V. Tabatabaee and L. Tassiulas, "MNCM: A new class of scheduling algorithms for input-buffered switches with no speedup," in Proc. IEEE INFOCOM, San Francisco, CA, Mar. 2003, pp. 1406-1413.
18. V. Tabatabaee and L. Tassiulas, "Max-min fair self-randomized scheduler for input-buffered switches," in Proc. IEEE Workshop High Performance Switching Routing, Apr. 2004, pp. 299-303.
19. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Autom. Control, vol. 37, no. 12, pp. 1936-1948, Dec. 1992.
20. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queued switches," in Proc. IEEE INFOCOM, San Francisco, CA, Apr. 1998, pp. 533-539.