Introduction to matrix analysis (2nd ed.)
Introduction to matrix analysis (2nd ed.)
On the Cycle Time Distribution in a Two-Stage Cyclic Network with Blocking
IEEE Transactions on Software Engineering
Evaluation of queuing system parameters using linear algebraic queuing theory—an implementation
SIGSMALL '90 Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems
Transient analysis of packet discarding policies in ATM networks with correlated arrivals
Performance Evaluation
Analytical observations for a multiservice node
Performance Evaluation
Approximation models of feed-forward G/G/1/N queueing networks with correlated arrivals
Performance Evaluation
Correlation properties of the token leaky bucket departure process
Computer Communications
| Hi-index | 0.00 |
An explicit steady-state solution is given for any queuing loop made up of two general servers, whose distribution functions have rational Laplace transforms. The solution is in matrix geometric form over a vector space that is itself a direct or Kronecker product of the internal state spaces of the two servers. The algebraic properties of relevant entities in this space are given in an appendix. The closed-form solution yields simple recursive relations that in turn lead to an efficient algorithm for calculating various performance measures such as queue length and throughput. A computational-complexity analysis shows that the algorithm requires at least an order of magnitude less computational effort than any previously reported algorithm.