By Topic

Approximate solution of closed queueing networks using mathematical formulae

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)

A practical method which gives the approximate solution of product form closed queueing networks is developed. The starting point is the integral representation of the normalization constant G. This approach was first used by Mitra et al. (1982). A conceptually simpler solution is proposed. It follows that the memory space requirements are dramatically reduced and the processing time is quite small, even on eight-bit personal computers. An important feature of this approach is that the complexity does not grow with the number of chains (classes), but only with the number of noninfinite server stations

Published in:

Telecommunications Symposium, 1990. ITS '90 Symposium Record., SBT/IEEE International

Date of Conference:

3-6 Sep 1990