Skip to main content
SpringerLink
Log in

Optimal Arrivals in a Two-Server Rational Random-Access System with Loss

  • mathematical game theory and applications
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

An Erratum to this article was published on 01 December 2020

This article has been updated

Abstract

This paper considers a two-server rational random-access system with loss that receives requests on a time interval [0, T]. The users (players) are sending their requests to the system; then the system provides a random access with given probabilities to one of two free servers or to a single free server, or rejects the request. We study the following noncooperative game for this service system. As his strategy, each player chooses the time to send his request to the system, trying to maximize the probability of service. The symmetric Nash equilibrium is selected as the optimality criterion. Two models are considered for this game. In the first model, the number of players is deterministic, while in the second it obeys the Poisson distribution. We demonstrate that there exists a unique symmetric equilibrium for both models. Finally, some numerical experiments are performed (a) to compare the equilibria under different parameter values and (b) to compare the efficiency of this two-server system with the one-server counterpart and also with the corresponding pure random-access model in which the system has no information about the states of servers (busy or free).

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Change history

References

  1. Mazalov, V. V. & Chuiko, Yu. V. Noncooperative Nash Equilibrium in an Optimal Arrival Time Problem for Queuing System. Vychisl. Tekhnolog. 11(no. 6), 60–71 (2006).

    Google Scholar 

  2. Chirkova, Yu. V. Optimal Arrivals in a Two-Server Random Access System with Loss. Autom. Remote Control 78(no. 3), 557–580 (2017).

    Article  MathSciNet  Google Scholar 

  3. Altman, E. Applications of Dynamic Games in Queues. Adv. Dynamic Games 7, 309–342 (2005).

    Article  MathSciNet  Google Scholar 

  4. Altman, E., A Markov Game Approach for Optimal Routing into a Queueing Network, INRIA Report no. 2178, 1994.

  5. Altman, E., Hassin, R.Altman, E., Hassin, R., Non-Threshold Equilibrium for Customers Joining an M/G/1 Queue, Proc. of 10th Int. Symp. on Dynamic Game and Applications, Saint-Petersburg, 2002.

  6. Altman, E., Jimenez, T., NunezQueija, R. & Yechiali, U. Optimal Routing among  ⋅ /M/1 Queues with Partial Information. Stoch. Models 20(no. 2), 149–172 (2004).

    Article  MathSciNet  Google Scholar 

  7. Altman, E. & Koole, G. Stochastic Scheduling Games with Markov Decision Arrival Processes. J. Comput. Math. Appl. 26(no. 6), 141–148 (1993).

    Article  MathSciNet  Google Scholar 

  8. Altman, E., Shimkin, N.Individually Optimal Dynamic Routing in a Processor Sharing System, Operat. Research, 1998, pp. 776–784.

  9. Glazer, A. & Hassin, R. Equilibrium Arrivals in Queues with Bulk Service at Scheduled Times. Transport. Sci. 21(no. 4), 273–278 (1987).

    Article  MathSciNet  Google Scholar 

  10. Glazer, A. & Hassin, R. ?/M/1: On the Equilibrium Distribution of Customer Arrivals. Eur. J. Operat. Research 13(no. 2), 146–150 (1983).

    Article  MathSciNet  Google Scholar 

  11. Johnson, O. & Goldschmidt, C. Preservation of Log-Concavity on Summation. ESAIM: Probab. Statist. 10, 206–215 (2006).

    Article  MathSciNet  Google Scholar 

  12. Killelea, P. Web Performance Tuning: Speeding Up the Web. (O’Reilly Media, Sebastopol, 2002).

    Google Scholar 

  13. Kopper, K. The Linux Enterprise Cluster: Build a Highly Available Cluster with Commodity Hardware and Free Software. (No Starch Press, San Francisco, 2005).

    Google Scholar 

  14. Ou, Z., Zhuang, H., Lukyanenko, A., Nurminen, J., Hui, P., Mazalov, V. & Yla-Jaaski, A. Is the Same Instance Type Created Equal? Exploiting Heterogeneity of Public Clouds. IEEE Trans. Cloud Computing 1(no. 2), 201–214 (2013).

    Article  Google Scholar 

  15. Ravner, L. & Haviv, M. Strategic Timing of Arrivals to a Finite Queue Multi-Server Loss System. Queueing Syst. 81(no. 1), 71–96 (2015).

    Article  MathSciNet  Google Scholar 

  16. Ravner, L., Haviv, M.Equilibrium and Socially Optimal Arrivals to a Single Server Loss System, in Int. Conf. on Network Games Control and Optimization 2014 (NETGCOOP’14), Trento, Italy, October 2014.

  17. Shaked, M. & Shanthikumar, J. G. Stochastic Orders, Springer Series in Statistics. (Springer, New York, 2007).

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematical Research, Karelian Research Center, Russian Academy of Sciences, Petrozavodsk, Russia

    Yu.V. Chirkova

Authors
  1. Yu.V. Chirkova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu.V. Chirkova.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chirkova, Y. Optimal Arrivals in a Two-Server Rational Random-Access System with Loss. Autom Remote Control 81, 1345–1365 (2020). https://doi.org/10.1134/S0005117920070140

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117920070140

Keywords

Search

Navigation