Measurement-based optimal routing on overlay architectures for unicast sessions

Authors:
Tuna Güven;Richard J. La;Mark A. Shayman;Bobby Bhattacharjee
Affiliations:
Department of Electrical and Computer Engineering, University of Maryland, College Park, MD;Department of Electrical and Computer Engineering, University of Maryland, College Park, MD;Department of Electrical and Computer Engineering, University of Maryland, College Park, MD;Department of Computer Science, University of Maryland, College Park, MD
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Network modelling and simulation
Year:
2006

Citing 9
Cited 1

Data networks

Data networks
Constrained optimization via stochastic approximation with a simultaneous perturbation gradient approximation

Automatica (Journal of IFAC)
Quality of service based routing: a performance perspective

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
On Approximate Computer System Models

Journal of the ACM (JACM)
Stochastic optimization and the simultaneous perturbation method

Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 1
Resilient overlay networks

SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
MATE: multipath adaptive traffic engineering

Computer Networks: The International Journal of Computer and Telecommunications Networking
On path selection for traffic with bandwidth guarantees

ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
A localized adaptive proportioning approach to QoS routing

IEEE Communications Magazine

On the interaction of multiple overlay routing

Performance Evaluation - Performance 2005

Quantified Score

Hi-index	0.00

Visualization

Abstract

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