基于P2P结构的广域分布式存储相关技术研究
|
摘要
P2P计算技术有别于传统客户/服务器服务模式,具有极强的鲁棒性和可扩展性。在互联网信息爆炸的今天,利用P2P技术来构建海量数据分布式存储系统成为最有效的存储组织模式之一。P2P计算环境中的拓扑一致性、节点动态性、异构性和自治性等问题是构建分布式存储系统面临的关键问题和难点。以利用Internet上个人计算机的空闲计算资源、存储资源和网络资源构建一个面向海量用户的海量分布式存储系统为主要应用目标,本文研究了目前主要采用的分布式存储技术,分析了利用P2P技术构建分布式存储系统面临的主要问题,在研究构建P2P存储系统的基础理论和算法基础之上,针对现有P2P存储系统在实时性和容错性上存在的不足,提出一个面向Internet的基于对等结构的分布式存储系统(RSA-Store)框架,对存储覆盖网络构建、数据管理、副本一致性维护和负载均衡等问题提出了相应的解决方案和策略,主要研究工作和创新如下：
(1)提出一种新的存储覆盖网络构建机制来改善P2P网络中的拓扑一致性问题。拓扑一致性问题严重制约了存储系统的性能,现有研究通过测量节点之间的网络距离并在此基础上对节点进行分组来改善这种影响,通过网络距离进行分组的方法具有不稳定性和带来大量的聚集开销。针对上述问题,利用Internet结构的自然属性建立一个基于区域语义的层次覆盖网络(RSA-HRing),给出了相应的拓扑维护机制,设计了基于推(Push)拉(Pull)相结合的超节点及其备份节点的选取算法,提出一种预防超节点失效的鲁棒性算法SNFT-RA。在此基础上针对现有网络距离测量方法中采用时延和跳数度量容易带来三角不等式问题,详细描述和分析了通过路径矢量测量网络距离的思想,并将其应用到覆盖网络的路由算法中,提出了一种基于路径矢量(Path-Vector)的覆盖网络路由算法(PVRA)。仿真实验表明,RSA-HRing能显著降低覆盖网络拓扑构建和维护开销PVRA具有较好的路由性能,能够在保持覆盖网络路由规模的同时显著节约实际物理路由开销。
(2)结合存储用户访问行为和区域活动特点,在RSA-HRing网络中提出一种基于区域感知的数据管理模型。基于区域感知的数据管理模型采用静态的数据放置策略Ⅰ (nter)-Ⅰ(ntra) BS来保证数据的精确定位和容错性能；同时详细分析了用户区域活动行为特点,提出一种基于区域感知的动态副本生成策略(RA-RCM)来改善数据访问性能。针对数据放置和副本生成策略设计了详细的定位算法和副本管理机制,用数学方法分析了RSA-HRing环境下该模型的访问开销,同时给出了节点失效对数据访问成功率影响的概率分析。仿真实验表明,如果合理控制簇节点规模和备份阈值,RA-RCM算法可以显著的节约数据定位跳数；Ⅰ (nter)-Ⅰ (ntra) BS能够有效应对节点的失效,尤其是在覆盖网层引入SNFT-RA算法后系统具有较好的数据容错能力。
(3)提出一种基于节点异构度的覆盖网络副本一致性维护方法(NHDCOM)。异构性是RSA-Store环境下节点的典型特征,现有的副本一致性维护算法对节点异构性缺乏考量,NHDCOM引入了节点能力度量参数-节点异构度,利用Chord环组织副本节点,提出一种基于节点指取表的环分割算法,理论分析证明该算法能够以较小的开销帮助更新源节点获得所有其他副本节点的异构度信息。结合节点异构度,给出了一种求解最小延迟更新内容树(minimum delay update-content tree)的问题模型,利用动态规划的方法提出一种启发式算法-MDUT-H。仿真实验表明,相较现有算法,在不同的节点异构度分布、副本文件大小以及节点规模等环境下,NHDCOM算法具有出色的效率和稳定性。
(4)提出一种基于虚拟服务器拆分的负载平衡算法(VSSLBA)。有效的负载平衡算法对RSA-Store系统数据的可用性和实时性将产生积极的影响。在物理节点上建立多个虚拟服务器并根据需要进行虚拟服务器迁移是目前DHT网络中经常采用的负载平衡方法,但这种方法存在单虚拟服务器问题(SVSP)。根据节点问间距的分布概率,建立了基于虚拟服务器的DHT网络负载分布数学模型,详细分析和计算了DHT网络中单虚拟服务器问题(SVSP)发生的概率,提出一种虚拟服务器拆分算法,该算法能够在解决SVSP问题的同时节约虚拟服务器维护开销。仿真实验结果表明,VSSLBA算法在有效解决SVSP问题的同时能够实现良好的负载平衡性能。
P2P computing technology breaks out the inherent defect of the traditional client/server service model with strong robustness and expansibility performance. Presently, with the information explosion growth in the Internet, using P2P technology to construct mass data distributed storage system has become one of the most attractive storage organization modes. The topological consistency, node dynamic, heterogeneity and autonomy of P2P computing environment are the key problems and difficulties which need to be considered when building distributed storage system. To take advantage of the free computing resources, storage resources and network resources of personal computers on Internet to construct a massive distributed storage system for massive users, this paper studies distributed storage technologies which have been widely adopted at present, analyzes the main problems when applying P2P technology to distributed storage system, discusses the basic theories and algorithms in detail for constructing a P2P-based storage system. To solve the real-time and fault-tolerance performance deficiencies of existing P2P storage systems, this paper introduces a novel distributed storage framework-Region Semantic Awareness Storage System, called RSA-Store, and studies in detail the corresponding components, including storage overlay network, data management model, replica consistency maintenance method and load balancing algorithm.
This paper puts forward a novel construction mechanism of P2P storage overlay network to improve network topological consistency. Existing researches improve topological consistency by measuring the network distances between nodes and then clustering those nodes into different groups. However, measuring network distances is instable and this method is easy to bring forward aggregation overhead. Based on regional semantic of the natural attributes of Internet structure, this paper establishes a hierarchical storage overlay network-RSA-HRing, and presents the topology maintenance mechanism, including a selection algorithm of super node and backup super nodes based on the combination of Push and Pull, and a robust algorithm-Super Node Failure Tolerance Algorithm, called SNFT-RA, to prevent the failure of super nodes. After that, an overlay network routing algorithm based on path vector (Path-Vetor) is proposed and the detailed implementation method has also been given. To overcome triangle inequality problem when using measurement metrics of traditional time delay and hop count, this routing algorithm introduces path vector to calculate network distances. Simulation results show that, RSA-HRing can significantly reduce the construction and maintenance costs of overlay network topology. In addition, P-V routing algorithm can greatly reduce the actual physical routing overhead while keeping the overlay network routing scale.
For RSA-HRing, this paper puts forward a novel data management model, which combines storage users'access behavior with regional activity characteristics. Based on the regional awareness, this data management model utilizes static data placement strategy I (nter)-I (ntra) BS to ensure data's accurate positioning and fault-tolerant performance. In the meantime, by analyzing behavior characteristics of the user regional activity, the model adopts a dynamic replica creation method RA-RCM to improve data access performance. By combining the data placement stratagy and replica creation method, this paper designs a localization algorithm and replica management mechanism in detail, and then uses mathematical method to analyze the access cost of this model in RSA-HRing and node failure influence on the data access success rate. Simulation results show that RA-RCM can save data positioning hop count significantly if cluster nodes scale and backup threshold are controlled reasonably. Moreover, I (nter)-I (ntra) BS can effectively deal with nodes failure, which enables the system has better data fault-tolerance, especially after introducing SNFT-RA.
This paper proposes a replica consistency maintenance method based on Node Heterogeneity Degree-NHDCOM. Node heterogeneity is a typical feature in RSA-Store environment. Existing replica consistency maintenance algorithms are lack of consideration of node heterogeneity. NHDCOM introduces Node Heterogeneity Degree to denote node capability, organizes replica node with Chord protocol, and proposes a ring splitting algorithm based on node finger table. Theoretical analysis proves that this algorithm can help the source node to acquire other replica nodes' NHDs at less cost. Then, this paper describes a problem model to solve minimum delay update-content tree and proposes a heuristic algorithms-MDUT-H with NHD. Simulation results show that NHDCOM has excellent efficiency and stability performance compared to existing algorithms.
This paper puts forward a novel VS-split load balance algorithm-VSSLBA. The usually adopted load balance method is to create several virtual servers (VS) on one physical node on demand, which results in single virtual server problem-SVSP. According to the probability distribution of nodes' interval in DHT-based overlay network, this paper proposes a load distribution model, then analyses and calculates probability of SVSP occurrence in detail. After that, a VS-split algorithm, which can not only solve SVSP but also save overhead of maintaining virtual servers is proposed. Simulation results show that VSSLBA can effectively solve SVSP and achieve better load balance performance.
(1)提出一种新的存储覆盖网络构建机制来改善P2P网络中的拓扑一致性问题。拓扑一致性问题严重制约了存储系统的性能,现有研究通过测量节点之间的网络距离并在此基础上对节点进行分组来改善这种影响,通过网络距离进行分组的方法具有不稳定性和带来大量的聚集开销。针对上述问题,利用Internet结构的自然属性建立一个基于区域语义的层次覆盖网络(RSA-HRing),给出了相应的拓扑维护机制,设计了基于推(Push)拉(Pull)相结合的超节点及其备份节点的选取算法,提出一种预防超节点失效的鲁棒性算法SNFT-RA。在此基础上针对现有网络距离测量方法中采用时延和跳数度量容易带来三角不等式问题,详细描述和分析了通过路径矢量测量网络距离的思想,并将其应用到覆盖网络的路由算法中,提出了一种基于路径矢量(Path-Vector)的覆盖网络路由算法(PVRA)。仿真实验表明,RSA-HRing能显著降低覆盖网络拓扑构建和维护开销PVRA具有较好的路由性能,能够在保持覆盖网络路由规模的同时显著节约实际物理路由开销。
(2)结合存储用户访问行为和区域活动特点,在RSA-HRing网络中提出一种基于区域感知的数据管理模型。基于区域感知的数据管理模型采用静态的数据放置策略Ⅰ (nter)-Ⅰ(ntra) BS来保证数据的精确定位和容错性能；同时详细分析了用户区域活动行为特点,提出一种基于区域感知的动态副本生成策略(RA-RCM)来改善数据访问性能。针对数据放置和副本生成策略设计了详细的定位算法和副本管理机制,用数学方法分析了RSA-HRing环境下该模型的访问开销,同时给出了节点失效对数据访问成功率影响的概率分析。仿真实验表明,如果合理控制簇节点规模和备份阈值,RA-RCM算法可以显著的节约数据定位跳数；Ⅰ (nter)-Ⅰ (ntra) BS能够有效应对节点的失效,尤其是在覆盖网层引入SNFT-RA算法后系统具有较好的数据容错能力。
(3)提出一种基于节点异构度的覆盖网络副本一致性维护方法(NHDCOM)。异构性是RSA-Store环境下节点的典型特征,现有的副本一致性维护算法对节点异构性缺乏考量,NHDCOM引入了节点能力度量参数-节点异构度,利用Chord环组织副本节点,提出一种基于节点指取表的环分割算法,理论分析证明该算法能够以较小的开销帮助更新源节点获得所有其他副本节点的异构度信息。结合节点异构度,给出了一种求解最小延迟更新内容树(minimum delay update-content tree)的问题模型,利用动态规划的方法提出一种启发式算法-MDUT-H。仿真实验表明,相较现有算法,在不同的节点异构度分布、副本文件大小以及节点规模等环境下,NHDCOM算法具有出色的效率和稳定性。
(4)提出一种基于虚拟服务器拆分的负载平衡算法(VSSLBA)。有效的负载平衡算法对RSA-Store系统数据的可用性和实时性将产生积极的影响。在物理节点上建立多个虚拟服务器并根据需要进行虚拟服务器迁移是目前DHT网络中经常采用的负载平衡方法,但这种方法存在单虚拟服务器问题(SVSP)。根据节点问间距的分布概率,建立了基于虚拟服务器的DHT网络负载分布数学模型,详细分析和计算了DHT网络中单虚拟服务器问题(SVSP)发生的概率,提出一种虚拟服务器拆分算法,该算法能够在解决SVSP问题的同时节约虚拟服务器维护开销。仿真实验结果表明,VSSLBA算法在有效解决SVSP问题的同时能够实现良好的负载平衡性能。
P2P computing technology breaks out the inherent defect of the traditional client/server service model with strong robustness and expansibility performance. Presently, with the information explosion growth in the Internet, using P2P technology to construct mass data distributed storage system has become one of the most attractive storage organization modes. The topological consistency, node dynamic, heterogeneity and autonomy of P2P computing environment are the key problems and difficulties which need to be considered when building distributed storage system. To take advantage of the free computing resources, storage resources and network resources of personal computers on Internet to construct a massive distributed storage system for massive users, this paper studies distributed storage technologies which have been widely adopted at present, analyzes the main problems when applying P2P technology to distributed storage system, discusses the basic theories and algorithms in detail for constructing a P2P-based storage system. To solve the real-time and fault-tolerance performance deficiencies of existing P2P storage systems, this paper introduces a novel distributed storage framework-Region Semantic Awareness Storage System, called RSA-Store, and studies in detail the corresponding components, including storage overlay network, data management model, replica consistency maintenance method and load balancing algorithm.
This paper puts forward a novel construction mechanism of P2P storage overlay network to improve network topological consistency. Existing researches improve topological consistency by measuring the network distances between nodes and then clustering those nodes into different groups. However, measuring network distances is instable and this method is easy to bring forward aggregation overhead. Based on regional semantic of the natural attributes of Internet structure, this paper establishes a hierarchical storage overlay network-RSA-HRing, and presents the topology maintenance mechanism, including a selection algorithm of super node and backup super nodes based on the combination of Push and Pull, and a robust algorithm-Super Node Failure Tolerance Algorithm, called SNFT-RA, to prevent the failure of super nodes. After that, an overlay network routing algorithm based on path vector (Path-Vetor) is proposed and the detailed implementation method has also been given. To overcome triangle inequality problem when using measurement metrics of traditional time delay and hop count, this routing algorithm introduces path vector to calculate network distances. Simulation results show that, RSA-HRing can significantly reduce the construction and maintenance costs of overlay network topology. In addition, P-V routing algorithm can greatly reduce the actual physical routing overhead while keeping the overlay network routing scale.
For RSA-HRing, this paper puts forward a novel data management model, which combines storage users'access behavior with regional activity characteristics. Based on the regional awareness, this data management model utilizes static data placement strategy I (nter)-I (ntra) BS to ensure data's accurate positioning and fault-tolerant performance. In the meantime, by analyzing behavior characteristics of the user regional activity, the model adopts a dynamic replica creation method RA-RCM to improve data access performance. By combining the data placement stratagy and replica creation method, this paper designs a localization algorithm and replica management mechanism in detail, and then uses mathematical method to analyze the access cost of this model in RSA-HRing and node failure influence on the data access success rate. Simulation results show that RA-RCM can save data positioning hop count significantly if cluster nodes scale and backup threshold are controlled reasonably. Moreover, I (nter)-I (ntra) BS can effectively deal with nodes failure, which enables the system has better data fault-tolerance, especially after introducing SNFT-RA.
This paper proposes a replica consistency maintenance method based on Node Heterogeneity Degree-NHDCOM. Node heterogeneity is a typical feature in RSA-Store environment. Existing replica consistency maintenance algorithms are lack of consideration of node heterogeneity. NHDCOM introduces Node Heterogeneity Degree to denote node capability, organizes replica node with Chord protocol, and proposes a ring splitting algorithm based on node finger table. Theoretical analysis proves that this algorithm can help the source node to acquire other replica nodes' NHDs at less cost. Then, this paper describes a problem model to solve minimum delay update-content tree and proposes a heuristic algorithms-MDUT-H with NHD. Simulation results show that NHDCOM has excellent efficiency and stability performance compared to existing algorithms.
This paper puts forward a novel VS-split load balance algorithm-VSSLBA. The usually adopted load balance method is to create several virtual servers (VS) on one physical node on demand, which results in single virtual server problem-SVSP. According to the probability distribution of nodes' interval in DHT-based overlay network, this paper proposes a load distribution model, then analyses and calculates probability of SVSP occurrence in detail. After that, a VS-split algorithm, which can not only solve SVSP but also save overhead of maintaining virtual servers is proposed. Simulation results show that VSSLBA can effectively solve SVSP and achieve better load balance performance.
引文
[1]P. N. Yianilos, S. Sobti. The Evolving Field of Distributed Storage. In:IEEE Internet Computing. Los Alamitos:IEEE Computer Society,2001,35-39
[2]张江陵,冯丹.海量信息存储.北京：科学出版社,2000,95-107
[3]Farley, M. SAN.存储区域网络(孙功星等译).北京：机械工业出版社,2001
[4]Russel Sandberg. The Sun Network Filesystem:Design, Implementation and Experience. In:Proc of the 1987 Summer Usenix Conference. Berkeley: University of California Press,1987,300-314
[5]AIX Systems Support Center. AFS distributed filesystem FAQ. IBM UK,1998
[6]Sidebotham. B.Volumes:The Andrew File System Data Structuring Primitive. Technical Report CMU-ITC-053, Carnegie Melon University,1986
[7]J. J. Kistler, M. Satyanarayanan. Disconnected operation in the coda filesystem. ACM Transactions on Computer Systems,1992,10(1):3-25
[8]G. Burns, R. Daoud, J. Vaigl. LAM:An open cluster environment for MPI. In:Proc of Supercomputing Symposium'94.Toronto,1994
[9]M. A. Baker, G. C. Fox, H. W. Yau. Cluster Computing Review. http://surface. syr.edu/npac/33,1995
[10]Burns, M. George, Wallace B. Modeling and Simulative Performance Analysis of SMP and Clustered Computer Architectures. Simulation. February 2000
[11]A. Merchant, P. S. Yu.Design and Modeling of Clustered RAID. In:Proc of the International Symposium on Fault-Tolerant Computing.Boston,1992,140-149
[12]Brian Pawlowski, Chet Juszczak, Peter Staubach, et al. PVFS:A Parallel File System For Linux Clusters. In:Proc of the 4th Annual Linux Showcase and Conference.Atlanta,2000,317-327
[13]Hakan Taki, Gil Utard. MPI-IO on a Parallel File System for Cluster of Workstations.Cluster Computing.In:Proc of 1st IEEE Computer Society International Workshop on Cluster Computing.Melbourne:IEEE,1999,150-157
[14]Steven R. Soltis, Thomas M, Matthew T.The Global File System.In:Proc of the 5th NASA Goddard Conference on Mass Storage Systems and Technologies. Maryland:IEEE Computer Society,1996
[15]Wikipedia.http://en.wikipedia.org/wiki/Lustre_(file_system),2012-11-26
[16]GHEMAWAT, S., GOBIOFF, H., LEUNG, S.-T. The Google file system. In Proc. of the 200319th ACM Symposium on Operating System Principles.New York:ACM Press,2003,29-43
[17]I.Foster, C.Kesselman. The Grid:Blueprint for a New Computing Infrastructure. Burlington:Morgan Kaufmann Publishers,1999
[18]I. Foster, C. Kesselman, J. Tedesco, et al. GASS:A Data Movement and Access Service for Wide Area Computing Systems. In:Proc of the Sixth workshop on I/O in Parallel and Distributed Systems.New York:ACM Press,1999,77-88
[19]J. S. Plank, M. Beck, W. Elwasif, et al. The Internet Backplane Protocol: Storage in the network. In NetStore'99:Network Storage Symposium. Seattle: Internet2,1999
[20]A. Chervenak, I. Foster, C. Kesselman, et al. The Data Grid:Towards an Architecture for the Distributed Management and Analysis of Large Scientic Datasets Journal of Network and Computer Applications,2000,23(3):187-200
[21]Chaitanya Baru, Reagan Moore, Arcot Rajasekar, et al.The SDSC Storage Resource Broker. In:Proc. CASCON'98 Conference.Canada:IBM Press,1998, 5-17
[22]Jiyi Wu, Lingdi Ping. Cloud Storage as the Infrastructure of Cloud Computing. In:2010 IEEE International Conference on Intelligent Computing and Cognitive Informatics.Kuala Lumpur:IEEE,2010,380-383
[23]M.Armbrust, A. Fox, R.Griffith.A view of cloud computing. Communications of the ACM,2010,53(4):50-58
[24]Wenying Zeng, Yuelong Zhao.Research on cloud storage architecture and key technologies.In:Proc of the 2nd International Conference on Interaction Sciences:Information Technology, Culture and Human.New York:ACM Press, 2009,1044-1048
[25]吴吉义,傅建庆,平玲娣.一种对等结构的云存储系统研究.电子学报,2011,39(5)：1100-1107
[26]Qinlu He, Zhanhuai Li Xiao Zhang. Study on Cloud Storage System Based on Distributed Storage Systems.In:2010 International Conference on Computational and Information Sciences(ICCIS).Chengdu:IEEE Computer Society,2010,1332-1335
[27]R Sravan Kumar, A Saxena.Data integrity proofs in cloud storage. In:2011 Third International Conference on Communication Systems and Networks (COMSNETS). Bangalore:IEEE,2011,1-4
[28]Wang C, Wang Q, Ren K, et al.Towards Secure and Dependable Storage Services in Cloud Computing. IEEE Transactions on Services Computing,2011, 2(12):1-7
[29]Sabahi, F.Cloud computing security threats and responses. In:2011 IEEE 3rd International Conference on Communication Software and Networks(ICCSN). Xi'an:IEEE Computer Society,2011,245-249
[30]Li B, He YT, Xu K.Distributed metadata management scheme in cloud computing. In:20116th International Conference on Pervasive Computing and Applications (ICPCA). Port Elizabeth:IEEE Computer Society,2011,32-38
[31]Mastroeni L, Naldi M.Long-range Evaluation of Risk in the Migration to Cloud Storage., In:2011 IEEE 13th Conference on Commerce and Enterprise Computing (CEC). Luxembourg:IEEE Computer Society,2011,260-266
[32]Kari C, KimY-A, RussellA.Data Migration in Heterogeneous Storage Systems.In:Proc of the 201131st International Conference on Distributed Computing Systems..Minneapolis:IEEE Computer Society,2011,143-150
[33]Jie Z, T. S. EN, Kunwadee S. Workload-Aware Live Storage Migration for Clouds.ACM Sigplan Notices,2011,2(21):133-144
[34]Jindarak K, UthayopasP.Performance improvement of cloud storage using a genetic algorithm based placement.In:2011 Eighth International Joint Conference on Computer Science and Software Engineering(JCSSE).Nakhon Pathom:IEEE Computer Socity,2011,54-57
[35]Bonvin N, Papaioannou TG, Aberer K.A self-organized, fault-tolerant and scalable replication scheme for cloud storage.In:Proc of the 1st ACM symposium on Cloud computing.ACM Press,2011,205-216
[36]Lluis PJ, Pedro GL, Marc SA, et al.Towards the design of optimal data redundancy schemes for heterogeneous cloud storage infrastructures. Journal of Computer Networks,2011,2(43):1100-1113
[37]Hyun-chul Kim. P2P Overview.Tech Report, Korea Advanced Institute of Science and Technology,2001.
[38]陈贵海,李振华.对等网络：结构、应用与设计.北京：清华大学出版社,2007
[39]Stoica I, Morris R, Karger D, et al.Chord:A scalable peer-to-peer lookup service for internet applications. In:Proc of the ACM SIGCOMM'01 Conference on Applications, technologies, architectures, and protocols for computer communications, San Diego:ACM Press,2001,149-160
[40]Dabek F, Kaashoek MF, Karger D, et al.Wide-area Cooperative Storage with CFS. In:Proc. Of the 18th ACM Symp. On Operating System Principles(SOSP). Banff:ACM Press,2001,202-215
[41]Zhao BY, Kubiatowicz JD, Joseph AD.Tapestry:An Infrastructure for Fault-tolerant Wide-area Location and Routing. U. C. Berkeley Technical Report UCB//CSD-01-1141, Berkeley:2001,329-350
[42]Kubiatowicz, David Bindel, Yan Chen, et al.OceanStore:An Architecture forGlobal-Scale Persistent Storage. In:Proc of the Ninth international Conferenceon Architectural Support for Programming Languages and Operating Systems(ASPLOS).Cambridge:ACM Press,2000,190-201
[43]A. Rowstron and P. Druschel. Pastry:Scalable, distributed object location and routing for large-scale peer-to-peer systems. In:IFIP/ACM International Conference on Distributed Systems Platforms (Middleware). Heidelberg:2001, 329-350
[44]P. Druschel, A. Rowstron.PAST:A large-scale, persistent peer-to-peer storage utility.In:Proc of the Eighth Workshop on Hot Topics in Operating Systems.Schoss Elmau:USENIX Association,2001,75-80
[45]S. Rhea, P. Eaton, D. Geels, et al. Pond:the OceanStore prototype.In:Proc. Of USENIX FAST,2003,1-14
[46]Weatherspoon H, Eaton P, Chun BG.Antiquity:Exploiting a Secure Log for Wide-Area Distributed Storage.In:Proc of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems, Lisbon:ACM Press,2007,371-384
[47]Chun BG, F Dabek, A Haeberlen,et al. Efficient replica maintenance for distributed storage systems. In:Proc. of USENIX Symposium on Networked Systems Design and Implementation (NSDI).San Jose:USENIX,2006,45-58
[48]Stribling J,Councill IG,Li JY.OverCite:A Cooperative Digital Research Library. In:Proc. of the 4th International Workshop on Peer-to-Peer Systems. Ithaca:Springer Berlin Heidelberg,2005,69-79
[49]Zheng W, J Hu,etal. Granary:architecture of object oriented Internet storage service.In:IEEE International Conference on E-Commerce Technology for DynamicE-Business.Beij ing:IEEE Computer Society,2004,294-297
[50]Hu J, M Li, W Zheng,etal. SmartBoa:Constructing p2p Overlay Network in the Heterogeneous Internet UsingIrregular Routing Tables.In:Proc. of the 3rd International Workshop on Peer-to-Peer Systems,La Jolla:Springer Berlin Heidelberg,2004,278-287
[51]魏青松.大规模分布式存储技术研究：[博士学位论文].西安：电子科技大 学,2004
[52]周旭.面向Internet的大规模分布式存储技术研究：[博士学位论文].西安：电子科技大学,2004
[53]候孟书.基于P2P的分布式存储及其相关技术研究：[博士学位论文].西安：电子科技大学,2005
[54]韩华.面向Internet的分布式海量文件系统：[博士学位论文].北京：北京大学,2001
[55]D. G. Andersen, H. Balakrishnan, M. Kaashoek, et al.Resilient overlay networks. In:Proc.18th ACM SOSP.New York:ACM,2001,131-145
[56]Ripeanu, M.Peer-to-Peer Architecture Case Study:Gnutella Network.In:Proc of 2001 International Conference on Peer-to-peer Computing (P2P2001). Linkoping:IEEE Computer Society,2001,99-100
[57]Matei Ripeanu, Ian Foster, Adriana Iamnitchi.Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems.Peer-to-Peer Systems Lecture Notes in Computer Science 2002,2429,85-93
[58]Y. Chawathe, S. Ratnasamy, L. Breslau, et al.Making Gnutella-like P2P systems scalable. In:Proc of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications. New York: ACM2003,407-418
[59]罗文杰.Peer-to-Peer(P2P)综述http://docs.huihoo.com/p2p/1/index.html. 2005-11-5
[60]Eng Keong, Lua, Jon Crowcroft, et al.A Survey and Comparison of Peer-to-Peer Overlay Network Schemes.IEEE Communications Survey and Tutorial,2005, 7(2):72-93
[61]Sylvia Ratnasamy, Paul Francis, Mark Handley, et al.A Scalable Content Addressable Network.In:SIGCOMM'01.New York:ACM,2001,161-172
[62]C.S. Lewis, J. Saia.Scalable Byzantine Agreement. Technical Report, University of New Mexico,2004
[63]L.Lamport, R.Shostak, M.Pease.The Byzantine Generals Problem.ACM TOPLAS,1982,4(3):382-401
[64]Ramarkrishna Kotla, Lorenzo Alvisi, Mike Dahlin, et al.Zyzzyva:Speculative Byzantine Fault Tolerance.In:Proc of twenty-first ACM SIGOPS symposium on Operating systems principles.New York:ACM,2007,45-58
[65]CASTRO, M.AND LISKOV, B.Practical Byzantine Fault Tolerance and Proactive Recovery.ACM Transactions on Computer Systems.2002,20(4): 398-461
[66]Kong L, et al.Agile Store:Experience with Quorum-based Data Replication Techniques for Adaptive Byzantine Fault Tolerance. In:IEEE Symposium on Reliable Distributed Systems. Orlando,2005,143-154
[67]Zhang Z, Lian Q.Reperasure:Replication Protocol using Erasure-code in Peer-to-Peer Storage Network. In:21st IEEE Symposium on Reliable Distributed Systems. Washington DC,2002,330-335
[68]J. Cowling, D. Myers, B. Liskov, et al.HQ replication:A hybrid quorum protocol for byzantine fault tolerance.In:OSDI'06 Proc of the 7th symposium on Operating systems design and implementation.Berkeley:USENIX Association 2006,177-190
[69]Kim J M, Manabe Y.A Byzantine Fault Tolerant Mutual Exclusion Algorithm and its Application to Byzantine Fault Tolerant Storage Systems.In:25th IEEE Conference on Distributed Computing Systems Workshops.Washington:IEEE Computer Society,2005,12-19
[70]R. Bazzi, Y. Ding.Non-skipping timestamps for Byzantine data storage systems. In:Proc of the 18th International Symposium on Distributed Computing. Amsterdam.Springer-Verlag,2004,405-419
[71]R. Rodrigues.Robust Services in Dynamic Systems[PhD thesis], MIT,2005
[72]C. Cachin, S. Tessaro.Optimal resilience for erasure-coded Byzantine distributed storage.In:Proc of the International Conference on Dependable Systems and Networks.IEEE Computer Society.Philadelphia:IEEE Computer Society2006,115-124
[73]Kotla R, Dahlin M.High throughput byzantine fault tolerance.In:Proc of the International Conference on Dependable Systems and Networks.IEEE Computer Society.Florence:IEEE Computer Society,2004,575-584
[74]Sukun Kim.Efficient Erasure Code for Wireless Sensor Networks,2004.
[75]Mitzenmacher, M.Digital fountains:a survey and look forward. In:Information Theory Workshop.San Antonio:IEEE,2004,271-276
[76]Plank, JS.A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems.Software Practice and Experience.1997,27(9):995-1012
[77]Lin, WK, DM Chiu, et al.Erasure code replication revisited.In:Proc. of Fourth International Conference on Peer-to-Peer Computing.2004,90-97
[78]Ratnasamy S, Handley M, Karp R, et al.Topologically aware overlay construction and server selection.In:Proc of the 21 stInternational Conference on IEEE Computer and Communications Societies. New York,2002,1190-1199
[79]Guyton J D, Schwartz M F.Locating nearby copies of replicated Internet servers.In:SIGCOMM'95 Proc of the conference on Applications, technologies, architectures, and protocols for computer communication.New York:ACM.1995, 288-298
[80]Francis P, Jamin S, Cheng J, et al.IDMaps:a global Internet host distance estimation service. IEEE/ACM Trans on Networking.2001,9 (5):525-540
[81]Yan Chen, Khian Hao Lim, Randy H.Katz et al. On the stability of network distance estimation.ACM SIGMETR ICS Performance Evaluation Review,2002, 30 (2):21-30
[82]Hyuk Lim, Jennifer C, Chong-Ho Choi. Constructing Internet coordinate system based on delaymeasurement.In:Proc of ACM SIGCOMM Conference on Internet Measurement,2003:129-142
[83]T.S.Eugene Ng, Hui Zhang.Predicting internet network distance with coordinates-based approaches. In:Proc of the 21st International Conference on IEEE Computer and Communications Societies,2002:170-179
[84]Nelder J A, Mead, R. A simp lexmethod for function minimization.The Computer Journal,1965,7 (4):308-313
[85]Liying Tang, Mark Crovella. Virtual landmarks for the Internet.In:Proc of the 3rd ACM SIGCOMM Conference on Internet Measurement. New York,2003: 143-152
[86]Mao Y, Saul L K, Smith JM. IDES:an Internet distance estimation service for large networks. IEEE Journal on Selected Areas in Communications,2006,24 (12):2273-2284
[87]李广华,朱志祥.结构化Chord算法改进.西安邮电学院学报,2009,14(3)：38-40
[88]李京文,熊焰,高燕.Ca-Chord:基于主从环的Chord路由算法.计算机工程,2009,35(11)：107-122
[89]符云清,王兴芹.基于物理拓扑的改进Chord模型.计算机工程,2012,38(6)：98-100
[90]Group of Prof.Zitterbart.Oversim, http://www.oversim.org,2012
[91]Alberto Medina, Anukool Lakhina. Brite, http://www.cs.bu.edu/brite/,2012
[92]闫晓东,徐惠民,徐雅静等.基于价值模型的数据副本替换算法.北京邮电大学学报,2006,29(4)：41-44
[93]李静,陈蜀宇,吴长泽.一种基于安全的网络数据副本策略模型.计算机应 用,2006,26(10)：2282-2284
[94]侯孟书,王晓斌.一种新的动态副本管理机制.计算机科学,2006,33(9)：50-51
[95]周旭,卢显良.频率自适应的动态副本管理机制.计算机科学,2005,32(2)：133-136
[96]魏青书,卢显良,侯孟书.自适应副本管理机制.计算机科学,2004,31(12)：34-36
[97]Bartal, Fia, Rabani.Competitive algorithms for distributed data management. Journal of Computer and System Sciences.1995,51(3):341-358
[98]Wolfson O, Huang Y. A Competitive Dynamic Data Replication Algorithm. In: Proc of Ninth International Data Engineering Conference.Vienna,1993: 310-317
[99]Swarup Acharya, Stanley B. Zdonik. An Efficient Scheme for Dynamic Data Replication. Technical Report,1993
[100]李振宇,谢高岗,李忠诚.PATCOM:基于分割树的无结构P2P系统一致性维护方法.计算机学报,2007,30(9)：1500-1510
[101]CHEN X, REN S S, WANG H N. SCOPE:scalable consistency maintenance in structured P2P systems.In:Proc of IEEE Infocom 2005. Washington,2005, 1502-1513
[102]WANG Y. Maintaining replica consistency using replica information broadcast tree in P2P storage system. In:International Conference on Research Challenges in Computer Science. Shanghai,2009
[103]ELKIN M, KORTSARZ G. A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem.In:Proc of the Annual ACM Symp on Theory of Computing. Montreal,2002.438-447
[104]MATEI R. Peer-to-Peer Architecture Case Study:Gnutella Network.In:First International Conference on Peer-to-Peer Computing.Linkoping:IEEE Computer Society,2001,99-100
[105]谢鲲,张大方,谢高岗等.基于轨迹标签的无结构P2P副本一致性维护算法.软件学报,2007,18(1)：105-111
[106]LAN J, LIU X T, SHENOY P. Consistency maintenance in peer-to-peer file sharing networks.In:Proc of the 3rd IEEE Workshop on Interact Applications. Washington,2002,90-94
[107]Datta A, Hauswirth M, Aberer K. Updates in highly unreliable, replicated Peer-to-Peer systems.In:Proc of the 23rd International Conference on Distributed Computing Systems. Washington,2003,76-85
[108]郭晓梅,李仁发,文吉刚等.基于P2P网络环境下的副本一致性维护算法.计算机科学,2009,36(1)：43-45
[109]蒋试伟,欧阳松.基于副本索引的P2P副本一致性维护策略.计算机工程,2008,34(19)：123-126
[110]WANG Z J, DAS S K, KUMAR M. Update propagation through replica chain in decentralized and unstructured P2P systems. In:Proc of the 4th International Conf. on Peer-to-Peer Computing. Washington,2004,64-71
[111]苏长根,欧阳松.P2P系统中基于副本链的一致性维护算法.计算机工程,2008,34(18)：145-150
[112]曹佳,鲁士文.应用层组播的最小延迟生成树算法.软件学报,2005,16(10)：1766-1773
[113]SALAMA H F, REEVES D S, VINIOTIS Y. The delay-constrained minimum spanning tree problem. In:Proc of the 2nd IEEE Symp on Computers and Communications. Alexandria,1997.699-703
[114]TAN S W, WATERS G, CRAWFORD J. A Survey and Performance Evaluation of Scalable Tree-Based Application Layer Multicast Protocol. Canterbury: University of kent,2003
[115]BROASH E, SHAVITT Y. Approximation and heuristic algorithms for minimum delay application-layer multicast trees. In:Proc of 2004 IEEE Conference on Computer and Communications.2004,2697-2707
[116]BELL W H, CAMERON D G, CAPOZZA L,et al. Optorsim:A grid simulator for studying dynamic data replication strategies. International Journal of High Performance Computing Applications,2003,17(4):403-416
[117]Ananth Rao, Karthik Lakshminarayanan, Sonesh Surana, et al. Load Balancing in Structured P2P Systems. In:Proc IPTPS.Berkeley.Springer Berlin Heidelberg, 2003,68-79
[118]B. Godfrey, K. Lakshminarayanan, S. Surana, et al. Stoica.Load balancing in dynamic structured P2P systems.In:Proc of IEEE INFOCOM,2004,2253-2262
[119]P. Godfrey, I. Stoica.Heterogeneity and load balance in distributed hash tables. In:Proc of IEEE INFOCOM. Miami:IEEE Communications Society,2005, 596-606
[120]Yingwu Zhu, Yiming Hu.Efficient, Proximity-Aware Load Balancing for DHT-Based P2P Systems.IEEE Transactions on Parallel and Distributed Systems,2005,16(4):349-361
[121]WANG XiaoHai, PENG YuXing, LI Dong Sheng. An efficient load balancing method for constant degree P2P systems.In:2010 International Conference on Computer Design and Applications (ICCDA). Qinhuangdao,2010,25-27
[122]Hung-Chang Hsiao and Hao Liao, Load Balance with Imperfect Information in Structured Peer-to-Peer Systems.IEEE Transactions on Parallel and Distributed Systems,2011,22(4):634-649
[123]A.Gupta, D.Agrawal, A.El Abbadi.Approximate range selection queries in peer-to-peer systems.In Proc of the First Biennial Conference on Innovative Data Systems Research. Asilomar:ACM Press 2003
[124]M. Cai, M.Frank, J.Chen, et al.MAAN:A Multi-Attribute Addressable Network for Grid Information Services, Journal of Grid Computing,2004,2(1):3-14
[125]Maymounkov P, Mazieres D. Kademlia:A peer-to-peer information system based On the XOR metric.In:Proc of the 1st International Workshop on Peer-to-Peer Systems(IPTPS'O2),2002,53-65
[126]Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell, et al. An analytical study of a structured overlay in the presence o f dynamic membership. IEEE/ACM Transactions on Networking,2008,16(4):814-825
[127]聂晓文,卢显良,周旭等.DH算法基本统计特性及应用.四川大学学报(工程科学版),2009,41(5)：170-175
[128]聂晓文,卢显良,孟江涛等.一类DHT算法中负载的概率分布.计算机应用研究,2009,26(10)：3763-3766
[129]肖波,聂晓文,侯孟书.DHT网络规模估计算法的定量分析与设计.电子科技大学学报,2011,40(2)：261-266
[130]聂晓文.DHT覆盖网若干基础性问题研究：[博士学位论文].西安：电子科技大学,2009,37-45
[131]F. E. Bustamante, Y Qiao, Friendships that last:peer lifespan and its role in P2P protocols, In:Web content caching and distribution. Proc of the 8th international workshop:Kluwer Academic Publishers,2004,233-246
[132]D. Stutzbach, R. Rejaie. Understanding chum in peer-to-peer networks. In:Proc of the 6th ACM SIGCOMM conference on internet measurement Rio de Janeriro.Brazil:ACM,2006,89-202
[2]张江陵,冯丹.海量信息存储.北京：科学出版社,2000,95-107
[3]Farley, M. SAN.存储区域网络(孙功星等译).北京：机械工业出版社,2001
[4]Russel Sandberg. The Sun Network Filesystem:Design, Implementation and Experience. In:Proc of the 1987 Summer Usenix Conference. Berkeley: University of California Press,1987,300-314
[5]AIX Systems Support Center. AFS distributed filesystem FAQ. IBM UK,1998
[6]Sidebotham. B.Volumes:The Andrew File System Data Structuring Primitive. Technical Report CMU-ITC-053, Carnegie Melon University,1986
[7]J. J. Kistler, M. Satyanarayanan. Disconnected operation in the coda filesystem. ACM Transactions on Computer Systems,1992,10(1):3-25
[8]G. Burns, R. Daoud, J. Vaigl. LAM:An open cluster environment for MPI. In:Proc of Supercomputing Symposium'94.Toronto,1994
[9]M. A. Baker, G. C. Fox, H. W. Yau. Cluster Computing Review. http://surface. syr.edu/npac/33,1995
[10]Burns, M. George, Wallace B. Modeling and Simulative Performance Analysis of SMP and Clustered Computer Architectures. Simulation. February 2000
[11]A. Merchant, P. S. Yu.Design and Modeling of Clustered RAID. In:Proc of the International Symposium on Fault-Tolerant Computing.Boston,1992,140-149
[12]Brian Pawlowski, Chet Juszczak, Peter Staubach, et al. PVFS:A Parallel File System For Linux Clusters. In:Proc of the 4th Annual Linux Showcase and Conference.Atlanta,2000,317-327
[13]Hakan Taki, Gil Utard. MPI-IO on a Parallel File System for Cluster of Workstations.Cluster Computing.In:Proc of 1st IEEE Computer Society International Workshop on Cluster Computing.Melbourne:IEEE,1999,150-157
[14]Steven R. Soltis, Thomas M, Matthew T.The Global File System.In:Proc of the 5th NASA Goddard Conference on Mass Storage Systems and Technologies. Maryland:IEEE Computer Society,1996
[15]Wikipedia.http://en.wikipedia.org/wiki/Lustre_(file_system),2012-11-26
[16]GHEMAWAT, S., GOBIOFF, H., LEUNG, S.-T. The Google file system. In Proc. of the 200319th ACM Symposium on Operating System Principles.New York:ACM Press,2003,29-43
[17]I.Foster, C.Kesselman. The Grid:Blueprint for a New Computing Infrastructure. Burlington:Morgan Kaufmann Publishers,1999
[18]I. Foster, C. Kesselman, J. Tedesco, et al. GASS:A Data Movement and Access Service for Wide Area Computing Systems. In:Proc of the Sixth workshop on I/O in Parallel and Distributed Systems.New York:ACM Press,1999,77-88
[19]J. S. Plank, M. Beck, W. Elwasif, et al. The Internet Backplane Protocol: Storage in the network. In NetStore'99:Network Storage Symposium. Seattle: Internet2,1999
[20]A. Chervenak, I. Foster, C. Kesselman, et al. The Data Grid:Towards an Architecture for the Distributed Management and Analysis of Large Scientic Datasets Journal of Network and Computer Applications,2000,23(3):187-200
[21]Chaitanya Baru, Reagan Moore, Arcot Rajasekar, et al.The SDSC Storage Resource Broker. In:Proc. CASCON'98 Conference.Canada:IBM Press,1998, 5-17
[22]Jiyi Wu, Lingdi Ping. Cloud Storage as the Infrastructure of Cloud Computing. In:2010 IEEE International Conference on Intelligent Computing and Cognitive Informatics.Kuala Lumpur:IEEE,2010,380-383
[23]M.Armbrust, A. Fox, R.Griffith.A view of cloud computing. Communications of the ACM,2010,53(4):50-58
[24]Wenying Zeng, Yuelong Zhao.Research on cloud storage architecture and key technologies.In:Proc of the 2nd International Conference on Interaction Sciences:Information Technology, Culture and Human.New York:ACM Press, 2009,1044-1048
[25]吴吉义,傅建庆,平玲娣.一种对等结构的云存储系统研究.电子学报,2011,39(5)：1100-1107
[26]Qinlu He, Zhanhuai Li Xiao Zhang. Study on Cloud Storage System Based on Distributed Storage Systems.In:2010 International Conference on Computational and Information Sciences(ICCIS).Chengdu:IEEE Computer Society,2010,1332-1335
[27]R Sravan Kumar, A Saxena.Data integrity proofs in cloud storage. In:2011 Third International Conference on Communication Systems and Networks (COMSNETS). Bangalore:IEEE,2011,1-4
[28]Wang C, Wang Q, Ren K, et al.Towards Secure and Dependable Storage Services in Cloud Computing. IEEE Transactions on Services Computing,2011, 2(12):1-7
[29]Sabahi, F.Cloud computing security threats and responses. In:2011 IEEE 3rd International Conference on Communication Software and Networks(ICCSN). Xi'an:IEEE Computer Society,2011,245-249
[30]Li B, He YT, Xu K.Distributed metadata management scheme in cloud computing. In:20116th International Conference on Pervasive Computing and Applications (ICPCA). Port Elizabeth:IEEE Computer Society,2011,32-38
[31]Mastroeni L, Naldi M.Long-range Evaluation of Risk in the Migration to Cloud Storage., In:2011 IEEE 13th Conference on Commerce and Enterprise Computing (CEC). Luxembourg:IEEE Computer Society,2011,260-266
[32]Kari C, KimY-A, RussellA.Data Migration in Heterogeneous Storage Systems.In:Proc of the 201131st International Conference on Distributed Computing Systems..Minneapolis:IEEE Computer Society,2011,143-150
[33]Jie Z, T. S. EN, Kunwadee S. Workload-Aware Live Storage Migration for Clouds.ACM Sigplan Notices,2011,2(21):133-144
[34]Jindarak K, UthayopasP.Performance improvement of cloud storage using a genetic algorithm based placement.In:2011 Eighth International Joint Conference on Computer Science and Software Engineering(JCSSE).Nakhon Pathom:IEEE Computer Socity,2011,54-57
[35]Bonvin N, Papaioannou TG, Aberer K.A self-organized, fault-tolerant and scalable replication scheme for cloud storage.In:Proc of the 1st ACM symposium on Cloud computing.ACM Press,2011,205-216
[36]Lluis PJ, Pedro GL, Marc SA, et al.Towards the design of optimal data redundancy schemes for heterogeneous cloud storage infrastructures. Journal of Computer Networks,2011,2(43):1100-1113
[37]Hyun-chul Kim. P2P Overview.Tech Report, Korea Advanced Institute of Science and Technology,2001.
[38]陈贵海,李振华.对等网络：结构、应用与设计.北京：清华大学出版社,2007
[39]Stoica I, Morris R, Karger D, et al.Chord:A scalable peer-to-peer lookup service for internet applications. In:Proc of the ACM SIGCOMM'01 Conference on Applications, technologies, architectures, and protocols for computer communications, San Diego:ACM Press,2001,149-160
[40]Dabek F, Kaashoek MF, Karger D, et al.Wide-area Cooperative Storage with CFS. In:Proc. Of the 18th ACM Symp. On Operating System Principles(SOSP). Banff:ACM Press,2001,202-215
[41]Zhao BY, Kubiatowicz JD, Joseph AD.Tapestry:An Infrastructure for Fault-tolerant Wide-area Location and Routing. U. C. Berkeley Technical Report UCB//CSD-01-1141, Berkeley:2001,329-350
[42]Kubiatowicz, David Bindel, Yan Chen, et al.OceanStore:An Architecture forGlobal-Scale Persistent Storage. In:Proc of the Ninth international Conferenceon Architectural Support for Programming Languages and Operating Systems(ASPLOS).Cambridge:ACM Press,2000,190-201
[43]A. Rowstron and P. Druschel. Pastry:Scalable, distributed object location and routing for large-scale peer-to-peer systems. In:IFIP/ACM International Conference on Distributed Systems Platforms (Middleware). Heidelberg:2001, 329-350
[44]P. Druschel, A. Rowstron.PAST:A large-scale, persistent peer-to-peer storage utility.In:Proc of the Eighth Workshop on Hot Topics in Operating Systems.Schoss Elmau:USENIX Association,2001,75-80
[45]S. Rhea, P. Eaton, D. Geels, et al. Pond:the OceanStore prototype.In:Proc. Of USENIX FAST,2003,1-14
[46]Weatherspoon H, Eaton P, Chun BG.Antiquity:Exploiting a Secure Log for Wide-Area Distributed Storage.In:Proc of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems, Lisbon:ACM Press,2007,371-384
[47]Chun BG, F Dabek, A Haeberlen,et al. Efficient replica maintenance for distributed storage systems. In:Proc. of USENIX Symposium on Networked Systems Design and Implementation (NSDI).San Jose:USENIX,2006,45-58
[48]Stribling J,Councill IG,Li JY.OverCite:A Cooperative Digital Research Library. In:Proc. of the 4th International Workshop on Peer-to-Peer Systems. Ithaca:Springer Berlin Heidelberg,2005,69-79
[49]Zheng W, J Hu,etal. Granary:architecture of object oriented Internet storage service.In:IEEE International Conference on E-Commerce Technology for DynamicE-Business.Beij ing:IEEE Computer Society,2004,294-297
[50]Hu J, M Li, W Zheng,etal. SmartBoa:Constructing p2p Overlay Network in the Heterogeneous Internet UsingIrregular Routing Tables.In:Proc. of the 3rd International Workshop on Peer-to-Peer Systems,La Jolla:Springer Berlin Heidelberg,2004,278-287
[51]魏青松.大规模分布式存储技术研究：[博士学位论文].西安：电子科技大 学,2004
[52]周旭.面向Internet的大规模分布式存储技术研究：[博士学位论文].西安：电子科技大学,2004
[53]候孟书.基于P2P的分布式存储及其相关技术研究：[博士学位论文].西安：电子科技大学,2005
[54]韩华.面向Internet的分布式海量文件系统：[博士学位论文].北京：北京大学,2001
[55]D. G. Andersen, H. Balakrishnan, M. Kaashoek, et al.Resilient overlay networks. In:Proc.18th ACM SOSP.New York:ACM,2001,131-145
[56]Ripeanu, M.Peer-to-Peer Architecture Case Study:Gnutella Network.In:Proc of 2001 International Conference on Peer-to-peer Computing (P2P2001). Linkoping:IEEE Computer Society,2001,99-100
[57]Matei Ripeanu, Ian Foster, Adriana Iamnitchi.Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems.Peer-to-Peer Systems Lecture Notes in Computer Science 2002,2429,85-93
[58]Y. Chawathe, S. Ratnasamy, L. Breslau, et al.Making Gnutella-like P2P systems scalable. In:Proc of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications. New York: ACM2003,407-418
[59]罗文杰.Peer-to-Peer(P2P)综述http://docs.huihoo.com/p2p/1/index.html. 2005-11-5
[60]Eng Keong, Lua, Jon Crowcroft, et al.A Survey and Comparison of Peer-to-Peer Overlay Network Schemes.IEEE Communications Survey and Tutorial,2005, 7(2):72-93
[61]Sylvia Ratnasamy, Paul Francis, Mark Handley, et al.A Scalable Content Addressable Network.In:SIGCOMM'01.New York:ACM,2001,161-172
[62]C.S. Lewis, J. Saia.Scalable Byzantine Agreement. Technical Report, University of New Mexico,2004
[63]L.Lamport, R.Shostak, M.Pease.The Byzantine Generals Problem.ACM TOPLAS,1982,4(3):382-401
[64]Ramarkrishna Kotla, Lorenzo Alvisi, Mike Dahlin, et al.Zyzzyva:Speculative Byzantine Fault Tolerance.In:Proc of twenty-first ACM SIGOPS symposium on Operating systems principles.New York:ACM,2007,45-58
[65]CASTRO, M.AND LISKOV, B.Practical Byzantine Fault Tolerance and Proactive Recovery.ACM Transactions on Computer Systems.2002,20(4): 398-461
[66]Kong L, et al.Agile Store:Experience with Quorum-based Data Replication Techniques for Adaptive Byzantine Fault Tolerance. In:IEEE Symposium on Reliable Distributed Systems. Orlando,2005,143-154
[67]Zhang Z, Lian Q.Reperasure:Replication Protocol using Erasure-code in Peer-to-Peer Storage Network. In:21st IEEE Symposium on Reliable Distributed Systems. Washington DC,2002,330-335
[68]J. Cowling, D. Myers, B. Liskov, et al.HQ replication:A hybrid quorum protocol for byzantine fault tolerance.In:OSDI'06 Proc of the 7th symposium on Operating systems design and implementation.Berkeley:USENIX Association 2006,177-190
[69]Kim J M, Manabe Y.A Byzantine Fault Tolerant Mutual Exclusion Algorithm and its Application to Byzantine Fault Tolerant Storage Systems.In:25th IEEE Conference on Distributed Computing Systems Workshops.Washington:IEEE Computer Society,2005,12-19
[70]R. Bazzi, Y. Ding.Non-skipping timestamps for Byzantine data storage systems. In:Proc of the 18th International Symposium on Distributed Computing. Amsterdam.Springer-Verlag,2004,405-419
[71]R. Rodrigues.Robust Services in Dynamic Systems[PhD thesis], MIT,2005
[72]C. Cachin, S. Tessaro.Optimal resilience for erasure-coded Byzantine distributed storage.In:Proc of the International Conference on Dependable Systems and Networks.IEEE Computer Society.Philadelphia:IEEE Computer Society2006,115-124
[73]Kotla R, Dahlin M.High throughput byzantine fault tolerance.In:Proc of the International Conference on Dependable Systems and Networks.IEEE Computer Society.Florence:IEEE Computer Society,2004,575-584
[74]Sukun Kim.Efficient Erasure Code for Wireless Sensor Networks,2004.
[75]Mitzenmacher, M.Digital fountains:a survey and look forward. In:Information Theory Workshop.San Antonio:IEEE,2004,271-276
[76]Plank, JS.A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems.Software Practice and Experience.1997,27(9):995-1012
[77]Lin, WK, DM Chiu, et al.Erasure code replication revisited.In:Proc. of Fourth International Conference on Peer-to-Peer Computing.2004,90-97
[78]Ratnasamy S, Handley M, Karp R, et al.Topologically aware overlay construction and server selection.In:Proc of the 21 stInternational Conference on IEEE Computer and Communications Societies. New York,2002,1190-1199
[79]Guyton J D, Schwartz M F.Locating nearby copies of replicated Internet servers.In:SIGCOMM'95 Proc of the conference on Applications, technologies, architectures, and protocols for computer communication.New York:ACM.1995, 288-298
[80]Francis P, Jamin S, Cheng J, et al.IDMaps:a global Internet host distance estimation service. IEEE/ACM Trans on Networking.2001,9 (5):525-540
[81]Yan Chen, Khian Hao Lim, Randy H.Katz et al. On the stability of network distance estimation.ACM SIGMETR ICS Performance Evaluation Review,2002, 30 (2):21-30
[82]Hyuk Lim, Jennifer C, Chong-Ho Choi. Constructing Internet coordinate system based on delaymeasurement.In:Proc of ACM SIGCOMM Conference on Internet Measurement,2003:129-142
[83]T.S.Eugene Ng, Hui Zhang.Predicting internet network distance with coordinates-based approaches. In:Proc of the 21st International Conference on IEEE Computer and Communications Societies,2002:170-179
[84]Nelder J A, Mead, R. A simp lexmethod for function minimization.The Computer Journal,1965,7 (4):308-313
[85]Liying Tang, Mark Crovella. Virtual landmarks for the Internet.In:Proc of the 3rd ACM SIGCOMM Conference on Internet Measurement. New York,2003: 143-152
[86]Mao Y, Saul L K, Smith JM. IDES:an Internet distance estimation service for large networks. IEEE Journal on Selected Areas in Communications,2006,24 (12):2273-2284
[87]李广华,朱志祥.结构化Chord算法改进.西安邮电学院学报,2009,14(3)：38-40
[88]李京文,熊焰,高燕.Ca-Chord:基于主从环的Chord路由算法.计算机工程,2009,35(11)：107-122
[89]符云清,王兴芹.基于物理拓扑的改进Chord模型.计算机工程,2012,38(6)：98-100
[90]Group of Prof.Zitterbart.Oversim, http://www.oversim.org,2012
[91]Alberto Medina, Anukool Lakhina. Brite, http://www.cs.bu.edu/brite/,2012
[92]闫晓东,徐惠民,徐雅静等.基于价值模型的数据副本替换算法.北京邮电大学学报,2006,29(4)：41-44
[93]李静,陈蜀宇,吴长泽.一种基于安全的网络数据副本策略模型.计算机应 用,2006,26(10)：2282-2284
[94]侯孟书,王晓斌.一种新的动态副本管理机制.计算机科学,2006,33(9)：50-51
[95]周旭,卢显良.频率自适应的动态副本管理机制.计算机科学,2005,32(2)：133-136
[96]魏青书,卢显良,侯孟书.自适应副本管理机制.计算机科学,2004,31(12)：34-36
[97]Bartal, Fia, Rabani.Competitive algorithms for distributed data management. Journal of Computer and System Sciences.1995,51(3):341-358
[98]Wolfson O, Huang Y. A Competitive Dynamic Data Replication Algorithm. In: Proc of Ninth International Data Engineering Conference.Vienna,1993: 310-317
[99]Swarup Acharya, Stanley B. Zdonik. An Efficient Scheme for Dynamic Data Replication. Technical Report,1993
[100]李振宇,谢高岗,李忠诚.PATCOM:基于分割树的无结构P2P系统一致性维护方法.计算机学报,2007,30(9)：1500-1510
[101]CHEN X, REN S S, WANG H N. SCOPE:scalable consistency maintenance in structured P2P systems.In:Proc of IEEE Infocom 2005. Washington,2005, 1502-1513
[102]WANG Y. Maintaining replica consistency using replica information broadcast tree in P2P storage system. In:International Conference on Research Challenges in Computer Science. Shanghai,2009
[103]ELKIN M, KORTSARZ G. A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem.In:Proc of the Annual ACM Symp on Theory of Computing. Montreal,2002.438-447
[104]MATEI R. Peer-to-Peer Architecture Case Study:Gnutella Network.In:First International Conference on Peer-to-Peer Computing.Linkoping:IEEE Computer Society,2001,99-100
[105]谢鲲,张大方,谢高岗等.基于轨迹标签的无结构P2P副本一致性维护算法.软件学报,2007,18(1)：105-111
[106]LAN J, LIU X T, SHENOY P. Consistency maintenance in peer-to-peer file sharing networks.In:Proc of the 3rd IEEE Workshop on Interact Applications. Washington,2002,90-94
[107]Datta A, Hauswirth M, Aberer K. Updates in highly unreliable, replicated Peer-to-Peer systems.In:Proc of the 23rd International Conference on Distributed Computing Systems. Washington,2003,76-85
[108]郭晓梅,李仁发,文吉刚等.基于P2P网络环境下的副本一致性维护算法.计算机科学,2009,36(1)：43-45
[109]蒋试伟,欧阳松.基于副本索引的P2P副本一致性维护策略.计算机工程,2008,34(19)：123-126
[110]WANG Z J, DAS S K, KUMAR M. Update propagation through replica chain in decentralized and unstructured P2P systems. In:Proc of the 4th International Conf. on Peer-to-Peer Computing. Washington,2004,64-71
[111]苏长根,欧阳松.P2P系统中基于副本链的一致性维护算法.计算机工程,2008,34(18)：145-150
[112]曹佳,鲁士文.应用层组播的最小延迟生成树算法.软件学报,2005,16(10)：1766-1773
[113]SALAMA H F, REEVES D S, VINIOTIS Y. The delay-constrained minimum spanning tree problem. In:Proc of the 2nd IEEE Symp on Computers and Communications. Alexandria,1997.699-703
[114]TAN S W, WATERS G, CRAWFORD J. A Survey and Performance Evaluation of Scalable Tree-Based Application Layer Multicast Protocol. Canterbury: University of kent,2003
[115]BROASH E, SHAVITT Y. Approximation and heuristic algorithms for minimum delay application-layer multicast trees. In:Proc of 2004 IEEE Conference on Computer and Communications.2004,2697-2707
[116]BELL W H, CAMERON D G, CAPOZZA L,et al. Optorsim:A grid simulator for studying dynamic data replication strategies. International Journal of High Performance Computing Applications,2003,17(4):403-416
[117]Ananth Rao, Karthik Lakshminarayanan, Sonesh Surana, et al. Load Balancing in Structured P2P Systems. In:Proc IPTPS.Berkeley.Springer Berlin Heidelberg, 2003,68-79
[118]B. Godfrey, K. Lakshminarayanan, S. Surana, et al. Stoica.Load balancing in dynamic structured P2P systems.In:Proc of IEEE INFOCOM,2004,2253-2262
[119]P. Godfrey, I. Stoica.Heterogeneity and load balance in distributed hash tables. In:Proc of IEEE INFOCOM. Miami:IEEE Communications Society,2005, 596-606
[120]Yingwu Zhu, Yiming Hu.Efficient, Proximity-Aware Load Balancing for DHT-Based P2P Systems.IEEE Transactions on Parallel and Distributed Systems,2005,16(4):349-361
[121]WANG XiaoHai, PENG YuXing, LI Dong Sheng. An efficient load balancing method for constant degree P2P systems.In:2010 International Conference on Computer Design and Applications (ICCDA). Qinhuangdao,2010,25-27
[122]Hung-Chang Hsiao and Hao Liao, Load Balance with Imperfect Information in Structured Peer-to-Peer Systems.IEEE Transactions on Parallel and Distributed Systems,2011,22(4):634-649
[123]A.Gupta, D.Agrawal, A.El Abbadi.Approximate range selection queries in peer-to-peer systems.In Proc of the First Biennial Conference on Innovative Data Systems Research. Asilomar:ACM Press 2003
[124]M. Cai, M.Frank, J.Chen, et al.MAAN:A Multi-Attribute Addressable Network for Grid Information Services, Journal of Grid Computing,2004,2(1):3-14
[125]Maymounkov P, Mazieres D. Kademlia:A peer-to-peer information system based On the XOR metric.In:Proc of the 1st International Workshop on Peer-to-Peer Systems(IPTPS'O2),2002,53-65
[126]Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell, et al. An analytical study of a structured overlay in the presence o f dynamic membership. IEEE/ACM Transactions on Networking,2008,16(4):814-825
[127]聂晓文,卢显良,周旭等.DH算法基本统计特性及应用.四川大学学报(工程科学版),2009,41(5)：170-175
[128]聂晓文,卢显良,孟江涛等.一类DHT算法中负载的概率分布.计算机应用研究,2009,26(10)：3763-3766
[129]肖波,聂晓文,侯孟书.DHT网络规模估计算法的定量分析与设计.电子科技大学学报,2011,40(2)：261-266
[130]聂晓文.DHT覆盖网若干基础性问题研究：[博士学位论文].西安：电子科技大学,2009,37-45
[131]F. E. Bustamante, Y Qiao, Friendships that last:peer lifespan and its role in P2P protocols, In:Web content caching and distribution. Proc of the 8th international workshop:Kluwer Academic Publishers,2004,233-246
[132]D. Stutzbach, R. Rejaie. Understanding chum in peer-to-peer networks. In:Proc of the 6th ACM SIGCOMM conference on internet measurement Rio de Janeriro.Brazil:ACM,2006,89-202
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |