Cart (Loading....) | Create Account
Close category search window

Properties and performance bounds for closed free choice synchronized monoclass queueing networks

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

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

3 Author(s)
Campos, J. ; Dept. de Ingenieria Electr. e Inf., Zaragoza Univ., Spain ; Chiola, G. ; Silva, M.

It is shown that many monoclass queuing networks (QN) with synchronizations can naturally be modeled with a subclass of Petri nets (PN) called free-choice nets (FC), for which a wide gamut of qualitative behavioral and structural results have been derived. Some of these net theoretic results are used to characterize the ergodicity, boundedness, and liveness of closed free-choice synchronized QNs. Upper and lower throughput bounds are defined based on the mean value of the service times, without any assumption on the probability distributions (thus including both the deterministic and the stochastic cases). It is shown that monotonicity properties exist between the throughput bounds and the parameters of the model in terms of population and service times. Proposed are (theoretically polynomial and practically linear complexity) algorithms for the computation of these bounds, based on linear programming problems defined on the incidence matrix of the underlying FC net. Using classical laws from queuing theory, bounds are provided for mean queue lengths and response time

Published in:

Automatic Control, IEEE Transactions on  (Volume:36 ,  Issue: 12 )

Date of Publication:

Dec 1991

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.