On discrete-time multiserver queues with finite buffer GI/Geom/m/N

Multiserver queues are often encountered in telecommunications systems and have special importance in the design of asynchronous transfer node 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 observant epochs, the waiting-time analysis is also carried out.