Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Performance analysis of a GI/D-\(MSP/1/\infty\) queueing system under different service phase initiations

  • Theoretical Article
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

The main objective of this paper is to derive some analytic results concerning GI/D-\(MSP/1/\infty\) queueing model in which customers arrive according to a discrete-time renewal process. We assume that the service process is correlated and its configuration is designed through discrete-time Markovian service process under different service phase initiations to start a busy period. The system-length distributions at various time epochs have been obtained by employing the matrix-geometric approach. An explicit closed form expression for the waiting-time distribution in the queue measured in slots has also been derived. Computational experiences with a variety of numerical results are discussed to show the effect of system parameters on the performance measures. This queueing model has potential applications in the domain of computer networks, telecommunication systems, and wireless local communication networks for evaluating the various system performances. An application of this type of queueing model in the domain of network coding in wireless communications is also discussed. This provides relevant information to the system analysts, researchers, and industry people who are interested to investigate congestion problems using queueing theory.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Alfa, A.S.: Applied Discrete-Time Queues, 2nd edn. Springer, New York (2016)

    Book  Google Scholar 

  2. Yue, W., Matsumoto, Y.: Performance Analysis of Multi-Channel and Multi-Traffic on Wireless Communication Networks. Kluwer Academic Publishers, New York (2002)

    Google Scholar 

  3. Bruneel, H., Kim, B.G.: Discrete-Time Models for Communication Systems Including ATM. Kluwer Academic Publishers, Boston (1993)

    Book  Google Scholar 

  4. Takagi, H.: Queueing Analysis: A Foundation of Performance Evaluation, vol. III. North-Holland, Amsterdam (1993)

    Google Scholar 

  5. Hunter, J.J.: Mathematical Techniques of Applied Probability: Discrete Time Models; Techniques and Applications, vol. II. Academic Press, New York (1983)

    Google Scholar 

  6. Woodward, M.E.: Communication and Computer Networks: Modelling with Discrete-Time Queues. Wiley-IEEE Computer Society Press, California (1994)

    Google Scholar 

  7. Alfa, A.S., Xue, J., Ye, Q.: Perturbation theory for the asymptotic decay rates in the queues with Markovian arrival process and/or Markovian service process. Queueing Syst. 36(4), 287–301 (2000)

    Article  Google Scholar 

  8. Bocharov, P.P., D’Apice, C., Pechinkin, A., Salerno, S.: The stationary characteristics of the \(G/MSP/1/r\) queueing system. Autom. Remote Control 64, 288–301 (2003)

    Article  Google Scholar 

  9. Albores-Velasco, F.J., Tajonar-Sanabria, F.S.: Analysis of the \(GI/MSP/c/r\) queueing system. Inf. Process. 4, 46–57 (2004)

    Google Scholar 

  10. Gupta, U.C., Banik, A.D.: Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue—a computational approach. Oper. Res. Lett. 35(2), 273–280 (2007)

    Article  Google Scholar 

  11. Chaudhry, M.L., Samanta, S.K., Pacheco, A.: Analytically explicit results for the \(GI/C\)-\(MSP/1/\infty\) queueing system using roots. Probab. Eng. Inf. Sci. 26(2), 221–244 (2012)

    Article  Google Scholar 

  12. Samanta, S.K.: Sojourn-time distribution of the \(GI/MSP/1\) queueing system. OPSEARCH 52(4), 756–770 (2015)

    Article  Google Scholar 

  13. Bocharov, P.P.: Stationary distribution of a finite queue with recurrent flow and Markovian service. Autom. Remote Control 57, 66–78 (1996)

    Google Scholar 

  14. Samanta, S.K., Chaudhry, M.L., Pacheco, A.: Analysis of \(BMAP/MSP/1\) queue. Methodol. Comput. Appl. Probab. 18(2), 419–440 (2016)

    Article  Google Scholar 

  15. Horváth, G., Van Houdt, B., Telek, M.: Commuting matrices in the queue length and sojourn time analysis of \(MAP/MAP/1\) queues. Stoch. Models 30(4), 554–575 (2014)

    Article  Google Scholar 

  16. Ozawa, T.: Analysis of queues with Markovian service processes. Stoch. Models 20(4), 391–413 (2004)

    Article  Google Scholar 

  17. Samanta, S.K., Gupta, U.C., Chaudhry, M.L.: Analysis of stationary discrete-time \(GI/D\)-\(MSP/1\) queue with finite and infinite buffers. 4OR Q. J. Oper. Res. 7(4), 337–361 (2009)

    Article  Google Scholar 

  18. Wang, Y.C., Chou, J.H., Wang, S.Y.: Loss pattern of \(DBMAP/DMSP/1/K\) queue and its application in wireless local communications. Appl. Math. Model. 35(4), 1782–1797 (2011)

    Article  Google Scholar 

  19. Samanta, S.K., Zhang, Z.G.: Stationary analysis of a discrete-time \(GI/D\)-\(MSP/1\) queue with multiple vacations. Appl. Math. Model. 36(12), 5964–5975 (2012)

    Article  Google Scholar 

  20. Samanta, S.K., Chaudhry, M.L., Pacheco, A., Gupta, U.C.: Analytic and computational analysis of the discrete-time \(GI/D\)-\(MSP/1\) queue using roots. Comput. Oper. Res. 56, 33–40 (2015)

    Article  Google Scholar 

  21. Daduna, H.: Queueing Networks with Discrete Time Scale—Explicit Expressions for the Steady State Behavior of Discrete Time Stochastic Networks (Series-Lecture Notes in Computer Science). Springer, Berlin (2001)

    Google Scholar 

  22. Alfa, A.S., Sengupta, B., Takine, T., Xue, J.: A new algorithm for computing the rate matrix of \(GI/M/1\) type Markov chains. In: Proceedings of the Fourth International Conference: Matrix-Analytic Methods-Theory and Applications, pp. 1–16 (2002)

  23. Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. Johns Hopkins Press, Baltimore (1981)

    Google Scholar 

  24. Goswami, V., Vijaya Laxmi, P.: Performance analysis of discrete-time \(GI/D\)-\(MSP^{a, b}/1/N\) queue. Int. J. Appl. Decis. Sci. 3(4), 400–420 (2010)

    Google Scholar 

  25. Çinlar, E.: Introduction to Stochastic Processes. Prentice Hall, New Jersey (1975)

    Google Scholar 

  26. Lucantoni, D.M., Neuts, M.F.: Some steady-state distributions for the \(MAP/SM/1\) queue. Stoch. Models 10, 575–598 (1994)

    Article  Google Scholar 

  27. Kim, N.K., Chang, S.H., Chae, K.C.: On the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals. Oper. Res. Lett. 30(1), 25–32 (2002)

    Article  Google Scholar 

  28. Gupta, U.C., Samanta, S.K., Goswami, V.: Analysis of a discrete-time queue with load dependent service under discrete-time Markovian arrival process. J. Korean Stat. Soc. 43, 545–557 (2014)

    Article  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the anonymous referees for their many valuable suggestions to improve the quality of this paper. The second author acknowledges the Council of Scientific and Industrial Research (CSIR), New Delhi, India, for partial support from the Project Grant 25(0271)/17/EMR-II.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. K. Samanta.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Nandi, R., Samanta, S.K. Performance analysis of a GI/D-\(MSP/1/\infty\) queueing system under different service phase initiations. OPSEARCH 56, 216–241 (2019). https://doi.org/10.1007/s12597-019-00358-3

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12597-019-00358-3

Keywords