Spatial Queues with Infinitely Many Servers

Lothar Breuer
Additional contact information
Lothar Breuer: University of Trier, Department of Computer Science

Chapter Chapter 9 in From Markov Jump Processes to Spatial Queues, 2003, pp 119-138 from Springer

Abstract: 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.

Keywords: Service Time; Arrival Rate; Outage Probability; Service Time Distribution; User Movement (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-010-0239-4_9

Ordering information: This item can be ordered from
http://www.springer.com/9789401002394

DOI: 10.1007/978-94-010-0239-4_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().