Title
Shadow prices for modified least loaded routing (MLLR)
Document Type
Conference Proceeding
Publication Date
1-1-1996
Abstract
We present 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. We 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, we formulate and solve a nonlinear constrained optimization problem to calculate the load sharing coefficients that result in a maximum networks rate of return for fixed levels of OD pair blocking probabilities.
Publication Source (Journal or Book title)
Proceedings of the Annual Southeastern Symposium on System Theory
First Page
45
Last Page
49
Recommended Citation
Vargas, C., Hegde, M., & Naraghi-Pour, M. (1996). Shadow prices for modified least loaded routing (MLLR). Proceedings of the Annual Southeastern Symposium on System Theory, 45-49. Retrieved from https://repository.lsu.edu/eecs_pubs/1080