The [Pht/Pht/∞]K queueing system: Part II - The multiclass network

INFORMS Journal on Computing

Volumn 16, Issue 3, 2004, Pages 275-283

  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; Queueing networks; Queues

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DIFFERENTIAL EQUATIONS; MATRIX ALGEBRA; PROBABILISTIC LOGICS; PROBABILITY; QUEUEING THEORY;

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

QUEUEING NETWORKS;

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

References (7)

1. Boucherie, R. J., N. M. van Dijk. 2000. On a queueing network models for cellular mobile telecommunication networks. Oper. Res. 48 38-49.
2. Kao, E. 1997. An Introduction to Stochastic Processes. Duxbury Press, Belmont, CA.
3. Kella, O., W. Whitt. 1999. Linear stochastic fluid networks. J. Appl. Probab. 36 244-260.
4. Lee, W. C. Y. 1989, Mobile Cellular Telecommunications Systems. McGraw-Hill, New York.
5. Massey, W. A., W. Whitt. 1993. Networks of infinite-server queues with nonstationary Poisson input. Queueing Systems: Theory Appl. 13 183-250.
6. t/∞ queueing system: Part I - The single node. INFORMS J. Comput. 16(3) 266-274.
7. Whitt, W. 1982. On the heavy-traffic limit theorem for GI/G/∞ queues. Adv. Appl. Probab. 14 171-190.