Measurement Based Optimal Multi-path Routing

dc.contributor.authorGuven, Tunaen_US
dc.contributor.authorKommareddy, Chrisen_US
dc.contributor.authorLa, Richard J.en_US
dc.contributor.authorShayman, Mark A.en_US
dc.contributor.authorBhattacharjee, Bobbyen_US
dc.date.accessioned2004-05-31T23:30:04Z
dc.date.available2004-05-31T23:30:04Z
dc.date.created2003-07en_US
dc.date.issued2003-08-01en_US
dc.description.abstractWe 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.extent241585 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/1294
dc.language.isoen_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-4500en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-2003-69en_US
dc.titleMeasurement Based Optimal Multi-path Routingen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
CS-TR-4500.pdf
Size:
235.92 KB
Format:
Adobe Portable Document Format