Skip to main content
Log in

An efficient computational method for solving nonlinear matrix equation and its application in queuing analysis

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

The matrix analytic analysis of queues with complex arrival, vacation and service characteristics requires the solution of nonlinear matrix equation. The complexity and large dimensionality of the model require an efficient and smart algorithm for the solution. In this paper, we propose an efficient Adaptive Newton-Kantorovich (ANK) method for speeding up the algorithm solving the nonlinear matrix equation which is an inevitable step in the analysis of the queue with embedded Markov chain such as BMAP/SMSP/1/∞ queue or its discrete version. BMAP/SMSP/1/∞ is a queuing model with a Semi Markov Service time Process (SMSP) and a Batch Markovian Arrival Process (BMAP). The numerical result is presented for the discrete case of N-MMBP/D/1 queue which arises in analyzing traffic aspect of computer communication network, where MMBP is Markov Modulated Bermoulli Process. The comparisons of Adaptive Newton-Kantorovich (ANK) with Modified Newton-Kantorovich (MNK) show that ANK saves 30% of CPU time when the number of userN is 50.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Lucantoni D M. New results on the single server queue with a batch Markovian arrival process.Stochastic Models., 1991, 7(1): 1–46.

    Article  MATH  MathSciNet  Google Scholar 

  2. Neuts M F. Structured Stochastic Matrices of M/G/1 Type and Their Applications. New York & Basel: Marcel Dekker Inc., 1989.

    MATH  Google Scholar 

  3. Lucantoni D M, Meier-Hellstern K S, Neuts M F. A single server queue with server vacations and a class of non-renewal arrival processes.Advanced Applied Probability, 1990, 22: 676–705.

    Article  MATH  MathSciNet  Google Scholar 

  4. Huang J, Hayes J F. A study of the matrix analytic method and it application in performance evaluation of broadband and related system. InInt’l Symp. on Operations Research with Applications in Engineering, Technology and Management (ISORA), Beijing, China, August 19–22, 1995.

  5. Bruneel H, Kim B G. Discrete Time Models for Communication Systems Including ATM. London: Kluwer Academic Publisher, 1993.

    Google Scholar 

  6. Ramaswami V. A stable recursion for the steady state vector in Markov chains of M/G/1 type.Stochastic Models, 1988, 4(1): 183–188.

    Article  MATH  MathSciNet  Google Scholar 

  7. Beuerman S L, Coyle E J. State space expansions and the limiting behavior of quasi-birth-and-dearth processes.Advanced Applied Probability, 1989, 21: 284–314.

    Article  MATH  MathSciNet  Google Scholar 

  8. Gun L. Experimental results on matrix-analytical solution techniques-extensions and comparisons.Stochastic Models, 1989, 5(4): 669–682.

    Article  MathSciNet  Google Scholar 

  9. Huang J, Chen Y, Hayes J F, Ali M M. Performance Analysis of Tunable Leaky Bucket in ATM Networks. ITC International Teletraffic Seminar, Russia, 1995.

  10. Ramaswami V. Nonlinear matrix equations in applied probability-solution techniques and open problems.SIAM Review, 1988, 30(2): 256–263.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Huang Jun.

Additional information

HUANG Jun obtained his Ph.D. degree in electrical engineering from Southeast University in 1992. He is currently a Research Associate in the Department of Electrical Engineering at Concordia University. His research interests are in the area of queuing theory and performance evaluation of telecommunication networks.

ZHU Tao received her Ph.D. degree in electrical engineering from Southeast University in 1993. She is now working for BNR/NT. Her research interests include performance analysis and simulation study with AI technique, traffic modelling and congestion control in BISDN.

J. F. HAYES is a tenure Professor of Department of Electrical Engineering at Concordia University in Montreal. He received his Ph.D. from Berkeley University. He is the senior editor of IEEE Journal of Selected Areas in Communication and the Fellow of IEEE. He published two books and a number of papers in digital and computer communications.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, J., Zhu, T. & Hayes, J.F. An efficient computational method for solving nonlinear matrix equation and its application in queuing analysis. J. of Comput. Sci. & Technol. 11, 272–285 (1996). https://doi.org/10.1007/BF02943134

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02943134

Keywords

Navigation