DocumentCode
2974182
Title
Ergodicity of networks with blocking
Author
Konstantopoulos, Panagiotis ; Walrand, Jean
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
fYear
1988
fDate
7-9 Dec 1988
Firstpage
1133
Abstract
The authors consider closed networks of first-come first-serve GI/GI/1 queues with the assumption that all service times satisfy a strong Cramer condition. They prove that the distribution of the state of the network at time t converges as t →∞ to a proper steady-state distribution. The method used is the construction of regenerative points
Keywords
queueing theory; Cramer condition; GI/GI/1 queues; closed networks; convergence; ergodicity; first come first serve queues; regenerative points; service times; Communication networks; Communication system control; Computer networks; Distributed computing; Laboratories; Manufacturing systems; Network servers; Random variables; Routing; Steady-state;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 1988., Proceedings of the 27th IEEE Conference on
Conference_Location
Austin, TX
Type
conf
DOI
10.1109/CDC.1988.194494
Filename
194494
Link To Document