PAST: A large-scale, persistent peer-to-peer storage utility

被引:91
作者
Druschel, P [1 ]
Rowstron, A [1 ]
机构
[1] Rice Univ, Houston, TX 77005 USA
来源
EIGHTH WORKSHOP ON HOT TOPICS IN OPERATING SYSTEMS, PROCEEDINGS | 2001年
关键词
D O I
10.1109/HOTOS.2001.990064
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper sketches the design of PAST, a large-scale, Internet-based, global storage utility that provides scalability, high availability, persistence and security PAST is a peer-to-peer Internet application and is entirely self-organizing. PAST nodes serve as 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 (1) the Pastry location and routing scheme, which reliably and efficiently routes client requests among the PAST nodes, has good network locality properties and automatically resolves node failures and node additions; (2) the use of randomization to ensure diversity in the set of nodes that store a file's replicas and to provide load balancing; and (3) the optional use of smartcards, which are held by each PAST user and issued by a third part), called a broker The smartcards support a quota system that balances supply, and demand of storage in the system.
引用
收藏
页码:75 / 80
页数:6
相关论文
共 15 条
[1]  
Anderson R.J., 1996, P PRAGOCRYPT, P242
[2]  
[Anonymous], 2001, UCBCSD011141
[3]  
Bolosky WJ, 2000, PERF E R SI, V28, P34, DOI 10.1145/345063.339345
[4]  
CLARKE I, 2000, WORKSH DES ISS AN UN, P311
[5]  
DINGLEDINE R, 2000, P WORKSH DES ISS AN
[6]  
KUBIATOWICZ J, 2000, P ACM ASPLOS2000 CAM
[7]  
PFITZMANN A, 2001, ANONYMITY UNOBSERVAB
[8]   Accessing nearby copies of replicated objects in a distributed environment [J].
Plaxton, CG ;
Rajaraman, R ;
Richa, AW .
THEORY OF COMPUTING SYSTEMS, 1999, 32 (03) :241-280
[9]  
RATNASAMY S, 2001, P ACM SIGCOMM01 SAN
[10]  
ROWSTRON A, 2001, P ACM SOSP01 BANFF C