Fully connected message-switching network with a large number of nodes, bypass routes, and a limited number of waiting places at nodes
The author obtains the asymptotic values as \(N\to \infty\) of some characteristics of a fully connected message-switching network with N nodes, bypass routes, and a limited number of waiting places at nodes. It is shown that there is a phase transition of the first kind in the network as \(N\to \infty\). The interrelationship between the phase transition and purposeful load-limiting discipline as \(N\to \infty\) is considered. The results are obtained under the assumption that as \(N\to \infty\) the queues at the nodes are statistically independent and can be approximated by queues in \(M| M| 1\) queuing systems with a limited number of waiting places and with intensities of the incoming flows determined from the self-consistency conditions.
- A mean-field limit for a class of queueing networks
- On a class of packet-switching networks on an infinite graph
- Asymptotic analysis of telegraphic message switching systems
- Poisson limit theorem for message switching networks with low transit traffic
- A Poisson limit theorem for hybrid star networks: The mean field approximation
This page was built for publication: Fully connected message-switching network with a large number of nodes, bypass routes, and a limited number of waiting places at nodes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069844)
