Hierarchical Peer-to-Peer Systems

Garcés-Erice, Luis; Biersack, Ernst W.; Felber, Pascal; Ross, Keith W.; Urvoy-Keller, Guillaume

doi:10.1007/978-3-540-45209-6_166

Cited by 90 publications

(80 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This issue is also addressed by an alternative approach, in which the multilevel structure is achieved based on the existence of superpeers i.e., nodes responsible for the communication between disjoint clusters of nodes [38], [39]. However, this approach poses significant capacity and availability requirements for the superpeers and heavily affects the load balancing character of DHTs.…”

Section: ) Impact Of Churnmentioning

confidence: 99%

H-Pastry: An inter-domain topology aware overlay for the support of name-resolution services in the future Internet

Fotiou

Κατσαρός

Xylomenos

et al. 2015

Computer Communications

View full text Add to dashboard Cite

Abstract-Overlay networks are widely used for locating and disseminating information by means of custom routing and forwarding on top of an underlying network. Distributed Hash Table (DHT) based overlays in particular, provide good scalability and load balancing properties. However, these come at the cost of inefficient routing, caused by the lack of adaptation to the underlying network, as DHTs often overlook physical network proximity, administrative boundaries and/or inter-domain routing policies. In this paper we show how to construct a DHT-based overlay network that takes all these aspects into account, so as to ease the global deployment of Future Internet architectures which require large-scale name resolution, such as Information-Centric Networking (ICN) and the Internet of Things (IoT). Based on the Pastry distributed object location and routing substrate and the Canon paradigm for multi-level DHTs, we developed H-Pastry, an overlay DHT scheme that harvests the scalability and load balancing features of DHTs, while also adapting to the underlying network topology, administrative structure and routing policies. We evaluate the performance characteristics of the proposed scheme through an extensive set of detailed simulations over realistic inter-network topologies. Our results show that HPastry substantially improves routing by reducing both overlay path stretch (by up to 55%) and routing policy violations (by up to 70%), compared to the Canonical (multi-level) Chord DHT. In addition, the design of H-Pastry keeps traffic within administrative boundaries as far as possible, reducing interdomain hops by up to 27% compared to Pastry, while also creating excellent opportunities for the support of caching and multicast.

show abstract

Section: ) Impact Of Churnmentioning

confidence: 99%

H-Pastry: An inter-domain topology aware overlay for the support of name-resolution services in the future Internet

Fotiou

Κατσαρός

Xylomenos

et al. 2015

Computer Communications

View full text Add to dashboard Cite

show abstract

“…resource levels. On the other hand, in hierarchical DHTs based on two-tiered peer capabilities (such as [1,10,25]) where nodes assume the roles of super-peer or leaf-peer, lookups are routed directly from leaf nodes to parent nodes. The parent (or super) nodes are fully responsible for performing lookup routing, completely neglecting the varying nuances of nodes' resource availabilities.…”

Section: Related Workmentioning

confidence: 99%

“…However, these approaches are difficult to adapt to our scenario. Firstly, the structural approaches which are capable of reducing the communication overhead of low resource nodes incorporate only two resource levels: "have" or "have not"(for example [1,10,25]). Secondly, the virtual nodes and node movement approaches, which allocate varying quantities of data to each physical node, actually introduce more maintenance overhead and churn into the network.…”

Section: Introductionmentioning

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

“…Efficient cooperation between heterogeneous overlays has served as an inspiration to a number of research efforts, which include concepts such as cooperation via gateway (in [5,6]), cooperation via super-overlay (in [11,15]), cooperation via hierarchy (in [8,9,16]), merging of overlays (in [6,7,14]), and hybrid overlay systems (in [4,13]). These efforts and concepts have been described and contrasted to our approach in more detail in [17], while here we only mention that we share their common idea of increasing locality in the network, and have the most features in common with the 'cooperation via hierarchy' approach.…”

Section: Introduction and Related Workmentioning

confidence: 99%

An Extension and Cooperation Mechanism for Heterogeneous Overlay Networks

Ciancaglini

Liquori

Hoang

et al. 2012

NETWORKING 2012 Workshops

View full text Add to dashboard Cite

Abstract. In real-world peer-to-peer applications, the scalability of data lookup is heavily affected by network artifacts. A common solution to improve scalability, robustness and security is to increase the local properties of nodes, by clustering them together. This paper presents a framework which allows for the development of distributed applications on top of interconnected overlay network. Here, message routing between overlays is accomplished by using co-located nodes, i.e. nodes belonging to more than one overlay network at the same time. These co-located nodes serve as distributed gateways, enabling the routing of requests across overlays, while keeping overlay maintenance operations local. The protocol has been evaluated via simulations and client deployment, showing that the ability, of reaching the totality of the overlays in a federated configuration can be preserved even with the simplest routing, proving the feasibility of federated overlay configurations.

show abstract

Hierarchical Peer-to-Peer Systems

Cited by 90 publications

References 9 publications

H-Pastry: An inter-domain topology aware overlay for the support of name-resolution services in the future Internet

H-Pastry: An inter-domain topology aware overlay for the support of name-resolution services in the future Internet

Combining Resource and Location Awareness in DHTs

An Extension and Cooperation Mechanism for Heterogeneous Overlay Networks

Contact Info

Product

Resources

About