Abstract
Throughout this chapter, the arrival process is assumed to be a marked Poisson point process. See Proposition 1.11 page 11 and Section 1.3.2 page 18 for the definition and the main properties of Poisson marked point processes. In this setting, four queueing models are analyzed: The queue with an infinite number of servers (the M/G/∞ queue) and the single server queue with the following service disciplines: FIFO, LIFO and Processor-Sharing. The Processor-Sharing queue receives a detailed treatment because of the central role played by an interesting branching process in the derivation of the distribution of the sojourn time. It is also an important discipline in modern stochastic models of communication networks. The last section is devoted to a common, important property of queues having a Poisson input.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S.F. Yashkov, A derivation of response time distribution for an MICR processor-sharing queue, Problems of Control and Information Theory 12 (1983), no. 2, 133–148.
Op. cit. page 182.
D.Y. Burman, Insensitivity in queueing systems, Advances in Applied Probability 13 (1981), 846–859.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Robert, P. (2003). Queues with Poisson Arrivals. In: Stochastic Networks and Queues. Applications of Mathematics, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-13052-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-13052-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05625-3
Online ISBN: 978-3-662-13052-0
eBook Packages: Springer Book Archive