Hostname: page-component-7bb8b95d7b-wpx69 Total loading time: 0 Render date: 2024-09-18T04:59:42.905Z Has data issue: false hasContentIssue false

Expected waiting times in a multiclass batch arrival retrial queue

Published online by Cambridge University Press:  14 July 2016

V. G. Kulkarni*
Affiliation:
University of North Carolina at Chapel Hill

Abstract

Expressions are derived for the expected waiting times for the customers of two types who arrive in batches (in a compound Poisson fashion) at a single-server queueing station with no waiting room. Those who cannot get served immediately keep returning to the system after random exponential amounts of time until they get served. The result is shown to agree with similar results for three special cases studied in the literature.

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1986 

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

Bux, W. (1981) Local area subnetworks: A performance comparison. IEEE Trans. Comm. 29, 14651473.Google Scholar
Falin, G. I. (1976) Aggregate arrival of customers in one-line system with repeated calls. Ukranian Math. J. 28, 437440.Google Scholar
Hawkes, A. G. (1965) Time dependent solution of a priority queue with bulk arrival. Operat. Res. 13, 586595.CrossRefGoogle Scholar
Kulkarni, V. G. (1983a) On queueing systems with retrials. J. Appl. Prob. 20, 380389.CrossRefGoogle Scholar
Kulkarni, V. G. (1983b) A game theoretic model for two types of customers competing for service: Operat. Res. Lett. 2, 119122.Google Scholar
Tropper, C. (1981) Local Computer Network Technologies. Academic Press, New York.Google Scholar