Dual proximity neighbour selection method for peer-to-peer-based discovery service

Authors:
Piotr Karwaczyński;Dariusz Konieczny;Jaka Moçnik;Marko Novak
Affiliations:
Wroclaw University of Technology, Wroclaw, Poland;Wroclaw University of Technology, Wroclaw, Poland;XLab d.o.o., Ljubljana, Slovenia;XLab d.o.o., Ljubljana, Slovenia
Venue:
Proceedings of the 2007 ACM symposium on Applied computing
Year:
2007

Citing 5
Cited 0

Mapping the Gnutella Network

IEEE Internet Computing
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Improving lookup latency in distributed hash table systems using random sampling

IEEE/ACM Transactions on Networking (TON)
Tapestry: a resilient global-scale overlay for service deployment

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.