By Topic

Mean value analysis for blocking 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

1 Author(s)
I. F. Akyildiz ; Sch. of Inf. & Comput. Sci., Georgia Inst. of Technol., Atlanta, GA, USA

An approximation is introduced for the mean value analysis of queueing networks with transfer blocking. The blocking occurs when a job, after completing service at a station, wants to join a station which is full. The job resides in the server of the source station until a place becomes available in the destination station. The approximation is based on the modification of mean residence times, due to the blocking events that occur in the network. Several examples are executed that validate the approximate results.

Published in:

IEEE Transactions on Software Engineering  (Volume:14 ,  Issue: 4 )