Complutense University Library

A finite source retrial queue

Artalejo, Jesús R. and Falin , Guennadi I. (1998) A finite source retrial queue. European Journal Of Operational Research, 108 (2). pp. 409-424. ISSN 0377-2217

[img] PDF
Restricted to Repository staff only until 31 December 2020.

972kB

Official URL: http://www.sciencedirect.com/science/article/pii/S0377221797001707

View download statistics for this eprint

==>>> Export to other formats

Abstract

This paper deals with a single-server retrial queue with a finite number of sources. Our analysis extends previous work on this topic and includes the analysis of the arriving customer's distribution, the busy period and the waiting time process. This queuing system and its variants are widely used to model magnetic disk memory systems, star-like local area networks and other communication systems.


Item Type:Article
Additional Information:

We thank a referee for his comments which helped us to improve the clarity of the paper. The research was supported by the European Commission through INTAS grant 96-0828 and the DGICYT through grant PB950416.

Uncontrolled Keywords:Retrial queuing systems; Finite number of sources; Discrete transformations
Subjects:Sciences > Mathematics > Operations research
ID Code:15963
References:

J.R. Artalejo, A. Gomez-Corral, Information theoretic analysis for queuing systems with quasi-random input, Mathematical and Computer Modelling 22 (1995) 65-76.

V.I. Uragieva, Single-line queue with finite source and repeated calls, Problems of Information Transmission 30 (1994) 283-289.

G.I. Falin, A survey of retrial queues, Queuing Systems 7 (1990) 127-168.

G.1. Falin, C. Fricker, On the virtual waiting time in an M/G/l retrial queue, Journal of Applied Probability 28 (1991) 446-460.

S.K. Godunov, V.S. Ryabenkii, Difference Schemes, North-Holland, 1987.

E. Isaacson, H.B. Keller, Analysis of Numerical Methods, John Wiley, 1966.

N.K. Jaiswal, Priority Queues, Academic Press, 1968.

G.K. Janssens, The quasi-input queuing system with repeated attempts as a model for a collision-avoidance star local area network, RUCA/STE working paper 91/08, University of Antwerp, Faculty of Applied Economics, 1991.

A.G. de Kok, Algorithmic methods for single server systems with repeated attempts, Statistica Nee-rlandica 38 (1984) 23-32.

Y.N. Komyshev, Design of a fully accessible switching system with repeated calls, Telecommunications 23 (1969) 46-52.

H. Li, T. Yang, A single-server retrial queue with server vacations and a finite number of input sources, European Journal of Gperational Research 85 (1995) 149-160.

M.K. Mehmet-Ali, J.F. Hayes, A.K. Elhakeem, Traffic analysis of a local atea network with star topology, JEEE Transactions on Communications 36 (1988) 703-712.

1131 H. Ohmura, Y. Takahashi, An analysis of repeated call model with a finite number of sources, Electronics and Communications in Japan 68 (1985) 112-121.

R.W. Wolff, Poisson arrivals see time averages, Operations Research 30 (1982) 223-231.

T. Yang, J.G.C. Templeton, A survey on retrial queues, Queuing Systems 2 (1987) 201-233.

Deposited On:16 Jul 2012 11:26
Last Modified:06 Feb 2014 10:35

Repository Staff Only: item control page