ISSN:
1572-9443
Keywords:
Spatial requirements
;
single server queues
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract In this paper, we consider a MAP/G/1 queue in which each customer arrives with a service and a space requirement, which could be dependent. However, the space and service requirements of different customers are assumed to be independent. Each customer occupies its space requirement in a buffer until it has completely received its service, at which time, it relinquishes the space it occupied. We study and solve the problem of finding the steady-state distribution of the total space requirement of all customers present in the system. In the process of doing so, we also generalize the solution of the MAP/G/1 queue and find the time-average joint distribution of the queue-length, the state of the arrival process and the elapsed service time, conditioned on the server being busy. This problem has applications to the design of buffer requirements for a computer or communication system.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01159396
Permalink
