论文信息 - A finite source retrial queue

A finite source retrial queue

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.

Jesus R. Artalejo | Gennadi. I. Falin

[1] H. Keller,et al. Analysis of Numerical Methods , 1969 .

[2] Yoshitaka Takahashi,et al. An analysis of repeated call model with a finite number of sources , 1985 .

[3] Jesús R. Artalejo,et al. Information theoretic analysis for queueing systems with quasi-random input , 1995 .

[4] Gennadi Falin,et al. A survey of retrial queues , 1990, Queueing Syst. Theory Appl..

[5] N. K. Jaiswal,et al. Priority queues , 1968 .

[6] Gerrit K. Janssens. The quasi-random input queueing system with repeated attempts as a model for a collision-avoidance star local area network , 1997, IEEE Trans. Commun..

[7] Ahmed K. Elhakeem,et al. Traffic analysis of a local area network with a star topology , 1988, IEEE Trans. Commun..

[8] de Ag Ton Kok,et al. ALGORITHMIC METHODS FOR SINGLE SERVER SYSTEMS WITH REPEATED ATTEMPTS , 1984 .

[9] Ronald W. Wolff,et al. Poisson Arrivals See Time Averages , 1982, Oper. Res..

[10] Gennadi Falin,et al. ON THE VIRTUAL WAITING TIME IN AN M/G/1 RETRIAL QUEUE , 1991 .