%0 Conference Paper
%B INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies
%D 2004
%T Measurement based optimal multi-path routing
%A Guven,T.
%A Kommareddy,C.
%A La,R.J.
%A Shayman,M.A.
%A Bhattacharjee, Bobby
%K algorithm;network
%K approximation;routing
%K IP
%K measurement;network
%K monitoring;optimization;perturbation
%K multipath
%K network;measurement-based
%K networks;Internet;optimisation;routing
%K processes;
%K protocol;IP
%K protocols;stochastic
%K Routing
%K Stochastic
%X We propose a new architecture for efficient network monitoring and measurements in a traditional IP network. This new architecture enables establishment of multiple paths (tunnels) between source-destination pairs without having to modify the underlying routing protocol(s). Based on the proposed architecture we propose a measurement-based multipath routing algorithm derived from simultaneous perturbation stochastic approximation. The proposed algorithm does not assume that the gradient of analytical cost function is known to the algorithm, but rather relies on noisy estimates from measurements. Using the analytical model presented in the paper we prove the convergence of the algorithm to the optimal solution. Simulation results are presented to demonstrate the advantages of the proposed algorithm under a variety of network scenarios. A comparative study with an existing optimal routing algorithm, MATE, is also provided
%B INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies
%V 1
%P 187 - 196
%8 2004/03//
%G eng
%R 10.1109/INFCOM.2004.1354493