Abstract
A class of circuit-switching open queueing networks is discussed. The main result of the paper is that if extra message flows are not “too intensive” and the path distribution is “mainly concentrated” on the paths of (graph) distance 1 (nearest neighbour connections), then the network has a unique stationary working regime, no matter how “large” the configuration graph of the network is. Standard properties of this regime are established such as decay of correlation and continuity.
Similar content being viewed by others
References
G.I. Falin, On the convergence of service processes to the stationary ones in complex-structure loss systems, Theor. Probab. Appl. 32, 3 (1987) 577–579.
M.Ya. Kelbert and Yu.M. Sukhov, Investigation of a full random field describing the state of switching network, Preprint, M, (1983), Inst. for Problems of Inf. Transmission, USSR AS, Moscow, USSR.
M.Ya. Kelbert and Yu.M. Sukhov, Conditions for existence and uniqueness of a random field describing the state of a switching network, Problems of Inf. Transmission 19, 4 (1983) 50–71.
M.Ya. Kelbert and Yu.M. Sukhov, Weak dependence properties of a random field describing the state of switching network, Problems of Inf. Transmission, 21, 3 (1985) 89–98.
M.Ya. Kelbert, R.N. Kopeika, R.N. Shamsiev and Yu.M. Sukhov, On a class of hybrid switching networks with small transit flows, Preprint No. 269/87 (1987), Research Center BiBoS, UniversitÄt Bielefeld, W. Germany.
M.Ya. Kelbert, R.P. Kopeika, R.N. Shamsiev and Yu.M. Sukhov, Perturbation theory approach for a class of hybrid switching networks with small transit flows, Submitted to Appl. Probab. (1987).
M.Ya. Kelbert and Yu.M. Sukhov, Mean-field approximation: a model of a star-like hybrid switching network, Submitted to Problems of Inf. Transmission (1987).
M.Ya. Kelbert, M.L. Kontsevich and A.N. Rybko, On the Jackson networks on denumerable graphs, Theor. Probab. Appl. 33, 2 (1988) 182–185.
F.P. Kelly, Blocking probabilities in large circuit-switched networks, Adv. in Appl. Probab. 18, 2 (1986) 473–505.
F.P. Kelly, One-dimensional circuit-switched network, Ann. of Probab. 15, 3 (1987) 1166–1179.
V.A. Malyshev and S.A. Berezner, On a class of circuit-switching networks, Submitted to Appl. Probab. (1987).
A.N. Rybko, Capacity regions for switching networks, Dissertation, M. (1983), Inst. for Problems of Inf. Transmission.
A.N. Rybko and V.A. Mikhailov, Capacity region for circuit switching networks, Problems of Inf. Transmission 22, 1 (1986) 51–66.
R.N. Shamsiev, Circuit switching networks with priorities on one-dimensional lattice, Submitted to Appl. Probab. (1988).
Yu.M. Sukhov and R.N. Shamsiev, Hybrid switching networks on one-dimensional lattice, Problems on Inf. Transmission, 23, 4 (1987) 75–86.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kelbert, M.Y., Sukhov, Y.M. Circuit-switching networks with FIFO plus justifying blockout service on infinite graphs. Queueing Syst 4, 157–169 (1989). https://doi.org/10.1007/BF01158550
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01158550