Abstract
Chord [1] has been widely used as a routing protocol in structured peer-to-peer overlay networks. The neighbor peers in Chord are defined by logical address and there is no necessary causality between logical address and physical address. It may appear a "detour" phenomenon which reject what is near at hand and seek what is far away in the physical layer. This paper proposes a strategy that considers physical network latency presenting the distance in physical layer to some extent. The improved routing algorithm chooses the next hops based on both logical distance and physical latency and makes a trade-off between them. Theoretical and experimental analysis shows that Latency-based Chord can improve search performance effectively.
Original language | English |
---|---|
Title of host publication | 2011 International Conference on Computational Problem-Solving, ICCP 2011 |
Pages | 436-439 |
Number of pages | 4 |
DOIs | |
Publication status | Published - 2011 Dec 26 |
Event | 2011 International Conference on Computational Problem-Solving, ICCP 2011 - Chengdu, China Duration: 2011 Oct 21 → 2011 Oct 23 |
Publication series
Name | 2011 International Conference on Computational Problem-Solving, ICCP 2011 |
---|
Conference
Conference | 2011 International Conference on Computational Problem-Solving, ICCP 2011 |
---|---|
Country/Territory | China |
City | Chengdu |
Period | 11/10/21 → 11/10/23 |
Keywords
- Chord
- Physical latency
- finger table
ASJC Scopus subject areas
- Computational Mathematics