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

DOI10.1016/S0305-0548(01)00101-0zbMath1029.90022MaRDI QIDQ1869908

Nam K. Kim, Kyung-Chul Chae

Publication date: 28 April 2003

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

zbMATH Keywords

dualityboundsapproximationsLittle's formulaQueueingQueue length distribution\(GI/G/1/K\) queuein queues

Mathematics Subject Classification ID

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

Related Items

On the Queue Length Distribution for the GI/G/1/K/V_MQueue, 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, Performance analysis of wireless sensor networks using queuing networks, MODELING TRAFFIC FLOWS WITH QUEUEING MODELS: A REVIEW, 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, Topological network design of general, finite, multi-server queueing networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A review of \(L=\lambda W\) and extensions
• 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
• Comments on duality of queues with finite buffer size
• A generalized pollaczek-khinchine formula for the gi/gi/1/k queue and its application to approximation
• Poisson Arrivals See Time Averages
• COMPUTATIONAL ASPECTS OF BULK-SERVICE QUEUEING SYSTEM WITH VARIABLE CAPACITY AND FINITE WAITING SPACE: M/G_Y/1/N+B
• A unified method to analyze overtake free queueing systems
• Customer average and time average queue lengths and waiting times