Guaranteed smooth switch scheduling with low complexity

GLOBECOM - IEEE Global Telecommunications Conference

Volumn 1, Issue , 2005, Pages 626-630

  Mohanty, Satya R ^a   Bhuyan, Laxmi N ^a  

^a University of California Riverside   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIRKHOFF-VON NEUMANN DECOMPOSITION; BOUNDED PACKET DELAY; PERMUTATION MATRICES; SWITCH SCHEDULING ALGORITHMS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; JITTER; PACKET NETWORKS; SCHEDULING; TELECOMMUNICATION SERVICES;

SWITCHING NETWORKS;

EID: 33846632382     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2005.1577699     Document Type: Conference Paper

References (10)

1. I. Keslassy, Murali Kodialam, T.V.Lakshman, and Dimitrios Stilladis. On guaranteed smooth scheduling for input-queued switches. IEEE INFOCOM, March 2003.
2. C.S Chang, J.W. Chen, and H.Y. Huang. On service garantees for input-buffered crossbar switches: a capacity decompostion approach by birkhoff and von neumann. IEEE IWQoS, London, 1999.
3. Srikanth Arekapudi, Shang-Tse Chuang, Isaac Keslassy, and N. McKeown. Configuring a load balanced switch in hardware. Hot Interconnects 12, Stanford, August 2004.
4. Alexander Kesselman and Kirill Kogan. Non-preemptive scheduling of optical switches. Proceedings of the IEEE Global Telecommunications Conference, October 2004.
5. Marcelo Prais and Celso C. Ribeiro. Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing, 12:164-176, 2000.
6. A. Bar-Noy, R. Motwani, and J. Naor. The greedy algorithm is optimal for on-line edge coloring. Information Processing Letters, 44(5):251-253, 1992.
7. Abhay K. Parekh and Robert G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: The single-node case. IEEE/ACM Transactions on Networking, June 1993.
8. Guo Chuanxiong. SRR: an O(1) time complexity packet scheduler for flows in multi-service packet networks. Proceedings of the ACM SIGCOMM, August 2001.
9. R. Yim, N. Devroye, V. Tarokh, and H.T Kung. Achieving fairness in two-dimensional generalized processor sharing. In Proceedings of the 22nd Biennial Symposium on Communications, pages 185-187, April 2004.
10. Xiao Zhang and Laxmi Bhuyan. Achieving fairness and throughput for best-effort traffic in input-queued crossbar switches. 2005.