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 considers the question, using a simplified analytical model of a circuit-switched network. We show that there exist implicit shadow prices associated with each route and with each link of the network, and that the equations defining these prices have a local or decentralized character. We illustrate how these results can be used as the basis for a decentralized adaptive routing scheme, responsive to changes in the demands placed on the network.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Statistics and Probability
Reference40 articles.
1. Nakagome Y. and Mori H. (1973) Flexible routing in the global communication network. 7th Int. Teletraffic Cong.
2. A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius
3. Louth G. M. (1986) Phase transition in a circuit-switched network.
4. Analysis of circuit-switched networks employing originating-office control with spill-forward. IEEE trans;Lin;Comm.,1978
5. Stochastic models of computer communication systems;Kelly;J. R. Statist. Soc.,1985
Cited by
146 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献