On discrete-time multiserver queues with finite buffer: GI/Geom/m/N [An article from: Computers and Operations Research]

This digital document is a journal article from Computers and Operations Research, published by Elsevier in 2004. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
Multiserver queues are often encountered in telecommunications systems and have special importance in the design of asynchronous transfer mode network. This paper analyzes a discrete-time multiserver queueing system with finite buffer in which the interarrival and service times are, respectively, arbitrarily and geometrically distributed. Using supplementary variable and imbedded Markov-chain techniques, the queue is analyzed for the early arrival system. Besides, developing relations among state probabilities at prearrival, arbitrary and outside observer's observation epochs, the waiting-time analysis is also carried out.