Two queueing systems sharing the same finite waiting room
暂无分享,去创建一个
In this paper, we consider the analysis of two M/G/1 queueing systems sharing the same finite waiting room. An exact analysis is given for several special cases, and then an algorithm is developed which approximates the system behavior for the general problem. Comparisons are made between the special cases and the algorithm.
[1] Guy Latouche. Exponential Servers Sharing a Finite Storage: Comparison of Space Allocation Policies , 1980, IEEE Trans. Commun..
[2] Wesley W. Chu. Buffer Behavior for Poisson Arrivals and Multiple Synchronous Constant Outputs , 1970, IEEE Transactions on Computers.
[3] Vincent Hodgson,et al. The Single Server Queue. , 1972 .
[4] Carl M. Harris,et al. Fundamentals of queueing theory , 1975 .