Hostname: page-component-5447f9dfdb-2bw5x Total loading time: 0 Render date: 2025-07-29T09:06:56.243Z Has data issue: false hasContentIssue false
  • English
  • Français

Circuit-switching networks with priorities on a one-dimensional lattice

Published online by Cambridge University Press:  14 July 2016

Rahim Shamsiev
Rahim Shamsiev*
Affiliation:
USSR Academy of Sciences
*
∗ Postal address: Institute for Problems of Information Transmission, USSR Academy of Sciences, 19, Yermolova Str., GSP-4 Moscow 101447 USSR.
Get access Rights & Permissions [Opens in a new window]

Abstract

We prove existence and uniqueness of a stationary regime for a model of a circuit-switching network with infinitely many nodes.

Keywords

EXISTENCE AND UNIQUENESS OF A STATIONARY REGIMEMAJORIZING FAMILY OF RANDOM MARKED POINT PROCESSES

Information

Type
Short Communications
Information
Journal of Applied Probability , Volume 26 , Issue 4 , December 1989 , pp. 901 - 905
Copyright
Copyright © Applied Probability Trust 1989 

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.)

Article purchase

Temporarily unavailable

References

[1] Berezner, S. A. and Malyshev, V. A. (1989) The stability of infinite-server networks with random routing. J. Appl. Prob. 26, 363–371.Google Scholar
[2] Kelbert, M. Ya., Kopeika, R. P., Shamsiev, R. N. and Suhov, Yu. M. (1987) On a class of hybrid switching networks with small transit flows. Preprint 269/87, Research Center BiBoS, Universitat Bielefeld, BRD.Google Scholar
[3] Kelbert, M. Ya., Kopeika, R. P., Shamsiev, R. N. and Suhov, Yu. M. (1990) Perturbation theory approach for a class of hybrid switching networks with small transit flows. Adv. Appl. Prob. 22(1).Google Scholar