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

Karwaczyński, Piotr; Konieczny, Dariusz; Močnik, Jaka; Novak, Marko

doi:10.1145/1244002.1244137

Cited by 4 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our protocol could also leverage in previous work [13] which addresses the use of inexpensive oracles for calculating neighbor proximity based on IP-based clustering (for instance, using a match of common IP prefixes to calculate a measure of proximity between two peers).…”

Section: Oraclesmentioning

confidence: 99%

X-BOT: A Protocol for Resilient Optimization of Unstructured Overlays

Leitão¹,

Marques²,

Pereira

et al. 2009

2009 28th IEEE International Symposium on Reliable Distributed Systems

View full text Add to dashboard Cite

Gossip, or epidemic, protocols have emerged as a highly scalable and resilient approach to implement several application level services such as reliable multicast, data aggregation, publish-subscribe, among others. All these protocols organize nodes in an unstructured random overlay network. In many cases, it is interesting to bias the random overlay in order to optimize some efficiency criteria, for instance, to reduce the stretch of the overlay routing. In this paper we propose X-BOT, a new protocol that allows to bias the topology of an unstructured gossip overlay network. X-BOT is completely decentralized and, unlike previous approaches, preserves several key properties of the original (non-biased) overlay (most notably, the node degree and consequently, the overlay connectivity). Experimental results show that X-BOT can generate more efficient overlays than previous approaches.

show abstract

Section: Oraclesmentioning

confidence: 99%

X-BOT: A Protocol for Resilient Optimization of Unstructured Overlays

Leitão¹,

Marques²,

Pereira

et al. 2009

2009 28th IEEE International Symposium on Reliable Distributed Systems

View full text Add to dashboard Cite

show abstract

“…In previous research on neighbour selection, peers have utilised geographical proximity to select neighbours that terminate low-latency, reliable connections [13]. By further considering network-wide topology, it has been shown to be possible to improve p2p network performance by providing suitable correlation between logical connections and the overlay network [25,7].…”

Section: Related Workmentioning

confidence: 99%

di-jest: Autonomic neighbour management for worm resilience in p2p systems

McIlwraith

Paquier

Kotsovinos

2008

2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks

View full text Add to dashboard Cite

Internet worms pose a serious and ongoing threat to system security, often resulting in significant service downtime and disruption. In recent years peer-to-peer (p2p) networks have become a target for the deployment of worms as their high connectivity allows for rapid dissemination and homogeneity of the adopted software platform ensures the existence of common susceptibilities.In this paper we observe that peer similarity in p2p networks can greatly increase overall vulnerability; peers with largely different system characteristics are unlikely to be infected by the same worm. With this in mind we present dijest -an autonomic method for neighbour selection based on heterogeneity. Our results show the efficacy of di-jest in reducing the spread rate and potency of p2p worms. By selecting neighbours with different system characteristics dijest can reduce the number of peers infected by a worm by up to 80%.

show abstract