By Topic

Guaranteed bounds for steady state performance measures of a Markov chain with applications to high speed data networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bonatti, M. ; ITALTEL, Milan, Italy ; Gaivoronski, A.A.

A method for approximation of a discrete Markov chain by a chain of considerably smaller dimension which is based on the duality theory of optimization is proposed. A novel feature of the approach is that it provides guaranteed upper and lower bounds for the performance indices defined on the steady state distribution of the original system. Several families of guaranteed bounds are defined, and the algorithms for their computation are developed. The properties of suggested bounds are illustrated by applying the approach to the problem of the statistical multiplexer dimensioning in asynchronous transfer mode (ATM) networks

Published in:

INFOCOM '93. Proceedings.Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking: Foundation for the Future, IEEE

Date of Conference: