Monotonicity properties of user equilibrium policies for parallel batch systems

Authors:
Yizheng Chen;Mark Holmes;Ilze Ziedins
Affiliations:
Department of Statistics, University of Auckland, Auckland, New Zealand;Department of Statistics, University of Auckland, Auckland, New Zealand;Department of Statistics, University of Auckland, Auckland, New Zealand
Venue:
Queueing Systems: Theory and Applications
Year:
2012

Citing 8
Cited 0

Deciding which queue to join: Some counterexamples

Operations Research
How bad is selfish routing?

Journal of the ACM (JACM)
Dynamic service sharing with heterogeneous preferences

Queueing Systems: Theory and Applications
Individual Equilibrium and Learning in Processor Sharing Systems

Operations Research
The Downs-Thomson Paradox: Existence, Uniqueness and Stability of User Equilibria

Queueing Systems: Theory and Applications
On a Paradox of Traffic Planning

Transportation Science
A survey on networking games in telecommunications

Computers and Operations Research
User equilibria for a parallel queueing system with state dependent routing

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a simple network with two parallel batch-service queues, where service at a queue commences when the batch is full and each queue is served by infinitely many servers. A stream of general arrivals observe the current state of the system on arrival and choose which queue to join to minimize their own expected transit time. We show that for each set of parameter values there exists a unique user equilibrium policy and that it possesses various monotonicity properties. User equilibrium policies for probabilistic routing are also discussed and compared with the state-dependent setting.