A Dynamic Popularity-Aware Load Balancing Algorithm for Structured P2P Systems

Soltani, Narjes; Khaneghah, Ehsan Mousavi; Sharifi, Mohsen; Mirtaheri, Seyedeh Leili

doi:10.1007/978-3-642-35606-3_9

Cited by 11 publications

(8 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The general idea presented by this category is to apply different hash functions on each resource to have different keys, and then assign each resource to different replica nodes according to the calculated key. A dynamic popularity‐aware load balancing: Authors use a notion of replication directories (repDir) that contain as entries data item and the responsible replica. When a new node joins the network, it applies a hash function called FirstHash to get an ID according to which it will be placed in the system.…”

Section: Related Workmentioning

confidence: 99%

“…This means, it is superior than in basic Chord but it is the same in our method as in the other popular replication works like predecessor replication (PredChord), successor‐list replication, and leaf‐set replication because r in all of them is equal to m‐1 ( log 2 ( N ) ‐ 1 ). In other works like, the storage space can be higher or lower as the replication factor increases with the augmentation of resource popularity.…”

Section: The Proposed Approach (Repmchord)mentioning

confidence: 99%

See 1 more Smart Citation

RepMChord: A novel replication approach for mobile Chord with reduced traffic overhead

Cherbal

Boukerram

Boubetra

2017

Int J Communication

View full text Add to dashboard Cite

Structured peer-to-peer systems based on distributed hash table (DHT) have known a great popularity and performance since their appearance. They have experienced multiple improvements to increase the efficiency, like replication mechanism with different used methods and different objectives like increasing data availability or fitting to churn. Besides their benefits, these methods suffer from the excessive generated overhead in maintenance process. On the other side, we have the interest deployment of DHT overlay on mobile ad hoc network, which benefits from the infrastructure-less architecture, but presents some shortcomings because of the limited bandwidth and energy batteries, what require a reduced overhead. Therefore, the aim of this work is to improve the lookup efficiency of DHT-based Chord on mobile ad hoc network underlay. For that, we propose a novel replication mechanism based on data structure to determine the replica nodes, while avoiding the excessive generated overhead in maintenance process to cope with the problem of limited energy batteries. To evaluate the proposed method, we present an extensive simulation study that compares the work to another efficient replication method and to mobile basic Chord. The results show the efficiency of our approach in decreasing the lookup path, the maintenance overhead, and the energy consumption.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: The Proposed Approach (Repmchord)mentioning

confidence: 99%

RepMChord: A novel replication approach for mobile Chord with reduced traffic overhead

Cherbal

Boukerram

Boubetra

2017

Int J Communication

View full text Add to dashboard Cite

show abstract

“…Unstructured P2P networks with flooding-based query routing are especially problematic in this sense, since nodes flood the incoming queries to all linked nodes. Also the differences in object properties, such as popularity, size and type generate load imbalance in P2P systems (Soltani et al 2012). This type of load imbalance is independent of whether the used P2P system is structured or unstructured.…”

Section: Sources Of Load Imbalance In P2p Systemsmentioning

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

“…In resource management framework, the load balancer is the key unit in efficient utilization of resources and improving response time [16]. Load balancing is the distribution of load among several computing resources such as computers, clusters, network communication lines, central processing units, or disk drives.…”

Section: Introductionmentioning

confidence: 99%

Adaptive Load Balancing Dashboard in Dynamic Distributed Systems

Mirtaheri

Fatemi

Grandinetti

2017

JSFI

View full text Add to dashboard Cite

Considering the dynamic nature of new generation scientific problems, load balancing is a necessity to manage the load in an efficient manner. Load balancing systems are used to optimize the resource consumption, maximize the throughput, minimize response time, and to prevent overload in resources. In current research, we consider operational distributed systems with dynamic variables caused by different nature of the applications and heterogeneity of the various levels in the system. The conducted studies indicate that many different factors should be considered to select the load balancing algorithm, including the processing power, load transfer and communication delay of nodes. In this work, We aim to design a dashboard that is capable of merging the load balancing algorithms in different environments. We design an adaptive system infrastructure with the ability to adjust various factors in the run time of a load balancing algorithm. We propose a task and a resource allocation mechanism and further introduce a mathematical model of load balancing process in the system. We calculate a normalized hardware score that determines the maturity of the system according to the environmental conditions of the load balancing process. The evaluation results confirm that the proposed method performs well and reduces the probability of system failure.

show abstract

A Dynamic Popularity-Aware Load Balancing Algorithm for Structured P2P Systems

Cited by 11 publications

References 7 publications

RepMChord: A novel replication approach for mobile Chord with reduced traffic overhead

RepMChord: A novel replication approach for mobile Chord with reduced traffic overhead

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

Adaptive Load Balancing Dashboard in Dynamic Distributed Systems

Contact Info

Product

Resources

About