Sciweavers

Share
CN
2006

Measurement-based optimal routing on overlay architectures for unicast sessions

9 years 2 months ago
Measurement-based optimal routing on overlay architectures for unicast sessions
We propose a measurement-based routing algorithm to load-balance intradomain traffic along multiple paths for multiple unicast sources. Multiple paths are established using overlay nodes. The distributed algorithm is derived from simultaneous perturbation stochastic approximation (SPSA) and does not assume that the gradient of an analytical cost function is known. Instead, we rely on (potentially) noisy estimates from local measurements. Using the analytical model presented in the paper, we first show the almost sure convergence of the algorithm to the optimal solution under a decreasing step size policy (as with a standard SPSA model). Motivated by practical concerns, we next consider the constant step size case, for which we establish weak convergence. We provide simulation results to demonstrate the advantages of our proposed algorithm under various network scenarios, and also present a comparative study with MATE (an existing optimal routing algorithm).
Tuna Güven, Richard J. La, Mark A. Shayman, B
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where CN
Authors Tuna Güven, Richard J. La, Mark A. Shayman, Bobby Bhattacharjee
Comments (0)
books