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

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 freque...

Full description

Saved in:
Bibliographic Details
Published in2010 2nd International Conference on E-business and Information System Security pp. 1 - 4
Main Authors Chuiwei Lu, Zhengbing Hu
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2010
Subjects
Computer errors
Computer networks
Delay
Fault tolerance
Information technology
Network topology
Peer to peer computing
Routing
Stability
Uncertainty
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:1424458935
9781424458936
ISSN:2161-5942
DOI:10.1109/EBISS.2010.5473644