Abstract
We analyze a model of a queueing system in which customers can only call in to request service: if the server is free, the customer enters service immediately, but if the service system is occupied, the unsatisfied customer must break contact and reinitiate his request later. Such a customer is said to be in “orbit”. In this paper we consider three models characterized by the discipline governing the order of re-request of service from orbit. First, all customers in orbit can reapply, but are discouraged and reduce their rate of demand as more customers join the orbit. Secondly, the FCFS discipline operates for the unsatisfied customers in orbit. Finally, the LCFS discipline governs the customers in orbit and the server takes an exponentially distributed vacation after each service is completed. We calculate several characteristics quantities of such systems, assuming a general service-time distribution and different exponential distributions for the times between arrivals of first and repeat requests.
References
C. Clos, An aspect of the dialing behaviour of subscribers and its effect on the trunk plant, Bell Syst. Tech. J. 27 (1948) 424–445.
J.W. Cohen, On the fundamental problems of telephone traffic theory and the influence of repeated calls, Philips Telecomm. Rep. 18 (1957) 49–100.
B.W. Conolly, Generalized state-dependent Erlangian queues: Speculations about calculating measures of effectiveness, J. Appl. Prob. 12 (1975) 358–363.
G.I. Falin, On the waiting-time process in a single line queue with repeated calls, J. Appl. Prob. 23 (1986) 185–192.
J. Keilson, J. Cozzolino and H. Young, A service system with unfilled requests repeated, Oper. Res. 16 (1968) 1126–1132.
J. Keilson and A. Kooharian, On time dependent queueing processes, Ann. Math. Stat. 31 (1960) 104–112.
J.D.C. Little, A proof for the queueing formulaL=λW, Oper. Res. 9 (1961) 383–387.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Farahmand, K. Single line queue with repeated demands. Queueing Syst 6, 223–228 (1990). https://doi.org/10.1007/BF02411475
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02411475