Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-29T13:17:15.433Z Has data issue: false hasContentIssue false
  • English
  • Français

Perturbation theory approach for a class of hybrid switching networks with small transit flows

Published online by Cambridge University Press:  01 July 2016

M. Ya. Kelbert ,
R. P. Kopeika ,
R. N. Shamsiev  and
Yu. M. Sukhov
M. Ya. Kelbert*
Affiliation:
Institute for Problems of Information Transmission
R. P. Kopeika*
Affiliation:
Institute for Problems of Information Transmission
R. N. Shamsiev*
Affiliation:
Institute for Problems of Information Transmission
Yu. M. Sukhov*
Affiliation:
Institute for Problems of Information Transmission
*
Postal address for all authors: Institute for Problems of Information Transmission, USSR Academy of Sciences, GSP-4 Moscow 101447, USSR.
Postal address for all authors: Institute for Problems of Information Transmission, USSR Academy of Sciences, GSP-4 Moscow 101447, USSR.
Postal address for all authors: Institute for Problems of Information Transmission, USSR Academy of Sciences, GSP-4 Moscow 101447, USSR.
∗Research partly carried out at BiBoS Research Centre, University of Bielefeld, D-4800 Bielefeld, FRG.
Get access Rights & Permissions [Opens in a new window]

Abstract

A method originating from statistical mechanics (low-density and high-temperature expansions) is used to prove the existence and uniqueness of a stationary regime for switching networks on finite or infinite graphs. The main assumption is that the message (customer) flows circulating through the network are ‘localized' in the sense that, for any message, the probability of having a long path is rapidly decreasing (and, moreover, a path of a ‘typical' message consists of one line). The switching rule combines message-switching and circuit-switching principles. The stationary regime for the network under consideration may be treated as a ‘small perturbation' of the ‘idealized' regime in the totally decoupled network where all the messages have single line paths.

Keywords

STATIONARY REGIMEFAMILY OF MARKED POINT PROCESSESSOLUTION TO A SYSTEM OF STOCHASTIC EQUATIONSEXISTENCE AND UNIQUENESSMAJORIZATION PROPERTIESWEAK DEPENDENCE
Type
Research Article
Information
Advances in Applied Probability , Volume 22 , Issue 1 , March 1990 , pp. 211 - 229
Copyright
Copyright © Applied Probability Trust 1990 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Brandt, A. (1985a) On stationary waiting times and limiting behaviour of queues with many servers I: the general G/G/m/8 case. Elektron. Informations verarb. u. Kybernet. EIK 21, 47–64.Google Scholar
[2] Brandt, A. (1985b) On stationary waiting times and limiting behaviour of queues with many servers II: the G/GI/m/8 case. Elektron. Informations verarb. u. Kybernet. EIK 21, 151–162.Google Scholar
[3] Ignatyuk, I. N. and Malyshev, V. A. (1989) Locally interacting processes and communication networks [Russian]. Problems Inf. Transmission 25, 65–77.Google Scholar
[4] Kelbert, M. Ya., Kontsevich, M. L. and Rybko, A. N. (1988) On Jackson's networks on denumerable graphs [Russian]. Theory Prob. Appl. 33, 379–382.Google Scholar
[5] Kelbert, M. Ya., Kopeika, R. P., Shamsiev, R. N., and Sukhov, Yu. M. (1987) On a class of hybrid switching networks with small transit flows. Preprint 269/87, Research Center BiBoS, University of Beilefeld, FRG.Google Scholar
[6] Kelbert, M. Ya. and Sukhov, Yu. M. (1983) Existence and uniqueness conditions for a random field describing the state of a switching network. Problems Inf. Transmission 19, 289–304.Google Scholar
[7] Kelbert, M. Ya. and Sukhov, Yu. M. (1985) Weak dependence of random field describing state of a switching network with small transit flows. Problems Inf. Transmission 21, 237–245.Google Scholar
[8] Kelbert, M. Ya. and Sukhov, Yu. M. (1989) Poissonian limit theorem for hybrid star-like networks: a mean-field approximation [Russian]. Problems Inf. Transmission 25, 78–87.Google Scholar
[9] Kelly, F. P. (1986) Blocking probabilities in large circuit-switching networks. Adv. Appl. Prob. 18, 473–505.Google Scholar
[10] Kelly, F. P. (1987) One-dimensional circuit-switched networks. Ann. Prob. 15, 1166–1179.Google Scholar
[11] Loynes, R. M. (1962) The stability of a queue with non-independent inter-arrival and service times. Proc. Camb. Phil. Soc. 58, 497–520.Google Scholar
[12] Rybko, A. N. and Mikhailov, V. A. (1986) Capacity region for circuit-switching networks. Problems Inf. Transmission 22, 51–56.Google Scholar
[13] Shamsiev, R. N. and Sukhov, Yu. M. (1986) Hybrid switching networks on the infinite one dimensional lattice [Russian]. Problems Inf. Transmission 23, 75–86.Google Scholar
[14] Stoyan, D. (1983) Comparison Methods for Queues and Other Stochastic Models. Wiley, Chichester.Google Scholar