scholarly journals Peer to peer size estimation in large and dynamic networks: A comparative study

2006 ◽  
Author(s):  
E. Le Merrer ◽  
A.-M. Kermarrec ◽  
L. Massoulie
Keyword(s):  
Comparative Study ◽  
Dynamic Networks ◽  
Peer To Peer ◽  
Size Estimation

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.

Peer-to-Peer Service Discovery for Grid Computing

2010 ◽  
pp. 285-312
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 Monitoring dynamic networks: A simulation‐based strategy for comparing monitoring methods and a comparative study

2021 ◽  
Author(s):  
Lisha Yu ◽  
Inez Maria Zwetsloot ◽  
Nathaniel Tyler Stevens ◽  
James David Wilson ◽  
Kwok Leung Tsui
Keyword(s):  
Comparative Study ◽  
Dynamic Networks ◽  
Monitoring Methods ◽  
Simulation Based

scholarly journals Consensus Algorithms Blockchain: A comparative study

2019 ◽  
Vol 5 (2) ◽  
pp. 66-71
Author(s):  
Siham Hattab ◽  
Imad Fakhri Taha Alyaseen
Keyword(s):  
Comparative Study ◽  
Peer To Peer ◽  
The State ◽  
Verification And Validation ◽  
Consensus Algorithm ◽  
Consensus Algorithms ◽  
The Public ◽  
Distributed Ledger ◽  
Distributed Ledger Technology ◽  
Encrypted Database

A blockchain is a Distributed Ledger Technology that has been defined as a “distributed, shared, encrypted database that serves as an irreversible and incorruptible repository of information. Blockchain can be defined as a peer-to-peer distributed ledger that is cryptographically secure, append-only, immutable and updatable only via consensus or agreement among peers. In blockchain platforms, each transaction in the public ledger is verified by consensus of the majority of the system participants in a transparent and secure way. The consensus algorithm refers to the process of attaining an unified agreement on the state of the network in a decentralized way and to facilitate the verification and validation of information being added to the blockchain. This paper aims at providing a comparison between most of the recent consensus algorithms regarding the scalability of the algorithm; the type of blockchain, node identity, the performance of the algorithm (in terms of throughput & latency) and Adversial Tolerance and to deliver a solid basis for discussions about current statistics. In this research, we also presented a new category of the Blockchain consensus algorithms, which consist of three groups as follows; the proof based on Hardware, the proof based on stake, and the proof based on voting.

Sign in / Sign up

Export Citation Format

Share Document