Comparative performance study of space priority mechanisms for ATM networks
暂无分享,去创建一个
[1] Hideaki Takagi,et al. Analysis of a Finite-Capacity M/G/1 Queue with a Resume Level , 1985, Perform. Evaluation.
[2] Ronald W. Wolff,et al. Poisson Arrivals See Time Averages , 1982, Oper. Res..
[3] Harry Heffes,et al. Overload Performance of Several Processor Queueing Disciplines for the M/M/1 Queue , 1986, IEEE Trans. Commun..
[4] Marcel F. Neuts. A Queueing Model for a Storage Buffer in Which the Arrival Rate is Controlled by a Switch with a Random Delay , 1985, Perform. Evaluation.
[5] S. Sumita. Achievability of performance objectives in ATM switching nodes , 1988 .
[6] Robert B. Cooper,et al. Introduction to Queueing Theory , 1973 .
[7] S.-Q. Li. Overload control in a finite message storage buffer , 1989, IEEE Trans. Commun..
[8] Annie Gravey,et al. A Space Priority Queuing Mechanism for Multiplexing ATM Channels , 1990, Comput. Networks ISDN Syst..
[9] D. V. Lindley,et al. Stochastic Service Systems. , 1963 .
[10] David M. Lucantoni,et al. Bandwidth Management: A Congestion Control Strategy for Broadband Packet Networks - Characterizing the Throughput-Burstiness Filter , 1990, Comput. Networks ISDN Syst..