Measurement Based Optimal Multi-path Routing
dc.contributor.author | Guven, Tuna | en_US |
dc.contributor.author | Kommareddy, Chris | en_US |
dc.contributor.author | La, Richard J. | en_US |
dc.contributor.author | Shayman, Mark A. | en_US |
dc.contributor.author | Bhattacharjee, Bobby | en_US |
dc.date.accessioned | 2004-05-31T23:30:04Z | |
dc.date.available | 2004-05-31T23:30:04Z | |
dc.date.created | 2003-07 | en_US |
dc.date.issued | 2003-08-01 | en_US |
dc.description.abstract | 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 multi-path 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. (UMIACS-TR-2003-69) | en_US |
dc.format.extent | 241585 bytes | |
dc.format.mimetype | application/pdf | |
dc.identifier.uri | http://hdl.handle.net/1903/1294 | |
dc.language.iso | en_US | |
dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
dc.relation.ispartofseries | UM Computer Science Department; CS-TR-4500 | en_US |
dc.relation.ispartofseries | UMIACS; UMIACS-TR-2003-69 | en_US |
dc.title | Measurement Based Optimal Multi-path Routing | en_US |
dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1