Description: This paper sketches the design of PAST, a large-scale,
Internet-base,global storage utility that provides seala-
bility high availability persistence and security. PAST
is a peer-to-peer Internet application and is entirely self-
organizing. PAST nodes serve us access points for clients,
participate in the routing of client requests, and contribute
storage to the system. Nodes are not trusted, they may join
the system at any time and may silently leave the system
without warning. Yet, the system is able to provide strong
assurances, efficient storage access, load balancing and
scalability
Among the most interesting aspects of PAST s design are
(I) the Pastry location and routing scheme, which reliably
and efficiently routes client requests among the PAST nodes,
has good network locality properties and automatically re-
solves node failures and node additions (2) the use of ran-
domization to ensure diversity in the set of nodes that store a file s replicas and to
- [rount] - In this paper, wireless sensor network i
- [PAST] - past algorithm
- [PAST] - Classic PAST algorithm, achieving blind
File list (Check if you may need any files):
past.pdf