Analysis and simulation of a fair queueing algorithm
暂无分享,去创建一个
[1] David L. Mills,et al. The NSFNET backbone network , 1987, Computer Communication Review.
[2] A. G. Fraser,et al. Queueing and framing disciplines for a mixture of data traffic types , 1984, AT&T Bell Laboratories Technical Journal.
[3] Mario Gerla,et al. Flow Control: A Comparative Survey , 1980, IEEE Trans. Commun..
[4] Chung-Yin Lo,et al. Performance analysis and application of a two-priority packet queue , 1987, AT&T Technical Journal.
[5] E. L. Hahne,et al. Round robin scheduling for fair flow control in data communication networks , 1986, ICC.
[6] David L. Mills. The fuzzball , 1988, SIGCOMM 1988.
[7] Samuel P. Morgan. Queueing disciplines and passive congestion control in byte-stream networks , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.
[8] John B. Nagle,et al. On Packet Switches with Infinite Storage , 1987, IEEE Trans. Commun..
[9] Yechiam Yemini,et al. Nest: A Network Simulation and Prototyping Tool , 1988, USENIX Winter.
[10] Jon Postel,et al. Internet Protocol , 1981, RFC.
[11] Jon Postel,et al. Queuing algorithm to provide type-of-service for IP links , 1988, RFC.
[12] John Nagle,et al. Congestion control in IP/TCP internetworks , 1984, CCRV.
[13] Eli Gafni,et al. Dynamic Control of Session Input Rates in Communication Networks , 1982, MILCOM 1982 - IEEE Military Communications Conference - Progress in Spread Spectrum Communications.
[14] Manolis Katevenis,et al. Fast switching and fair control of congested flow in broadband networks , 1987, IEEE J. Sel. Areas Commun..
[15] Lixia Zhang,et al. A new architecture for packet switching network protocols , 1989 .