ML-Chord: A multi-layered P2P resource sharing model
Journal of Network and Computer Applications
P2P Networking and Applications
P2P Networking and Applications
Improving the dependability of prefix-based routing in DHTs
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
A churn-resistant strategy for a highly reliable p2p system
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
| Hi-index | 0.00 |
The paper presents a concentric multi-ring overlay networking topology for fast and shortest-path resource discovery in dynamic distributed systems like P2P network. First, we de?ne a highly reliable P2P system called HiPeer, which is deployed on top of the logical overlay with a number of lowest bounds in terms of network performance. Then, we demonstrate that for any De Bruijn digraph of degree1 d = 2 and diameter2 DDB, HiPeer constructs a highly reliable network, where each node maintains a routing table with a size of at most 2d + 3 entries independent of the number N of nodes in the system. Further, we show that for any network with at most d nodes, any existing resource in the network can be found within at most DHiPeer = logd (N(d - 1) + d) - 1 hops. This result is as close to the Moore bound [9] as the query path length in the other best P2P proposals based on the De Bruijn digraphs. Thus, HiPeer de?nes a highly connected network with connectivity d and the lowest yet known lookup bound DHiPeer. Moreover, we show that any node驴s "join or leave" operation in HiPeer implies a constant expected reorganization cost of the magnitude order of O(d) control messages.