Analyzing the discrete-time \(G^{(G)}/Geo/1\) queue using complex contour integration

DOI10.1007/BF01158774zbMath0806.60088OpenAlexW2056852017MaRDI QIDQ1339093

Herwig Bruneel, Bart Vinck

Publication date: 14 February 1995

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01158774

zbMATH Keywords

bulk arrivalsanalytic solutionscontour integrationdiscrete-time single-server queueing systemgeneral interarrival times

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (5)

Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues ⋮ Analysis of a discrete-time queue with general service demands and phase-type service capacities ⋮ Analytically simple and computationally efficient solution to $\mathrm{GI}^{\mathrm{X}}/\mathrm{Geom}/1$ queues involving heavy-tailed distributions ⋮ Discrete-time queue with batch renewal input and random serving capacity rule: \(GI^X/ Geo^Y/1\) ⋮ A discrete-time \(\mathrm{GI}^X/\mathrm{Geo}^Y/1\) queue with early arrival system

Cites Work

• A general model for the behaviour of infinite buffers with periodic service opportunities
• The Application of the Residue Theorem to the Study of a Finite Queue with Batch Poisson Arrivals and Synchronous servers
• An analytic solution of the waiting time distribution for the discrete-time GI/G/1 queue
• Alternative Numerical Solutions of Stationary Queueing-Time Distributions in Discrete-Time Queues: GI/G/1
• Queuing Systems with Enforced Idle Time
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analyzing the discrete-time \(G^{(G)}/Geo/1\) queue using complex contour integration