Optimal arrivals in a two-server random access system with loss
- 27 Downloads
This paper considers a two-server random access system with loss that receives requests on a time interval [0, T]. The users (players) send their requests to the system, and then the system provides a random access to one of its two servers with some known probabilities. We study the following non-cooperative 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 servicing. The symmetric Nash equilibrium acts 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 to compare the equilibria under different values of the model parameters.
Unable to display preview. Download preview PDF.
- 1.Mazalov, V.V. and Chuiko, Yu.V., Non-cooperative Nash Equilibrium in an Optimal Arrival Time Problem for Queuing System, Vychisl. Tekhnol., 2006, vol. 11, no. 6, pp. 60–71.Google Scholar
- 2.Roslyakov, A.V., Tsentry obsluzhivaniya vyzovov (Call Centres), Moscow: Eko-Trendz, 2002.Google Scholar
- 4.Altman, E., A Markov Game Approach for Optimal Routing into a Queueing Network, INRIA report no. 2178, 1994.Google Scholar
- 5.Altman, E. and Hassin, R., Non-Threshold Equilibrium for Customers Joining an M/G/1 Queue, Proc. of 10th Int. Symp. on Dynamic Game and Applications, 2002.Google Scholar
- 8.Altman, E. and Shimkin, N., Individually Optimal Dynamic Routing in a Processor Sharing System, Operat. Res., 1998, pp. 776–784.Google Scholar
- 11.Killelea, P., Web Performance Tuning: Speeding Up the Web, Sebastopol: O’Reilly Media, 2002.Google Scholar
- 12.Kopper, K., The Linux Enterprise Cluster: Build a Highly Available Cluster with Commodity Hardware and Free Software, San Francisco: No Starch Press, 2005.Google Scholar
- 13.Ou, Z., Zhuang, H., Lukyanenko, A., Nurminen, J., Hui, P., Mazalov, V., and Yla-Jaaski, A., Is the Same Instance Type Created Equal? Exploiting Heterogeneity of Public Clouds, IEEE Trans. Cloud Computing, 2013, DOI: 10.1109/TCC.2013.12.Google Scholar
- 15.Ravner, L. and 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.Google Scholar
- 16.Shaked, M. and Shanthikumar, J.G., Stochastic Orders, Springer Series in Statistics, New York: Springer, 2007.Google Scholar