Adaptive Load Balancing for DHT Lookups

Bianchi, Silvia; Serbu, Sabina; Felber, Pascal; Kropf, Peter

doi:10.1109/icccn.2006.286311

Cited by 22 publications

(14 citation statements)

References 22 publications

(35 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The service request keys are drawn from this set according to a power-law distribution such that 50% of the requests are for the top 5% of the keys. This constitutes a realistic workload for a large number of P2P applications [6].…”

Section: Discussionmentioning

confidence: 99%

Self-organized Fault-tolerant Routing in Peer-to-Peer Overlays

Galuba

Aberer

Despotovic

et al. 2009

2009 Third IEEE International Conference on Self-Adaptive and Self-Organizing Systems

View full text Add to dashboard Cite

Abstract-In sufficiently large heterogeneous overlays message loss and delays are likely to occur. This has a significant impact on overlay routing, especially on longer paths. The existing solutions to this problem rely on message redundancy to mask the loss and delays. This incurs a significant bandwidth cost.We propose the Forward Feedback Protocol (FFP) which only routes a single copy of the message and detects the message loss and excessive delays while routing. Failures are signalled along the routing paths. Based only on the simple binary signals, each overlay node locally and independently learns to route to avoid failures. The local node interactions lead to the emergence of fast reliable overlay routes. This is a continuous process, the system constantly self-organizes in response to changing delay and loss conditions.We evaluate the protocol in the Internet deployment and in simulation. Our system uses 2-5 times less bandwidth than the existing overlay routing approaches that rely on high message redundancy for fault-tolerance. Despite its marginal bandwidth investment in reliability, FFP achieves up to a 30% higher delivery success rate in comparison to the existing solutions. The protocol is scalable with local state size of O(log 2 N ) in terms of the network size and is universally applicable to all recursively routing overlays. I. INTRODUCTIONTo ensure scalability of message delivery in peer-to-peer (P2P) systems, the nodes are typically interconnected to form an overlay network. The messages are then routed to their destinations hop-by-hop along the links of the overlay topology. Peer-to-peer systems are mostly deployed in heterogeneous environments with resource availability varying not only across the nodes but also over time. If any of the computational, storage or network resources are exhausted, message loss and delays might occur. Persistent message loss, usually caused by peers' departure from the network, is trivial to detect and detection typically triggers the appropriate protocols that repair the P2P overlay topology However, any sufficiently large P2P system will also experience non-persistent, intermittent message loss due to various factors, including peer overload [21], transient network connectivity problems [14] or DDoS attacks [12]. These problems cannot be solved by using the same techniques as persistent failures, since permanent changes in overlay topology incur substantial additional repair costs such as the overlay search for new neighbors or additional key replication in distributed hash tables [22].Transient failures pose a challenge. When message loss occurs at some peers or network links, even with low probability,

show abstract

Section: Discussionmentioning

confidence: 99%

Self-organized Fault-tolerant Routing in Peer-to-Peer Overlays

Galuba

Aberer

Despotovic

et al. 2009

2009 Third IEEE International Conference on Self-Adaptive and Self-Organizing Systems

View full text Add to dashboard Cite

show abstract

“…This has focussed on the construction of increasingly sophisticated and novel designs addressing application areas such as video streaming [25], distributed searching [6] and distributed object location [22]. These systems have generally been developed using 'ad-hoc' overlay-specific approaches to adaptation, focussing on adaptation for maintenance purposes [17][21] [22] as well as optimisation purposes [1][2] [4].…”

Section: Background and Motivationmentioning

confidence: 99%

A Reflective Middleware to Support Peer-to-Peer Overlay Adaptation

Tyson

Grace

Mauthe

et al. 2009

Distributed Applications and Interoperable Systems

View full text Add to dashboard Cite

Abstract.As peer-to-peer systems are evolving from simplistic application specific overlays to middleware platforms hosting a range of potential applications it has become evident that increasingly configurable approaches are required to ensure appropriate overlay support is provided for divergent applications. This is exacerbated by the increasing heterogeneity of networked devices expected to host the overlay. Traditional adaptation approaches rely on simplistic design-time isolated fine-tuning of overlay operations. This, however, cannot fully support the level of configurability required by next generation peer-to-peer systems. To remedy this, a middleware overlay framework is designed that promotes the use of architectural reconfiguration for adaptive purposes. Underpinning this is a generic reusable component pattern that utilises software reflection to enable rich and extensible adaptation of overlays beneath divergent applications operating in heterogeneous environments. This is evaluated through a number of case-study experiments showing how overlays developed using the framework have been adapted to address a range of application and environmental variations.

show abstract

“…The second method is to measure the service load, including, e.g. the number of service requests, routed messages, the size of stored items, maintenance signalling or the total volume of the traffic (Shen & Xu 2008, Bianchi et al 2006. The relation between the load types can be described as follows; service load generates hardware load and the impact depends on the hardware capabilities of the device in question.…”

Section: Basic Load Balancing Conceptsmentioning

confidence: 99%

“…churn (Godfrey et al 2005), peer proximity and locality (Zhu & Hu 2004, peer activity and object popularity (Bianchi et al 2006). In these models, load information distribution and decision algorithms take into account the mentioned system characteristics.…”

Section: Virtual Serversmentioning

confidence: 99%

See 1 more Smart Citation

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

Adaptive Load Balancing for DHT Lookups

Cited by 22 publications

References 22 publications

Self-organized Fault-tolerant Routing in Peer-to-Peer Overlays

Self-organized Fault-tolerant Routing in Peer-to-Peer Overlays

A Reflective Middleware to Support Peer-to-Peer Overlay Adaptation

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

Contact Info

Product

Resources

About