Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-12T20:31:36.786Z Has data issue: false hasContentIssue false
  • English
  • Français

INFINITE-SERVER QUEUES WITH SYSTEM'S ADDITIONAL TASKS AND IMPATIENT CUSTOMERS

Published online by Cambridge University Press:  25 September 2008

Eitan Altman  and
Uri Yechiali
Eitan Altman
Affiliation:
INRIA, Sophia Antipolis, France E-mail: [email protected]
Uri Yechiali
Affiliation:
Department of Statistics and Operations Research, School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

A system is operating as an M/M/∞ queue. However, when it becomes empty, it is assigned to perform another task, the duration U of which is random. Customers arriving while the system is unavailable for service (i.e., occupied with a U-task) become impatient: Each individual activates an “impatience timer” having random duration T such that if the system does not become available by the time the timer expires, the customer leaves the system never to return. When the system completes a U-task and there are waiting customers, each one is taken immediately into service. We analyze both multiple and single U-task scenarios and consider both exponentially and generally distributed task and impatience times. We derive the (partial) probability generating functions of the number of customers present when the system is occupied with a U-task as well as when it acts as an M/M/∞ queue and we obtain explicit expressions for the corresponding mean queue sizes. We further calculate the mean length of a busy period, the mean cycle time, and the quality of service measure: proportion of customers being served.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 22 , Issue 4 , October 2008 , pp. 477 - 493
Copyright
Copyright © Cambridge University Press 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Altman, E. & Kofman, D. (1996). Bounds for performance measures of token rings. IEEE/ACM Transactions on Networking 4: 292–299.CrossRefGoogle Scholar
2.Altman, E. & Yechiali, U. (2006). Analysis of customers’ impatience in queues with server vacations. Queueing Systems 52: 261–279.Google Scholar
3.Bonald, T. & Roberts, J. (2001). Performance modeling of elastic traffic in overload. ACM Sigmetrics Performance Evoluation Review 29: 342–343.CrossRefGoogle Scholar
4.Browne, S. & Steele, J.M. (1993). Transient behavior of coverage processes with applications to the infinite-server queue. Journal of Applied Probability 30: 589–602.CrossRefGoogle Scholar
5.Doshi, B.T. (1985). A note on stochastic decomposition in a GI/G/1 queue with vacations or set-up times. Journal of Applied Probability 22: 419–428.CrossRefGoogle Scholar
6.Fuhrmann, S.W. (1984). A note on the M/G/1 queue with server vacations. Operations Research 32: 1368–1373.CrossRefGoogle Scholar
7.Fuhrmann, S.W. & Cooper, R.B. (1985). Stochastic decomposition in the M/G/1 queue with generalized vacations. Operations Research 33: 1117–1129.CrossRefGoogle Scholar
8.Gans, N., Koole, G. & Mandelbaum, A. (2003). Telephone call centers: Tutorial, review, and research prospects. Manufacturing and Service Operations Management 5: 79–141.CrossRefGoogle Scholar
9.Levy, Y.J. & Yechiali, U. (1975). Utilization of the idle time in an M/G/1 queuing system. Management Science 22: 202–211.CrossRefGoogle Scholar
10.Levy, Y. & Yechiali, U. (1976). An M/M/s queue with servers’ vacations. Canadian Journal of Operational Research and Information Processing 14: 153–163.CrossRefGoogle Scholar
11.Liu, L. & Shi, D. (1996). Busy period in GIX/G/∞. Journal of Applied Probability 33: 815–829.CrossRefGoogle Scholar
12.Miorandi, D. & Altman, E. (2004). Connectivity in ad–hoc networks: A queueing theoretical approach. In Proceedings of Workshop on Modeling and Optimization in Mobile, Ad–Hoc and Wireless Networks (WiOPT 2004), pp. 132–141.Google Scholar
13.Shomrony, M. & Yechiali, U. (2001). Burst arrival queues with server vacations and random timers. Mathematical Methods in Operations Research 53: 117–146.CrossRefGoogle Scholar
14.Takacs, L. (1962). Introduction to the theory of queues. New York: Oxford University Press.Google Scholar
15.Takacs, L. (1974). A single-server queue with limited virtual waiting time. Journal of Applied Probability 11: 612–617.Google Scholar
16.Takagi, H. (1991). Queueing analysis Vol 1: Vacations and Priority Systems. Amsterdam: North-Holland.Google Scholar
17.Yechiali, U. (2004). On the M X/G/1 queue with a waiting server and vacations. Sankhya 66, (Part 1): 1–17.Google Scholar
18.Zussman, G., Segall, A. & Yechiali, U. (2004). Bluetooth time division duplex: Analysis as a polling system. In Proceedings of the 1st IEEE Conference on Sensor and Ad Hoc Communications and Networks (SECON’04), pp. 547–556.Google Scholar
19.Zussman, G., Yechiali, U. & Segall, A. (2003). Exact probabilistic analysis of the limited scheduling algorithm for symmetrical bluetooth piconets. In Proceedings of IFIP TC6 Personal Wireless Communications (PWC’03) Conti, M., Giordano, S., Gregori, E. & Olaria, S. (Eds.)Lecture Notes in Computer Science Vol. 2775. Berlin: Springer-Verlag, pp. 276–290.Google Scholar