Analysis of the Pastry File Routing Algorithm
Lan Liu
Abstract
Lan Liu
Abstract
One of the significant characteristics of structured P2P system is that the distribution of files depends on the network topology closely.Files are located within the network accurately according to its logic address of P2P system topology.There are several algorithms to implement the routing of files.This paper analyzes the Pastry algorithm by discussing its mechanism and its application.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
One of the significant characteristics of structured P2P system is that the distribution of files depends on the network topology closely.Files are located within the network accurately according to its logic address of P2P system topology.There are several algorithms to implement the routing of files.This paper analyzes the Pastry algorithm by discussing its mechanism and its application.
Key concepts: Pastry, Routing table, Computer science, Routing (electronic design automation), Routing algorithm, Algorithm, Topology (electrical circuits), Distributed computing