Bandwidth-Aware Routing in Overlay Networks Export

@inproceedings{citeulike:3451133, abstract = {In the absence of end-to-end quality of service (QoS), overlay routing has been used as an alternative to the default best effort Internet routing. Using end-to-end network measurement, the problematic parts of the path can be bypassed, resulting in improving the resiliency and robustness to failures. Studies have shown that overlay paths can give better latency, loss rate, and TCP throughput. Overlay routing also offers flexibility as different routes can be used based on application needs. There have been very few proposals of using bandwidth as the main metric of interest, which is of great concern in media applications. We introduce our scheme BARON (Bandwidth-Aware Routing in Overlay Networks) that utilizes capacity between the end hosts to identify viable overlay paths and measures available bandwidth to select the best route. We propose our path selection approaches, and using the measurements between 174 PlanetLab nodes and over 13,189 paths, we evaluate the usefulness of overlay routes in terms of bandwidth gain. Our results show that among 658,526 overlay paths, 25\% have larger bandwidth than their native IP routes, and over 86\% of (source, destination) pairs have at least one overlay route with larger bandwidth than the default IP routes. We also present the effectiveness of BARON in preserving the bandwidth requirement over time for a few selected Internet paths.}, author = {Lee, Sung-Ju and Banerjee, S. and Sharma, P. and Yalagandula, P. and Basu, S.}, booktitle = {INFOCOM 2008. The 27th Conference on Computer Communications. IEEE}, citeulike-article-id = {3451133}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/INFOCOM.2008.235}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4509830}, doi = {10.1109/INFOCOM.2008.235}, journal = {INFOCOM 2008. The 27th Conference on Computer Communications. IEEE}, keywords = {aware, bandwidth, networks, overlay, routing}, pages = {1732--1740}, posted-at = {2008-10-26 07:24:23}, priority = {0}, title = {Bandwidth-Aware Routing in Overlay Networks}, url = {http://dx.doi.org/10.1109/INFOCOM.2008.235}, year = {2008} }

TY - CONF ID - citeulike:3451133 L3 - citeulike-article-id:3451133 N2 - In the absence of end-to-end quality of service (QoS), overlay routing has been used as an alternative to the default best effort Internet routing. Using end-to-end network measurement, the problematic parts of the path can be bypassed, resulting in improving the resiliency and robustness to failures. Studies have shown that overlay paths can give better latency, loss rate, and TCP throughput. Overlay routing also offers flexibility as different routes can be used based on application needs. There have been very few proposals of using bandwidth as the main metric of interest, which is of great concern in media applications. We introduce our scheme BARON (Bandwidth-Aware Routing in Overlay Networks) that utilizes capacity between the end hosts to identify viable overlay paths and measures available bandwidth to select the best route. We propose our path selection approaches, and using the measurements between 174 PlanetLab nodes and over 13,189 paths, we evaluate the usefulness of overlay routes in terms of bandwidth gain. Our results show that among 658,526 overlay paths, 25% have larger bandwidth than their native IP routes, and over 86% of (source, destination) pairs have at least one overlay route with larger bandwidth than the default IP routes. We also present the effectiveness of BARON in preserving the bandwidth requirement over time for a few selected Internet paths. JF - INFOCOM 2008. The 27th Conference on Computer Communications. IEEE EP - 1740 TI - Bandwidth-Aware Routing in Overlay Networks T2 - INFOCOM 2008. The 27th Conference on Computer Communications. IEEE SP - 1732 KW - aware KW - bandwidth KW - networks KW - overlay KW - routing AU - Lee, Sung-Ju AU - Banerjee, S AU - Sharma, P AU - Yalagandula, P AU - Basu, S PY - 2008/// UR - http://dx.doi.org/10.1109/INFOCOM.2008.235 ER -