Abstract
We analyze spatial MAP/G/∞-, spatial MAP/G/c/01 and spatial Cox/G/∞-stations with group arrivals over some Polish space X (with Borel σ-algebra X), including the aspect of customer motion in space. For models with MAP-input, characteristic differential equations are set up that describe the dynamics of phase dependent random functions Q r;ij (u,t;S′), where Q r;ij (u,t;S′) is the probability to observe, at time u≤t, the number r of those customers in some source set S′∈X, who will be in a destination set S∈X at time t. For Cox/G/∞-stations, i.e., infinite server stations with doubly stochastic input, the arrival intensities as well as service times may depend on some general stochastic process (J′ t ) t≥0 with countable state space. For that case we obtain explicit expressions for space–time distributions as well as stationary and non-stationary characteristics.
Similar content being viewed by others
References
D. Baum, Ein Faltungskalkül für Matrizenfolgen und verallgemeinerte Poisson-Gruppenprozesse, Technical Report 96-36, University of Trier, Subdepartment of Computer Science (1996).
D. Baum, Multi-server queues with Markov additive arrivals, in: Advances in Algorithmic Methods for Stochastic Models, Proc. of the 3rd Internat. Conf. on Matrix Analytic Methods (MAMS), eds. G. Latouche and P. Taylor, Leuven, Belgium (Notable Publications, 1998).
D. Baum, On Markovian spatial arrival processes for the performance analysis of mobile communication networks, Technical Report 98-07, University of Trier, Subdepartment of Computer Science (1998).
D. Baum, The infinite server queue with Markov additive arrivals in space, in: Rare Events'99 Internat. Conference, eds. V.V. Kalashnikov and A.M. Andronov, 1999.
D. Baum and V.V. Kalashnikov, Spatial generalization of BMAPs with finite state space, J. Math. Sci. 105(6) (2001) 2504–2514.
D. Baum and V.V. Kalashnikov, Stochastic models for communication networks with moving customers, Inform. Process. 1 (2001) 1–23.
D. Baum and J. Sztrik, Customer motion in queueing models: The use of tangent vector fields, Internat. J. Pure Appl. Math. 2(1) (2002) 1–21.
R. Bellman, Introduction to Matrix Analysis (SIAM, Philadelphia, PA, 1995).
L. Breuer, Spatial queues with infinitely many servers, Technical Report 99-04, University of Trier, Subdepartment of Computer Science (1999).
L. Breuer, Spatial queues, Ph.D. thesis, University of Trier, Germany (2000).
L. Breuer, On Markov-additive jump processes, Queueing Systems 40(1) (2002) 75–91.
L. Breuer, From Markov Jump Processes to Spatial Queues (Kluwer Academic, Dordrecht, 2003) to appear.
E. Çinlar, Introduction to Stochastic Processes (Prentice-Hall, Englewood Cliffs, NJ, 1975).
J. Hofmann, The BMAP/G/1 queue with level dependent arrivals, Ph.D. thesis, University of Trier (1999).
J. Hofmann, The BMAP/G/1 queue with level dependent arrivals — an overview, Telecommunication Systems 16(4) (2001) 347–359.
D.M. Lucantoni, New results on the single server queue with a batch Markovian arrival process, Commun. Statist. Stochastic Models 7(1) (1991) 1–46.
M.F. Neuts, A versatile Markovian point process, J. Appl. Probab. 16 (1979) 764–779.
J. Neveu, Une generalisation des processus a acroissements positifs independants, Abhandlungen des mathematischen Seminars der Universität Hamburg 25 (1961) 36–61.
A. Pacheco, N.U. Prabhu and S. Zuyev, Markov-additive processes of arrivals, in: Advances in Queueing: Theory, Methods, and Open Problems, ed. J.H. Dshalalow (CRC Press, Boca Raton, FL, 1995).
R. Serfozo, Introduction to Stochastic Networks (Springer, Berlin, 1999).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Baum, D., Kalashnikov, V. Spatial No-Waiting Stations with Moving Customers. Queueing Systems 46, 231–247 (2004). https://doi.org/10.1023/B:QUES.0000027985.67934.32
Issue Date:
DOI: https://doi.org/10.1023/B:QUES.0000027985.67934.32