Shadow prices for LLR and ALBA

Author

Vargas, Cesar ; Hegde, Manjunath V. ; Naraghi-Pour, Morteza ; Min, Paul S.

Author_Institution

Centro de Electronica y Telecommunicaciones, Monterrey, Mexico

Volume

4

Issue

5

fYear

1996

fDate

10/1/1996 12:00:00 AM

Firstpage

796

Lastpage

807

Abstract

Shadow prices are calculated for least loaded routing (LLR) and aggregated least busy alternative (ALBA) routing in circuit-switched networks for the blocking probability obtained from fixed point algorithms. Numerical results are presented for the calculation of these shadow prices in small networks. As an application of these shadow prices, we also formulate a constrained optimization problem to calculate the sum capacity of LLR and ALBA for a given network. Comparison of the sum capacities indicate that the optimization using shadow prices results in a significant improvement. This provides evidence that matching capacity distribution to traffic is important even when adaptive routing schemes such as LLR and ALBA are used in the network. We also calculate upper bounds on the sum capacity which serve to indicate how well the optimized LLR and ALBA perform. The numerical results also confirm that with a small number of states the capacity of ALBA approaches that of LLR

Keywords

circuit switching; optimisation; probability; telecommunication network routing; telecommunication traffic; ALBA; LLR; adaptive routing; aggregated least busy alternative routing; blocking probability; capacity distribution; circuit-switched networks; constrained optimization problem; fixed point algorithms; least loaded routing; shadow prices; sum capacity; traffic; Constraint optimization; Intelligent networks; Network topology; Pricing; Probability; Routing; Switches; Switching circuits; Telecommunication traffic; Upper bound;

fLanguage

English

Journal_Title

Networking, IEEE/ACM Transactions on

Publisher

ieee

ISSN

1063-6692

Type

jour

DOI

10.1109/90.541327

Filename

541327