对等存储系统数据管理研究
|
摘要
P2P是构建分布式体系结构的主流技术之一,在现实世界已经得到大量普及和应用。P2P存储作为P2P主要研究内容,更成为近年来研究热点之一,其目标是充分利用广域网环境中各种可能的边缘节点进行大规模的协作计算和存储共享。然而由于P2P系统具有开放性、自组织性和高度动态特性,使得对等存储系统运行过程中对用户存在潜在的数据安全性和可用性问题。P2P系统的大多数问题都可归结为数据管理方面的问题,如数据分布与放置、数据检索等,而且这些数据管理问题在后起的云计算系统、社交网络、信息物理融合系统等应用中依然存在。在云计算中,由于资源相对集中,对其管理也可以实现集约化。而P2P因为大量文件或者数据资源分散管理和存储,难以保障资源的可靠性。因此,研究数据管理问题成为解决对等存储系统容错性、可靠性以及节点数据分发和查找的关键。云存储是分布式存储技术与虚拟化技术结合的产物,是分布式存储技术的最新发展,对等技术在这种新的计算模式下依然具有旺盛的活力。
在大规模对等存储系统中,对数据的管理成为整个系统运行生命周期中最核心的问题。本文从整个系统的角度分析和研究对等存储系统的数据管理,包括数据本身以及元数据的管理问题。前者主要涉及到数据副本的管理,而后者则和数据的分发、检索和查找相关,即元数据表示和组织。在以上研究基础上,设计和实现了一个半结构化的对等存储原型系统----石鼓(Scool)。本文在向对等存储系统构建技术进行系统、全面的总结基础之上,就对等存储数据管理问题展开了深入细致的研究,取得了若干创新成果。本文的主要贡献包括以下几方面:
(1)设计了一种数据副本数量计算模型。对等存储系统中副本数据管理,涉及数据冗余策略、数据分发以及数据修复等问题。副本冗余是提高数据可用性和并发访问效率的关键技术。本文结合节点的在线率和资源访问的热度设计副本的数量,其绕开了对系统可用性非确定性的计算难点,并且根据数据资源访问的热点频度考虑副本的数量(网络中大量的访问总是针对当前最热门的话题),在提高资源可用性的同时提高数据资源的并发访问速度,减少数据副本一致性维护开销。这种方法根据节点所承担的角色不同采取不同的修复策略,有效的解决了由于P2P系统节点高动态变化所带来的不确定性影响,节省系统整体存储和计算资源,减少系统不同节点数据间一致性维护开销和副本维护带宽占用率,从而较好的适应于对等存储系统的性能需求。
(2)提出了一种兴趣聚集的对等存储系统元数据管理机制。目前展开针对P2P存储系统元数据管理的研究还比较缺乏,本文基于半结构化P2P存储系统,设计了一个基于兴趣的Bloom Filter结构I-BSP2P。其使用基于兴趣聚集、分层的BloomFilters去定位和组织元数据,把对元数据的查询路由到不同的超级节点上。实验表明这种方法具有较好的自适应性和可扩展性,在查询时间、数据迁移损耗等指标上均取得了满意的结果。
(3)设计和实现了一个基于体裁互文性的P2P信息检索模型。目前针对P2P信息检索的研究大多集中在资源搜索机制上面,而P2P存储系统是一个多结构数据存储系统,系统中有多个数据源,数据有各种表示形式,不同的用户对相同的现实世界的实体可能会使用不同的描述数据,有不同的表示,这样必然会产生语义异构的问题。本文首次以语言学中体裁互文性理论为基础,将体裁互文性概念拓展到信息空间任务上下文,解决文档体裁的自动识别问题;同时,用体裁表达文档目标及查询目标,解决传统方法中查询目标用体裁显式表达的困难。这对于P2P信息检索技术的实现和完善有一定借鉴意义,同时为语言学的体裁互文性理论研究提供新视野和方法。着重在三个方面开展研究:第一,任务上下文中体裁互文性基本概念、性质与度量研究,将体裁互文性概念拓展到任务上下文,对其性质进行定量研究,建立互文性强度的度量方法;第二,基于互文性的文档体裁识别研究,根据关系理论提出目的性体裁概念,建立文档体裁自动识别算法;第三,基于任务上下文的体裁查询意图预测遗传算法研究。实验表明本文所设计方法在召回率、平均准确率均值、Bpref这三个P2P信息检索典型评价指标上均取得了较好的效果。
P2P, which has been a lot of popularity and application in the real world, is one of the main technologys to build distributed architecture. As P2P main study contents Peer-to-Peer (P2P) storage system is a hot topic in recently year, which goal is to make full use of all possible edge node of wide area network environment for large-scale collaborative computing and storage sharing. However, data availability and security are two potential problems to users in the running of storage system because of openness, self organization and high dynamic characteristic of peers. Most P2P system problems can be attributed to the data management issues, such as data distribution and placement, data retrieval, etc. And these data management issues still exist in the emerging cloud computing, social networks, Cyber-Physical-System. In the cloud computing, due to the relative concentration of resources, it can achieve intensive management. While P2P system scattered manages and stores large number of files or data storage resource, it is difficult to protect the reliability of resources. Therefore, the study of storage system data management issues is the key for solving availability, reliability, scalability and security. Cloud storage is the product combined distributed storage with virtualization technology, and is the latest development of the distributed storage technology. P2P technology in this new computing model still has the vigor and vitality.
In large-scale P2P storage systems, data management is the core issues of entire life cycle of system running. This paper tries to analyze and research on storage systems data management from the perspective of whole system, including the data itself and metadata management. The former is mainly related to data copy management, while the latter is to data distribution, resource search and find, namely metadata representation and organization. Finally, a semi-structured P2P storage prototype system, Scool, is designed and implemented. Based on systematically summarizing the relevant works on P2P storage technologies, this paper focuse on the related teehnologies of P2P storage data management and gains several achievements on sub domains and related technologies. The major contributions of this dissertation are as below:
(1) Designed a data calculation model for the number of copies. Copy redundancy is key technologies to improve data availability and concurrent access efficiency. P2P storage system copies data management include data redundancy strategies, data distribution and data recovery and other issues. This paper designs the number of copies combining nodes online and resources access rate, which consider copy number according to access frequency of hot data resources, bypassing the calculation of non-deterministic way of system availability. To improve resource availability and increase the speed concurrent access to data resources, it reduces data replica consistency maintenance overhead. In terms of different role of node to adopt different repair strategies, uncertainty caused by high dynamic of P2P system node is resolved effectively, which save network bandwidth, reduce latency, improve data query performance.
(2) A novel interest gathered storage systems metadata management mechanism is proposed. Research that aimed at P2P storage systems metadata management is still relatively scarce. Based on semi-structured P2P storage systems, Interest aggregated-based Bloom filter in Semi-structure P2P storage system (I-BSP2P) is addressed, which used interest aggregation and hierarchical Bloom Filters to locate and organize metadata, and routed the metadata query request to different metadata servers. Experiments showed that this method had good adaptability and scalability and significantly improved metadata query efficiency and access performance.
(3) Designed and implemented a genre intertexuality P2P information retrieval model. Currently research against P2P information retrieval mostly concentrated in the resource search mechanism. While P2P storage system is multi-structured data storage system, which has multiple data sources, variety data representation. And different users may use different data to describe the same real world entity, which would induce the problem of semantic heterogeneity. This is the first to extend genre intertextuality concept of linguistics to task context of P2P information retrival based on the concept of genre intertextuality and address the problem of document genres automatic identification. Meanwhile, inquiry target and document target is denoted by using genre and the problem that traditional method is difficult to explicitly express inquiry target with genre is solved. This can provide certain reference to achieving and improving of P2P information retrieval technology and give new vision and methods to study on genre intertextuality theory of linguistics. Research focuses on three areas. Firstly, the basic concepts, nature and measurement of genre intertextuality in task context, expanding the concept of genre intertextuality to task context, researching on the nature of its quantitative, establishing intertextuality strength measurement methods. Secondly, distinguishing intertextuality document genre based, proposing concept of purpose genre according to the relationship theory, building algorithm for document genre automatic identification. Finally, predicting query intent using genre and genetic algorithm based on task context. Experiments show that good results is achieved in the design method in three metrics, the recall rate, the average accuracy rate of the mean, bpref, which are typical evaluation indicators of P2P information retrieval.
在大规模对等存储系统中,对数据的管理成为整个系统运行生命周期中最核心的问题。本文从整个系统的角度分析和研究对等存储系统的数据管理,包括数据本身以及元数据的管理问题。前者主要涉及到数据副本的管理,而后者则和数据的分发、检索和查找相关,即元数据表示和组织。在以上研究基础上,设计和实现了一个半结构化的对等存储原型系统----石鼓(Scool)。本文在向对等存储系统构建技术进行系统、全面的总结基础之上,就对等存储数据管理问题展开了深入细致的研究,取得了若干创新成果。本文的主要贡献包括以下几方面:
(1)设计了一种数据副本数量计算模型。对等存储系统中副本数据管理,涉及数据冗余策略、数据分发以及数据修复等问题。副本冗余是提高数据可用性和并发访问效率的关键技术。本文结合节点的在线率和资源访问的热度设计副本的数量,其绕开了对系统可用性非确定性的计算难点,并且根据数据资源访问的热点频度考虑副本的数量(网络中大量的访问总是针对当前最热门的话题),在提高资源可用性的同时提高数据资源的并发访问速度,减少数据副本一致性维护开销。这种方法根据节点所承担的角色不同采取不同的修复策略,有效的解决了由于P2P系统节点高动态变化所带来的不确定性影响,节省系统整体存储和计算资源,减少系统不同节点数据间一致性维护开销和副本维护带宽占用率,从而较好的适应于对等存储系统的性能需求。
(2)提出了一种兴趣聚集的对等存储系统元数据管理机制。目前展开针对P2P存储系统元数据管理的研究还比较缺乏,本文基于半结构化P2P存储系统,设计了一个基于兴趣的Bloom Filter结构I-BSP2P。其使用基于兴趣聚集、分层的BloomFilters去定位和组织元数据,把对元数据的查询路由到不同的超级节点上。实验表明这种方法具有较好的自适应性和可扩展性,在查询时间、数据迁移损耗等指标上均取得了满意的结果。
(3)设计和实现了一个基于体裁互文性的P2P信息检索模型。目前针对P2P信息检索的研究大多集中在资源搜索机制上面,而P2P存储系统是一个多结构数据存储系统,系统中有多个数据源,数据有各种表示形式,不同的用户对相同的现实世界的实体可能会使用不同的描述数据,有不同的表示,这样必然会产生语义异构的问题。本文首次以语言学中体裁互文性理论为基础,将体裁互文性概念拓展到信息空间任务上下文,解决文档体裁的自动识别问题;同时,用体裁表达文档目标及查询目标,解决传统方法中查询目标用体裁显式表达的困难。这对于P2P信息检索技术的实现和完善有一定借鉴意义,同时为语言学的体裁互文性理论研究提供新视野和方法。着重在三个方面开展研究:第一,任务上下文中体裁互文性基本概念、性质与度量研究,将体裁互文性概念拓展到任务上下文,对其性质进行定量研究,建立互文性强度的度量方法;第二,基于互文性的文档体裁识别研究,根据关系理论提出目的性体裁概念,建立文档体裁自动识别算法;第三,基于任务上下文的体裁查询意图预测遗传算法研究。实验表明本文所设计方法在召回率、平均准确率均值、Bpref这三个P2P信息检索典型评价指标上均取得了较好的效果。
P2P, which has been a lot of popularity and application in the real world, is one of the main technologys to build distributed architecture. As P2P main study contents Peer-to-Peer (P2P) storage system is a hot topic in recently year, which goal is to make full use of all possible edge node of wide area network environment for large-scale collaborative computing and storage sharing. However, data availability and security are two potential problems to users in the running of storage system because of openness, self organization and high dynamic characteristic of peers. Most P2P system problems can be attributed to the data management issues, such as data distribution and placement, data retrieval, etc. And these data management issues still exist in the emerging cloud computing, social networks, Cyber-Physical-System. In the cloud computing, due to the relative concentration of resources, it can achieve intensive management. While P2P system scattered manages and stores large number of files or data storage resource, it is difficult to protect the reliability of resources. Therefore, the study of storage system data management issues is the key for solving availability, reliability, scalability and security. Cloud storage is the product combined distributed storage with virtualization technology, and is the latest development of the distributed storage technology. P2P technology in this new computing model still has the vigor and vitality.
In large-scale P2P storage systems, data management is the core issues of entire life cycle of system running. This paper tries to analyze and research on storage systems data management from the perspective of whole system, including the data itself and metadata management. The former is mainly related to data copy management, while the latter is to data distribution, resource search and find, namely metadata representation and organization. Finally, a semi-structured P2P storage prototype system, Scool, is designed and implemented. Based on systematically summarizing the relevant works on P2P storage technologies, this paper focuse on the related teehnologies of P2P storage data management and gains several achievements on sub domains and related technologies. The major contributions of this dissertation are as below:
(1) Designed a data calculation model for the number of copies. Copy redundancy is key technologies to improve data availability and concurrent access efficiency. P2P storage system copies data management include data redundancy strategies, data distribution and data recovery and other issues. This paper designs the number of copies combining nodes online and resources access rate, which consider copy number according to access frequency of hot data resources, bypassing the calculation of non-deterministic way of system availability. To improve resource availability and increase the speed concurrent access to data resources, it reduces data replica consistency maintenance overhead. In terms of different role of node to adopt different repair strategies, uncertainty caused by high dynamic of P2P system node is resolved effectively, which save network bandwidth, reduce latency, improve data query performance.
(2) A novel interest gathered storage systems metadata management mechanism is proposed. Research that aimed at P2P storage systems metadata management is still relatively scarce. Based on semi-structured P2P storage systems, Interest aggregated-based Bloom filter in Semi-structure P2P storage system (I-BSP2P) is addressed, which used interest aggregation and hierarchical Bloom Filters to locate and organize metadata, and routed the metadata query request to different metadata servers. Experiments showed that this method had good adaptability and scalability and significantly improved metadata query efficiency and access performance.
(3) Designed and implemented a genre intertexuality P2P information retrieval model. Currently research against P2P information retrieval mostly concentrated in the resource search mechanism. While P2P storage system is multi-structured data storage system, which has multiple data sources, variety data representation. And different users may use different data to describe the same real world entity, which would induce the problem of semantic heterogeneity. This is the first to extend genre intertextuality concept of linguistics to task context of P2P information retrival based on the concept of genre intertextuality and address the problem of document genres automatic identification. Meanwhile, inquiry target and document target is denoted by using genre and the problem that traditional method is difficult to explicitly express inquiry target with genre is solved. This can provide certain reference to achieving and improving of P2P information retrieval technology and give new vision and methods to study on genre intertextuality theory of linguistics. Research focuses on three areas. Firstly, the basic concepts, nature and measurement of genre intertextuality in task context, expanding the concept of genre intertextuality to task context, researching on the nature of its quantitative, establishing intertextuality strength measurement methods. Secondly, distinguishing intertextuality document genre based, proposing concept of purpose genre according to the relationship theory, building algorithm for document genre automatic identification. Finally, predicting query intent using genre and genetic algorithm based on task context. Experiments show that good results is achieved in the design method in three metrics, the recall rate, the average accuracy rate of the mean, bpref, which are typical evaluation indicators of P2P information retrieval.
引文
[1] Chang Li-Pin,Du Chun-Da. Design and implementation of an efficient wear Leveling algorithm for solid-state-disk microcontrollers.ACM Transactions on Design Automation of Electronic Systems,2009,15(1):1-36.
[2] EI Maghraoui Kaoutar,Kandiraju Gokul,Jann Joefon.Modeling and simulating flash based solid-state disks for operating systems.In:Proceedings of the 1st Joint WOSP/SIPEW Intemational Conference on Performance Engineering,15-26. 2010.
[3] AndyOram, Peer-to-Peer: Harnessing the Power of Disruptive Technologies, Publisher: O’Reilly Media,2001.
[4] Seholl meier Rudiger.A Definition of Peer-to-Peer Networking for the Classifieation Of Peer-t-Peer Architeetures and APPlieations.In:Proeeedings of First Interational Conference on Peer-to-Peer ComPuting2001(P2P2001). LinkoPing: IEEE ComPuter Soeiety, 101-102.2001.
[5] Azuri,C.iPoque,Internet study 2007: P2P file sharing still dominates the world wide Internet[EB/OL].http://ww.ipoqpe.com,2007.
[6] The true picture of Peer-to-Peer file-sharing [EB/OL]. http://www.cachelogic. com/researh/CacheLogic_Analyst_Presnetation_july2004.Pdf,2004.
[7] Antony Rowstron,Peter Drusehe.Pastry:scalable,distributed object location and routing for large-scale Peer-to-Peer systems.In Proceedings of the 18 IFIP/ACM International Conference on Distributed System Platforms.Berlin:ACM Press, 329-350. 2001.
[8] Ion Stoiea,Robert Morris,David Karge.Chord:A scalable Peer-to-Peer lookup service for internet applications.Proeeeding of ACM SIGCOMM 2001- Applications,Technologies,Architectures,and Protocols for Computers Communications.New York:Association for Computing Machinery,149-160. 2001.
[9] Sylvia Ratnasamy,Paul Franeis,Mark Handley.A scalable content-addressable network.Proeeeding of ACM SIGCOMM 2001-Applications, Technologies, Architectures, and Protocols for Computers Communications.New York: Association for Computing Machinery, 161-172. 2001.
[10] BenY.Zhao,John Kubiatowiez,Anthony D.Joseph.Tapestry:an infrastructure for fault-tolerant wide-area location and routing[EB/OL]. http://bnrg.cs.berkeley.edu. 2001.
[11] IRIS:Infrastructure for resilient internet systems[EB/OL].http://project-iris.net/.
[12] Rhea,C.Wells,P.Eaton,et al.Maintenance-free global storage in oceanstore. Proceedings of the IEEE Internet Computing.IEEE, 40-49. 2001.
[13] F.Dabek,M.F.Kaashoek,D.Karger,et al.Wide-area cooperative storage with CFS.Proceedings of the18th ACM Symposium on Operating Systems Principles (SOSP'01).New York:Association for Computing Machinery, 202-215. 2001.
[14] W.Zheng,J.Hu,M.Li.Granary:architecture of object oriented internet storage service .Proceedings of the IEEE International Conference on E-Commerce Technology for Dynamic E-Business(CEC-EAST 2004). Washington:IEEE Computer Society, 294-297. 2004.
[15]田敬,代亚非. P2P持久存储研究综述.软件学报, 2007, 18( 6) : 1379-1399.
[16]李振华. P2P十年:何去何从?计算机学会通讯.中国计算机学会通讯, 2010, 6(1):59-63.
[17]代亚非.P2P存储在云计算时代的新的机遇.中国计算机学会通讯. 2009,5(6): 54-56.
[18] Fay Chang, Jeffrey Dean, Sanjay Ghemawat, et al. Bigtable: a distributed storage system for structured data. In: Proc of the 7th USENIX Symp on OSDI,Berkeley,2006.
[19] Hbase Development Team. Hbase:Bigtable-Like Structured Storage for Hadoop Hdfs[EB/OL] .http://wiki.apache.org/hadoop/Hbase. 2011.
[20] Gu Yunhong,Robert L G.Sector and sphere: the design and implementation of a high-performance data cloud. Philosophical Transactions of the Royal Society, 2009(367):2429-2445.
[21] Marozzo F, Talia D, Trunfio P. Adapting MapReduce for dynamic environments using a peer-to-peer model. Workshop on cloud computing and its applications, Chicago, USA, 2008.
[22] Daniel J A.Data management in the cloud: limitations and opportunities.Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 2009,32(1):3-12.
[23] Amazon. Amazon Simple Storage Service[EB/OL] .http://www.amazon.com/s3. 2011.
[24]吴吉义,傅建庆,平玲娣等.一种对等结构的云存储系统研究.电子学报, 2011, 39(5):1100-1107.
[25] Boyd,Danah,Ellison, Nieole. Social Network Sites:Definition, History, and Scholarship. Journal of computer-Mediated Communication 13(1), 2007.
[26] Report:Cyber-Physical Systems Summit[EB/OL], Http://varma.ece.cmu.edu/ summit/CPS_Summit_Report.pdf,2010.
[27] Koubaa A, Andersson B.A Vision of Cyber-Physical Internet//Proceeding of the 8th International Workshop on real-Time Networks(RTN'09).2009.
[28]陈丽娜,王小乐,邓苏.CPS体系结构设计.计算机科学,2011:38(5):295-300.
[29]胡雅菲,李方敏,刘新华. CPS网络体系结构及关键技术.计算机研究与发展. 2010, 47(z2):304-311.
[30] DeCandia, G., et. al. Dynamo: Amazon's highly available key-value store. In Proceedings of the 21st ACM Symposium on Operating Systems Principles .New York:ACM Press, 205-220. 2007.
[31]俞敏,李战怀,张龙波. P2P数据管理.软件学报,2006,17(8):1717-1730.
[32] Lu Q, Cao P, Cohen E. Search and replication in unstructured peer-to-peer networks//Proceedings of the 16th ACM International Conference on Supercomputing. New York: ACM Press, 84-95. 2002.
[33] Kalogeraki V, Gunopulos D, Zeinalipour-Yazti D. A local search mechanism for peer-to-peer networks//Proceedings of the Eleventh International Conference on Information and Knowledge Management. New York: ACM Press, 300-307. 2002.
[34] Yang B, Garcia-Molina H. Improving search in peer-to-peer networks . IEEE Computer Society, 2002.7: 5-14 .
[35] Shen H T, Shu Y F, Yu B. Efficient semantic-based content search in P2P network. IEEE Trans on Knowledge and Data Engineering,2004, 16(7): 813-825.
[36] Tang C, Xu Z, Mahalingam M. Peer-to-peer information retrieval usingself-organizing semantic overlay networks//Proceedings of the ACM SIGCOMM. Karlsruhe: ACM Press, 175-186. 2003.
[37] Sripanidkulchai K, Maggs B, Zhang H. Efficient content location using interest-based locality in peer-to-peer systems//INFOCOM. San Franciso: IEEE Computer Society, 2166-2176. 2003.
[38] Daniel A M. Scalable P2P search . IEEE Internet Computing, 2003, 7(2): 83-87..
[39] Zhu Y, Yang X, Hu Y. Making search efficient on gnutella-like p2p systems //Proceedings of the 19th IEEE International Parallel & Distributed Processing Symposium. New York: ACM Press, 56-65.2005.
[40]周晋,路海明,李衍达.用small-world设计无组织P2P系统的路由算法.软件学报, 2004, 15(6): 915-923.
[41] Huang Juncheng, Li Xiuqi, Wu Jie. A class-based search system in unstructured P2P networks //21st International Conference on Advanced Networking and Applications. New York: ACM Press, 76-83. 2007.
[42] MILGRAM S.The small world problem.Psychology Today,1967,67( 1) : 60-67.
[43] NEWMAN M E J.Models of the small world: a review.Journal of Statistical Physics,2000,101( 3-4) : 819-841.
[44] LIU Lu, ANTONOPOULOS N, MAKIN S.Social peer-to-peer for resource discovery//Proc of the 15th Euromicro International Conference on Parallel,Distributed and Network-based Processing. 459-466.2007.
[45] Steven D Gribble, Alon Y Halevy, Zachary G I ves, et al . What Can Databases Do for Peer to Peer?. Mecca: Proc. of the 4 th I nternational Workshop on theWeb and Databases, 31-36. 2001.
[46]凌波,陆志国,黄维维等. PeerIS:基于Peer to Peer的信息检索系统.软件学报, 2004, 15 (9) : 1375-1384.
[47] P.J.Braam.The Lustre Storage Architecture.Medford,USA:Cluster File Systems,Inc.2004.14-422.
[48]陈兰香.网络存储中保障数据安全的高效方法研究.学位论文.武汉:华中科技大学,2009.
[49] Cuenca-Acuna FM, Nguyen TD. Text-Based content search and retrieval in ad hoc P2P communities. Department of Computer Science, Rutgers University: Technical ReportDCS-TR-483, 2002.
[50] Tang Chun-Qiang, Xu Zhi-Chen et al. pSearch: Information retrieval in structured overlays.Computer Communication Review, 2003, 33(1): 89-94.
[51] Bergman M.K.,The deep web: Surfacing hidden value. http://www.brightplanet. com/deepcontent, 2004.
[52] Sripanidkulchai K, Maggs B, Zhang H. Efficientcontent Location using interest-based locality in peer-to-peer systems.In: Proceedings of INFOCOM 2003 Conference,2003.
[53] Edith Cohen,Amos Fiat,Haim Kaplan.Associative search in peer to peer networks:harness latent semantics. In:Proceedings of the IEEE INFOCOM'03 Conference,2003.
[54] Ion Stoica,Robert Morris,David R.Karger, et al.Chord:A Scalable Peer-to-Peer Lookup Service for Internet Application. In:SIGCOMM’01, San Diego,CA, 149-160.2001.
[55] Ratnasamy S, Francis P, Handley M,et al.A Scalable Content-Addressable Network. Proc.of ACM SIGCOMM’01,New York,USA, 149-160. 2001.
[56] Zhao B Y, Huang L, Stribling J,et al.Tapestry: A resilient global-scale overlay for service deployment.IEEE Journal on Selected Areas in Communications, 2004, 22(1): 41~53.
[57] Rowstron A, Druschel P. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems.ACM/I-FIP/USENIX Middleware 2001, Heidelberg,Germany, 329-350. 2001.
[58] Ratnasamy S, Shenker S, Stoica I. Routing algorithms for DHTs: Some open questions.IPTPS’02, Boston, MA, 2002.
[59] Tang Chunqiang, Xu Zhichen, Dwarkadas Sandhya.Peer-to-peer information retrieval using self-organizing semantic overlay networks.In Proceeding of the ACM SIGCOMM’03. Karlsruhe,Germany,August, 175-186. 2003.
[60] Bawa M, Manku G S,Raghavan P.SETS:search enhanced by Topic segmentation.In:26th Annual International ACM SIGIR Conference. Toronto, Canada,2003.
[61] Reynolds P, Vahdat A. Efficient peer-to-peer keyword searching. Rio de Janeiro, Brazil:Middleware'03 , 21-40. 2003.
[62] Feng Zhou ,Li Zhuang,BenYzhao,etal.Approximate object location and spam filtering on peer-to-peer systems . In Proceeding of ACM/IFIP/USENIX Intl. Middleware Conference(Middleware'03), 1-20. 2003.
[63]孙克辉,张泰山.基于混沌序列的数据加密算法设计与实现.小型微型计算机系统,2004, 25(7):1368-1371.
[64]王永杰,江亮,鲜明等.网络攻击效果在线评估模型与算法研究.计算机科学,2007,34(5):72-75.
[65]肖斐,邓亚平等.一种结构化P2P负载均衡策略的研究.微计算机信息.2009,25(1-3):121-122,174.
[66]詹晓强,胡德敏.基于P2P系统的动态负载均衡算法.计算机工程与设计,2009,30(1):58-60.
[67] Adamic, L.A., Lukose, R.M.,et al. Search in Power-law Networks. Physical Review. E 64, 2001.
[68] B.Yang, H.Garcia-Molina. Efficient search in Peer-to-Peer newtorks. In Proc. Of International Conference on Distributed Computing Systems.Vienna, Austria,July, 1-25. 2002.
[69] Q. L v., P. Cao, E. Cohen,et al. Search and replication in unstructured Peer-to-peer newtork. ACM International Conference on Supercomputing. NewYork, ACM Press, 258-259. 2002.
[70] Jiaqi Liu,Zhigang Chen,Deng Li et al. A Measurement Study of Unstructured P2P Overlay. Proceeding of International Conference on Computer Science and Software Engineering, 121-124. 2008.
[71] Mawji A., Hassanein H. S..Bootstrapping P2P Overlays in MANETs. Proceedings of Global Telecommunications Conference, 1-5. 2008.
[72] Hung-Chang Hsiao,Chung-Ta King.Similarity discovery in structured P2P overlays.Proceedings of International Conference on Parallel Processing, 636-644. 2003.
[73] Kiran Nagaraja, Rollins. S., Khambatti M.. From the editors: peer-to-peer community: looking beyond the legacy of Napster and Gnutella. IEEE Distributed Systems Online. 2006,7(3):59-65.
[74] Stern, R. Napster: a walking copyright infringement? IEEE Micro.2000,20(6):4-5.
[75] Stoica I, Morris R, Karger D,et al.Chord:A scalable peer-to-peer lookup service for internet applications.Proceedings of the 2001 SIGCOMM conference. 2001,31(4): 149-160.
[76] Zhao B, Kubiatowicz J, Joseph A. Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing.Technical Report: CSD-01-1141, University of California at Berkeley. Berkeley, CA, USA, 2001.
[77] Ratnasamy S, Francis P, Handley M,et al.A scalable content-addressable network. Computer Communication Review.2001,31(4):161-172.
[78] JomlR.Douceur and Roger.P.Wattenhoef, Competitive Hill-Climbing Strategies for Replica Placement in Distributed File System,LeetuerNotes in Computer Science,48-63, 2001.
[79] lias Leontiadis,DimakoPoulos,VV.,Pitoura,E..Creating and Maintaining Replicas in Unstructured peer-to-peer Systems.Technical Report TR2006-01,Univ.of Ioannina,Dept.of Computer Science,2006.
[80] Tewari,S.,Kleinroek,L.On Fainess,Optimal Download Performance and Proportional Replication in Peer-to-Peer Networks, in Proc.of IFIP Networking,709~717. 2005.
[81] Gopalakrishnan,V.Silaghi,B.Bhattaeharjee,B. Keleher. Adaptive replication in Peer-to-Peer Systems.In Proeeedings of the 24th ICSDCS, 360-369. 2004.
[82] Giacomo Cbari,Antonio Conadi and Franco Zmabonelli,Experience of Adaptive Replication in Disrtibuetd File Sytems,In Proe.of EUROMICRO-22, 459-466. 1996.
[83] Peter Drusehel and Antony Rowstron.PAST:A large-scale,Persistent Peer-to-Peer storage utility I.inProe.of HOTOS Conf.,75-80. 2001.
[84] JiangL , Xiaotao L , PrashantS , Krlthi R. Consistency maintenance in Peere-to-Peer file sharing networks.In:Proc.of the 3rd IEEE Workshop on Internet Applications.Washington:IEEE Computer Society, 90-94. 2002.
[85] Edith Cohen and Seott Shenker.Replication strategies in unstruetured Peer-to-Peer networks.ACM SIGCOMM 2002,Pittsburgh,USA,2002.
[86] VCholvi,P.Felber,and E.Biersaek.Efficient search in unstructured Peer-to-Peer Networks.In SPAA2004,Bareelona,Spain,June,116-121. 2004.
[87] F.Schmuck,R.Haskin.GPFS:A Shared-Disk File System for Large Computing Clusters.Conference on File and Storage Technologies(FAST’02)Proc-eedings of the 1st USENIX Conference on File and Storage Technologies,Monterey, CA,2002.Berkeley,CA,USA,USENIX Association, 231~244. 2002.
[88] Ricardo Jiménez-Peris,M.Pati?o-Martínez,Gustavo Alonso,et al.Are quorums an alternative for data replication?,ACM ransactions on Database Systems(TODS), 2003,28(3):257~294.
[89]中国互联网络发展状况统计报告.中国互联网络信息中心.2010.
[90] A.Iamnitchi, M. Ripeanu, I.Foster. Small-world file-sharing communities. INFOCOM 2004, HongKong, March 2004.
[91] M. Bawa, GS Manku, and P. Raghavan. SETS: Search Enhanced by Topic Segmentation. Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval, 2003.
[92] VCholvi,P.Felber,and E.Biersaek.Efficient seareh in unstruetured Pee-to-Peer Networks.In SPAA 2004,Bareelona,Spain,June2004:116-121.
[93]田敬.对等存储系统中的数据可用性与安全性研究.博士学位论文.北京大学,2007.
[94] Alan Wood. Availability Modeling. IEEE Circuits and Devices Magazine.1994, 10(3):22~27.
[95] A.Varma,Q. Jaeobson. Destage algorithms for disk arrays with Non-volatile Caches.Proceedings of the 22nd Annual International Symposium on Computer Architecture,83-95. 1995.
[96] Dabek F,Kaashoek M,Karger D,et al.Wide-area cooperative storage with CFS. Operating Systems Review (ACM), 2001,35(5):202-215.
[97] Bhagwan,R. Total Recall: System Support for Automated Availability Management. In:Proc. of the First ACM/Usenix Symposium on Networked Systems Design and Implementation,2004.
[98] Weatherspoon H,Chun B,So C,et al.Long-Term Data Maintenance in Wide-Area Storage Systems:A Quantitative Approach. Techreports,berkeley CSD-05-1404. 2005.
[99] Zheng W,J Hu,M Li.Granary:Architecture of object oriented Internet storage service. IEEE International Conference on E-Commerce Technology for Dynamic E-Business:294-297. 2004.
[100]杨智,朱君,代亚非. Peer-to-Peer存储系统中一种高效的数据维护方案.软件学报.2009,20(1):80-95.
[101]万亚平,冯丹,欧阳利军等.一种适用于P2P存储系统的自反馈故障检测算法.计算机科学.2010,37(2):48-52,77.
[102] Brent Welch.Object Storage: Redefining Bandwidth for Linux Clusters. The“Storage on the Lunatic Fringe”Workshop on SC2003,Nov.19,2003.
[103] Borrill, Julian Oliker, Leonid Shalf, John Shan, Hongzhang. Investigation of leading HPC I/O performance using a scientific-application derived benchmark. Proceedings of the 2007 ACM/IEEE Conference on Supercomputing. 1-12. 2007.
[104] Ibrahim F.Haddad.PVFS:A Parallel Virtual File System for Linux Clusters.Linux Journal,2000,2000(80):5~12.
[105] Jianyong Wang,Zhiwei Xu.Cluster file systems:a case study.Future Generation Computer Systems,2002,18(2002):373~387.
[106] D. Roselli, J. R. Lorch, and T. E. Anderson,“A comparison of file system workloads,”Anual USENIX Technical Conference, 2000.
[107] A. Foster, C. Salisbury, and S. Tuecke,“The data grid: Towards an architecture for the distributed management and analysis of large scientific datasets,”Journal of Network and Computer Applications, vol. 23,187–200, 2001.
[108] M. Zingler,“Architectural Components for Metadata Management in Earth Observation,”The First IEEE Metadata Conference, 1996.
[109] Yu Hua,Yifeng Zhu,Hong Jiang,Dan Feng,Lei Tian. Scalable and Adaptive Metadata Management in Ultra Large-scale File Systems. International Conference on Distributed Computing Systems,2008.
[110] Maymounkov P and Mazieres D.Kademlia:A peer-to-peer information system based on the XOR metric.Proceedings of the 1st International Workshop on Peer-to-Peer Systems(IPTPS’02), 258-263. 2002.
[111] T.E.Anderson, M.D.Dahlin, J.M.Neefe, D.A.Patterson, D.S.Roselli, and R.Y.Wang,“Serverless network file systems,”ACM Transactions on Computer Systems, 14( 1),41–79, 1996.
[112] O. Rodeh and A. Teperman, zFS-a scalable distributed file system using objectdisks. Mass Storage Systems and Technologies,Proceedings 20th IEEE/11th NASA Goddard Conference on,207–218, 2003.
[113] J.H.Morris, M.Satyanarayanan, M.H.Conner, J.H.Howard, et al.Andrew:A distributed personal computing environment. Communications of the ACM, 1986: 29( 3).184–201.
[114] M. Satyanarayanan, J. J. Kistler, P. Kumar, M. E. Okasaki, et al., Coda: A highly available file system for a distributed workstation environment.IEEE Transactions on Computers, 1990:39(4),447–459.
[115] A. Adya, R. Wattenhofer, W. Bolosky,et al. Farsite: federated, available, and reliable storage for an incompletely trusted environment.ACM SIGOPS Operating Systems Review, 2002:36,1–14.
[116] S.Weil, K. Pollack, S. A. Brandt, and E. L.Miller. Dynamic metadata management for petabyte-scale file systems. Proceedings of the 2004 ACM/IEEE Conference on Supercomputing (SC’04), 2004.
[117] B.Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 1970:13.
[118]朱桂明,郭得科,金士尧.基于副本复制和Bloom Filter的P2P概率路由算法.软件学报. 2011,22(4):773?781.
[119] Andrei B, Michael M. Network applications of bloom filters: A survey. Internet Mathematics, 2003,1(4):485?509.
[120] Mark A. Rosso. Using Genre to Improve Web Search. Doctoral dissertation. University of North Carolina, Chapel Hill, NC. 2005.
[121] Mark A. Rosso. User-Based Identification of Web Genre. Journal of the American Society for Information Science and Technology.59(7):1053-1072, 2008.
[122] M. Mitzenmacher. Compressed Bloom Filters. IEEE/ACM Transactions on Networking 10:5 (2002), 604—612.
[123] A. Broder and M. Mitzenmacher. Network applications of bloom filters: A survey. Internet Mathematics, 1(4):485–509, 2005.
[124] W. S. Ng, B. C. Ooi, K. L. Tan, and A. Zhou. Peerdb: A p2p-based system for distributed data sharing. In Proceedings of the 19th International Conference on Data Engineering, 2003.
[125] Anastasios Kementsietsidis, Marcelo Arenas. Data Sharing through Query Translation in Autonomous Sources . Proc. of the 30th In- ternational Conference on Very Large Data Bases, San Fransisco: Morgan Kaufmann, 2004.468-479.
[126] D. Zhao, J. Mylopoulos, I. Kiringa, and V. Kantere, "An ECA Rule Rewriting Mechanism for Peer Data Management Systems", in Proc. EDBT, 1069- 1078.2006.
[127] Biao Xiang, Daxin Jiang, et al. Context-Aware Ranking in Web Search. Proceedings of the 33nd international conference on Research and development in information retrieval(SIGIR). Geneva, Switzerland. July, 2010: 451-458.
[128] Yeung K.F., Yanyan Yang Ndzi D. Contextualized mobile information retrieval in hybrid P2P environment. Proceedings of the Joint Conferences on Pervasive Computing (JCPC). 543-546. 2009.
[129] Budzik J, Hammond K J, Birnbaum L. Information access in context. Knowledge-Based Systems. 2001, 14(1-2): 37-53.
[130] Dumais S, Cutrell E, et al. Stuff I've Seen:A System for Personal Information Retrieval and Re-Use. Proceedings of the SIGIR. 72-79.2003.
[131] Shen X, Tan B, Zhai C. Context-sensitive information retrieval using implicit feedback. Proceedings of the SIGIR. 43-50.2005.
[132] Andrei Broder. A taxonomy of web search. Proceedings of the SIGIR. Tampere, Finland. August, 36(2). 2002.
[133] R. Kraft, F. Maghoul, et al. Y!Q: Contextual Search at the Point of Inspiration. Proceedings of the 14th International Conference on Information and Knowledge Management(CIKM). 816-823. 2005.
[134] Luanne Silvia Freund. Exploiting task-document relations in support of information retrieval in the workplace. Doctoral dissertation. Faculty of Information Studies, University of Toronto. 2008.
[135] Ingwersen P, J?rvelin K. Information Retrieval in Context. Proceedings of the IRiX. Proceedings of the SIGIR. Salvador, Brazil. 2005, 39(2):31-39.
[136] Ingwersen P. A Context-Driven Integrated Framework for Research on Interactive IR. Proceedings of the international conference Libraries in the Digital Age (LIDA). 126(6): 44-50. 2008.
[137] Ryen W. White, Peter Bailey, Liwei Chen. Predicting user interests from contextual information. Proceedings of the SIGIR.2009.
[138] Ashkan, Charles L.A. Clarke, E. Agichtein, Qi Guo. Classifying and Characterizing Query Intent. Proceedings of the ECIR. 2009.
[139] E. Agichtein, Qi Guo. Towards Inferring Web Searcher Intent from Behavior Data. Proceedings of the CHI. 2010.
[140] S. Kumpulainen, K. J?rvelin. Information Interaction in Molecular Medicine: Integrated Use of Multiple Channels. Proceedings of the IIiX. 95-104. 2010.
[141] M. Lykke, B. Larsen, H. lund, P. Ingwersen. Developing a Test Collection for the Evaluation of Integrated Search. Proceedings of the ECIR. 2010.
[142] Yuelin Li, Nicholas J. Belkin. An Exploration of the Relationships BetweenWork Task and Interactive Information Search Behavior. The American Society for Information Science & Technology(ASIS&T). 2010.
[143] Jingjing Liu, Michael J. Cole, Chang Liu, Ralf Bierig, Jacek Gwizdka, Nicholas J. Belkin, et al. Search Behaviors in Different Task Types. Proceedings of Joint Conference on Digital Libraries (JCDL). 2010.
[144] Jingjing Liu, Nicholas J. Belkin. Personalizing Information Retrieval for Multi-Session Tasks: The Roles of Task Stage and Task Type. Proceedings of the SIGIR.2010.
[145] Yuelin Li, Nicholas J.Belkin. A Faceted Approach to Conceptualizing Tasks in Information Seeking. Journal of Information Processing and Management. 2008(44): 1822-1837.
[146] V. Vidulin, M. Lu?trek, M. Gams. Using Genres to Improve Search Engines. Proceedings of the International Workshop“Towards Genre-Enabled Search Engines: The Impact of NLP”. 2007.
[147] Mark A. Rosso. User-Based Identification of Web Genre. Journal of the American Society for Information Science and Technology.2008,59 (7) :1053-1072.
[148]李卫疆,赵铁军,王宪刚.基于上下文的查询扩展.计算机研究与发展. 2010,47(2): 300-304.
[149] (法)朱丽娅?克里斯蒂娃.符号学:意义分析研究(引自《现代西方美学史》),朱立元著,上海文艺出版社,1993.
[150]纪卫宁.文学体裁互文性的深层含义.求索. 2010,(5).188-190.
[151]辛斌.语篇互文性的语用分析.外语研究. 2000,(3).14-16.
[152]辛斌.体裁互文性的社会语用学分析.外语学刊. 2002 ,(2) .15-21.
[153]周昌乐,游维,丁晓君.一种宋词自动生成的遗传算法及其机器实现.软件学报. 2010, 21(3):427-437.
[154] KLEINBERG J. Authoritative sources in a hyperlinked environment Proceedings of the 9th ACM -SIAM Symposium on Discrete Algorithms. New Orleans. ACM Press,1997.
[155] Swales, J . M. Genre Analysis : English in Academic Settings. Cambridge :CUP, 46-53. 1990.
[156] K. Vishwanath, A. Gautam, Yugyung Lee. Intelligent File Management in Ubiquitous Environments. ACM Symposium on Applied Computing. 2005.
[157] G. Abowd, C. Atkeson, et al. Cyberguide: A Mobile Context-Aware Tour Guide. ACM Wireless Networks. 1997, 3(5): 421-433.
[158] J.Teevan, D. Ramage, M. R. Morris. TwitterSearch: A Comparison of Microblog Search and Web Search. Proceedings of the Fourth ACM International Conference on Web Search and Data Mining (WSDM). 2011.
[2] EI Maghraoui Kaoutar,Kandiraju Gokul,Jann Joefon.Modeling and simulating flash based solid-state disks for operating systems.In:Proceedings of the 1st Joint WOSP/SIPEW Intemational Conference on Performance Engineering,15-26. 2010.
[3] AndyOram, Peer-to-Peer: Harnessing the Power of Disruptive Technologies, Publisher: O’Reilly Media,2001.
[4] Seholl meier Rudiger.A Definition of Peer-to-Peer Networking for the Classifieation Of Peer-t-Peer Architeetures and APPlieations.In:Proeeedings of First Interational Conference on Peer-to-Peer ComPuting2001(P2P2001). LinkoPing: IEEE ComPuter Soeiety, 101-102.2001.
[5] Azuri,C.iPoque,Internet study 2007: P2P file sharing still dominates the world wide Internet[EB/OL].http://ww.ipoqpe.com,2007.
[6] The true picture of Peer-to-Peer file-sharing [EB/OL]. http://www.cachelogic. com/researh/CacheLogic_Analyst_Presnetation_july2004.Pdf,2004.
[7] Antony Rowstron,Peter Drusehe.Pastry:scalable,distributed object location and routing for large-scale Peer-to-Peer systems.In Proceedings of the 18 IFIP/ACM International Conference on Distributed System Platforms.Berlin:ACM Press, 329-350. 2001.
[8] Ion Stoiea,Robert Morris,David Karge.Chord:A scalable Peer-to-Peer lookup service for internet applications.Proeeeding of ACM SIGCOMM 2001- Applications,Technologies,Architectures,and Protocols for Computers Communications.New York:Association for Computing Machinery,149-160. 2001.
[9] Sylvia Ratnasamy,Paul Franeis,Mark Handley.A scalable content-addressable network.Proeeeding of ACM SIGCOMM 2001-Applications, Technologies, Architectures, and Protocols for Computers Communications.New York: Association for Computing Machinery, 161-172. 2001.
[10] BenY.Zhao,John Kubiatowiez,Anthony D.Joseph.Tapestry:an infrastructure for fault-tolerant wide-area location and routing[EB/OL]. http://bnrg.cs.berkeley.edu. 2001.
[11] IRIS:Infrastructure for resilient internet systems[EB/OL].http://project-iris.net/.
[12] Rhea,C.Wells,P.Eaton,et al.Maintenance-free global storage in oceanstore. Proceedings of the IEEE Internet Computing.IEEE, 40-49. 2001.
[13] F.Dabek,M.F.Kaashoek,D.Karger,et al.Wide-area cooperative storage with CFS.Proceedings of the18th ACM Symposium on Operating Systems Principles (SOSP'01).New York:Association for Computing Machinery, 202-215. 2001.
[14] W.Zheng,J.Hu,M.Li.Granary:architecture of object oriented internet storage service .Proceedings of the IEEE International Conference on E-Commerce Technology for Dynamic E-Business(CEC-EAST 2004). Washington:IEEE Computer Society, 294-297. 2004.
[15]田敬,代亚非. P2P持久存储研究综述.软件学报, 2007, 18( 6) : 1379-1399.
[16]李振华. P2P十年:何去何从?计算机学会通讯.中国计算机学会通讯, 2010, 6(1):59-63.
[17]代亚非.P2P存储在云计算时代的新的机遇.中国计算机学会通讯. 2009,5(6): 54-56.
[18] Fay Chang, Jeffrey Dean, Sanjay Ghemawat, et al. Bigtable: a distributed storage system for structured data. In: Proc of the 7th USENIX Symp on OSDI,Berkeley,2006.
[19] Hbase Development Team. Hbase:Bigtable-Like Structured Storage for Hadoop Hdfs[EB/OL] .http://wiki.apache.org/hadoop/Hbase. 2011.
[20] Gu Yunhong,Robert L G.Sector and sphere: the design and implementation of a high-performance data cloud. Philosophical Transactions of the Royal Society, 2009(367):2429-2445.
[21] Marozzo F, Talia D, Trunfio P. Adapting MapReduce for dynamic environments using a peer-to-peer model. Workshop on cloud computing and its applications, Chicago, USA, 2008.
[22] Daniel J A.Data management in the cloud: limitations and opportunities.Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 2009,32(1):3-12.
[23] Amazon. Amazon Simple Storage Service[EB/OL] .http://www.amazon.com/s3. 2011.
[24]吴吉义,傅建庆,平玲娣等.一种对等结构的云存储系统研究.电子学报, 2011, 39(5):1100-1107.
[25] Boyd,Danah,Ellison, Nieole. Social Network Sites:Definition, History, and Scholarship. Journal of computer-Mediated Communication 13(1), 2007.
[26] Report:Cyber-Physical Systems Summit[EB/OL], Http://varma.ece.cmu.edu/ summit/CPS_Summit_Report.pdf,2010.
[27] Koubaa A, Andersson B.A Vision of Cyber-Physical Internet//Proceeding of the 8th International Workshop on real-Time Networks(RTN'09).2009.
[28]陈丽娜,王小乐,邓苏.CPS体系结构设计.计算机科学,2011:38(5):295-300.
[29]胡雅菲,李方敏,刘新华. CPS网络体系结构及关键技术.计算机研究与发展. 2010, 47(z2):304-311.
[30] DeCandia, G., et. al. Dynamo: Amazon's highly available key-value store. In Proceedings of the 21st ACM Symposium on Operating Systems Principles .New York:ACM Press, 205-220. 2007.
[31]俞敏,李战怀,张龙波. P2P数据管理.软件学报,2006,17(8):1717-1730.
[32] Lu Q, Cao P, Cohen E. Search and replication in unstructured peer-to-peer networks//Proceedings of the 16th ACM International Conference on Supercomputing. New York: ACM Press, 84-95. 2002.
[33] Kalogeraki V, Gunopulos D, Zeinalipour-Yazti D. A local search mechanism for peer-to-peer networks//Proceedings of the Eleventh International Conference on Information and Knowledge Management. New York: ACM Press, 300-307. 2002.
[34] Yang B, Garcia-Molina H. Improving search in peer-to-peer networks . IEEE Computer Society, 2002.7: 5-14 .
[35] Shen H T, Shu Y F, Yu B. Efficient semantic-based content search in P2P network. IEEE Trans on Knowledge and Data Engineering,2004, 16(7): 813-825.
[36] Tang C, Xu Z, Mahalingam M. Peer-to-peer information retrieval usingself-organizing semantic overlay networks//Proceedings of the ACM SIGCOMM. Karlsruhe: ACM Press, 175-186. 2003.
[37] Sripanidkulchai K, Maggs B, Zhang H. Efficient content location using interest-based locality in peer-to-peer systems//INFOCOM. San Franciso: IEEE Computer Society, 2166-2176. 2003.
[38] Daniel A M. Scalable P2P search . IEEE Internet Computing, 2003, 7(2): 83-87..
[39] Zhu Y, Yang X, Hu Y. Making search efficient on gnutella-like p2p systems //Proceedings of the 19th IEEE International Parallel & Distributed Processing Symposium. New York: ACM Press, 56-65.2005.
[40]周晋,路海明,李衍达.用small-world设计无组织P2P系统的路由算法.软件学报, 2004, 15(6): 915-923.
[41] Huang Juncheng, Li Xiuqi, Wu Jie. A class-based search system in unstructured P2P networks //21st International Conference on Advanced Networking and Applications. New York: ACM Press, 76-83. 2007.
[42] MILGRAM S.The small world problem.Psychology Today,1967,67( 1) : 60-67.
[43] NEWMAN M E J.Models of the small world: a review.Journal of Statistical Physics,2000,101( 3-4) : 819-841.
[44] LIU Lu, ANTONOPOULOS N, MAKIN S.Social peer-to-peer for resource discovery//Proc of the 15th Euromicro International Conference on Parallel,Distributed and Network-based Processing. 459-466.2007.
[45] Steven D Gribble, Alon Y Halevy, Zachary G I ves, et al . What Can Databases Do for Peer to Peer?. Mecca: Proc. of the 4 th I nternational Workshop on theWeb and Databases, 31-36. 2001.
[46]凌波,陆志国,黄维维等. PeerIS:基于Peer to Peer的信息检索系统.软件学报, 2004, 15 (9) : 1375-1384.
[47] P.J.Braam.The Lustre Storage Architecture.Medford,USA:Cluster File Systems,Inc.2004.14-422.
[48]陈兰香.网络存储中保障数据安全的高效方法研究.学位论文.武汉:华中科技大学,2009.
[49] Cuenca-Acuna FM, Nguyen TD. Text-Based content search and retrieval in ad hoc P2P communities. Department of Computer Science, Rutgers University: Technical ReportDCS-TR-483, 2002.
[50] Tang Chun-Qiang, Xu Zhi-Chen et al. pSearch: Information retrieval in structured overlays.Computer Communication Review, 2003, 33(1): 89-94.
[51] Bergman M.K.,The deep web: Surfacing hidden value. http://www.brightplanet. com/deepcontent, 2004.
[52] Sripanidkulchai K, Maggs B, Zhang H. Efficientcontent Location using interest-based locality in peer-to-peer systems.In: Proceedings of INFOCOM 2003 Conference,2003.
[53] Edith Cohen,Amos Fiat,Haim Kaplan.Associative search in peer to peer networks:harness latent semantics. In:Proceedings of the IEEE INFOCOM'03 Conference,2003.
[54] Ion Stoica,Robert Morris,David R.Karger, et al.Chord:A Scalable Peer-to-Peer Lookup Service for Internet Application. In:SIGCOMM’01, San Diego,CA, 149-160.2001.
[55] Ratnasamy S, Francis P, Handley M,et al.A Scalable Content-Addressable Network. Proc.of ACM SIGCOMM’01,New York,USA, 149-160. 2001.
[56] Zhao B Y, Huang L, Stribling J,et al.Tapestry: A resilient global-scale overlay for service deployment.IEEE Journal on Selected Areas in Communications, 2004, 22(1): 41~53.
[57] Rowstron A, Druschel P. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems.ACM/I-FIP/USENIX Middleware 2001, Heidelberg,Germany, 329-350. 2001.
[58] Ratnasamy S, Shenker S, Stoica I. Routing algorithms for DHTs: Some open questions.IPTPS’02, Boston, MA, 2002.
[59] Tang Chunqiang, Xu Zhichen, Dwarkadas Sandhya.Peer-to-peer information retrieval using self-organizing semantic overlay networks.In Proceeding of the ACM SIGCOMM’03. Karlsruhe,Germany,August, 175-186. 2003.
[60] Bawa M, Manku G S,Raghavan P.SETS:search enhanced by Topic segmentation.In:26th Annual International ACM SIGIR Conference. Toronto, Canada,2003.
[61] Reynolds P, Vahdat A. Efficient peer-to-peer keyword searching. Rio de Janeiro, Brazil:Middleware'03 , 21-40. 2003.
[62] Feng Zhou ,Li Zhuang,BenYzhao,etal.Approximate object location and spam filtering on peer-to-peer systems . In Proceeding of ACM/IFIP/USENIX Intl. Middleware Conference(Middleware'03), 1-20. 2003.
[63]孙克辉,张泰山.基于混沌序列的数据加密算法设计与实现.小型微型计算机系统,2004, 25(7):1368-1371.
[64]王永杰,江亮,鲜明等.网络攻击效果在线评估模型与算法研究.计算机科学,2007,34(5):72-75.
[65]肖斐,邓亚平等.一种结构化P2P负载均衡策略的研究.微计算机信息.2009,25(1-3):121-122,174.
[66]詹晓强,胡德敏.基于P2P系统的动态负载均衡算法.计算机工程与设计,2009,30(1):58-60.
[67] Adamic, L.A., Lukose, R.M.,et al. Search in Power-law Networks. Physical Review. E 64, 2001.
[68] B.Yang, H.Garcia-Molina. Efficient search in Peer-to-Peer newtorks. In Proc. Of International Conference on Distributed Computing Systems.Vienna, Austria,July, 1-25. 2002.
[69] Q. L v., P. Cao, E. Cohen,et al. Search and replication in unstructured Peer-to-peer newtork. ACM International Conference on Supercomputing. NewYork, ACM Press, 258-259. 2002.
[70] Jiaqi Liu,Zhigang Chen,Deng Li et al. A Measurement Study of Unstructured P2P Overlay. Proceeding of International Conference on Computer Science and Software Engineering, 121-124. 2008.
[71] Mawji A., Hassanein H. S..Bootstrapping P2P Overlays in MANETs. Proceedings of Global Telecommunications Conference, 1-5. 2008.
[72] Hung-Chang Hsiao,Chung-Ta King.Similarity discovery in structured P2P overlays.Proceedings of International Conference on Parallel Processing, 636-644. 2003.
[73] Kiran Nagaraja, Rollins. S., Khambatti M.. From the editors: peer-to-peer community: looking beyond the legacy of Napster and Gnutella. IEEE Distributed Systems Online. 2006,7(3):59-65.
[74] Stern, R. Napster: a walking copyright infringement? IEEE Micro.2000,20(6):4-5.
[75] Stoica I, Morris R, Karger D,et al.Chord:A scalable peer-to-peer lookup service for internet applications.Proceedings of the 2001 SIGCOMM conference. 2001,31(4): 149-160.
[76] Zhao B, Kubiatowicz J, Joseph A. Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing.Technical Report: CSD-01-1141, University of California at Berkeley. Berkeley, CA, USA, 2001.
[77] Ratnasamy S, Francis P, Handley M,et al.A scalable content-addressable network. Computer Communication Review.2001,31(4):161-172.
[78] JomlR.Douceur and Roger.P.Wattenhoef, Competitive Hill-Climbing Strategies for Replica Placement in Distributed File System,LeetuerNotes in Computer Science,48-63, 2001.
[79] lias Leontiadis,DimakoPoulos,VV.,Pitoura,E..Creating and Maintaining Replicas in Unstructured peer-to-peer Systems.Technical Report TR2006-01,Univ.of Ioannina,Dept.of Computer Science,2006.
[80] Tewari,S.,Kleinroek,L.On Fainess,Optimal Download Performance and Proportional Replication in Peer-to-Peer Networks, in Proc.of IFIP Networking,709~717. 2005.
[81] Gopalakrishnan,V.Silaghi,B.Bhattaeharjee,B. Keleher. Adaptive replication in Peer-to-Peer Systems.In Proeeedings of the 24th ICSDCS, 360-369. 2004.
[82] Giacomo Cbari,Antonio Conadi and Franco Zmabonelli,Experience of Adaptive Replication in Disrtibuetd File Sytems,In Proe.of EUROMICRO-22, 459-466. 1996.
[83] Peter Drusehel and Antony Rowstron.PAST:A large-scale,Persistent Peer-to-Peer storage utility I.inProe.of HOTOS Conf.,75-80. 2001.
[84] JiangL , Xiaotao L , PrashantS , Krlthi R. Consistency maintenance in Peere-to-Peer file sharing networks.In:Proc.of the 3rd IEEE Workshop on Internet Applications.Washington:IEEE Computer Society, 90-94. 2002.
[85] Edith Cohen and Seott Shenker.Replication strategies in unstruetured Peer-to-Peer networks.ACM SIGCOMM 2002,Pittsburgh,USA,2002.
[86] VCholvi,P.Felber,and E.Biersaek.Efficient search in unstructured Peer-to-Peer Networks.In SPAA2004,Bareelona,Spain,June,116-121. 2004.
[87] F.Schmuck,R.Haskin.GPFS:A Shared-Disk File System for Large Computing Clusters.Conference on File and Storage Technologies(FAST’02)Proc-eedings of the 1st USENIX Conference on File and Storage Technologies,Monterey, CA,2002.Berkeley,CA,USA,USENIX Association, 231~244. 2002.
[88] Ricardo Jiménez-Peris,M.Pati?o-Martínez,Gustavo Alonso,et al.Are quorums an alternative for data replication?,ACM ransactions on Database Systems(TODS), 2003,28(3):257~294.
[89]中国互联网络发展状况统计报告.中国互联网络信息中心.2010.
[90] A.Iamnitchi, M. Ripeanu, I.Foster. Small-world file-sharing communities. INFOCOM 2004, HongKong, March 2004.
[91] M. Bawa, GS Manku, and P. Raghavan. SETS: Search Enhanced by Topic Segmentation. Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval, 2003.
[92] VCholvi,P.Felber,and E.Biersaek.Efficient seareh in unstruetured Pee-to-Peer Networks.In SPAA 2004,Bareelona,Spain,June2004:116-121.
[93]田敬.对等存储系统中的数据可用性与安全性研究.博士学位论文.北京大学,2007.
[94] Alan Wood. Availability Modeling. IEEE Circuits and Devices Magazine.1994, 10(3):22~27.
[95] A.Varma,Q. Jaeobson. Destage algorithms for disk arrays with Non-volatile Caches.Proceedings of the 22nd Annual International Symposium on Computer Architecture,83-95. 1995.
[96] Dabek F,Kaashoek M,Karger D,et al.Wide-area cooperative storage with CFS. Operating Systems Review (ACM), 2001,35(5):202-215.
[97] Bhagwan,R. Total Recall: System Support for Automated Availability Management. In:Proc. of the First ACM/Usenix Symposium on Networked Systems Design and Implementation,2004.
[98] Weatherspoon H,Chun B,So C,et al.Long-Term Data Maintenance in Wide-Area Storage Systems:A Quantitative Approach. Techreports,berkeley CSD-05-1404. 2005.
[99] Zheng W,J Hu,M Li.Granary:Architecture of object oriented Internet storage service. IEEE International Conference on E-Commerce Technology for Dynamic E-Business:294-297. 2004.
[100]杨智,朱君,代亚非. Peer-to-Peer存储系统中一种高效的数据维护方案.软件学报.2009,20(1):80-95.
[101]万亚平,冯丹,欧阳利军等.一种适用于P2P存储系统的自反馈故障检测算法.计算机科学.2010,37(2):48-52,77.
[102] Brent Welch.Object Storage: Redefining Bandwidth for Linux Clusters. The“Storage on the Lunatic Fringe”Workshop on SC2003,Nov.19,2003.
[103] Borrill, Julian Oliker, Leonid Shalf, John Shan, Hongzhang. Investigation of leading HPC I/O performance using a scientific-application derived benchmark. Proceedings of the 2007 ACM/IEEE Conference on Supercomputing. 1-12. 2007.
[104] Ibrahim F.Haddad.PVFS:A Parallel Virtual File System for Linux Clusters.Linux Journal,2000,2000(80):5~12.
[105] Jianyong Wang,Zhiwei Xu.Cluster file systems:a case study.Future Generation Computer Systems,2002,18(2002):373~387.
[106] D. Roselli, J. R. Lorch, and T. E. Anderson,“A comparison of file system workloads,”Anual USENIX Technical Conference, 2000.
[107] A. Foster, C. Salisbury, and S. Tuecke,“The data grid: Towards an architecture for the distributed management and analysis of large scientific datasets,”Journal of Network and Computer Applications, vol. 23,187–200, 2001.
[108] M. Zingler,“Architectural Components for Metadata Management in Earth Observation,”The First IEEE Metadata Conference, 1996.
[109] Yu Hua,Yifeng Zhu,Hong Jiang,Dan Feng,Lei Tian. Scalable and Adaptive Metadata Management in Ultra Large-scale File Systems. International Conference on Distributed Computing Systems,2008.
[110] Maymounkov P and Mazieres D.Kademlia:A peer-to-peer information system based on the XOR metric.Proceedings of the 1st International Workshop on Peer-to-Peer Systems(IPTPS’02), 258-263. 2002.
[111] T.E.Anderson, M.D.Dahlin, J.M.Neefe, D.A.Patterson, D.S.Roselli, and R.Y.Wang,“Serverless network file systems,”ACM Transactions on Computer Systems, 14( 1),41–79, 1996.
[112] O. Rodeh and A. Teperman, zFS-a scalable distributed file system using objectdisks. Mass Storage Systems and Technologies,Proceedings 20th IEEE/11th NASA Goddard Conference on,207–218, 2003.
[113] J.H.Morris, M.Satyanarayanan, M.H.Conner, J.H.Howard, et al.Andrew:A distributed personal computing environment. Communications of the ACM, 1986: 29( 3).184–201.
[114] M. Satyanarayanan, J. J. Kistler, P. Kumar, M. E. Okasaki, et al., Coda: A highly available file system for a distributed workstation environment.IEEE Transactions on Computers, 1990:39(4),447–459.
[115] A. Adya, R. Wattenhofer, W. Bolosky,et al. Farsite: federated, available, and reliable storage for an incompletely trusted environment.ACM SIGOPS Operating Systems Review, 2002:36,1–14.
[116] S.Weil, K. Pollack, S. A. Brandt, and E. L.Miller. Dynamic metadata management for petabyte-scale file systems. Proceedings of the 2004 ACM/IEEE Conference on Supercomputing (SC’04), 2004.
[117] B.Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 1970:13.
[118]朱桂明,郭得科,金士尧.基于副本复制和Bloom Filter的P2P概率路由算法.软件学报. 2011,22(4):773?781.
[119] Andrei B, Michael M. Network applications of bloom filters: A survey. Internet Mathematics, 2003,1(4):485?509.
[120] Mark A. Rosso. Using Genre to Improve Web Search. Doctoral dissertation. University of North Carolina, Chapel Hill, NC. 2005.
[121] Mark A. Rosso. User-Based Identification of Web Genre. Journal of the American Society for Information Science and Technology.59(7):1053-1072, 2008.
[122] M. Mitzenmacher. Compressed Bloom Filters. IEEE/ACM Transactions on Networking 10:5 (2002), 604—612.
[123] A. Broder and M. Mitzenmacher. Network applications of bloom filters: A survey. Internet Mathematics, 1(4):485–509, 2005.
[124] W. S. Ng, B. C. Ooi, K. L. Tan, and A. Zhou. Peerdb: A p2p-based system for distributed data sharing. In Proceedings of the 19th International Conference on Data Engineering, 2003.
[125] Anastasios Kementsietsidis, Marcelo Arenas. Data Sharing through Query Translation in Autonomous Sources . Proc. of the 30th In- ternational Conference on Very Large Data Bases, San Fransisco: Morgan Kaufmann, 2004.468-479.
[126] D. Zhao, J. Mylopoulos, I. Kiringa, and V. Kantere, "An ECA Rule Rewriting Mechanism for Peer Data Management Systems", in Proc. EDBT, 1069- 1078.2006.
[127] Biao Xiang, Daxin Jiang, et al. Context-Aware Ranking in Web Search. Proceedings of the 33nd international conference on Research and development in information retrieval(SIGIR). Geneva, Switzerland. July, 2010: 451-458.
[128] Yeung K.F., Yanyan Yang Ndzi D. Contextualized mobile information retrieval in hybrid P2P environment. Proceedings of the Joint Conferences on Pervasive Computing (JCPC). 543-546. 2009.
[129] Budzik J, Hammond K J, Birnbaum L. Information access in context. Knowledge-Based Systems. 2001, 14(1-2): 37-53.
[130] Dumais S, Cutrell E, et al. Stuff I've Seen:A System for Personal Information Retrieval and Re-Use. Proceedings of the SIGIR. 72-79.2003.
[131] Shen X, Tan B, Zhai C. Context-sensitive information retrieval using implicit feedback. Proceedings of the SIGIR. 43-50.2005.
[132] Andrei Broder. A taxonomy of web search. Proceedings of the SIGIR. Tampere, Finland. August, 36(2). 2002.
[133] R. Kraft, F. Maghoul, et al. Y!Q: Contextual Search at the Point of Inspiration. Proceedings of the 14th International Conference on Information and Knowledge Management(CIKM). 816-823. 2005.
[134] Luanne Silvia Freund. Exploiting task-document relations in support of information retrieval in the workplace. Doctoral dissertation. Faculty of Information Studies, University of Toronto. 2008.
[135] Ingwersen P, J?rvelin K. Information Retrieval in Context. Proceedings of the IRiX. Proceedings of the SIGIR. Salvador, Brazil. 2005, 39(2):31-39.
[136] Ingwersen P. A Context-Driven Integrated Framework for Research on Interactive IR. Proceedings of the international conference Libraries in the Digital Age (LIDA). 126(6): 44-50. 2008.
[137] Ryen W. White, Peter Bailey, Liwei Chen. Predicting user interests from contextual information. Proceedings of the SIGIR.2009.
[138] Ashkan, Charles L.A. Clarke, E. Agichtein, Qi Guo. Classifying and Characterizing Query Intent. Proceedings of the ECIR. 2009.
[139] E. Agichtein, Qi Guo. Towards Inferring Web Searcher Intent from Behavior Data. Proceedings of the CHI. 2010.
[140] S. Kumpulainen, K. J?rvelin. Information Interaction in Molecular Medicine: Integrated Use of Multiple Channels. Proceedings of the IIiX. 95-104. 2010.
[141] M. Lykke, B. Larsen, H. lund, P. Ingwersen. Developing a Test Collection for the Evaluation of Integrated Search. Proceedings of the ECIR. 2010.
[142] Yuelin Li, Nicholas J. Belkin. An Exploration of the Relationships BetweenWork Task and Interactive Information Search Behavior. The American Society for Information Science & Technology(ASIS&T). 2010.
[143] Jingjing Liu, Michael J. Cole, Chang Liu, Ralf Bierig, Jacek Gwizdka, Nicholas J. Belkin, et al. Search Behaviors in Different Task Types. Proceedings of Joint Conference on Digital Libraries (JCDL). 2010.
[144] Jingjing Liu, Nicholas J. Belkin. Personalizing Information Retrieval for Multi-Session Tasks: The Roles of Task Stage and Task Type. Proceedings of the SIGIR.2010.
[145] Yuelin Li, Nicholas J.Belkin. A Faceted Approach to Conceptualizing Tasks in Information Seeking. Journal of Information Processing and Management. 2008(44): 1822-1837.
[146] V. Vidulin, M. Lu?trek, M. Gams. Using Genres to Improve Search Engines. Proceedings of the International Workshop“Towards Genre-Enabled Search Engines: The Impact of NLP”. 2007.
[147] Mark A. Rosso. User-Based Identification of Web Genre. Journal of the American Society for Information Science and Technology.2008,59 (7) :1053-1072.
[148]李卫疆,赵铁军,王宪刚.基于上下文的查询扩展.计算机研究与发展. 2010,47(2): 300-304.
[149] (法)朱丽娅?克里斯蒂娃.符号学:意义分析研究(引自《现代西方美学史》),朱立元著,上海文艺出版社,1993.
[150]纪卫宁.文学体裁互文性的深层含义.求索. 2010,(5).188-190.
[151]辛斌.语篇互文性的语用分析.外语研究. 2000,(3).14-16.
[152]辛斌.体裁互文性的社会语用学分析.外语学刊. 2002 ,(2) .15-21.
[153]周昌乐,游维,丁晓君.一种宋词自动生成的遗传算法及其机器实现.软件学报. 2010, 21(3):427-437.
[154] KLEINBERG J. Authoritative sources in a hyperlinked environment Proceedings of the 9th ACM -SIAM Symposium on Discrete Algorithms. New Orleans. ACM Press,1997.
[155] Swales, J . M. Genre Analysis : English in Academic Settings. Cambridge :CUP, 46-53. 1990.
[156] K. Vishwanath, A. Gautam, Yugyung Lee. Intelligent File Management in Ubiquitous Environments. ACM Symposium on Applied Computing. 2005.
[157] G. Abowd, C. Atkeson, et al. Cyberguide: A Mobile Context-Aware Tour Guide. ACM Wireless Networks. 1997, 3(5): 421-433.
[158] J.Teevan, D. Ramage, M. R. Morris. TwitterSearch: A Comparison of Microblog Search and Web Search. Proceedings of the Fourth ACM International Conference on Web Search and Data Mining (WSDM). 2011.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |