HIERAS: A DHT‐Based Hierarchical P2P Routing Algorithm

Xu, Zhiyong; Hu, Y.; Bhuyan, Laxmi N.

doi:10.1002/0471732710.ch31

Cited by 44 publications

(63 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…RELATED WORK The application of multi-level structures on DHTs has attracted the attention of many researchers who attempted to combine the scalability characteristics of both hierarchical designs and DHTs, so as to further improve overlay routing performance and/or achieve administrative autonomy. In the HIERAS [36] and Coral [37] schemes, overlay nodes 8 Similar results where derived for different time-out and failure rate values.…”

Section: ) Impact Of Churnsupporting

confidence: 67%

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 Churnsupporting

confidence: 67%

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

“…The concept of P2P has been defined in multiple different ways in the literature, for example by Androutsellis-Theotokis & Spinellis (2004), Xu et al (2003), Halepovic & Deters (2003) and Sakaryan & Unger (2004). In Koskela et al (2013), we have provided the following definition, which is based on the common properties of the different definitions found in the literature:…”

Section: P2p Networkingmentioning

confidence: 99%

Energy-efficient peer-to-peer networking for constrained-capacity mobile environments

Harjula

Ojala

Ylianttila

2017

2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM)

View full text Add to dashboard Cite

Energy efficiency is a powerful measure for promoting sustainability in technological evolution and ensuring feasible battery life of end-user devices in mobile computing. Peer-to-peer technology provides decentralized and self-organizing architecture for distributing content between devices in networks that scale up almost infinitely. However, peer-to-peer networking may require lots of resources from peer nodes, which in turn may lead to increased energy consumption on mobile devices. For this reason, peer-to-peer networking has so far been considered unfeasible for mobile environment.This thesis makes several contributions towards enabling energy-aware peer-to-peer networking in mobile environments. First, an empirical study is conducted to understand the energy consumption characteristics of radio interfaces and typical composition of traffic in structured peer-to-peer networks. This is done in order to identify the most essential obstacles for utilizing peer-to-peer technology in mobile environments. Second, the e-Aware model for estimating the energy consumption of a mobile device is developed and empirically verified to achieve 3-21% error in comparison to real-life measurements. Third, the e-Mon model for the energy-aware load monitoring of peer nodes is developed and demonstrated to improve the battery life of mobile peer nodes up to 470%. Fourth, the ADHT concept of mobile agent based virtual peers is proposed for sharing the peer responsibilities between peer nodes in a subnet so that they can participate in a peer-to-peer overlay without compromising their battery life.The results give valuable insight into implementing energy-efficient peer-to-peer systems in mobile environments. The e-Aware energy consumption model accelerates the development of energy-efficient networking solutions by reducing the need for time-consuming iterations between system development and evaluations with real-life networks and devices. The e-Mon load monitoring model facilitates the participation of battery-powered devices in peer-to-peer and other distributed networks by enabling energy-aware load balancing where energy-critical mobile nodes carry less load than other nodes. The ADHT facilitates the participation of constrained-capacity wireless devices, such as machine-to-machine nodes, in a peer-to-peer network by allowing them to sleep for most of their time.Keywords: battery life, constrained-capacity devices, energy-efficiency, green computing, internet of things, machine-to-machine networks, mobile networks, peer-topeer networks Harjula, Erkki, Energiatehokkaat vertaisverkkoratkaisut rajoitetun kapasiteetin mobiiliympäristöissä.Oulun yliopiston tutkijakoulu; Oulun yliopisto, Tieto-ja sähkötekniikan tiedekunta; Centre for Wireless Communications; Infotech Oulu Acta Univ. Oul. C 573, 2016 Oulun yliopisto, PL 8000, 90014 Oulun yliopisto TiivistelmäEnergiatehokkuus on kustannustehokas tapa vähentää päätelaitteiden käytön aiheuttamia kasvihuonepäästöjä sekä parantaa niiden akunkestoa. Vertaisverkkoteknologia ta...

show abstract

“…departments within a university) or peer capabilities ("have" or "have not"). Systems with group structures such as Canon [9], Hieras [23], and Cyclone [2] use routing protocols which tend to route lookups as far as possible within one group before forwarding them on to a different group. While resource availability levels could be used to define groups, current approaches pose several problems: lookup routing would have to start in the (sparse) highest layers in order to relieve weaker nodes from routing responsibilities, thus compromising scalability; low level nodes would primarily maintain links within their group, i.e.…”

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

HIERAS: A DHT‐Based Hierarchical P2P Routing Algorithm

Cited by 44 publications

References 0 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

Energy-efficient peer-to-peer networking for constrained-capacity mobile environments

Combining Resource and Location Awareness in DHTs

Contact Info

Product

Resources

About