Exact and approximate numerical solutions to steady-state single-server queues: \(M/G/1\) -- a unified approach

DOI10.1007/BF01193326zbMath0752.60075MaRDI QIDQ1183674

U. C. Gupta, Manju Lata Agarwal, Mohan L. Chaudhry

Publication date: 28 June 1992

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

zbMATH Keywords

generating functionsLaplace-Stieltjes transformnumerical aspectsdistribution of the queue lengthservice-time distributions

Mathematics Subject Classification ID

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

Related Items (6)

An analytical solution for the discrete time single server system with semi-Markovian arrivals ⋮ The queue GeoX/G/1/N+1 revisited ⋮ Steady-State Distributions in Computable Form for the Bulk-Arrival Single-Server Queue ⋮ Exact and approximate numerical solutions of steady-state distributions arising in the queue \(GI/G/1\) ⋮ Ultimate Ruin Probabilities for Generalized Gamma-Convolutions Claim Sizes ⋮ \(M/G/1\) system with adjustment at the beginning of its busy period

Uses Software

• QPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
• Computational analysis of single-server bulk-arrival queues: GI X/M/1
• Queue length distributions from probability generating functions via discrete Fourier transforms
• Numerical analysis of multi-server queues with deterministic service and special phase-type arrivals
• A Simple and Efficient Algorithm to Compute Tail Probabilities from Transforms
• Robustness of Rootfinding in Single-Server Queueing Models
• Characterizations of generalized hyperexponential distribution functions

This page was built for publication: Exact and approximate numerical solutions to steady-state single-server queues: \(M/G/1\) -- a unified approach