In this paper, we propose a new, dual method for selfoptimization of a pervasive, DHT-based discovery service. This method addresses the topology mismatch problem. On one hand, it selects close neighbours based on static, readily available information (the IP addresses of the nodes) and thus does not require costly periodic probing of many nodes. On the other hand, it enables the overlay network to optimize its topology in run-time in a cost-effective manner. We prove the effectiveness of our method by statistical and experimental verification.
The efficiency of overlay networks built on top of the IP network is often threatened by the mismatch between the topologies of the overlay and the underlying IP network, resulting in unnecessary traffic and increased latencies. Substantial improvement can be achieved by optimizing the logical links between overlay nodes to better match the IP network topology. In this paper, we propose a new method for selfoptimization of a DHT-based peer-to-peer overlay. Our method has no need for active measurement of inter-node latencies, thus minimizing network traffic costs of node insertion and topology maintenance. We verify our method by means of analysis of large data sets of latency measurements between arbitrary nodes on the Internet, proving correlation among common IP prefix length of communicating nodes and latency.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.