论文信息 - An efficient network-switch scheduling for real-time applications

An efficient network-switch scheduling for real-time applications

Bursts consist of a varying number of asynchronous transfer mode cells corresponding to a datagram. Here, we generalized weighted fair queueing to a burst-based algorithm with preemption. The new algorithm enhances the performance of the switch service for real-time applications, and it preserves the quality of service guarantees. We study this algorithm theoretically and via simulations.

Ece Yaprak | Anthony T. Chronopoulos | Caimu Tang

[1] Anujan Varma,et al. Efficient fair queueing algorithms for packet-switched networks , 1998, TNET.

[2] Ece Yaprak,et al. An efficient ATM network switch scheduling , 2003, IEEE Trans. Broadcast..

[3] Geoffrey G. Xie,et al. Real-time block transfer under a link-sharing hierarchy , 1998, TNET.

[4] Abhay Parekh,et al. A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[5] Harrick M. Vin,et al. Generalized guaranteed rate scheduling algorithms: a framework , 1997, TNET.

[6] Ece Yaprak,et al. A cell burst scheduling for ATM networking. I. Theory , 1998, Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166).

[7] S. Jamaloddin Golestani,et al. Network Delay Analysis of a Class of Fair Queueing Algorithms , 1995, IEEE J. Sel. Areas Commun..

[8] Takeshi Mizuike,et al. Burst scheduling algorithms for SS/TDMA systems , 1991, IEEE Trans. Commun..