Analysis of a single-server retrial queue with quasi-random input and nonpreemptive priority
| dc.contributor.author | Gómez-Corral, Antonio | |
| dc.date.accessioned | 2023-06-20T16:54:02Z | |
| dc.date.available | 2023-06-20T16:54:02Z | |
| dc.date.issued | 2002-07-06 | |
| dc.description.abstract | In this paper, we model a single-server retrial queue with quasi-random input and two priority classes. In the case of blocking, a high priority unit is queued, whereas a low priority unit joins the orbit to start generating a Poisson flow of repeated attempts until it finds the server free. Since units in orbit will be served only when the high priority queue is empty, high priority units have nonpreemptive priority over low priority units. We present a simple analysis for the outside observer distribution of the system state as well as for the arriving unit distribution in steady state. Besides, we give numerical examples to illustrate the effect of the parameters on several performance characteristics. | |
| dc.description.department | Depto. de Estadística e Investigación Operativa | |
| dc.description.faculty | Fac. de Ciencias Matemáticas | |
| dc.description.refereed | TRUE | |
| dc.description.sponsorship | European Commission | |
| dc.description.sponsorship | DGES | |
| dc.description.sponsorship | Universidad Complutense de Madrid | |
| dc.description.status | pub | |
| dc.eprint.id | https://eprints.ucm.es/id/eprint/15658 | |
| dc.identifier.doi | 10.1016/S0898-1221(01)00320-0 | |
| dc.identifier.issn | 0898-1221 | |
| dc.identifier.officialurl | http://www.sciencedirect.com/science/article/pii/S0898122101003200 | |
| dc.identifier.relatedurl | http://www.sciencedirect.com | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14352/57373 | |
| dc.journal.title | Computers & Mathematics with Applications | |
| dc.language.iso | eng | |
| dc.page.final | 782 | |
| dc.page.initial | 767 | |
| dc.publisher | Pergamon-Elsevier Science Ltd | |
| dc.relation.projectID | INTAS 96-0828, | |
| dc.relation.projectID | PB98-0837, | |
| dc.relation.projectID | PR64/99-8501 | |
| dc.rights.accessRights | restricted access | |
| dc.subject.cdu | 519.8 | |
| dc.subject.keyword | Retrial queue | |
| dc.subject.keyword | quasi-random input | |
| dc.subject.keyword | nonpreemptive priority | |
| dc.subject.keyword | supplementary variable method | |
| dc.subject.keyword | discrete transformation | |
| dc.subject.ucm | Investigación operativa (Matemáticas) | |
| dc.subject.unesco | 1207 Investigación Operativa | |
| dc.title | Analysis of a single-server retrial queue with quasi-random input and nonpreemptive priority | |
| dc.type | journal article | |
| dc.volume.number | 43 | |
| dcterms.references | J.R. Artalejo, Accessible bibliography on retrial queues, Mathl. Comput. Modelling 30 (3/4), 1-6, (1999). G.I. Falin and J.G.C. Templeton, Retrial Queues, Chapman and Hall, London, (1997). B.D. Choi and K.K. Park, The M/G/l retrial queue with Bernoulli schedule, Queueing Systems 7, 219-227,(1990). B.D. Choi, K.B. Choi and Y.W. Lee, M/G/l retrial queueing systems with two types of calls and finite capacity, Queue&g Systems 19, 215-229, (1995). B.D. Choi and J.W. Kim, Discretetime Geol,Geoz/G/l retrial queueing systems with two types of calls, Computers Math. Applic. 33 (lo), 79-88, (1997). B.D. Choi and D.B. Zhu, The Ml, Mz,/G/l/K retrial queueing systems with priority, Journal of the Korean Mathematical Society 35, 691-712, (1998). B.D. Choi and Y. Chang, Single server retrial queues with priority calls, Mathl. Comput. Modelling 30 (3/4),7-32, (1999). B.D. Choi, Y. Chang and B. Kim, MAPl/MAPz/M/ c retrial queue with guard channels and its application to cellular networks, Top 7, 231-248, (1999). G.I. Falin, J.R. Artalejo and M. Martin, On the single server retrial queue with priority customers, Queueing Systems 14, 439-455, (1993). D.H. Han and Y.W. Lee, MMPP, M/G/l retrial queue with two classes of customers, Communications of the Korean Mathematical Society 11, 481-493, (1996). H. Li and T. Yang, Gee/G/l discrete time retrial queue with Bernoulli schedule, European Journal of Operational Research 111, 629-649, (1998). E. Moutzoukis and C. Langaris, Non-preemptive priorities and vacations in a multiclass retrial queueing system, Communications in Statistics. Stochastic Models 12, 455-472, (1996). M. Takahsshi, H. Osawa and T. Fujisawa, Geo [X]/G/1 retrial queue with non-preemptive priority, Asia-Pacific Journal of Operational Research 16, 215-234, (1999). N.K. Jaiswal, Priority Queues, Academic Press, New York, (1968). H. Takagi, Queueing Analysis. Volume 1: Vacation and Priority Systems, North Holland, Amsterdam,(1991). Y.N. Kornyshev, Design of a fully accessible switching system with repeated calls, Telecommunications 23,46-52, (1969). J.R. Artalejo and A. Gbmez-Corral, Information theoretic analysis for queueing systems with quasi-random input, Mathl. Comput. Modelling 22 (3), 65-76, (1995). JR Artalejo, Retrial queues with a finite number of sources, Journal of the Korean Mathematical Society 35, 503-525, (1998). V.I. Dragieva, Queueing system with finite source and repeated demands, (in Russian), In Proceedings of the International Seminar on Teletmfic Theory and Computer Modelling, Sofia, Bulgaria, March 21-26, 1988,pp. 135-145. V.I. Dragieva, Single-line queue with finite source and repeated calls,, Problems of information tinsmdssion 30, 283-289, (1994). G.I. Falin and J.R. Artalejo, A finite source retrial queue, European Jownal of Operational Research 108,409-424, (1998). G.I. Falin, A multiserver retrial queue with a finite number of sources of primary calls, Math. Comput.Modelling 30 (3/4), 33-49, (1999). G.I. Falin and A. G6mez-Corral, On a bivariate Markov process arising in the theory of single-server retrial queues, Statistica Neerlandica 54, 67-78, (2000). A.G. deKok, Algorithmic methods for single server systems with repeated attempts, Statistica Neerlan&ca 38, 23-32, (1984). S.N. Stepanov, The analysis of the model with finite number of sources and taking into account the subscriber behavior, Automation and Remote Control 55, 100-113, (1994). H. Ohmura and Y. Takahsshi, An analysis of repeated call model with a finite number of sources, Electronics and Communications in Japan, Part I68 (6), 112-121, (1985). P. Tran-Gia and M. Mandjes, Modeling of customer retrial phenomenon in cellular mobile networks, IEEE Journal on Selected Areas in Commzlnications 15, 1406-1414, (1997). D.J. Houck and W.S. Lai, Traffic modeling and analysis of hybrid fibercoax systems, Computer Networks and ISDN Systems 30, 821-834, (1998). H. Li and T. Yang, A single-server retrial queue with server vacations and a finite number of input sources,European Journal of Operational Research 85, 149-160, (1995). G.K. Janssens, The quasi-input queueing system with repeated attempts as a model for a collision-avoidance star local area network, IEEE i’hasactions on Communications 45, 360-364, (1997). M.K. Mehmet-Ali, J.F. Hayes and A.K. Elhakeem, Traffic analysis of a local area network with star topology,IEEE Transactions on Communications 36, 703-712, (1988). A.I. Kalmychkov and G.A. Medvedev, Probability characteristics of Markov local-area networks with randomaccess protocols, Automatic Control and Computer Sciences 24, 38-45, (1990). 1.1. Khomichkov, Study of models of local networks with multipkaccess protocols, Azltomation and Remote Control 54, 1801-1811, (1993). H. Takagi, Queueing Analysis. Volume 2: Finite Systems, North Holland, Amsterdam, (1993). | |
| dspace.entity.type | Publication |
Download
Original bundle
1 - 1 of 1