DocumentCode
2817560
Title
Approximate solution of closed queueing networks using mathematical formulae
Author
Albuquerque, Ediron Q.
fYear
1990
fDate
3-6 Sep 1990
Firstpage
172
Lastpage
175
Abstract
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
Keywords
computer networks; queueing theory; 8 bit; approximate solution; closed queueing networks; computer networks; integral representation; mathematical formulae; memory space; normalization constant; personal computers; processing time; product form networks; server stations; Computer aided software engineering; National electric code; Testing; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Telecommunications Symposium, 1990. ITS '90 Symposium Record., SBT/IEEE International
Conference_Location
Rio de Janeiro
Type
conf
DOI
10.1109/ITS.1990.175592
Filename
175592
Link To Document