×

A queueing system where customers require a random number of servers simultaneously. (English) Zbl 0582.90035

A closed single node queueing system with multiple classes is analyzed numerically. The node consists of M identical servers fed by a single queue. Each customer of class r, \(1\leq r\leq M\), acquires r servers simultaneously at the beginning of its service. All r servers are released at the same time upon completion of its service. The service time of a class r customer is exponentially distributed with a mean depending on r. This queueing model is analyzed with a view to obtaining performance measures such as throughput, distribution of busy servers, and queue-length distribution.

MSC:

90B22 Queues and service in operations research
60K25 Queueing theory (aspects of probability theory)
68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Arthurs, E.; Kaufman, J. S., Sizing a message store subject to blocking criteria, (Arato, M.; Butrimenko, A.; Gelenbe, E., Performance of Computer Systems (1979), North-Holland: North-Holland Amsterdam), 547-564 · Zbl 0405.68037
[2] Brill, P. H.; Green, L., Queues in which customers receive simultaneous service from a random number of servers-A system point approach, Management Science, 30, 51-68 (1984) · Zbl 0579.60094
[3] Brill, P. H., An embedded level crossing technique for dams and queues, Journal of Applied Probability, 16, 174-186 (1979) · Zbl 0396.60091
[4] Federgruen, A.; Green, L., An M/G/c queue in which the number of servers required is random, (Columbia Business School Research paper 504A (1983), Columbia University) · Zbl 0557.60081
[5] Fletcher, G.Y., Perros, H.G., and Stewart, W.J., “A queueing network model of a circuit switching access scheme in an integrated services environment”, to appear in IEEE Transactions on Communication; Fletcher, G.Y., Perros, H.G., and Stewart, W.J., “A queueing network model of a circuit switching access scheme in an integrated services environment”, to appear in IEEE Transactions on Communication
[6] Gopal, I.S., and Stern, T.E., “Optimal call blocking policies in an integrated services environment”, IBM Research Report RC 9825.; Gopal, I.S., and Stern, T.E., “Optimal call blocking policies in an integrated services environment”, IBM Research Report RC 9825.
[7] Green, L., A queueing system in which customers require a random number of servers, Operations Research, 28, 1335-1346 (1980) · Zbl 0447.60080
[8] Green, L., Comparing operating characteristics of queues in which customers require a random number of servers, Management Science, 27, 65-74 (1981) · Zbl 0453.60092
[9] Kaufman, J., Blocking in a shared resource environment, IEEE Transaction on Communications, 29, 1474-1481 (1981)
[10] Kim, S., M/M/s queueing system where customers demand multiple server use, (Ph. D. dissertation (1979), Southern Methodist University)
[11] Schwartz, M.; Kraimeche, B., An analytic control model for an integrated node, Infocom ’83 (1983), San Diego, CA
[12] Seila, A. F., On waiting times for a queue in which customers require simultaneous service from a random number of servers, Operations Research, 32, 1181-1184 (1984) · Zbl 0548.90029
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.