Queue-Length Distribution for the Discriminatory Processor-Sharing Queue
From MaRDI portal
Publication:5689788
DOI10.1287/OPRE.44.4.653zbMath0865.90067OpenAlexW2008204647MaRDI QIDQ5689788
Kiran M. Rege, Bhaskar Sengupta
Publication date: 6 July 1997
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.44.4.653
heavy traffic limit theoremjoint queue-length distributiondiscriminatory processor-sharing queuemoments of the queue-length distribution
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (10)
Markov-modulated \(\mathrm{M}/\mathrm{G}/1\)-type queue in heavy traffic and its application to time-sharing disciplines ⋮ Approximate queue length distribution of a discriminatory processor sharing queue with impatient customers ⋮ Mobility can drastically improve the heavy traffic performance from \(\frac{1}{1-\varrho}\) to \(\log(1/(1-\varrho))\) ⋮ Heavy-traffic limits for discriminatory processor sharing models with joint batch arrivals ⋮ Mean sojourn times for phase-type discriminatory processor sharing systems ⋮ A survey on discriminatory processor sharing ⋮ Analysis of a Markovian feedback queue with multi-class customers and its application to the weighted round-robin queue ⋮ Hierarchical Game and Bi-level Optimization for Controlling Network Usage Via Pricing ⋮ Discriminatory Processor Sharing Queues and the DREB Method ⋮ Heavy-Traffic Insensitive Bounds for Weighted Proportionally Fair Bandwidth Sharing Policies
This page was built for publication: Queue-Length Distribution for the Discriminatory Processor-Sharing Queue
