Title :
Poles for networks of Markov queues
Author :
Keehn, Daniel G.
Author_Institution :
Dept. of Comput. Eng., San Jose State Univ., CA, USA
fDate :
7/1/1992 12:00:00 AM
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;
Journal_Title :
Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
