Name
Title | ||
|---|---|---|
Enforcing Routing Consistency in Structured Peer-to-Peer Overlays: Should We and Could We? |
Abstract | ||
|---|---|---|
In this paper, we argue that enforcing routing consistency i n key- based routing (KBR) protocols can simplify P2P application design and make structured P2P overlays suitable for more applications. We define two levels of routing consistency semantics, namel y weakly consistent KBR and strongly consistent KBR. We focus on an algorithm that provides strong consistency based on group membership service and weakly consistent KBR. The algorithm provides a continuum of consistency levels for applications with a tunable parameter. |
Year | Venue | Keywords |
|---|---|---|
2006 | IPTPS | key based routing,p2p,strong consistency |
Field | DocType | Citations |
Computer science,Peer to peer overlay,Overlay,Strong consistency,Semantics,Distributed computing | Conference | 2 |
PageRank | References | Authors |
0.39 | 21 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei Chen | 1 | 3416 | 170.71 |
| Xuezheng Liu | 2 | 352 | 22.72 |