Investigation of a fully connected channel switching network with many nodes and alternative routes
From MaRDI portal
Publication:795803
zbMATH Open0542.94041MaRDI QIDQ795803FDOQ795803
Authors: V. V. Marbukh
Publication date: 1983
Published in: Automation and Remote Control (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 4010374
- scientific article; zbMATH DE number 4072095
- Fully connected message-switching network with a large number of nodes, bypass routes, and a limited number of waiting places at nodes
- Dynamic Routing in Fully Connected Networks
- scientific article; zbMATH DE number 4041596
Stochastic network models in operations research (90B15) Control/observation systems governed by ordinary differential equations (93C15) Applications of graph theory to circuits and networks (94C15)
Cited In (7)
- Nonlinear Markov processes in big networks
- Metastability in loss networks with dynamic alternative routing
- Loss circuit switched communication network -- performance analysis and dynamic routing
- A method to evaluate the spatial extensibility of a switching unit and network
- State-dependent routing on symmetric loss networks with trunk reservations. II: Asymptotics, optimal design
- Chaos hypothesis for a system interacting through shared resources
- Propagation of chaos for a fully connected loss network with alternate routing
This page was built for publication: Investigation of a fully connected channel switching network with many nodes and alternative routes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795803)