DocumentCode
968344
Title
Mean value analysis for blocking queueing networks
Author
Akyildiz, Ian F.
Author_Institution
Sch. of Inf. & Comput. Sci., Georgia Inst. of Technol., Atlanta, GA, USA
Volume
14
Issue
4
fYear
1988
fDate
4/1/1988 12:00:00 AM
Firstpage
418
Lastpage
428
Abstract
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.
Keywords
performance evaluation; queueing theory; destination station; mean residence times; mean value analysis; performance evaluation; queueing networks; transfer blocking; Analytical models; Communication networks; Computer networks; Computer science; Job listing service; Network servers; Performance evaluation; Queueing analysis; State-space methods; Throughput;
fLanguage
English
Journal_Title
Software Engineering, IEEE Transactions on
Publisher
ieee
ISSN
0098-5589
Type
jour
DOI
10.1109/32.4663
Filename
4663
Link To Document