OPSEARCH

, Volume 50, Issue 3, pp 334–345 | Cite as

Analysis of G–queue with unreliable server

Application Article
First Online:
Accepted:

Abstract

This paper presents a model for a discrete time single server G-queue with two types of independent arrivals, namely positive and negative. The arrival of negative customer to queueing system removes one customer from the head of the queue (RCH), which causes server breakdown. The repair of the server is non-instantaneous and after repair server is assumed as good as new. The interarrival times of both positive and negative customers and the repair times of the server are geometrically distributed. We analyse the queueing system by using Matrix Geometric method. The expressions for various performance measures such as mean queue length, throughput, delay, etc. are derived and calculated numerically.

Keywords

G-queues Negative customers Discrete-time queues Server breakdown 
This is a preview of subscription content, log in to check access.

References

  1. 1.
    Artalejo, J.R.: G-networks: a versatile approach for work removal in queueing networks. Euro. J. Oper. Res. 126, 233–249 (2000)CrossRefGoogle Scholar
  2. 2.
    Atencia, I., Moreno, P.: The discrete-time Geo/Geo/1 queue with negative customers and disasters. Comput. Oper. Res. 31, 1537–1548 (2004)CrossRefGoogle Scholar
  3. 3.
    Atencia, I., Moreno, P.: A single-server G-queue in discrete time with geometrical arrival and service process. Perform. Eval. 59, 85–97 (2005)CrossRefGoogle Scholar
  4. 4.
    Bocharov, P.P., Vishnevskii, V.M.: G-networks: development of the theory of multiplicative networks. Autom. Remote. Control. 64(5), 714–739 (2003)CrossRefGoogle Scholar
  5. 5.
    Chakka, R.: Spectral expansion solution for some finite capacity queues. Ann. Oper. Res. 79, 27–44 (1998)CrossRefGoogle Scholar
  6. 6.
    Chakka, R., Do, T.V.: The MM \( \sum\limits_{{\mathrm{k}=1}}^{\mathrm{K}} {\mathrm{CP}{{\mathrm{P}}_{\mathrm{k}}}} /\mathrm{GE}/\mathrm{c}/\mathrm{L} \) G-queue and its application to the analysis of the load balancing in MPLS networks, LCN 735-736 (2002)Google Scholar
  7. 7.
    Chakka, R., Do, T.V.: The MM \( \sum\limits_{{\mathrm{k}=1}}^{\mathrm{K}} {\mathrm{CP}{{\mathrm{P}}_{\mathrm{k}}}} /\mathrm{GE}/\mathrm{c}/\mathrm{L} \) G-queue with heterogeneous servers: steady state solution and an application to performance evaluation. Perform. Eval. 64(3), 191–209 (2007)CrossRefGoogle Scholar
  8. 8.
    Chakka, R., Do, T.V.: Some new markovian models for traffic and performance evaluation of telecommunication networks, Next Generation Internet, LNCS-Lecture Notes in Computer Science 5233 (Ed. by Demetres D. Kouvatsos), 642–664 (2011)Google Scholar
  9. 9.
    Chakka, R., Harrison, P.G.: A markov modulated multi server queue with negative customers-The MM CPP/GE/c/L G-queue. Acta Informatica 37(11–12), 881–919 (2001)CrossRefGoogle Scholar
  10. 10.
    Do, T.V.: A new solution for a queueing model of a manufacturing cell with negative customers under a rotation rule. Perform. Eval. 68(4), 330–337 (2011)CrossRefGoogle Scholar
  11. 11.
    Do, T.V.: An initiative for a classified bibliography on G-networks. Perform. Eval. 68(4), 385–394 (2011)CrossRefGoogle Scholar
  12. 12.
    Do, T.V., Chakka, R.: A new performability model for queueing and FDL-related burst loss in optical switching nodes. Comput. Commun. 33, 146–151 (2010)CrossRefGoogle Scholar
  13. 13.
    Do, T.V., Chakka, R., Harrison, P.G.: Integrated analytical model for computation and comparison of the throughputs of the UMTS/HSDPA user equipment categories, Proceedings of MSWiM, ISBN: 978-1-59593-851-0, 45-51 (2007)Google Scholar
  14. 14.
    Do, T.V., Papp, D., Chakka, R., Truong, X.M.T.: A performance model of MPLS multipath routingwith failures and repaires of the LSPs, Performance Modelling and Analysis of Heterogeneous Networks, ISBN-10: 8792329187, ISBN-13: 978-87-92329-18-9, 27-44 (2009)Google Scholar
  15. 15.
    Do, T.V., Chakka, R., Do, N.H., Pap, L.: A Markovian queue with varying number of servers and applications to the performance comparison of HSDPA user equipment. Acta Informatica 48(4), 243–269 (2011)CrossRefGoogle Scholar
  16. 16.
    Gelenbe, E.: Product form queueing networks with negative and positive customers. J. Appl. Prob. 28, 656–663 (1991)CrossRefGoogle Scholar
  17. 17.
    Gelenbe, E.: Queues with negative arrivals. J. Appl. Prob. 28, 245–250 (1991)CrossRefGoogle Scholar
  18. 18.
    Gelenbe, E.: G-networks with signals and batch removal. Prob. Eng. Inform. Sci. 7, 335–342 (1993)CrossRefGoogle Scholar
  19. 19.
    Gelenbe, E.: Introduction to the special issue on G-Networks and the random neural network. Perform. Eval. 68(4), 307–308 (2011)CrossRefGoogle Scholar
  20. 20.
    Gelenbe, E., Fourneau, J.M.: G-networks with resets. Perform. Eval. 49, 179–191 (2002)CrossRefGoogle Scholar
  21. 21.
    Gelenbe, E., Mitrani, I.: Analysis and synthesis of computer systems. World Scientific, Imperial College Press, London (2010)Google Scholar
  22. 22.
    Gelenbe, E., Morfopoulou, C.: Routing and G-networks to optimise energy and quality of service in packet networks, Energy-Efficient Computing and Networking, Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 54(Part 4), 163–173 (2011). doi: 10.1007/978-3-642-19322-4_18
  23. 23.
    Gelenbe, E., Shanchnai, H.: On G-networks and resource allocation in multimedia systems. Eur. J. Oper. Res. 126, 308–318 (2000)CrossRefGoogle Scholar
  24. 24.
    Harrison, P.G.: The MM CPP/GE/c G-queue: sojourn time distribution. Queueing Sys.: Theory and Application 41(3), 271–298 (2002)CrossRefGoogle Scholar
  25. 25.
    Harrison, P.G., Patel, N.M., Pital, E.: Reliability modelling using G-queues. Eur. J. Oper. Res. 126(2), 273–287 (2000)CrossRefGoogle Scholar
  26. 26.
    Jianwen, T.: A novel discrete time queue system. J. Front. Com. Sci. Tech. 4(6), 567–575 (2010)Google Scholar
  27. 27.
    Li, Q., Zhao, Y.Q.: A MAP/G/1 queue with negative customers. Queueing Sys. 47, 5–43 (2004)CrossRefGoogle Scholar
  28. 28.
    Liu, Z., Wu, J.: An MAP/G/1 G-queues with preemptive resume and multiple vacations. App. Math. Mod. 33, 1739–1748 (2009)CrossRefGoogle Scholar
  29. 29.
    Ma, L.: A class of Geom/Geom/1 discrete-time queueing system with negative customers. Int. J. Nonlinear Sci. 5(3), 275–280 (2008)Google Scholar
  30. 30.
    Mitrani, I., Chakka, R.: Spectral expansion solution for a class of Markov models: application and comparison with the matrix-geometric method. Perform. Eval. 23(3), 241–260 (1995)CrossRefGoogle Scholar
  31. 31.
    Neuts, M.F.: Matrix geometric solutions in stochastic models- an algorithmic approach. John Hopkins Univ. Press, Baltimore (1981)Google Scholar
  32. 32.
    Park, H.M., Yang, W.S., Chae, K.C.: The Geo/G/1 queue with negative customers and disasters. Stoch. Model. 25(4), 673–688 (2009)CrossRefGoogle Scholar
  33. 33.
    Shin, Y.W.: Sojourn time distributions for M/M/c G-queue. Comm. Korean Math. Soc. 13(2), 405–434 (1998)Google Scholar
  34. 34.
    Wang, J., Zhang, P.: A discrete time retrial queue with negative customers and unreliable server. Comp. Ind. Engg. 56(4), 1216–1222 (2009)CrossRefGoogle Scholar
  35. 35.
    Wang, J., Zhang, P.: A single server discrete-time retrial G-queue with server breakdown and repair. Acta Math. App. Sinica- English Series 25(4), 675–684 (2009)CrossRefGoogle Scholar
  36. 36.
    Wang, J., Zhao, Q.: A discrete-time Geo/G/1 retrial queue with starting failures and second optional service. Comp. Math. App. 53(1), 115–127 (2007)CrossRefGoogle Scholar
  37. 37.
    Zhou, W.H.: Performance analysis of discrete time queue GI/G/1 with negative arrivals. App. Math. Comp. 170(2), 1349–1355 (2005)CrossRefGoogle Scholar

Copyright information

© Operational Research Society of India 2012

Authors and Affiliations

  1. 1.Birla Institute of Technology and SciencePilaniIndia
  2. 2.Centre for Mathematical SciencesBanasthali VidyapithBanasthaliIndia
  3. 3.Institute of Advanced Management and ResearchGhaziabadIndia

Personalised recommendations