zbMATH — the first resource for mathematics

GSPN analysis of retrial systems with servers breakdowns and repairs. (English) Zbl 1156.68319
Summary: Multiserver retrial systems arise in telecommunication and computer networks areas. It is of basic importance to study performance and reliability of retrial systems with unreliable servers, because of limited ability of repairs and heavy influence of the breakdowns on the performance of the system. However, so far the repairable retrial systems are analyzed only by queueing theory and almost works assumed that service station consists of one single server. In this paper, we give a detailed analysis of finite-source retrial systems with multiple servers subject to random breakdowns and repairs using generalized stochastic petri nets model. We show how this high level model allows us to cope with the complexity of such retrial systems involving the unreliability of the servers, under the different breakdowns disciplines. The main steady-state performance and reliability indices are derived and several numerical calculations were performed to show the effect of servers number, retrial, failure and repair rates on the performability measures of the system.

68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
Full Text: DOI
[1] Yang, T.; Templeton, J.G.C., A survey on retrial queues, Queueing systems, 2, 201-233, (1987) · Zbl 0658.60124
[2] Falin, G.I., A survey of retrial queues, Queueing systems, 7, 127-167, (1990) · Zbl 0709.60097
[3] Kulkarni, V.G.; Liang, H.M., Retrial queues revisited, () · Zbl 0871.60074
[4] Falin, G.I.; Templeton, J.G.C., Retrial queues, (1997), Chapman and Hall London · Zbl 0944.60005
[5] Artalejo, J.R., A classified bibliography of research in retrial queues: progress in 1990-1999, Top, 7, 187-211, (1999) · Zbl 1009.90001
[6] Artalejo, J.R., Accessible bibliography on retrial queues, Mathematical and computer modelling, 30, 1-6, (1999) · Zbl 1009.90001
[7] Artalejo, J.R., New results in retrial queueing systems with breakdowns of the servers, Statistica neerlandica, 48, 23-36, (1994) · Zbl 0829.60087
[8] Aissani, A.; Artalejo, J.R., On the single server retrial queue subject to breakdowns, Queueing systems theory applications, 30, 309-321, (1998) · Zbl 0918.90073
[9] Wang, J.; Cao, J.; Li, Q., Reliability analysis of the retrial queue with server breakdowns and repairs, Queueing systems, 38, 363-380, (2001) · Zbl 1028.90014
[10] Almasi, B.; Roszik, J.; Sztrik, J., Homogeneous finite-source retrial queues with server subject to breakdowns and repairs, Computers and mathematics with applications, 43, 767-780, (2002) · Zbl 1090.90036
[11] J. Sztrik, J. Roszik, Performance analysis of finite-source retrial queues with non-reliable heterogeneous servers, in: Proceedings of the XXIV Seminar on Stability Problems of Stochastic Models, Jurmala, Latvia, 2004.
[12] Ajmone Marsan, M.; Balbo, G.; Conte, G.; Donatelli, S.; Franceschinis, G., Modelling with generalized stochastic Petri nets, (1995), John Wiley and Sons New York · Zbl 0843.68080
[13] Janssens, G.K., The quasi-random input queueing system with repeated attempts as a model for collision-avoidance star local area network, IEEE transactions on communications, 45, 360-364, (1997)
[14] Tran-Gia, P.; Mandjes, M., Modeling of customer retrial phenomenon in cellular mobile networks, IEEE journal on selected areas in communications, 15, 1406-1414, (1997)
[15] Houck, D.J.; Lai, W.S., Traffic modeling and analysis of hybrid fiber-coax systems, Computer networks and ISDN systems, 30, 821-834, (1998)
[16] Gharbi, N.; Ioualalen, M., Performance analysis of retrial queueing systems using generalized stochastic Petri nets, Electronic notes in theoretical computer science, 65, 6, (2002) · Zbl 1270.68051
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.