On exact computational analysis of distributions of numbers in systems for \(M/G/1/N+1\) and \(GI/M/1/N+1\) queues using roots

DOI10.1016/0305-0548(91)90006-DzbMath0741.90019OpenAlexW2028486959MaRDI QIDQ1184456

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

Publication date: 28 June 1992

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(91)90006-d

zbMATH Keywords

measures of efficiency\(M/G/1/N+1\) queuing system

Mathematics Subject Classification ID

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

Related Items (6)

Computational analysis of M(n)/G/1/N queues with setup time ⋮ The queue GeoX/G/1/N+1 revisited ⋮ ON the GI/M(n)/1/K queue-an alternative approach ⋮ A Simple and Complete Solution to the Stationary Queue-Length Probabilities of a Bulk-Arrival Bulk-Service Queue ⋮ The queue \(\mathrm{Geo}/\mathrm{G}/1/N + 1\) revisited ⋮ Transform-free analysis of the \(GI/G/1/K\) queue through the decomposed little's formula

Uses Software

• QPACK

Cites Work

• Imbedded Markov chains in queueing systems M/G/1 and GI/M/1 with limited waiting room
• Computational analysis of single-server bulk-service queues, M/G^Y/ 1
• THE GI/E_k/1 QUEUE WITH FINITE WAITING ROOM
• Queue length for the E_k/G/1 queue by finite waiting room
• Characterizations of generalized hyperexponential distribution functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On exact computational analysis of distributions of numbers in systems for \(M/G/1/N+1\) and \(GI/M/1/N+1\) queues using roots