S-Chord: hybrid topology makes chord efficient

Authors:
Liu Hui-shan;Xu Ke;Xu Ming-wei;Cui Yong
Affiliations:
Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China
Venue:
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Year:
2005

Citing 7
Cited 2

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Search and replication in unstructured peer-to-peer networks

ICS '02 Proceedings of the 16th international conference on Supercomputing
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Simple efficient load balancing algorithms for peer-to-peer systems

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Know thy neighbor’s neighbor: better routing for skip-graphs and small worlds

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Diminished chord: a protocol for heterogeneous subgroup formation in peer-to-peer networks

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems

Empowering chord DHT overlays

HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
An adversarial evaluation of network signaling and control mechanisms

ICISC'10 Proceedings of the 13th international conference on Information security and cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the semi-structured Chord(S-Chord), every node maintains two static neighbors and O(logN) dynamic neighbors, which can guarantee network connectivity and improve the success rate of fuzzy lookup. It can effectively reduce the average lookup length and improve transmission performance by adjusting dynamic neighbors and optimizing forward routes according to current traffic of network. The simulation results show that the semi-structured Chord can get higher lookup success rate with shorter average lookup length, and lower fuzzy lookup workload of network, so it can better support large-scale overlay service.