Name
Abstract | ||
|---|---|---|
Topology maintenance, or how to handle the possibly concurrent joining and leaving of nodes, is a central problem for structured peer-to-peer networks. A good topology maintenance protocol should run efficiently, fully maintain the topology, and should not unduly restrict concurrency. In this paper, we present such a protocol for a multi-ring topology called Ranch. The protocol is efficient: for each join or leave, it uses a logarithmic number of messages with high probability. The protocol fully maintains Ranch after joins and leaves, and allows for a high degree of concurrency. To our knowledge, this is the first maintenance protocol that enjoys all of these properties for a structured peer-to-peer network topology. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.jpdc.2010.06.004 | J. Parallel Distrib. Comput. |
Keywords | Field | DocType |
high degree,topology maintenance,high probability,multi-ring topology,structured peer-to-peer network,ranch topology,good topology maintenance protocol,central problem,maintenance protocol,structured peer-to-peer networks,correctness,structured peer-to-peer network topology,concurrency,maintenance protocols,logarithmic number | Logical topology,Topology,Joins,Peer-to-peer,Concurrency,Computer science,Correctness,Network topology,Logarithm,restrict,Distributed computing | Journal |
Volume | Issue | ISSN |
70 | 11 | Journal of Parallel and Distributed Computing |
Citations | PageRank | References |
2 | 0.40 | 35 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaozhou Li | 1 | 17 | 2.30 |
| Jayadev Misra | 2 | 3147 | 771.78 |
| C. Greg Plaxton | 3 | 1835 | 281.07 |