On a class of packet-switching networks on an infinite graph |
| |
Authors: | M Ya Kelbert Yu M Suhov |
| |
Institution: | (1) Institute for Problems of Information Transmission, USSR Academy of Sciences, 19 Yermolova str., GSP 4, 101447 Moscow, USSR;(2) CPT CNRS and UER Luminy, Case 907, F-13288 Marseille Cedex 9, France |
| |
Abstract: | A class of open queueing networks with packet switching is discussed. The configuration graph of the network may be finite
or infinite. The external messages are divided into standard pieces (packets) each of which is transmitted as a single message.
The messages are addressed, as a rule, to nearest neighbours and thereby the network may be treated as a small perturbation
of the collection of isolated servers.
The switching rule adopted admits overtaking: packets which appeared later may reach the delivery node earlier. The transmission
of a message is completed when its last packet reaches the destination node.
The main result of this paper is that the network possesses a unique stationary working regime. Weak dependence properties
of this regime are established as well as the continuity with respect to the parameters of the external message flows. |
| |
Keywords: | Packet-switching networks infinite graph FCFS discipline small perturbation receiving time stochastic network equations stationary solution majorizing families decay of dependence (correlations) |
本文献已被 SpringerLink 等数据库收录! |
|