Light-Weight Overlay Path Selection in a Peer-to-Peer Environment Export

@inproceedings{citeulike:4254887, abstract = {Large-scale peer-to-peer systems span a wide range of Internet locations. Such diversity can be leveraged to build overlay "detours" to circumvent periods of poor performance on the default path. However, identifying which peers are "good" relay choices in support of such detours is challenging, if one is to avoid incurring an overhead that grows with the size of the peer- to-peer system. This paper proposes and investigates the Earliest Branching Rule (EBR) to perform such a selection. EBR builds on the Earliest Diverging Rule (EDR) that selects relay nodes whose AS path diverges from the default path at the earliest possible point, but calls for monitoring a much smaller number of paths. As a result, it has a much lower overhead. The paper explores the performance and overhead of EBR, and compares them to that of EDR. The results demonstrate that EBR succeeds in selecting good relay nodes with minimum control overhead. Hence, providing a practical solution for dynamically building good overlays in large peer-to-peer systems.}, author = {Fei, Teng and Tao, Shu and Gao, Lixin and Guerin, R. and Zhang, Zhi-Li}, booktitle = {INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings}, citeulike-article-id = {4254887}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/INFOCOM.2006.48}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4146701}, doi = {10.1109/INFOCOM.2006.48}, journal = {INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings}, keywords = {overlay, path, selection}, pages = {1--6}, posted-at = {2009-04-02 04:38:28}, priority = {0}, title = {Light-Weight Overlay Path Selection in a Peer-to-Peer Environment}, url = {http://dx.doi.org/10.1109/INFOCOM.2006.48}, year = {2006} }

TY - CONF ID - citeulike:4254887 L3 - citeulike-article-id:4254887 N2 - Large-scale peer-to-peer systems span a wide range of Internet locations. Such diversity can be leveraged to build overlay "detours" to circumvent periods of poor performance on the default path. However, identifying which peers are "good" relay choices in support of such detours is challenging, if one is to avoid incurring an overhead that grows with the size of the peer- to-peer system. This paper proposes and investigates the Earliest Branching Rule (EBR) to perform such a selection. EBR builds on the Earliest Diverging Rule (EDR) that selects relay nodes whose AS path diverges from the default path at the earliest possible point, but calls for monitoring a much smaller number of paths. As a result, it has a much lower overhead. The paper explores the performance and overhead of EBR, and compares them to that of EDR. The results demonstrate that EBR succeeds in selecting good relay nodes with minimum control overhead. Hence, providing a practical solution for dynamically building good overlays in large peer-to-peer systems. JF - INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings EP - 6 TI - Light-Weight Overlay Path Selection in a Peer-to-Peer Environment T2 - INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings SP - 1 KW - overlay KW - path KW - selection AU - Fei, Teng AU - Tao, Shu AU - Gao, Lixin AU - Guerin, R AU - Zhang, Zhi-Li PY - 2006/// UR - http://dx.doi.org/10.1109/INFOCOM.2006.48 ER -