Mean sojourn times for phase-type discriminatory processor sharing systems

DOI10.1016/j.ejor.2007.05.051zbMath1149.90324OpenAlexW2023198660MaRDI QIDQ2480975

Moshe Haviv, Jan van der Wal

Publication date: 7 April 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.05.051

zbMATH Keywords

queuesdiscriminatory processor sharingphase type

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items

Security screening queues with impatient applicants: a new model with a case study ⋮ Approximate queue length distribution of a discriminatory processor sharing queue with impatient customers ⋮ Heavy-traffic limits for discriminatory processor sharing models with joint batch arrivals ⋮ On the scheduling of operations in a chat contact center ⋮ Relative priority policies for minimizing the cost of queueing systems with service discrimination ⋮ Delay analysis of a discrete-timeGI−GI− 1 queue with reservation-based priority scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• A decomposition theorem and related results for the discriminatory processor sharing queue
• To queue or not to queue: equilibrium behavior in queueing systems.
• A survey on discriminatory processor sharing
• Protecting bursty applications against traffic aggressiveness
• Sharing a Processor Among Many Job Classes
• Direct Solutions of M/G/1 Processor-Sharing Models
• Priority Assignment in Waiting Line Problems
• Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities
• Time-shared Systems
• Queue-Length Distribution for the Discriminatory Processor-Sharing Queue

This page was built for publication: Mean sojourn times for phase-type discriminatory processor sharing systems