A QUEUING SYSTEM IN WHICH CUSTOMERS REQUIRE A RANDOM NUMBER OF SERVERS

[1] ANALYSIS OF MIXTURES OF WIDE- AND NARROW-BAND TRAFFIC [J]. IEEE TRANSACTIONS ON COMMUNICATION TECHNOLOGY, 1965, CO13 (03): : 258 - +

[2] GREEN L, UNPUBLISHED

[3] Green L., 1978, THESIS YALE U

[4] KAUFMAN JJ, UNPUBLISHED

[5] Kemeny J.G., 1983, FINITE MARKOV CHAINS

[6] ROSS SM, 1970, APPLIED PROBABILITY

[7] Stidham S. Jr., 1972, Advances in Applied Probability, V4, P542, DOI 10.2307/1425993

[8] Takacs L., 1962, INTRO THEORY QUEUES

[9] ON GENERALIZED M/G/1 QUEUING PROCESS IN WHICH 1ST CUSTOMER OF EACH BUSY PERIOD RECEIVES EXCEPTIONAL SERVICE [J]. OPERATIONS RESEARCH, 1964, 12 (05) : 736 - &

[10] WOLMAN E, 1972, BELL SYSTEM TECH J, P1363

[1] ANALYSIS OF MIXTURES OF WIDE- AND NARROW-BAND TRAFFIC [J]. IEEE TRANSACTIONS ON COMMUNICATION TECHNOLOGY, 1965, CO13 (03): : 258 - +

[2] GREEN L, UNPUBLISHED

[3] Green L., 1978, THESIS YALE U

[4] KAUFMAN JJ, UNPUBLISHED

[5] Kemeny J.G., 1983, FINITE MARKOV CHAINS

[6] ROSS SM, 1970, APPLIED PROBABILITY

[7] Stidham S. Jr., 1972, Advances in Applied Probability, V4, P542, DOI 10.2307/1425993

[8] Takacs L., 1962, INTRO THEORY QUEUES

[9] ON GENERALIZED M/G/1 QUEUING PROCESS IN WHICH 1ST CUSTOMER OF EACH BUSY PERIOD RECEIVES EXCEPTIONAL SERVICE [J]. OPERATIONS RESEARCH, 1964, 12 (05) : 736 - &

[10] WOLMAN E, 1972, BELL SYSTEM TECH J, P1363