ScholarLens Back to search
2009•Jisuanji gongchengRequires access

P2P Routing Algorithm Based on Physical Location and Access Locality

Xiaoheng Deng

Open publisher page 0 citations

Abstract

Aiming at the current structured P2P system’s locality of physical location and accessing resources, this paper takes the current popular structured P2P system Pastry as a foundation, proposes a P2P routing algorithm and gives relevant topology. When routing, the node route to the nodes which are physical adjacent to it. Theory analysis and the experimental results show that the algorithms proposed in this paper have improved the performance of P2P system about routing delays and the length of the path.

About this research paper

What this paper is about

Aiming at the current structured P2P system’s locality of physical location and accessing resources, this paper takes the current popular structured P2P system Pastry as a foundation, proposes a P2P routing algorithm and gives relevant topology. When routing, the node route to the nodes which are physical adjacent to it. Theory analysis and the experimental results show that the algorithms proposed in this paper have improved the performance of P2P system about routing delays and the length of the path.

Why it matters

A significance statement is not available in the OpenAlex record.

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

Aiming at the current structured P2P system’s locality of physical location and accessing resources, this paper takes the current popular structured P2P system Pastry as a foundation, proposes a P2P routing algorithm and gives relevant topology. When routing, the node route to the nodes which are physical adjacent to it. Theory analysis and the experimental results show that the algorithms proposed in this paper have improved the performance of P2P system about routing delays and the length of the path.

Key concepts: Computer science, Pastry, Locality, Routing (electronic design automation), Distributed computing, Node (physics), Computer network, Static routing

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
P2P Routing Algorithm Based on Physical Location and Access Locality — Research Paper | ScholarLens