ScholarLens Back to search
2008•Unpublished venueRequires access

Fault-Tolerant Routing for P2P System with Structured Topology

Chuiwei Lu, Zhitang Li, Huaiqin Lin, Qinfeng Huang

Open publisher page 1 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

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

Key concepts: Static routing, Computer science, Multipath routing, Policy-based routing, Distributed computing, Routing table, Dynamic Source Routing, Link-state routing protocol

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Fault-Tolerant Routing for P2P System with Structured Topology — Research Paper | ScholarLens