By Topic

Decomposition and aggregation by class in closed 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
$33 $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)
Conway, A.E. ; IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA ; Georganas, N.D.

A method is described whereby a multiple-class closed network of first-come first-served (FCFS) queues can be analyzed exactly by a decomposition and aggregation procedure that proceeds class by class, rather than node by node. First, the FCFS network is transformed into an equivalent network of processor-sharing queues in which a hierarchy of subsystems associated with subsets of the classes may be identified. This decomposition and aggregation procedure reduces the multiple-class queuing networks into a hierarchy of single-class queueing network problems. The reduced system is constructed containing one particular class of customers. A parametric analysis of this class with respect to the routing can then be made. The time and space requirements of this parametric analysis technique are derived and compared to the requirements of a straightforward repetitive analysis of the network using the convolution algorithm. An example parametric analysis of a store-and-forward communication network model is given.

Published in:

Software Engineering, IEEE Transactions on  (Volume:SE-12 ,  Issue: 10 )