We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Lumpability and nearly-lumpability in hierarchical queueing 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

1 Author(s)
Buchholz, P. ; Informatik IV, Dortmund Univ., Germany

Hierarchical extended queueing networks (HQNs) have been proposed recently as a model class which allows a very efficient analysis based on an exploitation of the hierarchical model structure in the analysis of the underlying Markov chain (MC). Furthermore the hierarchical structure of the model enables the definition of symmetries due to identical subnets on model level and the automatic generation of a reduced MC resulting from exact or ordinary lumpability. In this paper the notion of symmetries is extended to nearly symmetries at model and submodel level resulting in nearly lumpability of the underlying MC. Bounds on performance quantities for nearly lumpable Markov chains are computed using bounded aggregation in the stationary case

Published in:

Computer Performance and Dependability Symposium, 1995. Proceedings., International

Date of Conference:

24-26 Apr 1995