Fully connected message-switching network with a large number of nodes, bypass routes, and a limited number of waiting places at nodes

zbMATH Open0584.90024MaRDI QIDQ1069844FDOQ1069844

Authors: V. V. Marbukh 

Publication date: 1985

Published in: Problems of Information Transmission (Search for Journal in Brave)

Recommendations

• 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

zbMATH Keywords

phase transitionbypass routesfully connected message-switching networklimited number of waiting places

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Cited In (3)

• Investigation of a fully connected channel switching network with many nodes and alternative routes
• Loss circuit switched communication network -- performance analysis and dynamic routing
• Mathematical theory of queueing networks

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)