A Simulation Study of Flow-Based Scheduling Algorithms
暂无分享,去创建一个
[1] Lixia Zhang,et al. VirtualClock: a new traffic control algorithm for packet-switched networks , 1991, TOCS.
[2] Lixia Zhang,et al. Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks , 1990, SIGCOMM.
[3] R DavinJames,et al. A simulation study of fair queueing and policy enforcement , 1990 .
[4] James R. Davin,et al. A simulation study of fair queueing and policy enforcement , 1990, CCRV.
[5] Abhay Parekh,et al. A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.
[6] Hui Zhang,et al. WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[7] Hui Zhang,et al. Hierarchical packet fair queueing algorithms , 1996, SIGCOMM '96.
[8] Srinivasan Keshav,et al. On the Efficient Implementation of Fair Queueing , 1991 .
[9] Harrick M. Vin,et al. Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM '96.
[10] S. Jamaloddin Golestani,et al. A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.
[11] Rene L. Cruz,et al. A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.
[12] Abhay Parekh,et al. A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.