Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities

DOI10.1017/S0269964800004940zbMath1096.60521MaRDI QIDQ5488550

Moshe Haviv, Jan van der Wal

Publication date: 22 September 2006

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (13)

Stability of a queue with discriminatory random order service discipline and heterogeneous servers ⋮ Charging more for priority via two-part Tariff for accumulating priorities ⋮ An optimal mechanism charging for priority in a queue ⋮ HEAVY-TRAFFIC ANALYSIS OF A NON-PREEMPTIVE MULTI-CLASS QUEUE WITH RELATIVE PRIORITIES ⋮ Reducing Delay in Retrial Queues by Simultaneously Differentiating Service and Retrial Rates ⋮ Waiting times in queues with relative priorities ⋮ Strategic bidding in an accumulating priority queue: equilibrium analysis ⋮ The use of relative priorities in optimizing the performance of a queueing system ⋮ Mean sojourn times for phase-type discriminatory processor sharing systems ⋮ Relative priority policies for minimizing the cost of queueing systems with service discrimination ⋮ A survey on discriminatory processor sharing ⋮ Equilibrium strategies for placing duplicate orders in a single server queue ⋮ Random-order-of-service for heterogeneous customers: waiting time analysis

Cites Work

• Stable priority purchasing in queues
• Reneging from Processor Sharing Systems and Random Queues
• Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue
• Purchasing Priorities in Queues

This page was built for publication: Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities