Self and social optimization in multi-class multi-server queueing systems with relative priorities

Binyamin Oz, Moshe Haviv, Martin L. Puterman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper we show how the use of relative priorities can reduce queueing costs in queueing systems that are multi-server and multi-class as long as customers choose their routing policy strategically. This is demonstrated in two basic models with multi-class Poisson arrivals and parallel memoryless servers with linear cost functions of class expected mean waiting times. For each model we investigate the Nash equilibria under a given relative priority rule. Next, we characterize the central planner's optimal policy, which is shown to be of strictly relative priorities in some cases.

Original languageAmerican English
Title of host publication2014 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages135-141
Number of pages7
ISBN (Electronic)9788884435743
StatePublished - 2 Jul 2014
Event7th International Conference on Network Games, Control and Optimization, NetGCoop 2014 - Trento, Italy
Duration: 29 Oct 201431 Oct 2014

Publication series

Name2014 7th International Conference on Network Games, Control and Optimization, NetGCoop 2014

Conference

Conference7th International Conference on Network Games, Control and Optimization, NetGCoop 2014
Country/TerritoryItaly
CityTrento
Period29/10/1431/10/14

Bibliographical note

Publisher Copyright:
© 2014 University of Trento.

Fingerprint

Dive into the research topics of 'Self and social optimization in multi-class multi-server queueing systems with relative priorities'. Together they form a unique fingerprint.

Cite this