SHADOW PRICES FOR LLR AND ALBA

Shadow prices are calculated for least loaded routing (LLR) and aggreg ated least busy alternative (ALBA) routing in circuit-switched network s for the blocking probability obtained from fixed point algorithms, N umerical results are presented for the calculation of these shadow pri ces in small networks. As an application of these shadow prices, we al so formulate a constrained optimization problem to calculate the sum c apacity of LLR and ALBA for a given network, Comparison of the sum cap acities indicate that the optimization using shadow prices results in a significant improvement, This provides evidence that matching capaci ty distribution to traffic is important even when adaptive routing sch emes such as LLR and ALBA are used in the network, We also calculate u pper bounds on the sum capacity which serve to indicate how well the o ptimized LLR and ALBA perform, The numerical results also confirm that with a small number of states the capacity of ALBA approaches that of LLR.