Skip to main content
Springer Nature Link
Log in

Strategic Routing in Heterogeneous Discriminatory Processor Sharing Queues

  • Conference paper
  • First Online:
Network Games, Artificial Intelligence, Control and Optimization (NETGCOOP 2024)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 15185))

  • 44 Accesses

Abstract

We consider strategic routing for a two-class discriminatory processor queue with an additional cost for joining the premium class. We show that, depending on the specific parameters of the system, various equilibria can coexist, including equilibria where the queueing system is not ergodic for the equilibrium traffic split. We also investigate how the server can select the priority of the classes and the fees charged from the customers in order to maximise its revenue.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Gurvich, I., Lariviere, M.A., Ozkan, C.: Coverage, coarseness, and classification: determinants of social efficiency in priority queues. Manage. Sci. 65(3), 1061–1075 (2019)

    Article  MATH  Google Scholar 

  2. Hayel, Y., Tuffin, B.: Pricing for heterogeneous services at a discriminatory processor sharing queue. In: Proceedings of Networking (2005)

    Google Scholar 

  3. Fiems, D.: Strategic revenue management for discriminatory processor sharing queues. In: Computer Performance Engineering and Stochastic Modelling (LNCS,volume 14231), pp. 3–17. Springer (2023)

    Google Scholar 

  4. Fayolle, G., Mitrani, I., Iasnogorodski, R.: Sharing a processor among many job classes. J. ACM 27(3), 519–532 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  5. Massoulié, L., Roberts, J.: Bandwidth sharing: objectives and algorithms. IEEE/ACM Trans. Networking 10(3), 320–328 (2002)

    Article  MATH  Google Scholar 

  6. Massoulié, L., Roberts, J.: Bandwidth sharing and admission control for elastic traffic. Telecommun. Syst. 15(1–2), 185–201 (2000)

    Article  MATH  Google Scholar 

  7. Roberts, J.W.: A survey on statistical bandwidth sharing. Comput. Networks 45(3), 319–332 (2004)

    Article  MATH  Google Scholar 

  8. Yashkov, S.F., Yashkova, A.S.: Processor sharing: a survey of the mathematical theory. Autom. Remote. Control. 68(9), 1662–1731 (2007)

    Article  MATH  Google Scholar 

  9. Altman, E., Avrachenkov, K., Ayesta, U.: A survey on discriminatory processor sharing. Queueing Syst. 53(1–2), 53–63 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  10. Orda, A., Rom, R., Shimkin, N.: Competitive routing in multiuser communication networks. IEEE/ACM Trans. Networking 1(5), 510–521 (1993)

    Article  MATH  Google Scholar 

  11. Altman, E., Shimkin, N.: Individual equilibrium and learning in processor sharing systems. Oper. Res. 46(6), 776–784 (1998)

    Article  MATH  Google Scholar 

  12. Ben-Shahar, I., Orda, A., Shimkin, N.: Dynamic service sharing with heterogeneous preferences. Queueing Syst. 35(1–4), 83–103 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  13. Ravner, L., Haviv, M., Vu, H.L.: A strategic timing of arrivals to a linear slowdown processor sharing system. Eur. J. Oper. Res. 255, 496–504 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  14. Altman, E., Ayesta, U., Prabhu, B.J.: Load balancing in processor sharing systems. Telecommun. Syst. 47(1–2), 35–48 (2011)

    Article  MATH  Google Scholar 

  15. Ayesta, U., Brun, O., Prabhu, B.J.: Price of anarchy in non-cooperative load balancing games. Perform. Eval. 68(12), 1312–1332 (2011)

    Article  MATH  Google Scholar 

  16. Fiems, D., Prabhu, B.J.: Macroscopic modelling and analysis of flows during rush-hour congestion. In: Performance Evaluation, pp. 149–150 (2021)

    Google Scholar 

  17. Hassin, R., Haviv, M.: To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems. Kluwer Academic (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ghent University, Departement TELIN, Gent, Belgium

    Dieter Fiems

  2. LAAS CNRS, University of Toulouse, CNRS, Toulouse, France

    Balakrishna J. Prabhu

Authors
  1. Dieter Fiems
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Balakrishna J. Prabhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Dieter Fiems or Balakrishna J. Prabhu .

Editor information

Editors and Affiliations

  1. Inria, Villeneuve-d'Ascq, France

    Hélène Le Cadre

  2. University of Avignon, Avignon, France

    Yezekael Hayel

  3. INRIA, Rennes, France

    Bruno Tuffin

  4. IMT, Palaiseau, France

    Tijani Chahed

Rights and permissions

Reprints and permissions

Copyright information

© 2025 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Fiems, D., Prabhu, B.J. (2025). Strategic Routing in Heterogeneous Discriminatory Processor Sharing Queues. In: Le Cadre, H., Hayel, Y., Tuffin, B., Chahed, T. (eds) Network Games, Artificial Intelligence, Control and Optimization. NETGCOOP 2024. Lecture Notes in Computer Science, vol 15185. Springer, Cham. https://doi.org/10.1007/978-3-031-78600-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-78600-6_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-78599-3

  • Online ISBN: 978-3-031-78600-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics