Abstract
A tandem retrial queueing system with orbital search in which two self-service stations namely, the main station and the offer zone and an orbit for passive customers lost from the offer zone without joining the main station is considered. The main service station is of infinite capacity while the offer zone which works in a random environment and the orbit for passive customers are of finite capacities. Two types of customers arrive to the service stations according to a Marked Markovian Arrival Process (MMAP) with representation \((D_0,D_1,D_2).\) The service times in both stations are exponentially distributed. A virtual search mechanism associated with the main station will be working when the number of customers in the main station is below a pre-assigned level L. The duration of search is exponentially distributed. The condition for system stability is established. The system state distribution in the steady state is obtained. Several system performance characteristics are derived. An associated optimization problem is investigated.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Artalejo, J.R.: Accessible bibliography on retrial queues: progress in 2000–2009. Math. Comput. Model. 51, 1071–1081 (2010)
Artalejo, J.R.: A classified bibliography of research on retrial queues: progress in 1990–1999. Top 7, 187–211 (1999)
Artalejo, J.R., Joshua, V.C., Krishnamoorthy, A.: An M/G/1 retrial queue with orbital search by server. In: Advances in Stochastic Modelling, pp. 41–54. Notable Publications, New Jersey (2002)
Bright, L., Taylor, P.G.: Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes. Stoch. Mod. 11, 497–525 (1995)
Chakravarthy, S.R., Krishnamoorthy, A., Joshua, V.C.: Analysis of a multi-server retrial queue with search of customers from the orbit. Perform. Eval. 63, 776–798 (2006)
Dudin, A.N., Krishnamoorthy, A., Joshua, V.C., Tsarenkov, G.: Analysis of BMAP/G/1 retrial system with search of customers from the orbit. Eur. J. Oper. Res. 157, 169–179 (2004)
Dudin, A., Deepak, T.G., Joshua, V.C., Krishnamoorthy, A., Vishnevsky, V.: On a BMAP/G/1 retrial system with two types of search of customers from the orbit. In: Dudin, A., Nazarov, A., Kirpichnikov, A. (eds.) ITMM 2017. CCIS, vol. 800, pp. 1–12. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68069-9_1
Dallery, Y., Frein, Y.: On decomposition methods for tandem queueing networks with blocking. Oper. Res. 41, 386–399 (1993)
Falin, G.I.: A survey of retrial queues. Queueing syst. 7, 127–167 (1990)
Falin, G.I., Templeton, J.G.C.: Retrial Queues. Chapman and Hall, London (1997)
Corral, A.G.: A tandem queue with blocking and Markovian arrival process. Queueing syst. 41, 343–370 (2002)
Klimenok, V., Dudin, A., Vishnevsky, V.: On the stationary distribution of tandem queue consisting of a finite number of stations. In: Kwiecień, A., Gaj, P., Stera, P. (eds.) CN 2012. CCIS, vol. 291, pp. 383–392. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31217-5_40
Klimenok, V., Dudin, A., Vishnevsky, V.: Tandem queueing system with correlated input and cross-traffic. In: Kwiecień, A., Gaj, P., Stera, P. (eds.) CN 2013. CCIS, vol. 370, pp. 416–425. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38865-1_42
Krishnamoorthy, A., Deepak, T.G., Joshua, V.C.: An M/G/1 retrial queue with non persistent customers and orbital search. Stoch. Anal. Appl. 23, 975–997 (2005)
Krishnamoorthy, A., Joshua, V.C., Mathew, A.P.: A retrial queueing system with abandonment and search for priority customers. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds.) DCCN 2017. CCIS, vol. 700, pp. 98–107. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-66836-9_9
Krishnamoorthy, A., Joshua, V.C., Ambily, P.M.: MMAP/M/ \(\infty \) queueing system with an offer zone working in a random environment. Accepted for presentation in Euro Conference on Queue. Thesis Israel (2018)
Latouche, G., Neuts, M.F.: Efficient algorithmic solutions to exponential tandem queues with blocking. SIAM J. Algebraic Discrete Methods 1, 93–106 (1980)
Latouche, G., Ramaswami, V.: Introduction to Matrix Analytic Methods in Stochastic Modeling, vol. 5. SIAM (1999)
Neuts, M.F., Ramalhoto, M.F.: A service model in which the server is required to search for customers. J. Appl. Prob. 21, 57–166 (1984)
Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. Courier Corporation, New York (1981)
Neuts, M.F., Rao, B.M.: Numerical investigation of a multiserver retrial model. Queueing Syst. 7, 169–189 (1990)
Perros, H.G.: A bibliography of papers on queueing networks with finite capacity queues. Perform. Eval. 10, 255–260 (1989)
Acknowledgement
A. Krishnamoorthy and V.C. Joshua thanks the Department of Science and Technology, Government of India, for the support given under the Indo-Russian Project INT/RUS/RSF/P-15. A. Krishnamoorthy also thanks the UGC India for the Award of Emeritus Fellowship No.F6-6/2017/-18/EMERITUS-2017-18-GEN-10822/(SA-II). Ambily P. Mathew thanks the UGC-India for the teacher fellowship sanctioned under the Faculty Development Programme [F.No.FIP/12thplan/KLMG002TF06].
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Mathew, A.P., Krishnamoorthy, A., Joshua, V.C. (2018). A Retrial Queueing System with Orbital Search of Customers Lost from an Offer Zone. In: Dudin, A., Nazarov, A., Moiseev, A. (eds) Information Technologies and Mathematical Modelling. Queueing Theory and Applications. ITMM WRQ 2018 2018. Communications in Computer and Information Science, vol 912. Springer, Cham. https://doi.org/10.1007/978-3-319-97595-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-97595-5_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-97594-8
Online ISBN: 978-3-319-97595-5
eBook Packages: Computer ScienceComputer Science (R0)