Fault-Tolerant Routing for P2P System with Structured Topology

Author

Lu, Chuiwei ; Li, Zhitang ; Lin, Huaiqin ; Huang, Qinfeng

Author_Institution

Coll. of Comput., Huazhong Univ. of Sci. & Technol., Wuhan

Volume

3

fYear

2008

fDate

12-14 Dec. 2008

Firstpage

102

Lastpage

105

Abstract

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.

Keywords

peer-to-peer computing; software fault tolerance; stability; telecommunication network routing; P2P routing algorithm; P2P system; directed graph; fault-tolerant routing; network stability; routing information maintenance; structured topology; Computer networks; Computer science; Educational institutions; Fault tolerance; Fault tolerant systems; Network topology; Physics computing; Routing; Software engineering; Stability; Fault tolerant; P2P; Routing algorithm; Topology structure;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Software Engineering, 2008 International Conference on

Conference_Location

Wuhan, Hubei

Print_ISBN

978-0-7695-3336-0

Type

conf

DOI

10.1109/CSSE.2008.1379

Filename

4722300