Shadow prices for modified least loaded routing (MLLR)

Abstract

Presents modified least loaded routing (MLLR), a routing policy where no preference is given to the direct single link path but rather the first choice path is chosen statistically based on the results of an optimization problem. The authors calculate shadow prices for MLLR using the blocking probability obtained from a fixed point performance evaluation algorithm. Numerical results comparing performance of LLR and MLLR in, terms of blocking probability are introduced. As an application, the authors formulate and solve a nonlinear constrained optimization problem to calculate the load sharing coefficients that result in a maximum network rate of return for fixed levels of OD pair blocking probabilities.