Queueing networks in equilibrium and Markov chains: numerical solution methods

Dimitar Radev, Izabella Lokshina and Vladimir Denchev

World Review of Entrepreneurship, Management and Sustainable Development, 2007, vol. 3, issue 3/4, 302-316

Abstract: This paper is devoted to research and development of the computational procedures to obtain the steady-state probability vectors in the queueing networks. The numerical methods for the Markov chains performance evaluation and analysis, such as direct, iterative and aggregative methods, are considered and compared. The enhanced computational procedures, developed with use of Gaussian elimination direct approach, iterative power approach, Courtois's approximation method and Takahashi's iterative method are implemented and explored. Numerical examples for the steady state solutions based on the proposed algorithms are demonstrated; and comparative analysis of the obtained results is made.

Keywords: mobile communication networks; Markov chains; performance evaluation; steady state analysis; numerical solutions; queueing networks; mobile networks. (search for similar items in EconPapers)
Date: 2007
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=14048 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:wremsd:v:3:y:2007:i:3/4:p:302-316

Access Statistics for this article

More articles in World Review of Entrepreneurship, Management and Sustainable Development from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().