The Pht/Pht/∞ queueing system: Part I - The single node

INFORMS Journal on Computing

Volumn 16, Issue 3, 2004, Pages 266-274

  Nelson, Barry L ^a   Taaffe, Michael R ^b  

^a Northwestern University   (United States)

^b Virginia Polytechnic Institute and State University   (United States)

Author keywords

Algorithms; Infinite server; Nonstationary processes; Phase type distribution; Queues

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; COMPUTER SOFTWARE; DIFFERENCE EQUATIONS; FUNCTIONS; INTEGRATION; PARAMETER ESTIMATION; PROBABILITY; WORLD WIDE WEB;

INFINITE SERVER; NONSTATIONARY PROCESS; PHASE-TYPE DISTRIBUTION; QUEUES;

QUEUEING THEORY;

EID: 4544289495     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1040.0070     Document Type: Article

References (23)

1. Brown, M., S. H. Ross. 1967. Some results for infinite-server Poisson queues. J. Appl. Probab. 6 453-458.
2. Collings, T., C. Stoneman. 1976. The M/M/∞ queue with varying arrival and service rates. Oper. Res. 24 760-773.
3. t/G/∞ queues with sinusoidal arrival rates. Management Sci. 39 241-252.
4. t/G/∞ queue. Oper. Res. 41 731-742.
5. Foley, R. D. 1984. The nonhomogeneous M/G/∞ queue. Oper. Res. 19 40-48.
6. Glynn, P. W., W. Whitt. 1991. A new view of the heavy-traffic limit theorem for infinite-server queues. Adv. Appl. Probab. 23 188-209.
7. Harrison, J. M., A. J. Lemoine. 1981. A note on networks of infinite-server queues. J. Appl. Probab. 18 561-567.
8. Johnson, N. L., S. Kotz. 1977. Urn Models and Their Applications. John Wiley & Sons, New York.
9. Kao, E. 1997. An Introduction to Stochastic Processes. Duxbury Press, Belmont, CA.
10. Lee, W. C. Y. 1989. Mobile Cellular Telecommunications Systems. McGraw-Hill, New York.
11. Massey, W. A., W. Whitt. 1993. Networks of infinite-server queues with nonstationary Poisson input. Queueing Systems: Theory Appl. 13 183-250.
12. Massey, W. A., W. Whitt. 1994. An analysis of the modified offered-load approximation for the nonstationary Erlang loss model. Ann. Appl. Probab. 4 1145-1160.
13. Mirasol, N. M. 1963. The output of an M/G/∞ queueing system is Poisson. Oper. Res. 11 282-284.
14. K queueing system: Part II - The multiclass network. INFORMS J. Comput. 16(3) 275-283.
15. Neuts, M. F. 1981. Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. The Johns Hopkins University Press, Baltimore, MD.
16. Newell, G. F. 1966. The M/G/∞ queue. SIAM J. Appl. Math. 14 86-88.
17. Ong, K. L., M. R. Taaffe. 1987. Approximating nonstationary Ph(t)/M(t)/S/C queueing systems. Ann. Oper. Res. 8 103-116.
18. Ong, K. L., M. R. Taaffe. 1988. Approximating Ph(t)/Ph(t)/1/c nonstationary queueing systems. Math. Comput. Simulation 30 441-452.
19. Ong, K. L., M. R. Taaffe. 1989. Nonstationary queues with interrupted Poisson arrivals and unreliable/repairable servers. Queueing Systems: Theory Appl. 4 27-46.
20. Rothkopf, M. H., S. S. Oren. 1979. A closure approximation for the nonstationary M/M/s queue. Management Sci. 25 522-534.
21. Taaffe, M. R., K. L. Ong. 1984. Approximating time-dependent non-exponential queues. S. Sheppard, U. Pooch, C. D. Pegden, eds. Proc. 1984 Winter Simulation Conf. Institute of Electrical and Electronic Engineers, Piscataway, NJ, 175-180.
22. Tijms, H. C. 1995. Stochastic Models: An Algorithmic Approach. John Wiley & Sons, Chichester, U.K.
23. Whitt, W. 1982. On the heavy-traffic limit theorem for the GI/G/∞ queues. Adv. Appl. Probab. 14 171-190.