Maximum Size Matching is Unstable for Any Packet Switch

IEEE Communications Letters

Volumn 7, Issue 10, 2003, Pages 496-498

  Keslassy, Isaac ^a   Zhang Shen, Rui ^a   McKeown, Nick ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Instability; Maximum size matching (MSM); Switching algorithms

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; QUEUEING NETWORKS; TELECOMMUNICATION TRAFFIC;

MAXIMUM SIZE MATCHING (MSM);

PACKET SWITCHING;

EID: 0242364203     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2003.817330     Document Type: Article

References (4)

1. N. McKeown, A. Mekkittikul, V. Anantharam, and J. Walrand, "Achieving 100% throughput in an input-queued switch," IEEE Trans. Commun., vol. 47, no. 8, pp. 1260-1267, Aug. 1999.
2. A. Mekkittikul and N. McKeown, "A practical scheduling algorithm to achieve 100% throughput in input-queued switches," in Proc. IEEE Infocom, vol. 2, San Francisco, CA, Apr. 1998, pp. 792-799.
3. J. G. Dai and B. Prabhakar, "The throughput of data switches with and without speedup," in Proc. IEEE INFOCOM, vol. 2, Tel Aviv, Israel, Mar. 2000, pp. 556-564.
4. R. Zhang-Shen, I. Keslassy, and N. McKeown, "Maximum size matching is unstable for any packet switch," Stanford Univ. High-Performance Networking Group, Stanford, CA, TR03-HPNG-030 100, 2003.