Analysis of a Constant Retrial Queue with Joining Strategy and Impatient Retrial Customers

Shan Gao, Xiangyang Niu and Tao Li

Mathematical Problems in Engineering, 2017, vol. 2017, 1-8

Abstract:

This paper treats an M/M/1 retrial queue with constant retrial times. If the server is busy at the arrival epoch, the arriving customer decides to join the retrial orbit with probability or balk with probability . Only the customer at the head of the orbit is permitted to access the server. Upon retrial, the customer immediately receives his service if the server is idle; otherwise, he may enter the orbit again or leave the system because of impatience. First, we give the performance analysis for this retrial queue and give some important performance indices. Second, based on a natural reward-cost structure, we analyze the Nash equilibrium customers’ joining strategies and give some numerical examples.

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2017/9618215.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2017/9618215.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:9618215

DOI: 10.1155/2017/9618215

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().