doi: 10.4304/jsw.2.2.30-37
IP-based Clustering for Peer-to-Peer Overlays
- 1 Institute of Applied Informatics, Wrocław Univ. of Technology, 50-370 Wrocław, Poland
- 2 XLab d.o.o., Teslova 30, SI-1000 Ljubljana, Slovenia
Abstract
The efficiency of overlay networks built on top ofthe IP network is often threatened by the mismatch betweenthe topologies of the overlay and the underlying IP network,resulting in unnecessary traffic and increased latencies.Substantial improvement can be achieved by optimizing thelogical links between overlay nodes to better match the IPnetwork topology.In this paper, we propose a new method for selfoptimizationof a DHT-based peer-to-peer overlay. Ourmethod has no need for active measurement of inter-nodelatencies, thus minimizing network traffic costs of node insertionand topology maintenance. We verify our method bymeans of analysis of large data sets of latency measurementsbetween arbitrary nodes on the Internet, proving correlationamong common IP prefix length of communicating nodesand latency.
Keywords
- peer-to-peer
- overlay network
- topology
How to Cite
Piotr Karwaczy´nski and Jaka Moˇcnik, "IP-based Clustering for Peer-to-Peer Overlays," Journal of Software, vol. 2, no. 2, pp. 30-37, 2007. https://doi.org/ 10.4304/jsw.2.2.30-37
Copyright & License
Copyright © 2007 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).