Simulation and Analysis of Routing Schemes in Structured P2P System

A number of routing schemes have been proposed to improve the lookup performance of distributed hash table (DHT). There are three representative routing schemes among existing DHTs: recursive routing, semi-recursive routing and iterative routing. To know which routing scheme is more efficient, this paper takes one of the most important DHTs -- Chord as an example to simulate the three representative routing schemes and discusses the effectiveness of them from the aspects of lookup latency, effect of churn and difficulty of NAT traversal. The simulations and analysis show that they have advantages in different situations.