Transform-free analysis of the GI/G/1/K queue through the decomposed little's formula

DOI10.1016/S0305-0548(01)00101-0MaRDI QIDQ1869908zbMATH OpenFDO

Authors Nam K. Kim, Kyung C. Chae

Publication date 28 April 2003

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

Full work available at URL https://doi.org/10.1016/S0305-0548(01)00101-0

zbMATH Keywords

\(GI/G/1/K\) queueapproximationsboundsdualityin queuesLittle's formulaQueue length distributionQueueing

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A generalized pollaczek-khinchine formula for the gi/gi/1/k queue and its application to approximation
• A two-moment approximation for the GI/G/c queue with finite capacity
• Transform-Free Analysis of M/G/1/K and Related Queues
• A Transform-Free Approximation for the Finite Capacity M/G/s Queue
• On the Queue Length Distribution for the GI/G/1/K/V_MQueue

Cites work

• A generalized pollaczek-khinchine formula for the gi/gi/1/k queue and its application to approximation
• A review of L= W and extensions
• A unified method to analyze overtake free queueing systems
• Comments on duality of queues with finite buffer size
• COMPUTATIONAL ASPECTS OF BULK-SERVICE QUEUEING SYSTEM WITH VARIABLE CAPACITY AND FINITE WAITING SPACE: M/G_Y/1/N+B
• Customer average and time average queue lengths and waiting times
• scientific article; zbMATH DE number 4018069 (Why is no real title available?)
• scientific article; zbMATH DE number 4157645 (Why is no real title available?)
• scientific article; zbMATH DE number 47258 (Why is no real title available?)
• scientific article; zbMATH DE number 3796940 (Why is no real title available?)
• 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
• Poisson Arrivals See Time Averages

Cited in

(12)

• Topological network design of general, finite, multi-server queueing networks
• Transient and stationary losses in a finite-buffer queue with batch arrivals
• Capacity planning of a perinatal network with generalised loss network model with overflow
• Performance optimization of open zero-buffer multi-server queueing networks
• On the two-moment approximation of the discrete-time \(\mathrm{GI}/\mathrm{G}/1\) queue with a single vacation
• A two-moment approximation for the GI/G/c queue with finite capacity
• On the Queue Length Distribution for the GI/G/1/K/V_MQueue
• MODELING TRAFFIC FLOWS WITH QUEUEING MODELS: A REVIEW
• A generalized pollaczek-khinchine formula for the gi/gi/1/k queue and its application to approximation
• A Transform-Free Approximation for the Finite Capacity M/G/s Queue
• Transform-Free Analysis of M/G/1/K and Related Queues
• Performance analysis of wireless sensor networks using queuing networks

This page was built for publication: Transform-free analysis of the \(GI/G/1/K\) queue through the decomposed little's formula

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