An optimization model of load balancing in Peer to Peer (P2P) Network

2011 ◽  
Author(s):  
Bingquan Zhang ◽  
Shuang Wang
Keyword(s):  
Load Balancing ◽  
Optimization Model ◽  
Peer To Peer ◽  
P2p Network

scholarly journals Enhances the Capacity of Load Adjusting by Improved Load Balancing Methodology in P2P Network

2019 ◽  
Vol 8 (9S2) ◽  
pp. 446-453
Keyword(s):  
Load Balancing ◽  
Peer To Peer ◽  
Peer Networks ◽  
P2p Network ◽  
Meta Data ◽  
Running Time ◽  
Data Preservation ◽  
Peer To Peer Networks ◽  
The Impact

To upgrades the limit of load modifying by working up a novel enhanced load adjusting philosophy in heterogeneous P2P network with suitable load assignment and load reallocation process. We moreover propose another new adjusting procedure called two load adjusting strategy for peer to peer networks to make the best load designation assurance when a novel partner arrives. The new load adjusting method is also prepared to achieve the load reallocation immovably through framework running time, if congested peer arrives. In load altering estimation, no virtual servers are used. Subsequently, preparing overhead is diminished in light of restrictive meta-data preservation. Besides load adjusting additionally centers around controlling the framework action. The idea behind model is to investigate the impact of peer heterogeneity and to adjust the load dissemination in P2P frameworks

A Load Balancing Method in Superlayer of Hierarchical DHT-Based P2P Network

2010 ◽  
Vol 33 (9) ◽  
pp. 1580-1590
Author(s):  
Yu-Xiang ZHANG ◽  
Hong-Ke ZHANG
Keyword(s):  
Load Balancing ◽  
P2p Network

scholarly journals Detection of DDOS attacks in distributed peer to peer networks

2018 ◽  
Vol 7 (2.7) ◽  
pp. 1051
Author(s):  
Gera Jaideep ◽  
Bhanu Prakash Battula
Keyword(s):  
High Risk ◽  
Large Scale ◽  
Peer To Peer ◽  
P2p Network ◽  
Ddos Attacks ◽  
P2p Networks ◽  
Distributed Environment ◽  
Trace Back ◽  
Peer To Peer Networks ◽  
Direct Attack

Peer to Peer (P2P) network in the real world is a class of systems that are made up of thousands of nodes in distributed environments. The nodes are decentralized in nature. P2P networks are widely used for sharing resources and information with ease. Gnutella is one of the well known examples for such network. Since these networks spread across the globe with large scale deployment of nodes, adversaries use them as a vehicle to launch DDoS attacks. P2P networks are exploited to make attacks over hosts that provide critical services to large number of clients across the globe. As the attacker does not make a direct attack it is hard to detect such attacks and considered to be high risk threat to Internet based applications. Many techniques came into existence to defeat such attacks. Still, it is an open problem to be addressed as the flooding-based DDoS is difficult to handle as huge number of nodes are compromised to make attack and source address spoofing is employed. In this paper, we proposed a framework to identify and secure P2P communications from a DDoS attacks in distributed environment. Time-to-Live value and distance between source and victim are considered in the proposed framework. A special agent is used to handle information about nodes, their capacity, and bandwidth for efficient trace back. A Simulation study has been made using NS2 and the experimental results reveal the significance of the proposed framework in defending P2P network and target hosts from high risk DDoS attacks.  

Load balancing in peer-to-peer systems using a diffusive approach

Computing ◽  
2012 ◽  
Vol 94 (8-10) ◽  
pp. 649-678 ◽  
Author(s):  
Ying Qiao ◽  
Gregor v. Bochmann
Keyword(s):  
Load Balancing ◽  
Peer To Peer ◽  
Peer To Peer Systems

scholarly journals AToM: Active topology monitoring for the bitcoin peer-to-peer network

2021 ◽  
Author(s):  
Federico Franzoni ◽  
Xavier Salleras ◽  
Vanesa Daza
Keyword(s):  
Reference Model ◽  
Peer To Peer ◽  
Network Protocol ◽  
P2p Network ◽  
Malicious Nodes ◽  
The Past ◽  
Side Channels ◽  
Peer Network ◽  
Topology Information ◽  
Peer To Peer Network

AbstractOver the past decade, the Bitcoin P2P network protocol has become a reference model for all modern cryptocurrencies. While nodes in this network are known, the connections among them are kept hidden, as it is commonly believed that this helps protect from deanonymization and low-level attacks. However, adversaries can bypass this limitation by inferring connections through side channels. At the same time, the lack of topology information hinders the analysis of the network, which is essential to improve efficiency and security. In this paper, we thoroughly review network-level attacks and empirically show that topology obfuscation is not an effective countermeasure. We then argue that the benefits of an open topology potentially outweigh its risks, and propose a protocol to reliably infer and monitor connections among reachable nodes of the Bitcoin network. We formally analyze our protocol and experimentally evaluate its accuracy in both trusted and untrusted settings. Results show our system has a low impact on the network, and has precision and recall are over 90% with up to 20% of malicious nodes in the network.

Peer-to-Peer Service Discovery for Grid Computing

2012 ◽  
pp. 232-259
Author(s):  
Eddy Caron ◽  
Frédéric Desprez ◽  
Franck Petit ◽  
Cédric Tedeschi
Keyword(s):  
Fault Tolerance ◽  
Load Balancing ◽  
Service Discovery ◽  
Large Scale ◽  
Dynamic Networks ◽  
Peer To Peer ◽  
Indexing System ◽  
Key Points ◽  
Computing Platforms ◽  
Traditional Approaches

Within distributed computing platforms, some computing abilities (or services) are offered to clients. To build dynamic applications using such services as basic blocks, a critical prerequisite is to discover those services. Traditional approaches to the service discovery problem have historically relied upon centralized solutions, unable to scale well in large unreliable platforms. In this chapter, we will first give an overview of the state of the art of service discovery solutions based on peer-to-peer (P2P) technologies that allow such a functionality to remain efficient at large scale. We then focus on one of these approaches: the Distributed Lexicographic Placement Table (DLPT) architecture, that provide particular mechanisms for load balancing and fault-tolerance. This solution centers around three key points. First, it calls upon an indexing system structured as a prefix tree, allowing multi-attribute range queries. Second, it allows the mapping of such structures onto heterogeneous and dynamic networks and proposes some load balancing heuristics for it. Third, as our target platform is dynamic and unreliable, we describe its powerful fault-tolerance mechanisms, based on self-stabilization. Finally, we present the software prototype of this architecture and its early experiments.

scholarly journals Quality Assurance for Reusable Learning Objects on a Peer-To-Peer Network

2016 ◽  
Vol 11 (10) ◽  
pp. 4 ◽  
Author(s):  
Rajendra G. Singh ◽  
Margaret A. Bernard
Keyword(s):  
Subject Matter ◽  
Learning Objects ◽  
Peer To Peer ◽  
P2p Network ◽  
Subject Matter Experts ◽  
Reusable Learning Objects ◽  
Peer Network ◽  
First Time ◽  
Peer To Peer Network

In this research, improving on the quality of Reusable Learning Objects (RLOs) on a Peer-To-Peer (P2P) network is considered. The RLO was first redesigned to have a fundamentally inherent pedagogical structure, which gave it an immediate foundational level of quality in terms of opportunities related to reusability. Applying the Learning Object Review Instrument 1.5 (LORI 1.5) demonstrated that some of the elements are inherent in this new RLO design, so there was no need to constantly have such features evaluated with LORI. A modified LORI was therefore developed in order to evaluate the remaining features of the RLO. The research identified these remaining elements to produce a Review Rubric for scoring the RLO’s quality. In addition, an algorithm is given which considers one or more subject-matter experts as part of a review process. Utilizing the subject-matter experts in a P2P network involved the creation of special nodes to ensure data integrity and post-availability of the review scores for RLOs. The research concludes that the redesigned RLOs along with the corresponding Review Rubric and scoring algorithm produces a system suitable for a P2P network, where for the first time, RLOs can be shared of assured quality to promote eLearning within P2P networks.

Sign in / Sign up

Export Citation Format

Share Document