Abstract
Spatial Queues with infinitely many servers arise naturally as models for the planning process of mobile communication networks. A very useful concept has been developed by Çinlar [44], partly on the basis of Massey and Whitt [84]. This assumes single arrivals distributed in time as a non-homogeneous Poisson process. Every arrival chooses a position in space according to a (time-dependent) distribution on the space and independent of all other users. Since the arrival process is a multi-dimensional Poisson process on the product space of time and arrival space, the queue process is Poisson as well, and the mean measures can be computed in a straightforward manner. This yields a nice solution to the queue process.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Breuer, L. (2003). Spatial Queues with Infinitely Many Servers. In: From Markov Jump Processes to Spatial Queues. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-0239-4_9
Download citation
DOI: https://doi.org/10.1007/978-94-010-0239-4_9
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-3962-8
Online ISBN: 978-94-010-0239-4
eBook Packages: Springer Book Archive