A Topology-Aware Improvement on Chord
Zhou Xiaofan, Xudong Yang, Wang Zhiqian
Abstract
Zhou Xiaofan, Xudong Yang, Wang Zhiqian
Abstract
Routing efficiency is the critical issue when constructing peer-to-peer overlay. However, Chord has often been criticized on its careless of routing locality. In this paper, we propose a topology-aware improvement on the basis of Chord, which focuses on achieving better routing efficiency. It has lower latency by appending a topology-aware Chord circle to divide topology regions. The simulation shows that the improvement has achieved lower latency per message routing.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Routing efficiency is the critical issue when constructing peer-to-peer overlay. However, Chord has often been criticized on its careless of routing locality. In this paper, we propose a topology-aware improvement on the basis of Chord, which focuses on achieving better routing efficiency. It has lower latency by appending a topology-aware Chord circle to divide topology regions. The simulation shows that the improvement has achieved lower latency per message routing.
Key concepts: Chord (peer-to-peer), Computer science, Pastry, Computer network, Latency (audio), Topology (electrical circuits), Distributed computing, Overlay