Shadow prices for LLR and ALBA

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 network...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking 1996-10, Vol.4 (5), p.796-807
Main Authors: Vargas, C., Hegde, M.V., Naraghi-Pour, M., Min, P.S.
Format: Article
Language:English
Subjects:
Applied sciences
Constraint optimization
Exact sciences and technology
Intelligent networks
Network topology
Pricing
Probability
Routing
Switches
Switching and signalling
Switching circuits
Systems, networks and services of telecommunications
Telecommunication traffic
Telecommunications
Telecommunications and information theory
Upper bound
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1063-6692
1558-2566
DOI:10.1109/90.541327