Fault-Tolerant Routing for P2P System with Structured Topology

Fault-tolerant routing in existing P2P technologies is still not ideally solved. A new P2P routing algorithm FT-p2p is proposed, which is mainly used to optimize the fault-tolerant routing. The algorithm is based on directed graph and division of P2P network into two layers. The maintenance of routing information and network stability mostly depends on high-performance peers. When low-performance peers encounter difficulties, they may obtain routing-information service or data-relay service from high-performance peers. Experimental results indicate that FT-p2p algorithm is superior to Chord, Tapestry and Koodre algorithm in fault-tolerant routing.