O-Ring: A Fault Tolerance and Load Balancing Architecture for Peer-to-Peer Systems

Author(s):  
P.M. Melliar-Smith ◽  
Louise E. Moser
Computing ◽  
2012 ◽  
Vol 94 (8-10) ◽  
pp. 649-678 ◽  
Author(s):  
Ying Qiao ◽  
Gregor v. Bochmann

2012 ◽  
pp. 232-259
Author(s):  
Eddy Caron ◽  
Frédéric Desprez ◽  
Franck Petit ◽  
Cédric Tedeschi

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.


Author(s):  
Eddy Caron ◽  
Frédéric Desprez ◽  
Franck Petit ◽  
Cédric Tedeschi

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.


2006 ◽  
Vol 63 (3) ◽  
pp. 217-240 ◽  
Author(s):  
Sonesh Surana ◽  
Brighten Godfrey ◽  
Karthik Lakshminarayanan ◽  
Richard Karp ◽  
Ion Stoica

Author(s):  
Eddy Caron ◽  
Frédéric Desprez ◽  
Charles Fourdrignier ◽  
Franck Petit ◽  
Cédric Tedeschi

Networks ◽  
2015 ◽  
Vol 66 (3) ◽  
pp. 235-249 ◽  
Author(s):  
Jakarin Chawachat ◽  
Jittat Fakcharoenphol

2006 ◽  
Vol 39 (6) ◽  
pp. 787-804 ◽  
Author(s):  
David R. Karger ◽  
Matthias Ruhl

Sign in / Sign up

Export Citation Format

Share Document