Routing in circuit-switched networks: optimization, shadow prices and decentralization
- 1 March 1988
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 20 (1), 112-144
- https://doi.org/10.2307/1427273
Abstract
How should calls be routed or capacity allocated in a circuit-switched communication network so as to optimize the performance of the network? This paper consid...Keywords
This publication has 19 references indexed in Scilit:
- One-Dimensional Circuit-Switched NetworksThe Annals of Probability, 1987
- Quasi-stationary distributions and one-dimensional circuit-switched networksJournal of Applied Probability, 1987
- Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blockingAdvances in Applied Probability, 1987
- Blocking probabilities in large circuit-switched networksAdvances in Applied Probability, 1986
- Convergence and finite-time behavior of simulated annealingAdvances in Applied Probability, 1986
- The use of learning algorithms in telephone traffic routing—A methodologyAutomatica, 1983
- The Distribution of Queuing Network States at Input and Output InstantsJournal of the ACM, 1981
- Asynchronous Iterative Methods for MultiprocessorsJournal of the ACM, 1978
- A Minimum Delay Routing Algorithm Using Distributed ComputationIEEE Transactions on Communications, 1977
- Application of Learning Automata to Telephone Traffic Routing and ControlIEEE Transactions on Systems, Man, and Cybernetics, 1977