## Novel Architectures for P2P Applications: the Continuous-DiscreteApproach*# (2006)

### BibTeX

@MISC{06novelarchitectures,

author = {},

title = {Novel Architectures for P2P Applications: the Continuous-DiscreteApproach*#},

year = {2006}

}

### OpenURL

### Abstract

Abstract We propose a new approach for constructing P2P networks based on a dynamic decomposition ofa continuous space into cells corresponding to servers. We demonstrate the power of this approach by suggesting two new P2P architectures and various algorithms for them. The first serves as a DHT(Distributed Hash Table) and the other is a dynamic expander network. The DHT network, which we call Distance Halving, allows logarithmic routing and load, while preserving constant degrees. It offersan optimal tradeoff between the degree and the path length in the sense that degree d guarantees a pathlength of O(logd n). Another advantage over previous constructions is its relative simplicity. A majornew contribution of this construction is a dynamic caching technique that maintains low load and storage even under the occurrence of hot spots. Our second construction builds a network that is guaranteed tobe an expander. The resulting topologies are simple to maintain and implement. Their simplicity makes it easy to modify and add protocols. A small variation yields a DHT which is robust against randomByzantine faults. Finally we show that, using our approach, it is possible to construct any family of constant degree graphs in a dynamic environment, though with worse parameters. Therefore we expectthat more distributed data structures could be designed and implemented in a dynamic environment. 1 Introduction The problem we deal with is how to maintain a network structure and functionality in a dynamic environmentwhere the participants of the network change over time. Such networks are sometimes called Peer-to-peer (P2P) systems. Peer-to-peer networks are characterized by a mostly symmetric communication pattern andby the lack of central control or a-priori hierarchical organization. Moreover a P2P system is expected to scale gracefully as the size of the network grows. The sheer scale and dynamism in which P2P networks aresupposed to operate make the design of P2P systems challenging even for relatively simple applications.

### Citations

553 | Kademlia: A peer-to-peer information system based - Maymounkov, Mazières |

184 | Erasure Coding Vs. Replication: A Quantitative Comparison
- Weatherspoon, Kubiatowicz
- 2002
(Show Context)
Citation Context ...l subset of the servers suffices to reconstruct the data item. It is known that often the use of erasure correcting codesis more efficient than replication. For instance, Weatherspoon and Kubiatowicz =-=[47]-=- claim that an erasure correcting code may improve significantly the bandwidth and storage used by the system. 6.3 The Lookup Operation The routing properties of the continuous graph Gc were discussed... |

142 | Novel architectures for p2p applications: the continuous-discrete approach
- Naor, Wieder
- 2003
(Show Context)
Citation Context ..., Pastry [43], CAN [41], Kademlia [32], Viceroy [29] and many more. These systems follow the general paradigm of consistent hashing [19]: Let I *Preliminary versions of the paper appeared in [36] and =-=[35]-=-. #Research supported in part by the RAND/APX grand from the EU Program IST ##Incumbent of the Judith Kleeman Professorial Chair. $Research done while at the Weizmann Institute 1sdenote the space into... |

98 | Rege A. A digital fountain approach to reliable distribution of bulk data. Copyright © 2006 - JW, Luby, et al. |

91 | A proof of Alon’s second eigenvalue conjecture
- Friedman
- 2003
(Show Context)
Citation Context ...buted computing include load balancing, fault tolerance and search through random walks (c.f. [2],[9],[27],[15],[4]). It is well known that a random regular graph is an expander with high probability =-=[13]-=-. An explicit anddeterministic construction for expanders was given by Margulis [31] and Gabber and Galil [14], and was later generalized by Cai [6].The goal in this Section is to construct a P2P netw... |

78 | Distributed construction of random expander networks
- Law, Siu
- 2003
(Show Context)
Citation Context ...more modular design. In the following chapters we demonstrate the usefulness of the approach. 2Law and Siu have independently designed another algorithm which builds an expander with high probability =-=[25]-=-. Their approach is completely different from ours. 4s2 The Distance Halving DHT 2.1 The Construction First we define the continuous Distance Halving graph Gc. The vertex set of Gc is the interval I d... |

46 | Work-preserving emulations of fixed-connection networks
- Koch, Leighton, et al.
- 1997
(Show Context)
Citation Context ...). In other words if ~x is smooth then G~x is a real time emulation of Gk. In Particular this means that anycomputation performed by Gk, could be performed by G~x in constant slow down. (See [28] and =-=[23]-=- for anoverview on the literature of real time emulations.) Suppose that the servers have a mechanism to dynamically maintain a smooth partition ~x as servers joinand leave as well as a lookup mechani... |

9 |
Optimal adaptive broadcasting with a bounded fraction of faulty nodes
- Diks, Pelc
(Show Context)
Citation Context ...uc-tures in combinatorics. They have numerous applications in computer science. Applications in distributed computing include load balancing, fault tolerance and search through random walks (c.f. [2],=-=[9]-=-,[27],[15],[4]). It is well known that a random regular graph is an expander with high probability [13]. An explicit anddeterministic construction for expanders was given by Margulis [31] and Gabber a... |

9 |
Chord: Ascalable peer-to-peer lookup service for internet applications
- Stoica, Morris, et al.
- 2001
(Show Context)
Citation Context ...f a large variety of tasks, therefore it received a considerable amount of attention from the research community. Previous DHT designs in-clude the Plaxton-Rajaraman design [39], Tapestry [48], Chord =-=[45]-=-, Pastry [43], CAN [41], Kademlia [32], Viceroy [29] and many more. These systems follow the general paradigm of consistent hashing [19]: Let I *Preliminary versions of the paper appeared in [36] and ... |

2 |
Scalable and dynamic quorum systems. Distributed Computing (prelimenary version appeared
- Naor, Wieder
- 2005
(Show Context)
Citation Context ...uch as Chord, Pastry and Viceroy) a one dimensional name space suffices for a Distributed Hash Table. In some applications it may be useful to apply the same approach to a twodimensional universe. In =-=[37]-=- the continuous-discrete approach was used to construct a dynamic quorum system. In this paper we show how to construct a network which is an expander.In the two dimensional case the set of points can... |

1 |
A genericscheme for building overlay networks in adversarial scenarios
- Abraham, Awerbuch, et al.
- 1993
(Show Context)
Citation Context ...aph. We are not the only ones to use the De-Bruijn graph in this context. Constructions using it were suggested independently by Fraigniaud and Gauron [12], Kaashoek and Karger [18] and Abraham et al.=-=[1]-=-. The parameters they achieve aresimilar to those proved in Section 2, yet their approach in emulating the De-Bruijn graph is different. They try to do it directly whereas we use the continuous-discre... |

1 |
Viceroy: A scalable and dynamic emulation of thebutterfly
- Malkhi, Naor, et al.
- 2002
(Show Context)
Citation Context ...considerable amount of attention from the research community. Previous DHT designs in-clude the Plaxton-Rajaraman design [39], Tapestry [48], Chord [45], Pastry [43], CAN [41], Kademlia [32], Viceroy =-=[29]-=- and many more. These systems follow the general paradigm of consistent hashing [19]: Let I *Preliminary versions of the paper appeared in [36] and [35]. #Research supported in part by the RAND/APX gr... |