A Fault-Tolerant Routing Algorithm of P2P Network Based on Hierarchical Structure

Author

Lu, Chuiwei ; Hu, Zhengbing

Author_Institution

Comput. Sch., Huangshi Inst. of Technol., Huangshi, China

fYear

2010

fDate

22-23 May 2010

Firstpage

1

Lastpage

4

Abstract

Fault-tolerant routing in P2P network has been a hot point. To raise the performance of fault-tolerant routing can highly enhance the stability and efficiency of P2P network. Through research, we find most routing errors is caused by highly dynamic characteristic of P2P network, such as peers frequently join, leave and fail, which is the main factor that induce routing errors. We proposed an improved algorithm to raise the performance of fault-tolerant routing of P2P network based on hierarchical structure theory, which is named as FTARH (Fault-tolerant Algorithm of Routing with Hiberarchy). The new algorithm makes full use of the superfluous capability of super peers to enhance the performance of fault-tolerant routing of entire P2P network.

Keywords

fault tolerant computing; peer-to-peer computing; P2P network; fault-tolerant algorithm of routing with hiberarchy; hierarchical structure theory; Computer errors; Computer networks; Delay; Fault tolerance; Information technology; Network topology; Peer to peer computing; Routing; Stability; Uncertainty;

fLanguage

English

Publisher

ieee

Conference_Titel

e-Business and Information System Security (EBISS), 2010 2nd International Conference on

Conference_Location

Wuhan

Print_ISBN

978-1-4244-5893-6

Electronic_ISBN

978-1-4244-5895-0

Type

conf

DOI

10.1109/EBISS.2010.5473644

Filename

5473644