Routing in circuit-switched networks: optimization, shadow prices and decentralization

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.

[1]  Arne Jensen,et al.  The life and works of A. K. Erlang , 1960 .

[2]  R. A. Acton.  Introduction to Congestion Theory in Telephone Systems , 1961 .

[3]  J. Munkres,et al.  Calculus on Manifolds , 1965 .

[4]  V. E. Benes,et al.  Programming and control problems arising from optimal routing in telephone networks , 1966 .

[5]  H. T. Kung,et al.  Synchronized and asynchronous parallel algorithms for multiprocessors , 1976 .

[6]  Kumpati S. Narendra,et al.  Application of Learning Automata to Telephone Traffic Routing and Control , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[8]  Gérard M. Baudet,et al.  Asynchronous Iterative Methods for Multiprocessors , 1978, JACM.

[9]  P. Lin,et al.  Analysis of Circuit-Switched Networks Employing Originating-Office Control with Spill-Forward , 1978, IEEE Trans. Commun..

[10]  J. Lottin,et al.  A Decentralized Control Scheme for Large Telephone Networks , 1980 .

[11]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .

[12]  Isi Mitrani,et al.  The Distribution of Queuing Network States at Input and Output Instants , 1979, JACM.

[13]  Kumpati S. Narendra,et al.  The use of learning algorithms in telephone traffic routing - A methodology , 1983, Autom..

[14]  W. Whitt,et al.  Blocking when service is required from several facilities simultaneously , 1985, AT&T Technical Journal.

[15]  Frank Kelly,et al.  Stochastic Models of Computer Communication Systems , 1985 .

[16]  Jr. Shaler Stidham.  Optimal control of admission to a queueing system , 1985 .

[17]  L. G. Mason,et al.  Equilibrium flows, routing patterns and algorithms for store- and -forward networks , 1985 .

[18]  Frank Kelly.  Blocking and routing in circuit-switched networks , 1986 .

[19]  D. Mitra,et al.  Convergence and finite-time behavior of simulated annealing , 1986, Advances in Applied Probability.

[20]  F. Kelly.  Blocking probabilities in large circuit-switched networks , 1986, Advances in Applied Probability.

[21]  Debasis Mitra,et al.  A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius , 1986, JACM.

[22]  Alistair I. Mees,et al.  Convergence of an annealing algorithm , 1986, Math. Program..

[23]  D. Mitra.  Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking , 1987, Advances in Applied Probability.

[24]  I. Ziedins.  Quasi-stationary distributions and one-dimensional circuit-switched networks , 1987 .

[25]  F. Kelly.  One-Dimensional Circuit-Switched Networks , 1987 .

[26]  Richard J. Gibbens,et al.  Dynamic Routing in Fully Connected Networks , 1990 .