Services within a busy period of an M/M/1 queue and Dyck paths

DOI10.1007/S11134-004-5556-6MaRDI QIDQ1766090zbMATH OpenOpenAlexFDO

Authors Moez Draief, Jean Mairesse

Publication date 28 February 2005

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0707.4124

zbMATH Keywords

busy periodDyck pathsM/M/1 queue

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Abstract: We analyze the service times of customers in a stable M/M/1 queue in equilibrium depending on their position in a busy period. We give the law of the service of a customer at the beginning, at the end, or in the middle of the busy period. It enables as a by-product to prove that the process of instants of beginning of services is not Poisson. We then proceed to a more precise analysis. We consider a family of polynomial generating series associated with Dyck paths of length 2n and we show that they provide the correlation function of the successive services in a busy period with (n+1) customers.

Recommendations

• Weighted Dyck paths and nonstationary queues
• A sample path analysis of the M/M/1 queue
• The busy periods of some queueing systems
• Busy-period analysis of a correlated queue with exponential demand and service
• A direct approach to sojourn times in a busy period of an \(M/M/1\) queue

Cites work

• scientific article; zbMATH DE number 3174015 (Why is no real title available?)
• scientific article; zbMATH DE number 3755546 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 1111371 (Why is no real title available?)
• scientific article; zbMATH DE number 879776 (Why is no real title available?)
• On the area swept under the occupation process of an \(M/M/1\) queue in a busy period
• The formal theory of birth-and-death processes, lattice path combinatorics and continued fractions
• Waiting Times When Queues are in Tandem

Cited in

(6)

• A direct approach to sojourn times in a busy period of an \(M/M/1\) queue
• Computing the performance measures in queueing models via the method of order statistics
• An application of Riordan arrays to the transient analysis of M/M/1 queues
• mBm-based scalings of traffic propagated in internet
• Lattice path approach for busy period density of \(M/G/1\) queues using \(C_{3}\) Coxian distribution
• Weighted Dyck paths and nonstationary queues

This page was built for publication: Services within a busy period of an M/M/1 queue and Dyck paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1766090)