Exhaustive service matching algorithms for input queued switches

IEEE Workshop on High Performance Switching and Routing, HPSR

Volumn , Issue , 2004, Pages 253-258

  Li, Yihan ^a   Panwar, Shivendra S ^a   Chao, H Jonathan ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Exhaustive service; Hamiltonian walk; Limited service; Polling; Scheduling; Switching; Virtual Output Queueing

Indexed keywords

EXHAUSTIVE SERVICE; HAMILTONIAN WALK; VIRTUAL OUTPUT QUEUEING;

ALGORITHMS; DELAY CONTROL SYSTEMS; HAMILTONIANS; PACKET SWITCHING; QUEUEING NETWORKS; SCHEDULING; SWITCHES;

Q SWITCHING;

EID: 2942565968     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. M. J. Karol, M. Hluchyj, and S. Morgan, "Input vs. output queuing on a space-division packet switch", Proc. GLOBECOM 1986, pp. 659-665.
2. M. J. Karol, M. Hluchyj, and S. Morgan, "Input versus output queuing on a space-division packet switch," IEEE Trans. on Communications, vol.35, pp. 1347-1356, 1987.
3. L. Tassiulas, A. Ephremides, "Stability properties of constrained queueing systems and scheduling for maximum throughput in multihop radio networks," IEEE Trans. Automatic Control, Vol. 37, No. 2, pp. 1936-1949.
4. N. McKeown, A. Mekkittikul, V. Anantharam and J. Walrand, "Achieving 100% throughput in an Input-Queued switch", IEEE Trans. Communications, vol. 47, No. 8, pp. 1260-1267, Aug. 1999.
5. A. Charny, P. Krishna, N. Patel and R. Simcoe, "Algorithms for providing bandwidth and delay guarantees in Input-Buffered crossbars with speedup", IWQOS'98, May 1998.
6. P. Krishna, N. S. Patel, A.Charny and R. Simcoe, "On the speedup required for work-conserving crossbar switches", IWQOS'98, May 1998.
7. A. Mekkittikul and N. McKeown, "A practical scheduling algorithm to achieve 100% throughput in input-queued switches", IEEE INFOCOM 98, Vol 2, pp. 792-799, April 1998.
8. T. E. Anderson, S. S. Owicki, J. B. Saxe and C. P. Thacker, "High speed switch scheduling for local area networks," ACM Trans. on Computer Systems, vol. 11, No. 4, pp. 319-352, Nov. 1993.
9. N. McKeown, "The iSLIP scheduling algorithm for Input-Queued switches", IEEE/ACM Trans. Networking, vol. 7, pp. 188-201, April 1999.
10. H. J. Chao, "Saturn: a terabit packet switch using Dual Round-Robin", IEEE Communication Magazine, vol. 38 12, pp. 78-84, Dec. 2000.
11. Y. Li, S. Panwar, H. J. Chao, "On the performance of a Dual Round-Robin switch," IEEE INFOCOM 2001, vol. 3, pp. 1688-1697, April 2001.
12. Y. Li "Design and analysis of schedulers for high speed input queued switches," Ph.D. Dissertation, Polytechnic University, Jan. 2004.
13. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queued switches," IEEE INFOCOM 1998, vol.2, New York, 1998, pp.533-539.
14. P. Giaccone, B. Prabhakar, D. Shah "Toward simple, high-performance schedulers for high-aggregate bandwidth switches", IEEE INFOCOM 2002. New York, 2002.
15. Y. Li, S. Panwar, H. J. Chao, "The Dual Round-Robin Matching switch with exhaustive service," 2002 Workshop on High Performance Switching and Routing (HPSR 2002), May 2002.
16. D. Shah, M. Kopikare, "Delay bounds for approximate maximum weight matching algorithms for input queued switches," IEEE INFOCOM 2002, New York, 2002, pp. 1024-1031.
17. A. Nijenhuis, H. Wilf, "Combinatorial algorithms: for comptuters and calulators," 2nd Edition, Academic Press, New York, 1978.
18. M. A. Marsan, A. Bianco, P. Giaccone, E. Leonardi, F. Neri, "Packet Scheduling in Input-Queued Cell-Based Switches," IEEE INFOCOM 2001, vol. 2, pp. 1085-1094, April 2001.
19. K Claffy, O. Miller, K. Thompson, "The nature of the beast: recent traffic measurements from an Internet backbone," CAIDA.
20. H. Takagi, "Queueing analysis of polling models: an update," Stochastic Analysis of Computer and Communication Systems, New York: Elsevier Science and B. V. North Holland, pp. 267-318 1990.