Dual proximity neighbour selection method for peer-to-peer-based discovery service
Piotr Karwaczyński, Dariusz Konieczny, Jaka Močnik, Marko Novak · 2007
In this paper, we propose a new, dual method for self-optimization 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.