MNCM a new class of efficient scheduling algorithms for input-buffered switches with no speedup

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2003, Pages 1406-1413

  Tabatabaee, Vahid ^a   Tassiulas, Leandros ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BUFFER CIRCUITS; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; THROUGHPUT;

INPUT BUFFERED SWITCHES; AVERAGE DELAY; DELAY PERFORMANCE; DETERMINISTIC ALGORITHMS; FLUID MODELS; INPUT TRAFFIC; MAXIMAL SIZE MATCHING; NEW RESULTS; PERFORMANCE METRICES; STRONG LAW OF LARGE NUMBERS; WEIGHTED MATCHING ALGORITHMS;

ELECTRIC SWITCHES; SCHEDULING ALGORITHMS;

EID: 0042515250     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/infcom.2003.1208976     Document Type: Conference Paper

References (14)

1. T. Anderson, S. Owicki, J. Saxe, C. Thacker, "High Speed Switch Scheduling for Local Area Networks", ACM Transactions on Computer Systems 319-352, Nov 1993.
2. T.H. Cormen, C.E. Leiserson, R.L. Rivest, "Introduction to algorithms", The MIT Press 1990.
3. J.G. Dai, B. Prabhakar, "The throughput of data switches with and without speedup", INFOCOM '00
4. J. Edmonds, R.M. Karp, "Theoretical improvements in the algorithmic efficiency for network flow problems", Journal of the ACM,v.19, 248-264, 1972
5. P. Giaccone, B. Prabhakar, D. Shah, "Towards simple, high-performance schedulers for high-aggregate bandwidth switches", INFOCOM '02
6. 5/2 algorithm for maximum matching in bipartite graphs", SIAM Journal on Computing,v.2, no.4, 225-231, 1973
7. M.J. Karol, M.G. Hluchyj, S.P. Morgan, "Input Versus Output Queueing on a Space-Division Packet Switch", IEEE Transactions on Communications,v.35, 1347-1356, 1987
8. N. McKeown, V. Anantharam, J. Warland, " Achieving 100% Throughput in an Input-Queued Switch", INFOCOM '96, 296-302.
9. A. Mekkittikul, N. McKeown, " A Practical Scheduling Algorithm to Achieve 100% Throughput in Input-Queued Switches", INFOCOM '98, 792-799.
10. A. Mekkittikul, N. McKeown, " Scheduling VOQ switches under non-uniform traffic", CSL Technical Report, CSL-TR-97-747, Stanford University, 1997.
11. N. McKeown, " iSLIP: A scheduling algorithm for Input-Queued Switches IEEE Transaction on Networking", v.7, 188-201, April 1999.
12. L. Tassiulas, A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks", IEEE Trans. on Automatic Control, v.37, n.12, Dec. 1992, pp. 1936-1948.
13. L. Tassiulas, "Linear Complexity Algorithms for Maximum Throughput in Radio Networks and Input Queued Switches", Infocom98, 533-539.
14. V. Tabatabaee, L. Georgiadis, L. Tassiulas, " QoS Provisioning and Tracking Fluid Policies in Input Queueing Switches", IEEE Transaction on Networking, v.9, no.5, pp. 605-617, Oct. 2001.