Development of a fast routing algorithm for DHT at frequent joining of nodes

点击翻译按钮获取中文摘要

We propose a simple routing algorithm in a constant degree overlay network for resilience of distributed software systems. This algorithm can be used to efficiently locate nodes that provide a particular resource in distributed systems such as peer-to-peer (P2P) systems.Mathematical evaluation of the proposed algorithm shows the expected degree is constant not depending on the number of nodes, and the expected path length is logarithmic with the number of nodes. The proposed algorithm is scalable because the degree is constant, that is, the load of updating neighbors does not become high when the number of nodes becomes large. A simulation shows the number of lost messages for the proposed algorithm is less than that of Chord algorithm.