An efficient network-switch scheduling for real-time applications

IEEE Transactions on Communications

Volumn 53, Issue 3, 2005, Pages 401-404

  Tang, Caimu ^a   Chronopoulos, Anthony T ^b   Yaprak, Ece ^c  

^a University of Southern California   (United States)

^b One UTSA Circle   (United States)

^c Wayne State University   (United States)

Author keywords

Burst preemptive scheduling; Fair queueing; Quality of service (QoS)

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; PACKET SWITCHING; QUALITY OF SERVICE;

BURST PREEMPTIVE SCHEDULING; FAIR QUEUEING;

ASYNCHRONOUS TRANSFER MODE;

EID: 17644366136     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2005.843434     Document Type: Article

References (8)

1. S. J. Golestani, "Network delay analysis of a class of fair queueing algorithms," IEEE Trans. Sel. Areas Commun., vol. 13, pp. 1057-1070, Aug 1995.
2. P. Goyal and H. M. Vin, "Generalized guaranteed rate scheduling algorithms: A framework," IEEE/ACM Trans. Netw., vol. 4, pp. 561-571, Aug. 1997.
3. A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The single-node case," IEEE/ACM Trans. Netw., vol. 1, pp. 344-357, Jun. 1993.
4. D. Stiliadis and A. Varma, "Efficient fair queueing algorithms for packet-switched networks," IEEE/ACM Trans. Netw., vol. 6, pp. 175-185, Apr. 1998.
5. G. Xie and S. Lam, "Real-time block transfer under a link-sharing hierarchy," IEEE/ACM Trans. Netw., vol. 6, pp. 30-41, Feb. 1998.
6. T. Mizuike, Y. Ito, D. J. Kennedy, and L. N. Nguyen, "Burst scheduling algorithms for SS/TDMA systems," IEEE Trans. Commun., vol. 39, pp. 533-539, Apr. 1991.
7. A. T. Chronopoulos, C. Tang, and E. Yaprak, "An efficient ATM network switch scheduling," IEEE Trans. Broadcast., vol. 49, pp. 278-292, Sep. 2003.
8. C. Tang, A. T. Chronopoulos, and E. Yaprak, "A cell burst based scheduling for ATM networking: Part I," in Proc. 3rd IEEE Symp. Computers, Commun., Jun.-Jul. 1998, pp. 455-461.