Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Competitive buffer management for shared-memory switches
ACM Transactions on Algorithms (TALG)
Queuing networks with population size constraints
IBM Journal of Research and Development
Hi-index | 0.00 |
We consider a model of an open exponential queuing network where each node comprises several M/M/1 queues that share a common waiting space (a buffer) of limited capacity. A customer arriving to a node with fully occupied buffer is lost. To make the model analytically tractable we assume that the input traffic to each node, which is a super-position of the external Poisson flow and the flows coming from other nodes, is a Poisson process. Under this assumption a method of an approximate analysis is presented. It is based on solving iteratively a system of non-linear equations for the unknown nodal flow rates. Existence and uniqueness of the solution, obtained by the iterative algorithm, is rigorously proven. Required network and node performance characteristics are provided.