DocumentCode
1013083
Title
Poles for networks of Markov queues
Author
Keehn, Daniel G.
Author_Institution
Dept. of Comput. Eng., San Jose State Univ., CA, USA
Volume
39
Issue
7
fYear
1992
fDate
7/1/1992 12:00:00 AM
Firstpage
577
Lastpage
582
Abstract
A method for calculating the throughput of queuing network models is introduced. This method uses the concepts of poles in the complex plane to evaluate system performance and characterizes the system bottleneck as a certain extreme pole. This method allows the analyst to treat linear systems, controls, and some queuing networks with the common methodology of complex variable analysis
Keywords
Markov processes; poles and zeros; queueing theory; Markov queues; closed Jackson networks; complex plane; complex variable analysis; numerical stability; poles; queuing network models; saddle point approximation; system bottleneck; throughput; Algorithm design and analysis; Computer networks; Current measurement; Delay; Equations; Queueing analysis; Steady-state; System performance; Throughput; Time measurement;
fLanguage
English
Journal_Title
Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
Publisher
ieee
ISSN
1057-7122
Type
jour
DOI
10.1109/81.257291
Filename
257291
Link To Document