A fair and cost-effective service mechanism for cell scheduling in ATM networks
暂无分享,去创建一个
[1] Hui Zhang,et al. WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[2] Hui Zhang,et al. Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.
[3] Satish K. Tripathi,et al. Carry-over round robin: a simple cell scheduling mechanism for ATM networks , 1998, TNET.
[4] Costas Courcoubetis,et al. Weighted Round-Robin Cell Multiplexing in a General-Purpose ATM Switch Chip , 1991, IEEE J. Sel. Areas Commun..
[5] Abhay Parekh,et al. A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.
[6] George Varghese,et al. Efficient fair queueing using deficit round robin , 1995, SIGCOMM '95.
[7] S. Jamaloddin Golestani,et al. A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.
[8] R. Shreedhar,et al. Efficient Fair Queuing Using Deficit Round - , 1997 .
[9] Scott Shenker,et al. Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.
[10] Daein Jeong,et al. Design of a Generalized Priority Queue Manager for ATM Switches , 1997, IEEE J. Sel. Areas Commun..