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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.