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

zbMath0584.90024MaRDI QIDQ1069844

V. V. Marbukh

Publication date: 1985

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (2)

Mathematical theory of queueing networks ⋮ Loss circuit switched communication network -- performance analysis and dynamic routing

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