|
Problemy Peredachi Informatsii, 1997, Volume 33, Issue 3, Pages 91–101
(Mi ppi380)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Communication Network Theory
Queueing Networks with Several Demand Types, Immediate Service, and Node Bypassing by Demands
A. V. Krylenko
Abstract:
We consider open networks with several demand types. Demands arrive at a node with probability depending on the node state and demand type and displace the demands being served. The displaced demands are queued at the same node or are moved instantly to another node according to a route matrix or leave the system. It is proved that the stationary distribution depends only on the mean service time and not on the type of its distribution.
Received: 30.04.1996 Revised: 29.07.1996
Citation:
A. V. Krylenko, “Queueing Networks with Several Demand Types, Immediate Service, and Node Bypassing by Demands”, Probl. Peredachi Inf., 33:3 (1997), 91–101; Problems Inform. Transmission, 33:3 (1997), 268–276
Linking options:
https://www.mathnet.ru/eng/ppi380 https://www.mathnet.ru/eng/ppi/v33/i3/p91
|
Statistics & downloads: |
Abstract page: | 275 | Full-text PDF : | 113 |
|