Peer-to-peer (P2P) systems are often constructed in overlay networks at the application layer without taking the physical network topologies into consideration. The mismatch between physical topologies and logical overlays can cause a large volume of redundant traffic and considerable performance degradation of the P2P systems. In order to alleviate this mismatching problem, we propose an algorithm that iteratively reshapes the topology of an overlay. The algorithm is fully decentralized and only relies on local information available at each node. Also, the algorithm preserves the total number of links during the process of iterative modifications, thus maintaining the resiliency to failures. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Ikeda, S., Tsuchiya, T., & Kikuno, T. (2006). A decentralized scheme for network-aware reliable overlay construction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3961 LNCS, pp. 955–964). Springer Verlag. https://doi.org/10.1007/11919568_95
Mendeley helps you to discover research relevant for your work.