The single server queueing system with Non-recurrent input-process and Erlang service time

P. D. Finch

doi:10.1017/S1446788700027968

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We consider a single server queueing system in which customers arrive at the instants t0, t1, …, tm, …. We write τm = tm+1 − tm, m ≧ 0. There is a single server with distribution of service times B(x) given by where k is an integer not less than unity.

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Pearce, C. 1965. A queueing system with moving average input process and batch arrivals. Journal of the Australian Mathematical Society, Vol. 5, Issue. 4, p. 434.

Pearce, C. 1966. A Queueing system with general moving average input and negative exponential service time. Journal of the Australian Mathematical Society, Vol. 6, Issue. 2, p. 223.

Kovalenko, I. N. 1974. Queueing theory. Journal of Soviet Mathematics, Vol. 2, Issue. 1, p. 1.

Takács, Lajos 1975. Combinatorial and analytic methods in the theory of queues. Advances in Applied Probability, Vol. 7, Issue. 03, p. 607.

Takács, Lajos 1975. Combinatorial and analytic methods in the theory of queues. Advances in Applied Probability, Vol. 7, Issue. 3, p. 607.

Brent, R. P. and Kung, H. T. 1978. Fast Algorithms for Manipulating Formal Power Series. Journal of the ACM, Vol. 25, Issue. 4, p. 581.

Pakes, Anthony G. and Phatarfod, R.M. 1978. The limiting distribution for the infinitely deep dam with a Markovian input. Stochastic Processes and their Applications, Vol. 8, Issue. 2, p. 199.

Phatarfod, Ravindra M. 1979. The bottomless dam. Journal of Hydrology, Vol. 40, Issue. 3-4, p. 337.

Phatarfod, Revindra M. 1982. On some applications of Wald's identity to dams. Stochastic Processes and their Applications, Vol. 13, Issue. 3, p. 279.

K�nig, D. Rykov, V. V. and Schmidt, V. 1983. Stationary queuing systems with dependencies. Journal of Soviet Mathematics, Vol. 21, Issue. 6, p. 938.

Phatarfod, R. M. 1993. The geometricity of the limiting distributions in queues and dams. Journal of Applied Probability, Vol. 30, Issue. 2, p. 438.

Manivasakan, R. Desai, U.B. and Karandikar, A. 1999. CIPP based characterization of VBR traffic and related statistical multiplexer performance. Vol. 1a, Issue. , p. 194.

Manivasakan, R. Karandikar, Abhay and Desai, U.B. 2001. CIPP—a versatile analytical model for VBR traffic. Performance Evaluation, Vol. 43, Issue. 4, p. 269.

Kim, Bara and Sohraby, Khosrow 2003. Providing Quality of Service in Heterogeneous Environments, Proceedings of the 18th International Teletraffic Congress - ITC-18. Vol. 5, Issue. , p. 781.

Kim, Bara and Sohraby, Khosrow 2006. Tail behavior of the queue size and waiting time in a queue with discrete autoregressive arrivals. Advances in Applied Probability, Vol. 38, Issue. 4, p. 1116.

Tomanová, Petra and Holý, Vladimír 2021. Clustering of arrivals in queueing systems: autoregressive conditional duration approach. Central European Journal of Operations Research, Vol. 29, Issue. 3, p. 859.

Article contents

The single server queueing system with Non-recurrent input-process and Erlang service time

Extract

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests