Data Replication in P2P Systems

2010 ◽  
pp. 589-615
Author(s):  
Vassilios V. Dimakopoulos ◽  
Spiridoula Margariti ◽  
Mirto Ntetsika ◽  
Evaggelia Pitoura
Keyword(s):  
Fault Tolerance ◽  
Load Balancing ◽  
Response Time ◽  
Distributed System ◽  
Data Replication ◽  
System Availability ◽  
P2p Systems ◽  
Network Links ◽  
Multiple Copies ◽  
Additional Reason

Maintaining multiple copies of data items is a commonly used mechanism for improving the performance and fault-tolerance of any distributed system. By placing copies of data items closer to their requesters, the response time of queries can be improved. An additional reason for replication is load balancing. For instance, by allocating many copies to popular data items, the query load can be evenly distributed among the servers that hold these copies. Similarly, by eliminating hotspots, replication can lead to a better distribution of the communication load over the network links. Besides performance-related reasons, replication improves system availability, since the larger the number of copies of an item, the more site failures can be tolerated. In this chapter we survey replication methods applicable to p2p systems. Although there exist some general techniques, methodologies are distinguished according to the overlay organization (structured and unstructured) they are aimed at. After replicas are created and distributed, a major issue is their maintenance. We present strategies that have been proposed for keeping replicas up to date so as to achieve a desired level of consistency.

scholarly journals Monitoring and Resource Management in P2P Grid-Based Web Services

2012 ◽  
Vol 1 (2) ◽  
pp. 71-84
Author(s):  
Djafri Laouni ◽  
Mekki Rachida
Keyword(s):  
Fault Tolerance ◽  
Resource Management ◽  
Load Balancing ◽  
Grid Computing ◽  
Grid Infrastructure ◽  
P2p Computing ◽  
P2p Systems ◽  
Processing Power ◽  
Service Load ◽  
High Bandwidth

Grid computing has recently emerged as a response to the growing demand for resources (processing power, storage, etc.) exhibited by scientific applications. However, as grid sizes increase, the need for self-organization and dynamic reconfigurations is becoming more and more important. Since such properties are exhibited by P2P systems, the convergence of grid computing and P2P computing seems natural. However, using P2P systems (usually running on the Internet) on a grid infrastructure (generally available as a federation of SAN-based clusters interconnected by high-bandwidth WANs) may raise the issue of the adequacy of the P2P communication mechanisms. Among the interesting properties of P2P systems is the  volatility of  peers  which  causes  the  need  for  integration  of  a  service fault tolerance. And service Load balancing,   As a solution, we proposed a mechanism of fault tolerance and model of Load balancing  adapted to a grid P2P model, named SGRTE (Monitoring and Resource Management, Fault Tolerances and Load Balancing).DOI: 10.18495/comengapp.12.071084

scholarly journals Novelty circular neighboring technique using reactive fault tolerance method

2019 ◽  
Vol 9 (6) ◽  
pp. 5211
Author(s):  
Ahmad Shukri Mohd Noor ◽  
Nur Farhah Mat Zian ◽  
Noor Hafhizah Abd Rahim ◽  
Rabiei Mamat ◽  
Wan Nur Amira Wan Azman
Keyword(s):  
Fault Tolerance ◽  
Data Replication ◽  
Data Availability ◽  
Complex Environment ◽  
Tolerance Mechanism ◽  
System Availability ◽  
Replication Technique ◽  
The Right ◽  
Tolerance Method ◽  
Reactive Method

The availability of the data in a distributed system can be increase by implementing fault tolerance mechanism in the system. Reactive method in fault tolerance mechanism deals with restarting the failed services, placing redundant copies of data in multiple nodes across network, in other words data replication and migrating the data for recovery. Even if the idea of data replication is solid, the challenge is to choose the right replication technique that able to provide better data availability as well as consistency that involves read and write operations on the redundant copies. Circular Neighboring Replication (CNR) technique exploits neighboring policy in replicating the data items in the system performs well with regards to lower copies needed to maintain the system availability at the highest. In a performance analysis with existing techniques, results show that CNR improves system availability by average 37% by offering only two replicas needed to maintain data availability and consistency. The study demonstrates the possibility of the proposed technique and the potential of deploying in larger and complex environment.

scholarly journals Optimized Load Balancing Strategy In Cloud Computing : A Review

2016 ◽  
Vol 15 (4) ◽  
pp. 6681-6685
Author(s):  
Parveen Kaur ◽  
Monika Sachdeva
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Load Balancing ◽  
Response Time ◽  
Resource Utilization ◽  
Distributed System ◽  
Job Scheduling ◽  
Work Load ◽  
Memory Capacity ◽  
Network Load

Now a days every organization is migrating towards  cloud computing as cloud computing is considered being more flexible and scalable as compared to other technologies. The technology simply means to provide the computing resources and services through a network. This paper discusses the existing approaches for scheduling algorithms that can maintain the load balancing and provides better improved strategies through efficient job scheduling and modified resource allocation techniques. The load can be CPU load, memory capacity, delay or network load. Load balancing is the process of distributing the load among various nodes of a distributed system to improve both resource utilization and job response time while also avoiding a situation where some of the nodes are heavily loaded while other nodes are idle or doing very little work. Load balancing ensures that all the processor in the system or every node in the network does approximately the equal amount of work at any instant of time. 

Effective Management of Data Centers Resources for Load Balancing in Cloud Computing

2018 ◽  
Vol 8 (2) ◽  
pp. 40-56 ◽  
Author(s):  
Pradeep Kumar Tiwari ◽  
Sandeep Joshi
Keyword(s):  
Fault Tolerance ◽  
Load Balancing ◽  
Response Time ◽  
Load Balance ◽  
Data Centers ◽  
Information Policy ◽  
Effective Management ◽  
Live Migration ◽  
Load Imbalance ◽  
Comparison Table

An effective load balancing mechanism maximizes the throughput minimizes the response time with fault tolerance. Load imbalance problems occasionally occur during the over-demanding of resources from VMs. Load balance mechanisms manage the load by allocating jobs and reallocation of VMs. This article proposes the Dynamic Weighted Live Migration (DWLM) mechanism. DWLM mechanism based on LP-formulation-based heuristic approaches to dynamically manage load balancing. DWLM approaches use transfer, selection, and location polices. These policies work based on an information policy. The authors map the result in migration time, throughput, response time and fault tolerance. The proposed DWLM mechanism gives the best results from Equally Spared Current Execution (ESCEL) and Push-Pull mechanisms. A comparison table and associated charts show the efficiency of the proposed DWLM mechanism.

scholarly journals Generic Controller Adaptive Load Balancing (GCALB) for SDN Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-9 ◽  
Author(s):  
Wael Hosny Fouad Aly
Keyword(s):  
Fault Tolerance ◽  
Load Balancing ◽  
Response Time ◽  
Fault Tolerant ◽  
High Reliability ◽  
Tolerance Mechanisms ◽  
New Era ◽  
Proposed Model ◽  
New Strategies

Fault tolerance is an important aspect of network resilience. Fault-tolerance mechanisms are required to ensure high availability and high reliability in different environments. The beginning of software-defined networking (SDN) has both presented new challenges and opened a new era to develop new strategies, standards, and architectures to support fault tolerance. In this paper, a study of fault tolerance is performed for two architectures: (1) a single master with multiple slave controllers and (2) multiple slave controllers. The proposed model is called a Generic Controller Adaptive Load Balancing (GCALB) model for SDNs. GCALB adapts the load among slave controllers based on a GCALB algorithm. Mininet simulation tool is utilized for the experimentation phase. Controllers are implemented using floodlights. Experiment results were conducted using GCALB when master controller is taking the responsibility of distributing switches among four and five slave controllers as a case study. Throughput and response time metrics are used to measure performance. GCALB is compared with two reference algorithms: (1) HyperFlow (Kreutz et al., 2012), and (2) Enhanced Controller Fault Tolerant (ECFT) (Aly and Al-anazi, 2018). Results are promising as the performance of GCALB increased by 15% and 12% when compared to HyperFlow and by 13% and 10% when compared to ECFT in terms of throughput and response time.

A Review on Load Balancing Model Using Best Partition Technique

2017 ◽  
Vol 7 (8) ◽  
pp. 284
Author(s):  
M. Chaitanya ◽  
K. Durga Charan
Keyword(s):  
Cloud Computing ◽  
Fault Tolerance ◽  
Load Balancing ◽  
Load Balance ◽  
Large Impact ◽  
Cloud Environment ◽  
Public Cloud ◽  
The Public ◽  
Partition Technique ◽  
Textual Content

Load balancing makes cloud computing greater knowledgeable and could increase client pleasure. At reward cloud computing is among the all most systems which offer garage of expertise in very lowers charge and available all the time over the net. However, it has extra vital hassle like security, load administration and fault tolerance. Load balancing inside the cloud computing surroundings has a large impact at the presentation. The set of regulations relates the sport idea to the load balancing manner to amplify the abilties in the public cloud environment. This textual content pronounces an extended load balance mannequin for the majority cloud concentrated on the cloud segregating proposal with a swap mechanism to select specific strategies for great occasions.

MobileRE: A replicas prioritized hybrid fault tolerance strategy for mobile distributed system

2021 ◽  
pp. 102217
Author(s):  
Yu Wu ◽  
Duo Liu ◽  
Xianzhang Chen ◽  
Jinting Ren ◽  
Renping Liu ◽  
...  
Keyword(s):  
Fault Tolerance ◽  
Distributed System ◽  
Tolerance Strategy

scholarly journals Efficient Placement of Service Function Chains in Cloud Computing Environments

Electronics ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 323
Author(s):  
Marwa A. Abdelaal ◽  
Gamal A. Ebrahim ◽  
Wagdy R. Anis
Keyword(s):  
Energy Consumption ◽  
Load Balancing ◽  
Response Time ◽  
Optimization Problem ◽  
Service Providers ◽  
Virtual Network ◽  
Placement Problem ◽  
Service Function ◽  
Network Functions ◽  
Bandwidth Consumption

The widespread adoption of network function virtualization (NFV) leads to providing network services through a chain of virtual network functions (VNFs). This architecture is called service function chain (SFC), which can be hosted on top of commodity servers and switches located at the cloud. Meanwhile, software-defined networking (SDN) can be utilized to manage VNFs to handle traffic flows through SFC. One of the most critical issues that needs to be addressed in NFV is VNF placement that optimizes physical link bandwidth consumption. Moreover, deploying SFCs enables service providers to consider different goals, such as minimizing the overall cost and service response time. In this paper, a novel approach for the VNF placement problem for SFCs, called virtual network functions and their replica placement (VNFRP), is introduced. It tries to achieve load balancing over the core links while considering multiple resource constraints. Hence, the VNF placement problem is first formulated as an integer linear programming (ILP) optimization problem, aiming to minimize link bandwidth consumption, energy consumption, and SFC placement cost. Then, a heuristic algorithm is proposed to find a near-optimal solution for this optimization problem. Simulation studies are conducted to evaluate the performance of the proposed approach. The simulation results show that VNFRP can significantly improve load balancing by 80% when the number of replicas is increased. Additionally, VNFRP provides more than a 54% reduction in network energy consumption. Furthermore, it can efficiently reduce the SFC placement cost by more than 67%. Moreover, with the advantages of a fast response time and rapid convergence, VNFRP can be considered as a scalable solution for large networking environments.

Sign in / Sign up

Export Citation Format

Share Document