Head of the line processor sharing for many symmetric queues with finite capacity
From MaRDI portal
Publication:688661
DOI10.1007/BF01153535zbMath0780.60094OpenAlexW2091072780MaRDI QIDQ688661
Publication date: 30 January 1994
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01153535
asymptoticsapproximation to the loss probabilityhead of the line processor sharingprocessor-sharing disciplinesteady-state behavior
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (5)
On the stability of the multi-queue multi-server processor sharing with limited service ⋮ A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline ⋮ Waiting times for \(M/M\) systems under state-dependent processor sharing ⋮ Optimal Server Allocation to Parallel Queues with Finite-Capacity Buffers ⋮ On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline
- Asymptotic Analysis of the Waiting-Time Distribution for a Large Closed Processor-Sharing System
- Power Series for Stationary Distributions of Coupled Processor Models
- Processor-sharing of two parallel lines
- On the diffusion approximation to two parallel queues with processor sharing
- Rays, waves and asymptotics
- Two coupled processors: The reduction to a Riemann-Hilbert problem
- Diffusion Approximation for Head-of-the-Line Processor Sharing for Two Parallel Queues
This page was built for publication: Head of the line processor sharing for many symmetric queues with finite capacity