Queueing disciplines and passive congestion control in byte-stream networks
暂无分享,去创建一个
[1] A. Fraser,et al. Towards a Universal Data Transport System , 1983, IEEE J. Sel. Areas Commun..
[2] John N. Daigle. Message Delays with Prioritized HOLP and Round-Robin Packet Servicing , 1987, IEEE Trans. Commun..
[3] Scott Shenker,et al. Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.
[4] A. G. Fraser,et al. Queueing and framing disciplines for a mixture of data traffic types , 1984, AT&T Bell Laboratories Technical Journal.
[5] John Nagle,et al. On Packet Switches with Infinite Storage , 1985, IEEE Trans. Commun..
[6] W. Whitt,et al. Open and closed models for networks of queues , 1984, AT&T Bell Laboratories Technical Journal.
[7] Manolis Katevenis,et al. Fast switching and fair control of congested flow in broadband networks , 1987, IEEE J. Sel. Areas Commun..
[8] Erol Gelenbe,et al. Analysis and Synthesis of Computer Systems , 1980 .
[9] S. Albin. On Poisson Approximations for Superposition Arrival Processes in Queues , 1982 .
[10] S. P. Morgan,et al. Mean message delays for two packet-FIFO queueing disciplines , 1990, IEEE Trans. Commun..
[11] R. Wolff. Time Sharing with Priorities , 1970 .
[12] K. M. Rege,et al. Analysis of a multistage queue , 1985, AT&T Technical Journal.
[13] E. L. Hahne,et al. Round robin scheduling for fair flow control in data communication networks , 1986, ICC.