Asymptotic Analysis of Two Coupled Queues with Vastly Different Arrival Rates and Finite Customer Capacities

DOI10.1111/J.1467-9590.2011.00529.XzbMath1271.68072OpenAlexW1538166632MaRDI QIDQ2893198

Charles Knessl, John A. Morrison

Publication date: 26 June 2012

Published in: Studies in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1467-9590.2011.00529.x

zbMATH Keywords

generalized processor sharingcoupled queues

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

PERFORMANCE MEASURES FOR THE TWO-NODE QUEUE WITH FINITE BUFFERS

Cites Work

• Two queues with vastly different arrival rates and processor-sharing factors
• Interacting queues in heavy traffic
• Heavy traffic analysis of two coupled processors
• A fork-join queueing model: Diffusion approximation, integral representations and asymptotics
• Analysis of the asymmetric shortest queue problem
• Two Parallel Queues Created by Arrivals with Two Demands I
• The Longer Queue Model
• J.comput. appl. math
• Two Parallel Queues Created by Arrivals with Two Demands II
• Processor-sharing of two parallel lines
• Two queues in parallel
• Two coupled processors: The reduction to a Riemann-Hilbert problem
• Analysis of generalized processor-sharing systems with two classes of customers and exponential services
• Diffusion Approximation for Head-of-the-Line Processor Sharing for Two Parallel Queues

This page was built for publication: Asymptotic Analysis of Two Coupled Queues with Vastly Different Arrival Rates and Finite Customer Capacities