Build One, Get One Free: Leveraging the Coexistence of Multiple P2P Overlay Networks

Maniymaran, Balasubramaneyam; Bertier, Marin; Kermarrec, Anne-Marie

doi:10.1109/icdcs.2007.88

Cited by 23 publications

(25 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Proximity-awareness in DHTs is generally classified as proximity-aware identifier selection (PIS, such as Mithos [31] and SAT-Match [26]), proximity-aware neighbor selection (PNS, such as DHash++ [9]), proximity-aware route selection (PRS, such as Tapestry [35]), or a combination thereof and is primarily directed at reducing overall traffic or average round trip times [16]. Proximity-awareness has gained interest in many areas related to DHTs, including caching and replication protocols and hybrid overlays [10,20].…”

Section: Related Workmentioning

confidence: 99%

A hierarchical approach to resource awareness in DHTs for mobile data management

Ribe-Baumann

Sattler

2014

Pervasive and Mobile Computing

View full text Add to dashboard Cite

Data is increasingly distributed across networks of mobile nodes such as wireless sensor networks, distributed smartphone applications, or ad hoc recovery networks in disaster scenarios, but must still be reliably collected, stored, and retrieved. While such networks run in either ad hoc mode or use existing infrastructure, all of them must deal with node heterogeneity. Wireless nodes invariably have differing levels of power availability, and often varying connectivity and computing power. While many distributed hash tables (DHTs) have been designed for mobile ad hoc or heterogeneous networks, they do not consider differences in node strength, or resource availability, for an arbitrary number of resource availability levels. In this paper, we present a scalable, location aware, hierarchical DHT that utilizes nodes' varying resource availability levels to increase and prolong the mobile network's data storage and retrieval capabilities. Furthermore, we compare this DHT to other location aware flat and hierarchical approaches, examining their structures' suitability for nodes with varying resource availability.

show abstract

Section: Related Workmentioning

confidence: 99%

A hierarchical approach to resource awareness in DHTs for mobile data management

Ribe-Baumann

Sattler

2014

Pervasive and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…Finally, [12] studies the co-existence of multiple overlay networks, namely Pastry and an unstructured overlay that uses a gossip protocol to improve its performance.…”

Section: Related Workmentioning

confidence: 99%

Interconnection of Large Scale Unstructured P2P Networks: Modeling and Analysis

Ciancaglini

Gaeta

Loti

et al. 2013

Analytical and Stochastic Modeling Techniques and Applications

View full text Add to dashboard Cite

Abstract. Interconnection of multiple P2P networks has emerged as a viable solution to increase system reliability and fault-tolerance as well as to increase resource availability. In this paper we consider interconnection of large scale unstructured P2P networks by means of special nodes (called Synapses) that are co-located in more than one overlay. Synapses act as trait d'union by forwarding a query to all the P2P networks they belong to. Modeling and analysis of the resulting interconnected system is crucial to design e cient and e↵ective search algorithms and to control the cost of interconnection. To this end, we develop a generalized random graph based model that is validated against simulations and it is used to investigate the performance of search algorithms for di↵erent interconnection costs and to provide some insight in the characteristics of the interconnection of a large number of P2P networks.

show abstract

“…Proximity-awareness has begun to permeate areas related to DHTs, including caching and replication protocols and hybrid overlays [7,16], as well as DHTs' original designs. Location awareness is integrated into DHTs using a combination of proximity-aware identifier selection (PIS, such as Mithos [22] and SAT-Match [19]), proximity-aware neighbor selection (PNS, such as DHash++ [6]), and proximity-aware route selection (PRS, such as Tapestry [24]), and has generally been directed at reducing overall traffic or average round trip times [12].…”

Section: Related Workmentioning

confidence: 99%

Combining Resource and Location Awareness in DHTs

Ribe-Baumann

2011

On the Move to Meaningful Internet Systems: OTM 2011

View full text Add to dashboard Cite

Abstract. Distributed hash tables are designed to provide reliable distributed data management, but present challenges for networks in which nodes have varying characteristics such as battery or computing power. Assuming that nodes are aware of their resource availability and relative network positions, this paper presents a novel distributed hash table protocol which uses nodes' resource levels to remove load from weak nodes, whose overuse may cause delays or failure, while using nodes' positions to reduce cross-network traffic, which may cause unwanted network load and delays. This protocol provides nodes with links that are physically near with high resource availability, and simultaneously provides scalability and an O(log(N )) routing complexity with N network nodes. Theoretical analysis and simulated evaluation show significant decreases in the routing and maintenance overhead for weak nodes, the physical distances that lookups traverse, and unwanted node failures, as well as an increase node lifetime.

show abstract

Build One, Get One Free: Leveraging the Coexistence of Multiple P2P Overlay Networks

Cited by 23 publications

References 7 publications

A hierarchical approach to resource awareness in DHTs for mobile data management

A hierarchical approach to resource awareness in DHTs for mobile data management

Interconnection of Large Scale Unstructured P2P Networks: Modeling and Analysis

Combining Resource and Location Awareness in DHTs

Contact Info

Product

Resources

About