Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Early measurements of a cluster-based architecture for P2P systems
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Brocade: Landmark Routing on Overlay Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Building Topology-Aware Overlays Using Global Soft-State
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
PChord: Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity
IEICE - Transactions on Information and Systems
AChord: Topology-Aware Chord in Anycast-Enabled Networks
ICHIT '06 Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02
A survey and comparison of peer-to-peer overlay network schemes
IEEE Communications Surveys & Tutorials
| Hi-index | 0.00 |
The research on routing efficiency of DHT P2P networks is a key element to promote the development of P2P networks. One reason is that a node's logical ID is independent of its physical location, bringing tremendous delay to network routing. In this paper, we propose a structured P2P system with low network delay, named TB_Chord, which is extended to enable physical topology aware on the base of Chord. In the TB_Chord, nodeID is configured with prefix called domainID, finger tables are set bidirectional. The most important is TB_Chord neither has super node nor any other plus layer, which guarantees no extra maintenance cost or overhead and original chord's advantages remaining. The routing algorithms, node arrival mechanisms are designed and tested. The results of simulation experiments suggest that the TB_Chord's performance is obviously improved in the delay of routing and the hops of overlay network by contrast with the traditional Chord.