Spatial Queueing Systems

  • Richard Serfozo
Part of the Applications of Mathematics book series (SMAP, volume 44)


This chapter describes a spatial queueing model for stochastic service systems in which customers or units move about and receive services in a region or a general space. The state of such a system is a point process on a space that evolves over time as a “measure-valued” Markov jump process. Each unit moves in the space according to a Markovian routing mechanism and it receives services at the locations it visits. The service times are exponentially distributed and the rates, as in a queueing system, depend on the congestion or configuration of the points in the system. The types of dependencies are extensions of those in Jackson and Whittle queueing networks.


Stationary Distribution Invariant Measure Poisson Process Service Rate Sojourn Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  • Richard Serfozo
    • 1
  1. 1.School of Industrial and Systems EngineeringGeorgia Institute of TechnologyAtlantaUSA

Personalised recommendations