分布式存储系统中的数据冗余与维护技术研究
|
摘要
分布式存储系统是解决海量数据存储问题的有效手段之一,它利用冗余数据维护技术,通过分散在网络上大量存储节点之间的协作,能够实现长久可靠的数据存储服务;现有大规模数据中心、P2P网络存储和无线网络存储技术等均属于分布式存储系统的范畴。然而,在分布式存储系统中,由于某些存储节点可能会暂时失效或永久失效,所以存储系统一般是通过附加冗余数据信息的方式来保证存储系统的可靠性和可用性,因此分布式存储系统中的数据冗余和维护技术是一个非常重要的研究课题。
目前在分布式存储系统的数据冗余和维护技术中,所面临的主要问题有:1)当采取不同的数据冗余策略时,必须研究针对该策略的数据可靠性问题,从而预测系统的失效概率、所需的数据冗余大小和系统的生命周期等。2)针对不同的数据冗余策略,需要研究更加有效的存储编码。3)对于采用纠删码冗余的分布式存储系统,实现数据修复往往需要耗费大量的网络带宽,这对某些低速的存储网络可能是无法容忍的,所以必须研究改进纠删码冗余的数据修复方法。4)某些新的应用可能会使存储的数据从传统的静态文件共享转变为动态文件交互,文件副本需要经常更新,所以必须研究维护冗余副本的一致性问题。因此,分布式存储系统中的数据冗余与维护技术的研究课题有重要的理论意义和实际意义。
基于此,本文分别从数据冗余的可靠性、最小存储与最小带宽的数据冗余编码、干扰准直技术的冗余数据维护和冗余数据的一致性维护四个方面对分布式存储系统中的数据冗余和维护技术问题进行了深入分析和研究,取得了若干创新性成果。
本文的主要研究工作和创新性成果体现在以下几个方面:
1.提出了一种能够预测数据冗余系统可靠性的数学模型(DRSRM,Data Redundancy System Reliability Model)。针对分布式存储系统存储节点的不稳定性,分析了复制和纠删码冗余维护的数据文件可用性,给出了存储节点失效与修复的数学分布,从而计算出存储节点的可靠性模型。在此基础上,提出了复制数据冗余存储系统的可靠性预测模型(DRSRM),该模型能模拟系统冗余数据的维护过程,并由此计算出系统的失效率、经历的时间段和系统生命周期等。
2.提出了两种新的数据冗余编码,即:最小存储冗余再生码(MSRRC,Minimum Storage Redundancy Regenerating Code)和最小带宽冗余再生码(MBRRC, Minimum Bandwidth Redundancy Regenerating Code)。本文根据纠删码冗余数据维护中失效数据修复的理论极值点:最小带宽再生点(MBR, Minimum Storage Regeneration)和最小存储再生点(MSR, Minimum Bandwidth Regeneration),提出了最小存储冗余再生码(MSRRC)和最小带宽冗余再生码(MBRRC)的概念,分别给出了这两类编码的数据分布、失效数据修复和数据重构过程,理论证明了实现原理的正确性,并详细给出了两类编码的运行实例,最后通过实验证明了编码的有效性。
3.提出了一种运用干扰准直技术实现分布式存储系统冗余数据维护的方法(RDMIA, Redundancy Data Maintenance based on Interference Alignment)。RDMIA方法的突出优点在于:1)丢失的编码分块能直接从其它编码分块的子集中修复,无需重构原数据;2)能从固定数目的存活编码分块就能修复失效分块,该数目只依赖于多少个编码分片丢失,而无需知道哪个分片丢失。运用该技术能极大减少分布式存储系统冗余数据维护时的网络开销。
4、提出了一种运用副本信息传播树(RBT, Replica information Broadcast Tree)维护冗余数据一致性的方法(DCMRBT, Data Consistency Maintenance based on RBT)。DCMRBT方法的主要设计思想是:通过为每个数据副本节点的关键词构建RBT,使得系统能追踪副本位置并传播副本更新信息。该策略能有效避免热点和节点失效问题,同时由于避免显示记录节点的ID和IP地址来存储副本,因此能有效地保护节点私密性。
Distributed storage system serves as one of the effective means for solving the problem of mass data storage. It uses redundant data maintain technology, by the collaboration of a large number of nodes distributed on the network, to achieve long-term reliable data storage services. Existing large-scale data centers, P2P network storage and wireless networking technology etc., all of which belong to the category of distributed storage system. However, some nodes in the system may be temporarily or permanently disabled. In order to ensure reliability and availability of systems, redundant data is generally adopted by the storage system. Therefore, the redundancy and maintenance technology has become an important research issue in distributed storage system.
At present, for data redundancy and maintenance technology of distributed storage system, the major problems currently facing are: 1) When taking the different data redundancy strategy, we must learn more about the data reliability for the strategies, and then predict the probability of the system failure, the size of the required data redundancy, system life cycles and so on. 2) For different data redundancy strategies, we need to study more effective storage encoding. 3) Redundancy using erasure codes for distributed storage systems, its data restoration would consume a lot of network bandwidth, which may be unable to be tolerated for some low-speed storage network. We must improve data recovery method for the erasure codes redundancy. 4) The new application of distributed storage have changed from the traditional static file sharing to dynamic file interaction, the replicated files update frequently. So the problem of maintaining data replicas’consistency must be taken into account. In a word, it has an important theoretical and practical significance on studying the the data redundancy and maintenance in distributed storage system.
In the dissertation, for these problems, an in-depth research was conducted from the four aspects, that is, the reliability of different redundant strategies, the realization of the minimum storage and minimum bandwidth redundancy coding, the use of interference alignment techniques to repair redundant data, redundant data consistency maintenance. We have made some innovative achievements for data redundancy and maintenance in distributed storage system.
The main research work and innovative achievements are reflected in the following several aspects:
1. Mathematical model (DRSRM, Data Redundancy System Reliability Model) is proposed which can help to predict the reliability of redundant distributed storage system. In my dissertation, Data availability of redundant maintenance of the replication and erasure codes are analyzed. The mathematical model of storage node failure and repairing is proposed and the reliability of the storage node is analyzed. On the basis of which reliability forcast model for the replicated data redundancy storage system is also put forward, which is used to simulate the maintenance process of data redundant, and then calculate the system failure rate, the time period, the life cycle of the system etc..
2. Minimum storage redundancy regenerating code (MSRRC) and the minimum bandwidth redundancy regenerating code (MBRRC) are presented. According to some literature, the data regeneration has the two extreme points: the minimum bandwidth of regeneration points (MBR) and minimum storage regeneration points (MSR), therefore, MBRRC and MSRRC are presented. We analyze the principle of two types code’s reconstruction and regeneration, prove the reliability of realization principles, and describe in detail the implementation process by the examples. Finally, the experimental results prove it effectiveness.
3. Interference alignment technology (RDMIA, Redundancy Data Maintenance based on Interference Alignment) is proposed to reduce network overhead when redundancy data need to be repaired. Its prominent advantage is that: 1) Loss of block can be directly repaired from the subset of other encoded block, no need to reconstruct the original data. 2) Invalid block can be repaired from a fixed number of survival encoded block. The number only depends on the number of missing coded patch, without knowing which patch is lost. Applying this technology can greatly reduce the network costs when redundancy data is maintained in distributed storage system.
4.The replica broadcast tree (RBT, Replica Broadcast Tree) is proposed to maintain the redundancy data consistency. By the construction of RBT for every replica’s key, system can trace the replica location and spread replica’s updated information. The strategy can effectively avoid the problem of hot spots and node failures. At the same time, system stores replicas by avoiding display ID and IP address of recording node, therefore, it can effectively protect the privacy of the nodes.
目前在分布式存储系统的数据冗余和维护技术中,所面临的主要问题有:1)当采取不同的数据冗余策略时,必须研究针对该策略的数据可靠性问题,从而预测系统的失效概率、所需的数据冗余大小和系统的生命周期等。2)针对不同的数据冗余策略,需要研究更加有效的存储编码。3)对于采用纠删码冗余的分布式存储系统,实现数据修复往往需要耗费大量的网络带宽,这对某些低速的存储网络可能是无法容忍的,所以必须研究改进纠删码冗余的数据修复方法。4)某些新的应用可能会使存储的数据从传统的静态文件共享转变为动态文件交互,文件副本需要经常更新,所以必须研究维护冗余副本的一致性问题。因此,分布式存储系统中的数据冗余与维护技术的研究课题有重要的理论意义和实际意义。
基于此,本文分别从数据冗余的可靠性、最小存储与最小带宽的数据冗余编码、干扰准直技术的冗余数据维护和冗余数据的一致性维护四个方面对分布式存储系统中的数据冗余和维护技术问题进行了深入分析和研究,取得了若干创新性成果。
本文的主要研究工作和创新性成果体现在以下几个方面:
1.提出了一种能够预测数据冗余系统可靠性的数学模型(DRSRM,Data Redundancy System Reliability Model)。针对分布式存储系统存储节点的不稳定性,分析了复制和纠删码冗余维护的数据文件可用性,给出了存储节点失效与修复的数学分布,从而计算出存储节点的可靠性模型。在此基础上,提出了复制数据冗余存储系统的可靠性预测模型(DRSRM),该模型能模拟系统冗余数据的维护过程,并由此计算出系统的失效率、经历的时间段和系统生命周期等。
2.提出了两种新的数据冗余编码,即:最小存储冗余再生码(MSRRC,Minimum Storage Redundancy Regenerating Code)和最小带宽冗余再生码(MBRRC, Minimum Bandwidth Redundancy Regenerating Code)。本文根据纠删码冗余数据维护中失效数据修复的理论极值点:最小带宽再生点(MBR, Minimum Storage Regeneration)和最小存储再生点(MSR, Minimum Bandwidth Regeneration),提出了最小存储冗余再生码(MSRRC)和最小带宽冗余再生码(MBRRC)的概念,分别给出了这两类编码的数据分布、失效数据修复和数据重构过程,理论证明了实现原理的正确性,并详细给出了两类编码的运行实例,最后通过实验证明了编码的有效性。
3.提出了一种运用干扰准直技术实现分布式存储系统冗余数据维护的方法(RDMIA, Redundancy Data Maintenance based on Interference Alignment)。RDMIA方法的突出优点在于:1)丢失的编码分块能直接从其它编码分块的子集中修复,无需重构原数据;2)能从固定数目的存活编码分块就能修复失效分块,该数目只依赖于多少个编码分片丢失,而无需知道哪个分片丢失。运用该技术能极大减少分布式存储系统冗余数据维护时的网络开销。
4、提出了一种运用副本信息传播树(RBT, Replica information Broadcast Tree)维护冗余数据一致性的方法(DCMRBT, Data Consistency Maintenance based on RBT)。DCMRBT方法的主要设计思想是:通过为每个数据副本节点的关键词构建RBT,使得系统能追踪副本位置并传播副本更新信息。该策略能有效避免热点和节点失效问题,同时由于避免显示记录节点的ID和IP地址来存储副本,因此能有效地保护节点私密性。
Distributed storage system serves as one of the effective means for solving the problem of mass data storage. It uses redundant data maintain technology, by the collaboration of a large number of nodes distributed on the network, to achieve long-term reliable data storage services. Existing large-scale data centers, P2P network storage and wireless networking technology etc., all of which belong to the category of distributed storage system. However, some nodes in the system may be temporarily or permanently disabled. In order to ensure reliability and availability of systems, redundant data is generally adopted by the storage system. Therefore, the redundancy and maintenance technology has become an important research issue in distributed storage system.
At present, for data redundancy and maintenance technology of distributed storage system, the major problems currently facing are: 1) When taking the different data redundancy strategy, we must learn more about the data reliability for the strategies, and then predict the probability of the system failure, the size of the required data redundancy, system life cycles and so on. 2) For different data redundancy strategies, we need to study more effective storage encoding. 3) Redundancy using erasure codes for distributed storage systems, its data restoration would consume a lot of network bandwidth, which may be unable to be tolerated for some low-speed storage network. We must improve data recovery method for the erasure codes redundancy. 4) The new application of distributed storage have changed from the traditional static file sharing to dynamic file interaction, the replicated files update frequently. So the problem of maintaining data replicas’consistency must be taken into account. In a word, it has an important theoretical and practical significance on studying the the data redundancy and maintenance in distributed storage system.
In the dissertation, for these problems, an in-depth research was conducted from the four aspects, that is, the reliability of different redundant strategies, the realization of the minimum storage and minimum bandwidth redundancy coding, the use of interference alignment techniques to repair redundant data, redundant data consistency maintenance. We have made some innovative achievements for data redundancy and maintenance in distributed storage system.
The main research work and innovative achievements are reflected in the following several aspects:
1. Mathematical model (DRSRM, Data Redundancy System Reliability Model) is proposed which can help to predict the reliability of redundant distributed storage system. In my dissertation, Data availability of redundant maintenance of the replication and erasure codes are analyzed. The mathematical model of storage node failure and repairing is proposed and the reliability of the storage node is analyzed. On the basis of which reliability forcast model for the replicated data redundancy storage system is also put forward, which is used to simulate the maintenance process of data redundant, and then calculate the system failure rate, the time period, the life cycle of the system etc..
2. Minimum storage redundancy regenerating code (MSRRC) and the minimum bandwidth redundancy regenerating code (MBRRC) are presented. According to some literature, the data regeneration has the two extreme points: the minimum bandwidth of regeneration points (MBR) and minimum storage regeneration points (MSR), therefore, MBRRC and MSRRC are presented. We analyze the principle of two types code’s reconstruction and regeneration, prove the reliability of realization principles, and describe in detail the implementation process by the examples. Finally, the experimental results prove it effectiveness.
3. Interference alignment technology (RDMIA, Redundancy Data Maintenance based on Interference Alignment) is proposed to reduce network overhead when redundancy data need to be repaired. Its prominent advantage is that: 1) Loss of block can be directly repaired from the subset of other encoded block, no need to reconstruct the original data. 2) Invalid block can be repaired from a fixed number of survival encoded block. The number only depends on the number of missing coded patch, without knowing which patch is lost. Applying this technology can greatly reduce the network costs when redundancy data is maintained in distributed storage system.
4.The replica broadcast tree (RBT, Replica Broadcast Tree) is proposed to maintain the redundancy data consistency. By the construction of RBT for every replica’s key, system can trace the replica location and spread replica’s updated information. The strategy can effectively avoid the problem of hot spots and node failures. At the same time, system stores replicas by avoiding display ID and IP address of recording node, therefore, it can effectively protect the privacy of the nodes.
引文
[1] Jim G. What next? A few remaining problems in information technology [EB/OL]. http://research.microsoft.com/~gray/talks/Gray_Turing_FCRC.pdf, 2010
[2] Yang J., Harting J: Improving storage subsystem reliability -- a case study [C].In proceeding of the 2007 Annual Reliability and Maintainability Symposium. 2007:434-439
[3]王文丰.分布式存储中的高性能和高可靠性问题的研究[D].广州:华南理工大学博士学位论文,2009
[4] http://news.xinhuanet.com/tech/2010-07/03/c_12292762_5.htm[EB/OL]
[5]田敬.对等存储系统中的数据可用性与安全性研究[D].北京:北京大学博士论文, 2007
[6]王禹,赵跃龙.对等网络中全文检索系统的设计与实现[J].计算机工程与应用. 2010,46(10), pp.70-77
[7] S. Al-Kiswany, A. Gharaibeh, E. Santos-Neto, G. Yuan, and M. Ripeanu. StoreGPU: exploiting graphics processing units to accelerate distributed storage systems. In ACM Symposium on High Performance Distributed Computing (HPDC), 2008.
[8] S. Rhea, C. Wells, P. Eaton, D. Geels, B. Zhao, H. Weatherspoon,and J. Kubiatowicz. Maintenance-free global data storage. IEEE Internet Computing, pp. 40-49, September 2001.
[9] Z. Wang, R. Mateescu, A.G. Dimakis, J. Bruck. Array codes for distributed storage: Results and open problems”, Information Theory and Applications (ITA), 2010.
[10] The OceanStore Project. http://oceanstore.cs.berkeley.edu/.
[11] J.Kubiatowicz, D.Bindel, Y.chen, S.Czerwinski, P.Eaton, D.Geels, R.Gummadi, S.Rhea, H.Weatherspon, W.Weimer, C.Wells, and B.Zhao. OceanStore: architecture for global-scale persistent storage[C]. In Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2000.
[12] Wells C. The OceanStore archive: Goals, structures, and self-repair[R]. UC Berkeley Masters Report, May, 2002.
[13] I.Stoica, R.Morris, D.Karger, M.F.Kaashoek, and H.Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet application[C]. In ACM SIGCOMM, 2001.
[14] F.Dabek, M.F.Kaashoek, D.Karger, R.Morris, and I.Stoica. Wide-area cooperativestorage with cfs[C]. In ACM Symposium on Operating Systems Principles (SOSP), 2001.
[15] Zhang Z, Lian Q, Lin S, Chen W, Chen Y, and Jin C. BitVault: a Highly Reliable Distributed Data Retention Platform[R]. Technical Report, MSR-TR-2005-179, Microsoft Research, 2005.
[16] Zhang Z, Lian Q, and Chen Y. Xring: Achieving High-Performance Routing Adaptively in Structured P2P[R]. Technical Report, MSR-TR-2004-93, Microsoft Research, 2004.
[17] A.Rowstron and P.Druschel. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems[C]. In IFIP/ACM International Conference on Distributed Systems Platforms, 2001.
[18] Druschel P, Rowstron A. PAST: a large-scale persistent peer-to-peer storage utility [C]. Proceedings of the 8th Workshop on Hot Topics in Operating Systems. IEEE Press, 2001:65-70.
[19] Bhagwan R, Tati K, Cheng Y, Savage S, and Voelker G. Total Recall: System Support for Automated Availability Management[C]. Proceeding of the First ACM/Usenix Symposium on Networked Systems Design and Implementation (NSDI), 2004.
[20]胡进锋,洪春辉,郑纬民.一种面向对象的Internet存储服务系统Granary[J].计算机研究与发展, 2007,44(6):1071-1079
[21]郑纬民,胡进锋,代亚非等.对等计算研究概论. http://www.ccf.org.cn
[22]丁嵩,田敬,陈东,代亚非. UPStore:一个开放的P2P存储平台[J].计算机研究与发展, 2009,46(z2)
[23] Jing Tian and Yafei Dai, Understanding the Dynamic of Peer-to-Peer Systems[C]. Proceeding of Sixth International Workshop on Peer-to-Peer Systems (IPTPS’07), 2007.
[24] Atul Adya, William J. Bolosky, and etc. Farsite: Federated, available, and reliable storage for an incompletely trusted environment[C]. Proceedings of 5th Symposium on Operation Systems Design and Implementation. December 2002, Vol. 36, pp. 1-14.
[25] Cox L, Murray C, and Noble B. Pastiche: making backup cheap and easy[C]. ACM SIGOPS Operating Systems Review, 2002.36:285-298
[26] A.Haeberlen, A.Mislove, and P.Druschel. Glacier: highly durable, decentralized storage despite massive correlated failures[C]. Proceedings of the 2nd conference on Symposium on Networked Systems Design&Implementation, pages 143-158, Berkeley, CA,USA,2005. USENIX Association. 12-16
[27] G.Utard and A. Vernois. Data durability in peer to peer storage systems[C]. Proceeding of IEEE GP2PC’04, Chicago, Illinois, April 2004.
[28] A. Abiteboul, A.Bonifati, G.Cobena, I.Manolescu, and T.Milo. Dynamic XML documents with distribution and replication[C]. Proceeding of the ACM SIGMOD Int. Conf. on Management of Data, pages 527-538, San Diego, California, June 2003.
[29] Clarke I, Hong T,Miller S, et al. Protecting free expression online with Freenet[J]. IEEE Internet Computing, 2002,6(1):40-49.
[30]万武南.分布式安全存储系统纠删码技术的研究[D].成都:中国科学院研究生院,2006
[31] R.Rodrigues and B.Liskov. High availability in DHTs: Erasure coding vs. replication[C]. Proceedings of IPTPS, Ithaca, USA, 2005.
[32] H.Weatherspoon and J.Kubiatowicz. Erasure coding vs. replication: A quantitative comparison[C]. Proceeding of IPTPS’02, Cambridge, Massachusetts, March 2002.
[33] J. Plank and M. Thomason. A Practical Analysis of Low-density Paritycheck Erasure Codes for Wide-area Storage Applications[C]. The International Conference on Dependable Systems and Networks. Florence, Italy, Jun, 2004.
[34] A.G.Dimakis, P.G.Godfrey, M.J.Wainwright, and K.Ramchandran. Network coding for peer-to-peer storage[C], Proceeding of INFOCOM, Anchorage, Alaska, May 2007.
[35] G.Utard and A.Vernois. Data durability in peer to peer storage systems. Proceeding of IEEE GP2PC’04, Chicago, Illinois, April 2004.
[36] A.Dandoush, S.Alouf, and P.Nain. Simulation analysis of download and recovery processes in p2p storage systems[R]. Research Report RR-6858, INRIA, 2009.
[37] C.Blake and R.Rodrigues. High availability, scalable storage, dynamic peer networks: pick two[C]. In USENIX Workshop on Hot Topics in Operating Systems (HotOS), 2003.
[38] F.Wu, T.Qiu, Y.Chen, and G.Chen. Redundancy schemes for high availability in DHTs[C]. In International Symposium on Parallel and distributed processing and Applications (ISPA), 2005.
[39] B. Schroeder and G. Gibson. Disk Failures in the real World: What Does an MTTF of 1,000,000 Hours Mean to You?[C] in Proc. 5th USENIX conference on File and Storage Technologies (FAST), San Jose, CA,Feb. 2007,pp.14-16.
[40] R.Koetter and F.Kschischang. Coding for errors and erasures in random network coding[C]. Proceeding of IEEE. Symp. Information Theory, Nice, France, June 2007, pp.791-795.
[41] M. Blaum, J. Brady, J. Bruck, and J. Menon. EVENODD: An efficient Scheme for tolerating Double Disk Failures in RAID Architectures [J]. IEEE Transactions on Computers, vol. 44, no. 2, pp. 192–202, 1995.
[42] M. Baker, M. Shah, D. Rosenthal, M. Roussopoulos, P. Maniatis, T. Giuli, and P. Bungale. A Fresh Look at the Reliability of Longterm Digital Storage[C]. In Proc. 1st ACM SIGOPS/EuroSys European Conference on Computer Systems, 2006.
[43] Y. Hu, Y. Xu, X. Wang, C. Zhan, and P. Li. Cooperative Recoveryof Distributed Storage Systems from Multiple Losses with NetworkCoding. IEEE Journal on Selected Areas in Communication, vol. 28,no. 2, pp. 268–276, Feb. 2010.
[44] L. Xiang, Y. Xu, J. Lui, and Q. Chang. Optimal Recovery of Single Disk Failure in RDP Code Storage Systems[C]. In Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 2010, pp. 119–130.
[45] F. Oggier and A. Datta. Self-repairing Homomorphic Codes for distributed Storage Systems. 2010. [Online]. Available: arXiv:1008.0064[cs.IT]
[46] Xiaozhao Wang, Yuchong Hu, Yinlong Xu, Kaiqian Qu. MFR: Multi-Loss Flexible Recovery in Distributed Storage Systems, IEEE International Conference on Communications 2010.
[47] S.Acedanski, S.Deb, M.Medard, R.Koetter. How good is random linear coding based distributed networked storage? In NetCod 2005.
[48] A.Kermarrec, N.L.Scouarnec, G.Straub. Repairing Multiple Failures with Coordinated and Adaptive Regenerating Codes. ArXiv:1102.0204v1 [cs.IT] Feb 2011.
[49] Xiaozhao Wang, Yuchong Hu, Yinlong Xu, Kaiqian Ou, MFR: Multi-Loss Flexible Recovery in Distributed Storage Systems, IEEE International Conference on Communications 2010.
[50] J.Li, S.Yang, X.Wang, X.Xue, and B.Li. Tree-structured data regeneration with network coding in distributed storage systems. In Proceeding of 17th IEEE International Workshop on Quality of Service (IWQos), 2009.
[51] S. Akhlaghi, A. Kiani, and M. R. Ghanavati,“A Fundamental Tradeoff between The Download Cost And Repair Bandwidth In Distributed Storage Systems,”in Proc. IEEE International Symposium on Network Coding (NetCod), Toronto, Jun. 2010.
[52] N. B. Shah, K. V. Rashmi, P. V. Kumar, and K. Ramchandran. Explicit Codes Minimizing Repair Bandwidth for Distributed Storage. In Proc. IEEE Information Theory Workshop, Cairo, Jan. 2010.
[53] Shah S, Ramamritham K, Shenoy P. Resilient and coherence preserving dissemination of dynamic data using cooperating peers. IEEE Trans. on Knowledge and Data Engineering, 2004,16(7):799-812
[54]覃飙,王珊,杜小勇. Peer数据管理系统中的视图维护策略[J].软件学报, 2007, 18(2):259-267.
[55] Z.Wang, R.Mateescu, A.G.Dimakis, J.Bruck. Array codes for distributed storage: Results and open problems [J]. Information Theory and Applications (ITA), 2010.
[56] Yijie Wang, Xiaoming Zhang. A Prediction-Based Parallel Replication Algorithm in Distributed Storage System[C]. In Proceedings of the 4th Grid and Cooperative Computing International Conference (GCC 2005). LNCS 3795, Springer, 2005. 690-700.
[57] David Del Vecchio, Sang H.Son. Flexible Update Management in Peer-to-Peer Database Systems[C]. In Proceedings of the 9th International Database Engineering & Application Symposium (IDEAS 2005). Washington: IEEE Computer Society, 2005. 435-444.
[58] Zhijun Wang, Sajal K.Das, Mohan Kumar, Huaping Shen. Update Progagation through Replica Chain in Decentralized and Unstructured P2P Systems[C]. In proceedings of the 4th IEEE International Conference on Peer-to-Peer Computing (P2P 2004). Washington: IEEE Computer Society, August 2004. 64-71.
[59] Xin Chen, Shansi Ren, Haining Wang, Xiaodong Zhang. SCOPE: Scalable ConsistencyMaintenance in Structured P2P Systems[C]. In Proceedings of the 24th Conference of the IEEE Communications Society (INFOCOM 2005). Washington: IEEE Computer Society, 2005. 1502-1513.
[60] E.Leontiadis, V.V.Dimakopoulos and E.Pitoura. Creating and Maintaining Replicas in Unstructured Peer-to-Peer Systems[C]. Proceedings of the 12th International Euro-Par Conference on Parallel Processing (EURO-PAR). Dresden, Germany, August 2006. 1015-1025.
[61] Zhijun Wang, Mohan Kumar, Sajal K. Das, Huaping Shen. File Consistency Maintenance through Virtual Servers in P2P Systems[C]. Proceedings of the 11th IEEE Symposium on Computers and Communications (ISCC 2006) Washington: IEEE Computer Society, 2006. 435-441.
[62] Picconi F, Baynat B, Sens P. Predicting durability in DHTs using Markov chains[C]. Proceedings of the 2nd International Conference on Digital Information Management.Lyon, France: IEEE, 2007:532-538.
[63] Datta A, Aberer K. Internet-scale storage systems under churn– a study of the steady-state using markov models[C]. In IEEE international conference on peer-to-peer computing(P2P), Cambridge, United Kingdom, 2006:39-48
[64]田敬,代亚非. P2P持久存储研究综述[J].软件学报,2007, 18(6):1379-1399.
[65]田敬,张大为,代亚非,韩华. ESStore:P2P网络的可靠存储协议[C].全国网络与信息安全技术研讨会’2005论文集(下册)
[66] Ramabhadran S, Pasquale. J. Analysis of Long-Running replicated system[C]. Proceedings of the 25th IEEE International Conference on Computer Communications. Barcelona, USA: IEEE, 2006: 1-9.
[67] Jing Tian, Zhi Yang and Yafei Dai, A Data Placement Scheme with Time-Related Model for P2P Storages,. Proceeding of Seventh International Conference on Peer-to-Peer Computing, 2007.
[68] S. Acedacnski, S. Deb, M. Medard, and R. Koetter. How good is random linear coding based distributed networked storage? In Workshop on Network Coding, Theory, and Applications (NetCod), 2005
[69] R. Bhagwan, D. Moore, S. Savage, and G. M. Voelker. Replication strategies for highly available peer-to-peer storage[R]. Technical Report CS2002-0726, University of California at San Diego, 2002.
[70] Ramabhadran S, Pasquale J. Analysis of durability in replicated distributed storage systems[C]. 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS). Atlanta, GA, April 2010:1-12
[71] Byung-Gon Chun, Frank Dabek, Andreas Haeberlen, Emil Sit, Hakim Weatherspoon, M. Frans Kaashoek, John Kubiatowicz, and Robert Morris. Efficient replica maintenance for distributed storage systems[C]. Proceedings of the 3rd Symposium on Networked System Design and Implementation. California, USA: USENIX Association, 2006:45-58.
[72] Hakim Weatherspoon. Design and evaluation of distributed wide-area on-line archival storage systems [D]. University of California Berkeley Ph.D. Dissertation (2006).
[73]王禹,赵跃龙,侯昉. P2P存储系统副本一致性维护策略[J].计算机工程, 2009,36(1):27-29.
[74] Duminuco A, Biersack E, En-Najjary T. Proactive replication in distributed storage systems using machine availability estimation[C]. In ACM conference on emergingnetworking experiments and technologies, New York, USA:ACM,2007:1-12
[75] Weatherspoon H, Chun Byung-Gon, So Chiu Wah, et al. Long-term data maintenance in wide-area storage systems: a quantitative approach[R]. Berkeley USA: University of California, 2005.
[76] Liu X., Lan J, Shenoy P, et al. Consistency maintenance in dynamic peer-to-peer overlay networks [J]. ComputerNetworks, 2005, 50:859-876
[77] Datta A, Hauswirth M, Aberer K, Updates in highly unreliable replicated peer-to-peer systems[C]. Proceedings of the 23rd International Conference on Distributed Computing Systems: Rhode Island USA:IEEE, 2003:76-88
[78] PlanetLab, An open platform for developing, deploying, and accessing planetary-scale services, http://www.planet-lab.org/(2010)
[79] D. A. Patterson, G. Gibson, and R. H. Katz. A case for redundant arrays of inexpensive disks (RAID)[C]. Proceeding of ACM SIGMOD Chicago, USA, June 1988.
[80] I. Reed and G. Solomon. Polynomial Codes over certain Finite Fields [J]. Journal of the Society for Industrial and Applied Mathematics, vol. 8, no. 2, pp. 300–304, 1960.
[81] Y. Wu, A.G.Dimakis, and K. Ramchandran, Deterministic regenerating codes for distributed storage[C]. In Allerton Conference on Control, Computing, and Communication, Monticello, IL, October 2007
[82] Z. Wang, A. G. Dimakis, and J. Bruck. Rebuilding for Array Codes in Distributed Storage Systems[C]. In Workshop on the Application of Communication Theory to Emerging Memory Technologies (ACTEMT), Dec. 2010.
[83] S. Akhlaghi, A. Kiani, and M. R. Ghanavati. A Fundamental Tradeoff etween The Download Cost and Repair Bandwidth in Distributed Storage Systems. Proceeding of IEEE International Symposium on Network Coding (NetCod), Toronto, Jun. 2010.
[84] N. B. Shah, K. V. Rashmi, and P. V. Kumar. A Flexible Class of egenerating Codes for Distributed Storage. Proceeding of IEEE International smposium on Information Theory (ISIT), Austin, Jun. 2010, pp. 1943–1947.
[85] B. Gast′on and J. Pujol. Double Circulant Minimum Storage egenerating Codes. 2010. [Online]. Available: arXiv:1007.2401[cs.IT]
[86] Z. Wang, R.Mateescu, A.G. Dimakis, J.Bruck, Array codes for distributed storage: Results and open problems [J]. Information Theory and Application. ITA, 2010
[87] R.Koetter and M. Medard. An algebaic approach to network coding [J]. Transactions on Networking, October 2003
[88] Y. Wu. Existence and construction of capacity-achieving network codes for distributedstorage [J]. Journal on Selected Areas in Communications. Vol.28, issue 2. pp.277-288, Feb.2010
[89] J. Li and S. Yang and Xin Wang and Baochun Li. Tree structured Data Regeneration in Distributed Storage Systems with Regenerating Codes[C]. Proceedings of IEEE INFOCOM 2010.
[90] P. Corbett, B. English, A. Goel, T. Grcanac, S. Kleiman, J. Leong, and S. Sankar. Row-Diagonal Parity for Double Disk Failure Correction[C]. Proceedings of 3rd USENIX Conference on File and Storage Technologies (FAST), 2004, pp. 1–14.
[91] B. Gaidioz, B. Koblitz, and N. Santos. Exploring High Performance Distributed File Storage using LDPC Codes [J]. Parallel Computing, vol. 33, no. 4-5, pp. 264–274, 2007.
[92] Nihar B.Shah, K.V.Rashmi, P.Vijay Kumar, Kannan Ramchandran. Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff[C]. in Allerton Conf, Urbana-Champaign, Sep.2009
[93] N.B.Shah, R.K.V., P.V.Kumar, and K.Ramchandran. Distributed storage codes with repair-by-transfer and non-achievability of interior points on the storage-bandwidth tradeoff. CoRR, vol. abs/1011.2361, 2010. http://arxiv.org/abs/1011.2361.
[94] A. G. Dimakis, P. B. Godfrey, Y. Wu, M. Wainwright, and K. Ramchandran. Network Coding for Distributed Storage Systems[C]. IEEE Transactions on Information Theory, vol. 56, no. 9, pp. 4539–4551, 2010.
[95] R. Gallager. Low density Parity-Check Codes [J]. IRE Transactions on Information Theory, vol. 8, no. 1, pp. 21–28, Jan. 1962.
[96] M. Luby, M. Mitzenmacher, M. Shokrollahi, D. Spielman, and V. Stemann. Practical Loss-Resilient Codes. Proceeding of 29th annual ACM symposium on Theory of computing, 1997, pp. 150–159.
[97] A. Shokrollahi. Raptor Codes [J]. IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2551–2567, 2006.
[98] F.J. MacWilliams and N.J.A. Sloane. The Theory of Error-Correcting Codes [M]. Part I, North-Holland Publishing Company, Amsterdam, New York, Oxford, 1977.
[99] Y. Wu. A Construction of Systematic MDS Codes with Minimum Repair Bandwidth [J]. IEEE Transactions on Information Theory, submitted for publication. [Online]. Available: arXiv:0910.2486[cs.IT]
[100] V. R. Cadambe, S. A. Jafar, and H. Maleki. Distributed Data Storage with Minimum Storage Regenerating Codes - Exact and Functional Repair are Asymptotically EquallyEfficient [J]. [Online]. Available: arXiv:1004.4299[cs.IT]
[101] B. Gaston and J. Pujol. Double Circulant Minimum Storage Regenerating Codes [J]. Submitted to Allerton Conf., Urbana-Champaign, Sep. 2010. Available online at arXiv:1007.2401 [cs.IT].
[102] C. Huang and L. Xu. STAR: An efficient coding scheme for correcting triple storage node failures [J]. IEEE Transactions on Computers, vol. 57, no. 7, pp. 889–901, 2008.
[103] S. El Rouayheb and K. Ramchandran. Fractional Repetition Codes for Repair in Distributed Storage Systems[C]. Proceeding of 48th Annual Allerton Conference on Control, Computing, and Communication, Urbana-Champaign, Sep. 2010.
[104] M. Blaum, J. Bruck, and A. Vardy. MDS Array Codes with Independent Parity Symbols [J]. IEEE Transactions on Information Theory,, vol. 42, no. 2, pp. 529–542, Mar. 2002.
[105] A. G. Dimakis, P. Brighten Godfrey, M. J.Wainwright, K. Ramchandran. The Benefits of Network Coding for Peer-to-Peer Storage Systems[C]. Workshop on Network Coding, Theory, and Applications (Netcod), 2007
[106] A. Duminuco, E.W. Biersack. A Practical Study of Regenerating Codes for Peer-to-Peer Backup Systems[C]. Conference on Distributed Computing Systems (ICDCS), 2009.
[107] A. Datta, K. Aberer. Internet-Scale Storage Systems under Churn– A Study of the Steady-State using Markov Models[C]. Conference on Peer-to-Peer Computing (P2P), pp. 133-144, 2006
[108] A. Duminuco and E. Biersack. Hierarchical Codes: How To Make Erasure Codes Attractive for Peer-to-Peer Storage Systems[C]. In 8th International Conference on Peer-to-Peer Computing (P2P), 2008, pp.89–98.
[109] Mingqiang Li, Jiwu Shu, and Weimin Zheng. GRID codes: Strip-based erasure codes with high fault tolerance for storage systems [J]. In ACM Transactions on storage, 2009.
[110] V. R. Cadambe and S. A. Jafar. Interference alignment and the degree of freedom for the K user interference channel. IEEE Transactions on Information Theory, vol. 54, no. 8, pp. 3425–3441, Aug. 2008.
[111] M.A.Maddah-Ali, S.A.Motahari and A.K.Khandani. Communication over MIMO X Channels: Interference Alignment, Decomposition, and Performance Analysis [J]. IEEE Transactions on Information Theory, 54(8), pp.3457-3470, Aug.2008.
[112] J. Elerath. Hard-disk drives: The good, the bad, and the ugly [J]. Communications of the ACM, vol. 52, no. 6, pp. 38–45, 2009.
[113] D. S. Bernstein, Matrix mathematics: Theory, facts, and formulas with application to linear systems theory [M]. Princeton University Press, 2005
[114] A.A.Bubrulle. Work notes on elementary matrics[R]. Technology Report. HPL-93-69, Hewlen- Packard Laboratory, 1993.
[115] R. Koetter and M. Medard, An algebraic approach to network coding [J]. IEEE/ACM Transaction. Networking. vol. 11, no. 5, Oct. 2003, pp. 782–795.
[116] Y. Wu and A. G. Dimakis. Reducing Repair Traffic for Erasure Coding-Based Storage via Interference Alignment [J]. in Proc. IEEE ISIT, Seoul, Jul. 2009.
[117]王禹,赵跃龙,侯昉.基于副本管理的P2P存储系统可靠性分析[J].华南理工大学学报(自然科学版), 2011 Vol. 39(2):148-152
[118]周婧. P2P分布存储系统中海量数据的数据一致性维护技术研究[D].长沙:国防科技大学,2007
[119] Xun-yi Ren; Wang Ru-chuan; Kong Qiang. Efficient Model for Replica Consistency Maintenance in Data Grids[C]. In International Symposium on Computer Science and its Applications, Nanjing, china. Oct. 2008, pp. 159 - 162
[120] Ximei Wang; Shoubao Yang; Shuling Wang, Xianlong Niu, Jing Xu. An Application-Based Adaptive Replica Consistency for Cloud Storage[C]. the 9th International Conference on Grid and Cooperative Computing (GCC). Nanjing, china. Nov. 2010, pp. 13 - 17
[121] Ghalem Belalem, Yahya Slimani. A Consistency Protocol Multi-Layer for Replicas Management in Large Scale Systems. PROCEEDINGS OF World Academy of Science, Engineering and Technology. 2006,pp.117-122
[122] The Napster website. http://www.napster.com
[123] S. Rhea, P. Eaton, D. Geels, H. Weatherspoon, B. Zhao, and J. Kubiatowicz. Pond: The OceanStore Prototype[C]. Proceeding of 2nd USENIX conference on File and Storage Technologies (FAST), 2003, pp. 1–14.
[124] I Clarke, O Sandberg, B Wiley, and T W Hong. Freenet: A Distributed Anonymous Information Storage and Retrieval System[C]. In Workshop on Design Issues in Anonymity and Unobservability, July 2000: 311-320.
[125] Gnutella website. http://www.gnutella.com
[126]谢鲲,张大方,谢高刚等.基于轨迹卷标的无结构P2P副本一致性维护算法[J].软件学报, 2007, 18(1):105-116
[127]苏长根,欧阳松. P2P系统中基于副本链的一致性维护算法[J].计算机工程, 2008, 34(18):145-147
[128] A. Rowstron and P. Druschel. Storage management and caching in PAST, a large-scalepersistent peer-to-peer storage utility[C]//Proceedings of ACM SOSP’01. Alberta, Canada: ACM Press, 2001:188-201.
[2] Yang J., Harting J: Improving storage subsystem reliability -- a case study [C].In proceeding of the 2007 Annual Reliability and Maintainability Symposium. 2007:434-439
[3]王文丰.分布式存储中的高性能和高可靠性问题的研究[D].广州:华南理工大学博士学位论文,2009
[4] http://news.xinhuanet.com/tech/2010-07/03/c_12292762_5.htm[EB/OL]
[5]田敬.对等存储系统中的数据可用性与安全性研究[D].北京:北京大学博士论文, 2007
[6]王禹,赵跃龙.对等网络中全文检索系统的设计与实现[J].计算机工程与应用. 2010,46(10), pp.70-77
[7] S. Al-Kiswany, A. Gharaibeh, E. Santos-Neto, G. Yuan, and M. Ripeanu. StoreGPU: exploiting graphics processing units to accelerate distributed storage systems. In ACM Symposium on High Performance Distributed Computing (HPDC), 2008.
[8] S. Rhea, C. Wells, P. Eaton, D. Geels, B. Zhao, H. Weatherspoon,and J. Kubiatowicz. Maintenance-free global data storage. IEEE Internet Computing, pp. 40-49, September 2001.
[9] Z. Wang, R. Mateescu, A.G. Dimakis, J. Bruck. Array codes for distributed storage: Results and open problems”, Information Theory and Applications (ITA), 2010.
[10] The OceanStore Project. http://oceanstore.cs.berkeley.edu/.
[11] J.Kubiatowicz, D.Bindel, Y.chen, S.Czerwinski, P.Eaton, D.Geels, R.Gummadi, S.Rhea, H.Weatherspon, W.Weimer, C.Wells, and B.Zhao. OceanStore: architecture for global-scale persistent storage[C]. In Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2000.
[12] Wells C. The OceanStore archive: Goals, structures, and self-repair[R]. UC Berkeley Masters Report, May, 2002.
[13] I.Stoica, R.Morris, D.Karger, M.F.Kaashoek, and H.Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet application[C]. In ACM SIGCOMM, 2001.
[14] F.Dabek, M.F.Kaashoek, D.Karger, R.Morris, and I.Stoica. Wide-area cooperativestorage with cfs[C]. In ACM Symposium on Operating Systems Principles (SOSP), 2001.
[15] Zhang Z, Lian Q, Lin S, Chen W, Chen Y, and Jin C. BitVault: a Highly Reliable Distributed Data Retention Platform[R]. Technical Report, MSR-TR-2005-179, Microsoft Research, 2005.
[16] Zhang Z, Lian Q, and Chen Y. Xring: Achieving High-Performance Routing Adaptively in Structured P2P[R]. Technical Report, MSR-TR-2004-93, Microsoft Research, 2004.
[17] A.Rowstron and P.Druschel. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems[C]. In IFIP/ACM International Conference on Distributed Systems Platforms, 2001.
[18] Druschel P, Rowstron A. PAST: a large-scale persistent peer-to-peer storage utility [C]. Proceedings of the 8th Workshop on Hot Topics in Operating Systems. IEEE Press, 2001:65-70.
[19] Bhagwan R, Tati K, Cheng Y, Savage S, and Voelker G. Total Recall: System Support for Automated Availability Management[C]. Proceeding of the First ACM/Usenix Symposium on Networked Systems Design and Implementation (NSDI), 2004.
[20]胡进锋,洪春辉,郑纬民.一种面向对象的Internet存储服务系统Granary[J].计算机研究与发展, 2007,44(6):1071-1079
[21]郑纬民,胡进锋,代亚非等.对等计算研究概论. http://www.ccf.org.cn
[22]丁嵩,田敬,陈东,代亚非. UPStore:一个开放的P2P存储平台[J].计算机研究与发展, 2009,46(z2)
[23] Jing Tian and Yafei Dai, Understanding the Dynamic of Peer-to-Peer Systems[C]. Proceeding of Sixth International Workshop on Peer-to-Peer Systems (IPTPS’07), 2007.
[24] Atul Adya, William J. Bolosky, and etc. Farsite: Federated, available, and reliable storage for an incompletely trusted environment[C]. Proceedings of 5th Symposium on Operation Systems Design and Implementation. December 2002, Vol. 36, pp. 1-14.
[25] Cox L, Murray C, and Noble B. Pastiche: making backup cheap and easy[C]. ACM SIGOPS Operating Systems Review, 2002.36:285-298
[26] A.Haeberlen, A.Mislove, and P.Druschel. Glacier: highly durable, decentralized storage despite massive correlated failures[C]. Proceedings of the 2nd conference on Symposium on Networked Systems Design&Implementation, pages 143-158, Berkeley, CA,USA,2005. USENIX Association. 12-16
[27] G.Utard and A. Vernois. Data durability in peer to peer storage systems[C]. Proceeding of IEEE GP2PC’04, Chicago, Illinois, April 2004.
[28] A. Abiteboul, A.Bonifati, G.Cobena, I.Manolescu, and T.Milo. Dynamic XML documents with distribution and replication[C]. Proceeding of the ACM SIGMOD Int. Conf. on Management of Data, pages 527-538, San Diego, California, June 2003.
[29] Clarke I, Hong T,Miller S, et al. Protecting free expression online with Freenet[J]. IEEE Internet Computing, 2002,6(1):40-49.
[30]万武南.分布式安全存储系统纠删码技术的研究[D].成都:中国科学院研究生院,2006
[31] R.Rodrigues and B.Liskov. High availability in DHTs: Erasure coding vs. replication[C]. Proceedings of IPTPS, Ithaca, USA, 2005.
[32] H.Weatherspoon and J.Kubiatowicz. Erasure coding vs. replication: A quantitative comparison[C]. Proceeding of IPTPS’02, Cambridge, Massachusetts, March 2002.
[33] J. Plank and M. Thomason. A Practical Analysis of Low-density Paritycheck Erasure Codes for Wide-area Storage Applications[C]. The International Conference on Dependable Systems and Networks. Florence, Italy, Jun, 2004.
[34] A.G.Dimakis, P.G.Godfrey, M.J.Wainwright, and K.Ramchandran. Network coding for peer-to-peer storage[C], Proceeding of INFOCOM, Anchorage, Alaska, May 2007.
[35] G.Utard and A.Vernois. Data durability in peer to peer storage systems. Proceeding of IEEE GP2PC’04, Chicago, Illinois, April 2004.
[36] A.Dandoush, S.Alouf, and P.Nain. Simulation analysis of download and recovery processes in p2p storage systems[R]. Research Report RR-6858, INRIA, 2009.
[37] C.Blake and R.Rodrigues. High availability, scalable storage, dynamic peer networks: pick two[C]. In USENIX Workshop on Hot Topics in Operating Systems (HotOS), 2003.
[38] F.Wu, T.Qiu, Y.Chen, and G.Chen. Redundancy schemes for high availability in DHTs[C]. In International Symposium on Parallel and distributed processing and Applications (ISPA), 2005.
[39] B. Schroeder and G. Gibson. Disk Failures in the real World: What Does an MTTF of 1,000,000 Hours Mean to You?[C] in Proc. 5th USENIX conference on File and Storage Technologies (FAST), San Jose, CA,Feb. 2007,pp.14-16.
[40] R.Koetter and F.Kschischang. Coding for errors and erasures in random network coding[C]. Proceeding of IEEE. Symp. Information Theory, Nice, France, June 2007, pp.791-795.
[41] M. Blaum, J. Brady, J. Bruck, and J. Menon. EVENODD: An efficient Scheme for tolerating Double Disk Failures in RAID Architectures [J]. IEEE Transactions on Computers, vol. 44, no. 2, pp. 192–202, 1995.
[42] M. Baker, M. Shah, D. Rosenthal, M. Roussopoulos, P. Maniatis, T. Giuli, and P. Bungale. A Fresh Look at the Reliability of Longterm Digital Storage[C]. In Proc. 1st ACM SIGOPS/EuroSys European Conference on Computer Systems, 2006.
[43] Y. Hu, Y. Xu, X. Wang, C. Zhan, and P. Li. Cooperative Recoveryof Distributed Storage Systems from Multiple Losses with NetworkCoding. IEEE Journal on Selected Areas in Communication, vol. 28,no. 2, pp. 268–276, Feb. 2010.
[44] L. Xiang, Y. Xu, J. Lui, and Q. Chang. Optimal Recovery of Single Disk Failure in RDP Code Storage Systems[C]. In Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 2010, pp. 119–130.
[45] F. Oggier and A. Datta. Self-repairing Homomorphic Codes for distributed Storage Systems. 2010. [Online]. Available: arXiv:1008.0064[cs.IT]
[46] Xiaozhao Wang, Yuchong Hu, Yinlong Xu, Kaiqian Qu. MFR: Multi-Loss Flexible Recovery in Distributed Storage Systems, IEEE International Conference on Communications 2010.
[47] S.Acedanski, S.Deb, M.Medard, R.Koetter. How good is random linear coding based distributed networked storage? In NetCod 2005.
[48] A.Kermarrec, N.L.Scouarnec, G.Straub. Repairing Multiple Failures with Coordinated and Adaptive Regenerating Codes. ArXiv:1102.0204v1 [cs.IT] Feb 2011.
[49] Xiaozhao Wang, Yuchong Hu, Yinlong Xu, Kaiqian Ou, MFR: Multi-Loss Flexible Recovery in Distributed Storage Systems, IEEE International Conference on Communications 2010.
[50] J.Li, S.Yang, X.Wang, X.Xue, and B.Li. Tree-structured data regeneration with network coding in distributed storage systems. In Proceeding of 17th IEEE International Workshop on Quality of Service (IWQos), 2009.
[51] S. Akhlaghi, A. Kiani, and M. R. Ghanavati,“A Fundamental Tradeoff between The Download Cost And Repair Bandwidth In Distributed Storage Systems,”in Proc. IEEE International Symposium on Network Coding (NetCod), Toronto, Jun. 2010.
[52] N. B. Shah, K. V. Rashmi, P. V. Kumar, and K. Ramchandran. Explicit Codes Minimizing Repair Bandwidth for Distributed Storage. In Proc. IEEE Information Theory Workshop, Cairo, Jan. 2010.
[53] Shah S, Ramamritham K, Shenoy P. Resilient and coherence preserving dissemination of dynamic data using cooperating peers. IEEE Trans. on Knowledge and Data Engineering, 2004,16(7):799-812
[54]覃飙,王珊,杜小勇. Peer数据管理系统中的视图维护策略[J].软件学报, 2007, 18(2):259-267.
[55] Z.Wang, R.Mateescu, A.G.Dimakis, J.Bruck. Array codes for distributed storage: Results and open problems [J]. Information Theory and Applications (ITA), 2010.
[56] Yijie Wang, Xiaoming Zhang. A Prediction-Based Parallel Replication Algorithm in Distributed Storage System[C]. In Proceedings of the 4th Grid and Cooperative Computing International Conference (GCC 2005). LNCS 3795, Springer, 2005. 690-700.
[57] David Del Vecchio, Sang H.Son. Flexible Update Management in Peer-to-Peer Database Systems[C]. In Proceedings of the 9th International Database Engineering & Application Symposium (IDEAS 2005). Washington: IEEE Computer Society, 2005. 435-444.
[58] Zhijun Wang, Sajal K.Das, Mohan Kumar, Huaping Shen. Update Progagation through Replica Chain in Decentralized and Unstructured P2P Systems[C]. In proceedings of the 4th IEEE International Conference on Peer-to-Peer Computing (P2P 2004). Washington: IEEE Computer Society, August 2004. 64-71.
[59] Xin Chen, Shansi Ren, Haining Wang, Xiaodong Zhang. SCOPE: Scalable ConsistencyMaintenance in Structured P2P Systems[C]. In Proceedings of the 24th Conference of the IEEE Communications Society (INFOCOM 2005). Washington: IEEE Computer Society, 2005. 1502-1513.
[60] E.Leontiadis, V.V.Dimakopoulos and E.Pitoura. Creating and Maintaining Replicas in Unstructured Peer-to-Peer Systems[C]. Proceedings of the 12th International Euro-Par Conference on Parallel Processing (EURO-PAR). Dresden, Germany, August 2006. 1015-1025.
[61] Zhijun Wang, Mohan Kumar, Sajal K. Das, Huaping Shen. File Consistency Maintenance through Virtual Servers in P2P Systems[C]. Proceedings of the 11th IEEE Symposium on Computers and Communications (ISCC 2006) Washington: IEEE Computer Society, 2006. 435-441.
[62] Picconi F, Baynat B, Sens P. Predicting durability in DHTs using Markov chains[C]. Proceedings of the 2nd International Conference on Digital Information Management.Lyon, France: IEEE, 2007:532-538.
[63] Datta A, Aberer K. Internet-scale storage systems under churn– a study of the steady-state using markov models[C]. In IEEE international conference on peer-to-peer computing(P2P), Cambridge, United Kingdom, 2006:39-48
[64]田敬,代亚非. P2P持久存储研究综述[J].软件学报,2007, 18(6):1379-1399.
[65]田敬,张大为,代亚非,韩华. ESStore:P2P网络的可靠存储协议[C].全国网络与信息安全技术研讨会’2005论文集(下册)
[66] Ramabhadran S, Pasquale. J. Analysis of Long-Running replicated system[C]. Proceedings of the 25th IEEE International Conference on Computer Communications. Barcelona, USA: IEEE, 2006: 1-9.
[67] Jing Tian, Zhi Yang and Yafei Dai, A Data Placement Scheme with Time-Related Model for P2P Storages,. Proceeding of Seventh International Conference on Peer-to-Peer Computing, 2007.
[68] S. Acedacnski, S. Deb, M. Medard, and R. Koetter. How good is random linear coding based distributed networked storage? In Workshop on Network Coding, Theory, and Applications (NetCod), 2005
[69] R. Bhagwan, D. Moore, S. Savage, and G. M. Voelker. Replication strategies for highly available peer-to-peer storage[R]. Technical Report CS2002-0726, University of California at San Diego, 2002.
[70] Ramabhadran S, Pasquale J. Analysis of durability in replicated distributed storage systems[C]. 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS). Atlanta, GA, April 2010:1-12
[71] Byung-Gon Chun, Frank Dabek, Andreas Haeberlen, Emil Sit, Hakim Weatherspoon, M. Frans Kaashoek, John Kubiatowicz, and Robert Morris. Efficient replica maintenance for distributed storage systems[C]. Proceedings of the 3rd Symposium on Networked System Design and Implementation. California, USA: USENIX Association, 2006:45-58.
[72] Hakim Weatherspoon. Design and evaluation of distributed wide-area on-line archival storage systems [D]. University of California Berkeley Ph.D. Dissertation (2006).
[73]王禹,赵跃龙,侯昉. P2P存储系统副本一致性维护策略[J].计算机工程, 2009,36(1):27-29.
[74] Duminuco A, Biersack E, En-Najjary T. Proactive replication in distributed storage systems using machine availability estimation[C]. In ACM conference on emergingnetworking experiments and technologies, New York, USA:ACM,2007:1-12
[75] Weatherspoon H, Chun Byung-Gon, So Chiu Wah, et al. Long-term data maintenance in wide-area storage systems: a quantitative approach[R]. Berkeley USA: University of California, 2005.
[76] Liu X., Lan J, Shenoy P, et al. Consistency maintenance in dynamic peer-to-peer overlay networks [J]. ComputerNetworks, 2005, 50:859-876
[77] Datta A, Hauswirth M, Aberer K, Updates in highly unreliable replicated peer-to-peer systems[C]. Proceedings of the 23rd International Conference on Distributed Computing Systems: Rhode Island USA:IEEE, 2003:76-88
[78] PlanetLab, An open platform for developing, deploying, and accessing planetary-scale services, http://www.planet-lab.org/(2010)
[79] D. A. Patterson, G. Gibson, and R. H. Katz. A case for redundant arrays of inexpensive disks (RAID)[C]. Proceeding of ACM SIGMOD Chicago, USA, June 1988.
[80] I. Reed and G. Solomon. Polynomial Codes over certain Finite Fields [J]. Journal of the Society for Industrial and Applied Mathematics, vol. 8, no. 2, pp. 300–304, 1960.
[81] Y. Wu, A.G.Dimakis, and K. Ramchandran, Deterministic regenerating codes for distributed storage[C]. In Allerton Conference on Control, Computing, and Communication, Monticello, IL, October 2007
[82] Z. Wang, A. G. Dimakis, and J. Bruck. Rebuilding for Array Codes in Distributed Storage Systems[C]. In Workshop on the Application of Communication Theory to Emerging Memory Technologies (ACTEMT), Dec. 2010.
[83] S. Akhlaghi, A. Kiani, and M. R. Ghanavati. A Fundamental Tradeoff etween The Download Cost and Repair Bandwidth in Distributed Storage Systems. Proceeding of IEEE International Symposium on Network Coding (NetCod), Toronto, Jun. 2010.
[84] N. B. Shah, K. V. Rashmi, and P. V. Kumar. A Flexible Class of egenerating Codes for Distributed Storage. Proceeding of IEEE International smposium on Information Theory (ISIT), Austin, Jun. 2010, pp. 1943–1947.
[85] B. Gast′on and J. Pujol. Double Circulant Minimum Storage egenerating Codes. 2010. [Online]. Available: arXiv:1007.2401[cs.IT]
[86] Z. Wang, R.Mateescu, A.G. Dimakis, J.Bruck, Array codes for distributed storage: Results and open problems [J]. Information Theory and Application. ITA, 2010
[87] R.Koetter and M. Medard. An algebaic approach to network coding [J]. Transactions on Networking, October 2003
[88] Y. Wu. Existence and construction of capacity-achieving network codes for distributedstorage [J]. Journal on Selected Areas in Communications. Vol.28, issue 2. pp.277-288, Feb.2010
[89] J. Li and S. Yang and Xin Wang and Baochun Li. Tree structured Data Regeneration in Distributed Storage Systems with Regenerating Codes[C]. Proceedings of IEEE INFOCOM 2010.
[90] P. Corbett, B. English, A. Goel, T. Grcanac, S. Kleiman, J. Leong, and S. Sankar. Row-Diagonal Parity for Double Disk Failure Correction[C]. Proceedings of 3rd USENIX Conference on File and Storage Technologies (FAST), 2004, pp. 1–14.
[91] B. Gaidioz, B. Koblitz, and N. Santos. Exploring High Performance Distributed File Storage using LDPC Codes [J]. Parallel Computing, vol. 33, no. 4-5, pp. 264–274, 2007.
[92] Nihar B.Shah, K.V.Rashmi, P.Vijay Kumar, Kannan Ramchandran. Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff[C]. in Allerton Conf, Urbana-Champaign, Sep.2009
[93] N.B.Shah, R.K.V., P.V.Kumar, and K.Ramchandran. Distributed storage codes with repair-by-transfer and non-achievability of interior points on the storage-bandwidth tradeoff. CoRR, vol. abs/1011.2361, 2010. http://arxiv.org/abs/1011.2361.
[94] A. G. Dimakis, P. B. Godfrey, Y. Wu, M. Wainwright, and K. Ramchandran. Network Coding for Distributed Storage Systems[C]. IEEE Transactions on Information Theory, vol. 56, no. 9, pp. 4539–4551, 2010.
[95] R. Gallager. Low density Parity-Check Codes [J]. IRE Transactions on Information Theory, vol. 8, no. 1, pp. 21–28, Jan. 1962.
[96] M. Luby, M. Mitzenmacher, M. Shokrollahi, D. Spielman, and V. Stemann. Practical Loss-Resilient Codes. Proceeding of 29th annual ACM symposium on Theory of computing, 1997, pp. 150–159.
[97] A. Shokrollahi. Raptor Codes [J]. IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2551–2567, 2006.
[98] F.J. MacWilliams and N.J.A. Sloane. The Theory of Error-Correcting Codes [M]. Part I, North-Holland Publishing Company, Amsterdam, New York, Oxford, 1977.
[99] Y. Wu. A Construction of Systematic MDS Codes with Minimum Repair Bandwidth [J]. IEEE Transactions on Information Theory, submitted for publication. [Online]. Available: arXiv:0910.2486[cs.IT]
[100] V. R. Cadambe, S. A. Jafar, and H. Maleki. Distributed Data Storage with Minimum Storage Regenerating Codes - Exact and Functional Repair are Asymptotically EquallyEfficient [J]. [Online]. Available: arXiv:1004.4299[cs.IT]
[101] B. Gaston and J. Pujol. Double Circulant Minimum Storage Regenerating Codes [J]. Submitted to Allerton Conf., Urbana-Champaign, Sep. 2010. Available online at arXiv:1007.2401 [cs.IT].
[102] C. Huang and L. Xu. STAR: An efficient coding scheme for correcting triple storage node failures [J]. IEEE Transactions on Computers, vol. 57, no. 7, pp. 889–901, 2008.
[103] S. El Rouayheb and K. Ramchandran. Fractional Repetition Codes for Repair in Distributed Storage Systems[C]. Proceeding of 48th Annual Allerton Conference on Control, Computing, and Communication, Urbana-Champaign, Sep. 2010.
[104] M. Blaum, J. Bruck, and A. Vardy. MDS Array Codes with Independent Parity Symbols [J]. IEEE Transactions on Information Theory,, vol. 42, no. 2, pp. 529–542, Mar. 2002.
[105] A. G. Dimakis, P. Brighten Godfrey, M. J.Wainwright, K. Ramchandran. The Benefits of Network Coding for Peer-to-Peer Storage Systems[C]. Workshop on Network Coding, Theory, and Applications (Netcod), 2007
[106] A. Duminuco, E.W. Biersack. A Practical Study of Regenerating Codes for Peer-to-Peer Backup Systems[C]. Conference on Distributed Computing Systems (ICDCS), 2009.
[107] A. Datta, K. Aberer. Internet-Scale Storage Systems under Churn– A Study of the Steady-State using Markov Models[C]. Conference on Peer-to-Peer Computing (P2P), pp. 133-144, 2006
[108] A. Duminuco and E. Biersack. Hierarchical Codes: How To Make Erasure Codes Attractive for Peer-to-Peer Storage Systems[C]. In 8th International Conference on Peer-to-Peer Computing (P2P), 2008, pp.89–98.
[109] Mingqiang Li, Jiwu Shu, and Weimin Zheng. GRID codes: Strip-based erasure codes with high fault tolerance for storage systems [J]. In ACM Transactions on storage, 2009.
[110] V. R. Cadambe and S. A. Jafar. Interference alignment and the degree of freedom for the K user interference channel. IEEE Transactions on Information Theory, vol. 54, no. 8, pp. 3425–3441, Aug. 2008.
[111] M.A.Maddah-Ali, S.A.Motahari and A.K.Khandani. Communication over MIMO X Channels: Interference Alignment, Decomposition, and Performance Analysis [J]. IEEE Transactions on Information Theory, 54(8), pp.3457-3470, Aug.2008.
[112] J. Elerath. Hard-disk drives: The good, the bad, and the ugly [J]. Communications of the ACM, vol. 52, no. 6, pp. 38–45, 2009.
[113] D. S. Bernstein, Matrix mathematics: Theory, facts, and formulas with application to linear systems theory [M]. Princeton University Press, 2005
[114] A.A.Bubrulle. Work notes on elementary matrics[R]. Technology Report. HPL-93-69, Hewlen- Packard Laboratory, 1993.
[115] R. Koetter and M. Medard, An algebraic approach to network coding [J]. IEEE/ACM Transaction. Networking. vol. 11, no. 5, Oct. 2003, pp. 782–795.
[116] Y. Wu and A. G. Dimakis. Reducing Repair Traffic for Erasure Coding-Based Storage via Interference Alignment [J]. in Proc. IEEE ISIT, Seoul, Jul. 2009.
[117]王禹,赵跃龙,侯昉.基于副本管理的P2P存储系统可靠性分析[J].华南理工大学学报(自然科学版), 2011 Vol. 39(2):148-152
[118]周婧. P2P分布存储系统中海量数据的数据一致性维护技术研究[D].长沙:国防科技大学,2007
[119] Xun-yi Ren; Wang Ru-chuan; Kong Qiang. Efficient Model for Replica Consistency Maintenance in Data Grids[C]. In International Symposium on Computer Science and its Applications, Nanjing, china. Oct. 2008, pp. 159 - 162
[120] Ximei Wang; Shoubao Yang; Shuling Wang, Xianlong Niu, Jing Xu. An Application-Based Adaptive Replica Consistency for Cloud Storage[C]. the 9th International Conference on Grid and Cooperative Computing (GCC). Nanjing, china. Nov. 2010, pp. 13 - 17
[121] Ghalem Belalem, Yahya Slimani. A Consistency Protocol Multi-Layer for Replicas Management in Large Scale Systems. PROCEEDINGS OF World Academy of Science, Engineering and Technology. 2006,pp.117-122
[122] The Napster website. http://www.napster.com
[123] S. Rhea, P. Eaton, D. Geels, H. Weatherspoon, B. Zhao, and J. Kubiatowicz. Pond: The OceanStore Prototype[C]. Proceeding of 2nd USENIX conference on File and Storage Technologies (FAST), 2003, pp. 1–14.
[124] I Clarke, O Sandberg, B Wiley, and T W Hong. Freenet: A Distributed Anonymous Information Storage and Retrieval System[C]. In Workshop on Design Issues in Anonymity and Unobservability, July 2000: 311-320.
[125] Gnutella website. http://www.gnutella.com
[126]谢鲲,张大方,谢高刚等.基于轨迹卷标的无结构P2P副本一致性维护算法[J].软件学报, 2007, 18(1):105-116
[127]苏长根,欧阳松. P2P系统中基于副本链的一致性维护算法[J].计算机工程, 2008, 34(18):145-147
[128] A. Rowstron and P. Druschel. Storage management and caching in PAST, a large-scalepersistent peer-to-peer storage utility[C]//Proceedings of ACM SOSP’01. Alberta, Canada: ACM Press, 2001:188-201.