层次p2p存储系统关键技术研究
|
摘要
随着Internet技术的飞速发展,基于Internet的应用从对计算资源要求少的传统的文字和图片式Web应用向要求更多计算资源的音视频应用转变。同时,因为网络传输性能和个人计算机处理能力的显著提高,基于原来被忽视的PC构建大规模、低成本、高可用、高可扩展及高性能的P2P分布式存储系统,成为当今的一个研究热点。多个针对Internet流量的统计数据表明,基于P2P的文件共享应用得到了广泛应用,并开始占据大部分的Internet流量。
在对P2P分布式存储系统的相关技术进行了深入系统研究的基础上,针对P2P模式存储系统在访问性能和维护管理方面存在的不足,为提高P2P存储系统中数据的可靠性、可用性和访问性能,提出了一种基于P2P的非中心,自组织的大规模存储机制,并且设计了一个新的层次动态哈希表(Distributed Hash Table, DHT)路由协议。为了改善系统下载大文件的性能,提出了一种基于层次DHT协议的动态并行下载机制。
不同于传统集群存储系统的节点,构成P2P存储系统的节点具有大规模、高动态性、高异构性、强异步性等新特点,这严重损害了整个系统的效率和可扩展性。针对这一问题,提出了一种层次P2P的分布式存储系统HIPSS (Hierarchical P2P Storage System, HIPSS)。HIPSS使用层次DHT层叠网将大量分散在Internet上的节点组织成一个统一的逻辑网络,并使用节点提供的磁盘空间构成一个非单一映像空间的虚拟存储池。HIPSS采用完全分布的数据和元数据管理存储方式、灵活的文件副本管理方法、高效的文件查询机制以及高速并行传输机制为用户构建可扩展、高效的海量存储系统。
高效可靠的数据组织策略是P2P存储系统的核心。传统的DHT完全平等的对待系统中的节点,因此具有良好的负载平衡和可靠性,但随着系统规模增长,节点的异构性将严重影响整个系统的效率和扩展性。因此,提出一种基于Chord的层次路由协议以在动态的Internet环境下提高数据访问的效率,该协议利用了节点异构和物理邻近性,通过对物理邻近节点和相关数据的聚合来提高数据访问的本地化比率,降低网络访问延迟。
相对于非结构化P2P网络,结构化P2P系统需要更大的维护开销用于构建、更新路由表,因此增加了网络负载,影响了查询效率。为了减少DHT网络在动态大规模网络环境下的维护开销,基于层次DHT网络提出一种新的拓扑维护机制。该算法采用管理节点作为拓扑更新信息的管理者,存储节点周期性的探测其后继节点,当后继节点状态发生改变则把消息发送给管理节点。管理节点记录所属存储节点的状态改变并周期性的发送给存储节点以帮助存储节点更新路由表,存储节点不必像传统DHT一样查询其后继节点,从而显著减少底层网络的更新开销,提高拓扑网络的扩展性。
P2P并行下载工具(如BT)是目前非常流行的可扩展文件发布工具,能够快速高效的发布大型文件。然而,这些基于传输跟踪服务器的系统依赖显式的静态IP地址。针对这一问题,提出了一种基于层次P2P的动态映射并行下载机制。该方法耦合传输跟踪服务器的ID编号与其驻留的管理节点ID地址,并引入分布式ID映射服务,保证在动态Internet环境中正确的发现传输管理服务器。同时,还利用节点聚集以及传输本地化来优化传输管理、提高下载性能。
With the rapid improvement in network technology, applications are changing from the traditional text and picture based on Web to more resource demanding audio and video content. At the same time, because of the remarkable improvement in network bandwith and the capacity of person computer, it becomes a hot research topic nowadays to construct a P2P distributed storage system with large-scale, low-cost, high scalability, high reliability and high performance with the PC which was ignored in the past. Nowadays P2P-based file sharing applications are characterizing a great fraction of the Internet traffic and several statistics on IP traffic have recently put in evidence that P2P traffic is starting to dominate the bandwidth in certain segments of the Internet.
This dissertation makes a deep research on related technologies of P2P-based storage system. To improve data's availability, reliability and access efficiency which are deployed in the P2P storage system, We Propose a decentralized, self-organizing large distributed storage mechanism based on P2P. And designs a novel hierarchical (Distributed Hash Table) DHT routing protocol and low overhead maintenance mechanism. To improve downloading performance of large file we proposed a dynamic parallel downloading method based on hierarchical DHT.
Difference from Peers which appear in traditional cluster storage systems, peers in P2P system face the new properties such as high dynamic, high heterogeneity, high asynchrony which compromise the scalability and efficiency of the whole system. Aiming at this issue, this dissertation designs a P2P-based distributed storage system HIPSS. By means of hierarchical DHT overlay which organizes large numbers of peers in Internet into a united logic network, HIPSS forms a virtual storgae pool with no single I/O addressing space out of disk provided by those peers. With the help of distributed metadata and file management, flexible replications management, efficient file searching and parallel file transferring mechanism, HIPSS builds scalable, available, efficient and massive storage system for users.
Organizing data in a reasonable, effective and dependable way is a key problem to P2P storage systems. The original DHT are designed to treat peers equally. Thus yields good load balancing and robustness to failures. However, with the development of the system the weak peers can seriously compromise the scalability and efficiency of the whole system. So we present a novel hierarchical DHT routing protocol which is built on Chord but achieves better file routing efficiency in Internet by exploiting heterogeneity and proximity. This protocol exploits the proximity by grouping the data with the same properties together and distributing the data across peers within a matching cluster, which greatly boosts the local access ratio of data and optimizes the routing performance of our protocol.
DHT network needs relatively higher maintenance overhead than unstructured P2P networks. As result from building and updating their routing information, p2p system generates considerable maintenance workload which not only increases the bandwidth consumption but also affects the routing efficiency. So we present here a new maintenance method to minimize the maintenance cost in a large-scale system or a dynamic environment which combines the hierarchical DHT algorithm with a peer proximity mechanism. We let storage peer in the lower layer periodically probe their successors. When a change is detected, the message will be transfered to its upper layer manage peer. Then the manage peer will broadcast this message to all its lower layer peers to update the affected routing tables rather than let lower layer peers periodically refresh their routing tables. It significantly reduces the maintenance costs of the lower ring and achieves better scalability.
P2P Parallel download tools, such as BitTorrent, are very popular and scalable file distribution systems which can distribute large files quickly and efficiently. However, those systems based on tracker server relies on static IP address. Aiming at this issue, this dissertation proposed a dynamic parallel downloading method Based on hierarchical DHT. The method couples the unique ID of a tracker server with the ID of the its resident manage peer, and introduces distributed ID mapping service to implement correct route in dynamic Internet environment. By the combination of grouping peers and the locality of the downloading, the method optimizes the management of transferring and improves downloading performance greatly.
在对P2P分布式存储系统的相关技术进行了深入系统研究的基础上,针对P2P模式存储系统在访问性能和维护管理方面存在的不足,为提高P2P存储系统中数据的可靠性、可用性和访问性能,提出了一种基于P2P的非中心,自组织的大规模存储机制,并且设计了一个新的层次动态哈希表(Distributed Hash Table, DHT)路由协议。为了改善系统下载大文件的性能,提出了一种基于层次DHT协议的动态并行下载机制。
不同于传统集群存储系统的节点,构成P2P存储系统的节点具有大规模、高动态性、高异构性、强异步性等新特点,这严重损害了整个系统的效率和可扩展性。针对这一问题,提出了一种层次P2P的分布式存储系统HIPSS (Hierarchical P2P Storage System, HIPSS)。HIPSS使用层次DHT层叠网将大量分散在Internet上的节点组织成一个统一的逻辑网络,并使用节点提供的磁盘空间构成一个非单一映像空间的虚拟存储池。HIPSS采用完全分布的数据和元数据管理存储方式、灵活的文件副本管理方法、高效的文件查询机制以及高速并行传输机制为用户构建可扩展、高效的海量存储系统。
高效可靠的数据组织策略是P2P存储系统的核心。传统的DHT完全平等的对待系统中的节点,因此具有良好的负载平衡和可靠性,但随着系统规模增长,节点的异构性将严重影响整个系统的效率和扩展性。因此,提出一种基于Chord的层次路由协议以在动态的Internet环境下提高数据访问的效率,该协议利用了节点异构和物理邻近性,通过对物理邻近节点和相关数据的聚合来提高数据访问的本地化比率,降低网络访问延迟。
相对于非结构化P2P网络,结构化P2P系统需要更大的维护开销用于构建、更新路由表,因此增加了网络负载,影响了查询效率。为了减少DHT网络在动态大规模网络环境下的维护开销,基于层次DHT网络提出一种新的拓扑维护机制。该算法采用管理节点作为拓扑更新信息的管理者,存储节点周期性的探测其后继节点,当后继节点状态发生改变则把消息发送给管理节点。管理节点记录所属存储节点的状态改变并周期性的发送给存储节点以帮助存储节点更新路由表,存储节点不必像传统DHT一样查询其后继节点,从而显著减少底层网络的更新开销,提高拓扑网络的扩展性。
P2P并行下载工具(如BT)是目前非常流行的可扩展文件发布工具,能够快速高效的发布大型文件。然而,这些基于传输跟踪服务器的系统依赖显式的静态IP地址。针对这一问题,提出了一种基于层次P2P的动态映射并行下载机制。该方法耦合传输跟踪服务器的ID编号与其驻留的管理节点ID地址,并引入分布式ID映射服务,保证在动态Internet环境中正确的发现传输管理服务器。同时,还利用节点聚集以及传输本地化来优化传输管理、提高下载性能。
With the rapid improvement in network technology, applications are changing from the traditional text and picture based on Web to more resource demanding audio and video content. At the same time, because of the remarkable improvement in network bandwith and the capacity of person computer, it becomes a hot research topic nowadays to construct a P2P distributed storage system with large-scale, low-cost, high scalability, high reliability and high performance with the PC which was ignored in the past. Nowadays P2P-based file sharing applications are characterizing a great fraction of the Internet traffic and several statistics on IP traffic have recently put in evidence that P2P traffic is starting to dominate the bandwidth in certain segments of the Internet.
This dissertation makes a deep research on related technologies of P2P-based storage system. To improve data's availability, reliability and access efficiency which are deployed in the P2P storage system, We Propose a decentralized, self-organizing large distributed storage mechanism based on P2P. And designs a novel hierarchical (Distributed Hash Table) DHT routing protocol and low overhead maintenance mechanism. To improve downloading performance of large file we proposed a dynamic parallel downloading method based on hierarchical DHT.
Difference from Peers which appear in traditional cluster storage systems, peers in P2P system face the new properties such as high dynamic, high heterogeneity, high asynchrony which compromise the scalability and efficiency of the whole system. Aiming at this issue, this dissertation designs a P2P-based distributed storage system HIPSS. By means of hierarchical DHT overlay which organizes large numbers of peers in Internet into a united logic network, HIPSS forms a virtual storgae pool with no single I/O addressing space out of disk provided by those peers. With the help of distributed metadata and file management, flexible replications management, efficient file searching and parallel file transferring mechanism, HIPSS builds scalable, available, efficient and massive storage system for users.
Organizing data in a reasonable, effective and dependable way is a key problem to P2P storage systems. The original DHT are designed to treat peers equally. Thus yields good load balancing and robustness to failures. However, with the development of the system the weak peers can seriously compromise the scalability and efficiency of the whole system. So we present a novel hierarchical DHT routing protocol which is built on Chord but achieves better file routing efficiency in Internet by exploiting heterogeneity and proximity. This protocol exploits the proximity by grouping the data with the same properties together and distributing the data across peers within a matching cluster, which greatly boosts the local access ratio of data and optimizes the routing performance of our protocol.
DHT network needs relatively higher maintenance overhead than unstructured P2P networks. As result from building and updating their routing information, p2p system generates considerable maintenance workload which not only increases the bandwidth consumption but also affects the routing efficiency. So we present here a new maintenance method to minimize the maintenance cost in a large-scale system or a dynamic environment which combines the hierarchical DHT algorithm with a peer proximity mechanism. We let storage peer in the lower layer periodically probe their successors. When a change is detected, the message will be transfered to its upper layer manage peer. Then the manage peer will broadcast this message to all its lower layer peers to update the affected routing tables rather than let lower layer peers periodically refresh their routing tables. It significantly reduces the maintenance costs of the lower ring and achieves better scalability.
P2P Parallel download tools, such as BitTorrent, are very popular and scalable file distribution systems which can distribute large files quickly and efficiently. However, those systems based on tracker server relies on static IP address. Aiming at this issue, this dissertation proposed a dynamic parallel downloading method Based on hierarchical DHT. The method couples the unique ID of a tracker server with the ID of the its resident manage peer, and introduces distributed ID mapping service to implement correct route in dynamic Internet environment. By the combination of grouping peers and the locality of the downloading, the method optimizes the management of transferring and improves downloading performance greatly.
引文
[1]谢长生.数字时代信息存储技术的发展.计算机世界,2001,34：4-5
[2]Dejan S. Milojicic, Vana Kalogeraki, Rajan Lukose, et al. Peer-to-Peer Computing[R]. Tech. Rep. HPL-2002-57, HP Laboratories Palo Alto,2002,3
[3]Stephanos Androutsellis-Theotokis and Diomidis Spinellis, A Survey of Peer-to-Peer Content Distribution Technologies, ACM Computing Surveys,2004, 36(4):127-139
[4]Detlef Schoder, Kai Fischbach. Peer-to-Peer Prospects[J]. Communications of the ACM,2003,46(2):729-736
[5]IMlogic Threat Center.2005 real-time communication security:The year in review. http://www.imlogic.com/pdf/2005ThreatCenter_report.2005
[6]Weaver N. Warhol worms:The potential for very fast Internet plagues, http://www. cs.berkeley.edu/~nweaver/warhol.html.2002
[7]R. Sandberg, The Sun Network Filesystem:Design, Implementation and Experience, presented at Proceedings of the1987 Summer Usenix Conference,1987.57-65
[8]Sidebotham. B. Volumes:The Andrew File System Data Structuring Primitive. Technical Report CMU-ITC-053, Carnegie Melon University,1986
[9]M. Satyanarayanan, J. J. Kistler, P. Kumar. Coda:a Highly Available File System for a Distributed Workstation Environment. IEEE Transactions on Computers,1990. 6(4):715-726
[10]M. A. Baker, G C. Fox and H. W. Yau. Cluster Computing Review. Northeast Parallel Architectures Center, Syracuse University, November 16,1995
[11]Burns, M. George and Wallace B. Modeling and Simulative Performance Analysis of SMP and Clustered Computer Architectures. Simulation. February 2000
[12]Wang R. Y., Anderson T. E.. xFS:a wide area mass storage file system. In: Proceedings of the Fourth Workshop on Workstation Operating Systems,1993. 71-78
[13]Sweeney A., Doucette D., Wei Hu. Scalability in the XFS file system. In: Proceedings of the USENIX 1996 Annual Technical Conference,1996.1-14
[14]Kuhn Michael, Kunkel Julian Martin, Ludwig Thomas. Dynamic file system semantics to enable metadata optimizations in PVFS. Concurrency Computation Practice and Experience, September 25,2009,21(14):1775-1788
[15]Cams P. H., Ligon W. B. Ⅲ, Ross R. B.. PVFS:a parallel file system for Linux clusters. In:Proceedings of the 4th Annual Linux Showcase and Conference,2000. 317-327
[16]Braam P. J.. The Lustre storage architecture. Technical report, Cluster File Systems, Inc.,2002. http://www.lustre.org/docs/lustre.pdf:21-45
[17]Stephanos Androutsellis-Theotokis and Diomidis Spinellis, A Survey of Peer-to-Peer Content Distribution Technologies, ACM Computing Surveys,2004, 36(4):516-527
[18]Napster home page, http://www.napster.com
[19]Matei Ripeanu. Peer-to-Peer Architecture Case Study:Gnutella Network. In proceedings of 2001 International Conference on Peer-to-peer Computing (P2P2001), Linkoping Sweden, August,2001.27-29
[20]Druschel P, Rowstron A. PAST:A large-scale, persistent peer-to-peer storage utility. In:Proc. of the HOTOS Conf.2001.75-80
[21]Kubiatowicz, David Bindel, Yan Chen, et al. OceanStore:An Architecture forGlobal-Scale Persistent Storage. In Proceedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), November 2000.95-104
[22]Frank Dabek, M. Frans Kaashoek, David Karger, et al. Wide-area Cooperative Storage with CFS. In SOSP, Oct.2001.126-137
[23]A. Rowstron and P. Druschel. Pastry:Scalable, distributed object location and routing for large-scale peer-to-peer systems. IFIP/ACM International Conference on Distributed Systems Platforms(Middleware), Heidelberg, Germany, pages November 2001.329-350
[24]W. J. Bolosky, M. Castro. Wattenhofer. FARSITE:Federated, Available, and Reliable Storage for an Incompletely Trusted Environment. In Proceedings of OSDI, December 2002.176-185
[25]S. Kubiatowicz, J, C Wells. OceanStore:an architecture for global-scale persistent storage. Proceedings of the ninth international conference on Architectural support for programming languages and operating systems,2000.190-201
[26]XML Doeuments, http://www.w3.org/XML
[27]RDF Doeuments. http://www.w3.org/RDF
[28]Stoica I, Morris R, Liben-Nowell D, Karger DR, Kaashoek MF, Dabek F, Balakrishnan H. Chord:A scalable peer-to-peer lookup service for Internet applications. IEEE/ACM Trans.on Networking,2003,11(1):17-32
[29]S. Ratnasamy, P. Francis, M. Handley, et al. "A scalable content-addressable network", Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM'01), ACM Press,2001.161-172
[30]Zhao BY, Huang L, Stribling J, Rhea SC, Joseph AD. Tapestry:A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications,2004,22(1):41-53
[31]A. Rowstron, P. Druschel, "Pastry:scalable, decentralized object location and routing for large-scale peer-to-peer systems", Proceedings of the 2001 IFIP/ACM International Conference on Distributed Systems Platforms vol.2218 of Lecture Notes in Computer Science, Springer-Verlag,2001.329-350
[32]B. C. Neuman. The Prospero File System:A Global File System Based on the Virtual. System. Computing Systems,1992,5(4):407-432
[33]B. W. Lampson. Designing a global name service. In Proceedings of the 4th ACM. Symposium on Principles of Distributed Computing, August 1986.1-10
[34]I. Foster, C Kesselman.:GLOBUS:a Metacomputing Infrastructure Toolkit, Int. J. Supercomputing Applications,1997,11(2):115-128
[35]A. Bosselaers, R. Govaerts. SHA:a design for Parallel architectures? AdvnaeesinCryPtolog, yProe. EuroeryPt,97, LNCS1233, W. Fum, yEd., SPringe-rVerlag,1997.348-362
[36]Lei S., Grama A.. Extended consistent hashing:an efficient framework for object location. In:Proceedings of the 2nd IEEE International Conference on Distributed Computing Systems. Tokyo, Japan. March 2004.254-262
[37]Swart G. Spreading the load using consistent hashing:a preliminary report. In: Proceeding of Third International Symposium on Parallel and Distributed Computing/HeteroPar. Cork, Ireland. July 2004.169-176
[38]A. Rowstron and P. Druschel. Storage Management and Caching in PAST, a Large-scale Persistent Peer-to-Peer Storage Utility.18th ACM Symposium on Operating Systems Principles (SOSP'01). October 2001.115-123
[39]Lian, Q, W Chen, and Z Zhang, On the Impact of Replica Placement to the Reliability of Distributed Brick Storage Systems. Distributed Computing Systems, 2005. ICDCS 2005. Proceedings.25th IEEE International Conference on,2005. 187-196
[40]Douceur, JR and RP Wartenhofer, Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System. Proceedings ofl5th DISC,2001.48-62
[41]Ramanathan, MK, Increasing object availability in peer-to-peer systems. In Proc. of Parallel and Distributed Processing Symposium,2004.128-136
[42]Schwarz, Thomas J. E., Qin Xin, and Ethen L. Miller, Availability in Global Peer-To-Peer Storage Systems. In Proc. of 6th Workshop onDistributed Data and Structures (WDAS),2004.58-71
[43]L. Avinash and M. Prashant. Cassandra-A Decentralized Structured Storage System. In Proceedings of the 3rd ACM SIGOPS International Workshop on Large Scale Distributed Systems and Middleware Workshop (LADIS'09), Big Sky, MT, USA,2009.81-89
[44]Bhagwan, R, S Savage, and G Voelker, Replication strategies for highly available peer-to-peer storage systems, proc. of FuDiCo:Future directions in Distributed Computing, June,2002.152-163
[45]Rodrigues, R and B Liskov, High Availability in DHTs:Erasure Coding vs. Replication. Proc. of the 4th International Workshop on Peer-to-Peer Systems,2005. 73-82
[46]Lin, WK, DM Chiu, and YB Lee, Erasure code replication revisited. In Proc. of Fourth International Conference on Peer-to-Peer Computing,2004.90-97
[47]田敬.P2P持久存储研究综述.软件学报,2007,15(7)：1056-1063
[48]Ghemawat, S, H Gobioff, and ST Leung, The Google file system. Proceedings of the nineteenth ACM symposium on Operating systemsprinciples,2003.29-43
[49]L. Mihai and Nuno Pregui. Consistency without Concurrency Control in Large, Dynamic Systems. In Proceedings of the 3rd ACM SIGOPS International Workshop on Large Scale Distributed Systems and Middleware Workshop (LADIS '09), Big Sky, MT, USA,2009.125-134
[50]Saito, Y., and Shapiro, M. Optimistic replication. Computing Surveys 37,1 (Mar. 2005),42-81
[51]David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, Rina Panigrahy "Consistent Hashing and Random Trees:Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web". In Proceedings of the 29th Annual ACM Sym-posium on Theory of Computing. El Paso, TX, May 1997. 654-663
[52]E. K. Lua, J. Crowcroft, M. Pias, R. Sharma and S. Lim, A Survey and Comparison of Peer-to-Peer Overlay. Network Schemes, IEEE Communications Survey and. Tutorial,2004,5(7):830-843
[53]E. P. Markatos, Tracing A Large-Scale Peer-to-Peer System:An Hour in the Life of Gnutella, Proc. Second IEEE/ACM Int'l Symp. Cluster Computing and the Grid, 2002.149-158
[54]Kunwadee Sripanidkulchai, Bruce Maggs, and Hui Zhang, Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems, Infocom 2003. 205-217
[55]Ratnasamy. S,. Handley M,. Topologically-aware overlay construction and server selection. In Proc.21st IEEE INFOCOM, volume 21, New York, NY, June 2002. 1190-1199
[56]T. S. Eugene Ng and H. Zhang. Global Network Positioning:A New Approach to Network Distance Prediction. CCR,2001.76-86
[57]Marc S, Antonio F. A Comparative Study of Hierarchical DHT Systems,32nd IEEE Conference on Local Computer Networks,2007.325-333
[58]P. Ganesan, K. Gummadi, H. Garcia-Molina, "Canon in G major:designing DHTs with hierarchical structure", IEEE International Conference on Distributed Computing Systems (ICDCS'04), Tokyo, Japan,2004.263-272
[59]王庆波,代亚非,田敬.基于特征信息定位的P2P网络模型：Barnet.软件学报,2003,14(8)：1481-1488
[60]Z. Xu, R. Min and Y. M. Hu. HIERAS:A DHT based hierarchical P2P routing algorithm.2003 International Conference on Parallel Processing, Kaohsiung, Taiwan, October 2003.6-9
[61]L. Garces-Erice, E. W. Biersack, K. W. Ross, et al. Hierarchical Peer-to-peer Systems. Parallel Processing Letters,2003,13(4):643-657
[62]L. Xiao, Z. Y. Zhuang, Y. H. Liu. Dynamic Layer Management in Superpeer Architectures. IEEE Transactions on Parallel and Distributed System,2005,16(11): 1078-1091
[63]p2psim http://www.pdos.lcs.mit.edu/p2psim/
[64]K Calvert, M Doar, E Zegura. Modeling Internet topology [J]. IEEE Communications Magazine (S0163-6804),1997,35(6):160-163
[65]Zegura E W, Calvert K L, Donaoo M J. A quantitative comparison of graph based models for Internet topology. IEEE/ACM Transactions on Networking,1997,5(6): 770-783
[66]S. Rhea, D. Geels, et al. Handling churn in a DHT[A]. Proceedings of the 2004 USENIX Technical Conference[C]. Boston MA, USA,2004.127-146
[67]Godfrey P B, Shenker S, Stoica I. Minimizing Churn in Distributed Systems[C]. Proc of the 2006 Conf on Applications, Technologies, Architectures, and Protocols for Computer Communications,2006:147-158
[68]M. R and I. Foster. Mapp ing the Gnutella network. IEEE Internet Computing,2002, 6:50-57
[69]S. Saroiu, P. K. Gummadi, S. D. Gribble. A Measurement Study of Peer to Peer File Sharing Systems. Proc. of the Multimedia Computing and Networking 2002 (MMCN 2002).2002.156-170
[70]S. Sen and J. Wang. Analyzing Peer to Peer Traffic Across Large Networks. ACM/ IEEE Transactions on Networking,2004,12(2):137-150
[71]Ripeanu M, Foster I, Iamnitchi A. Mapping the Gnutella Network:Properties of Large-scale Peer-to-Peer Systems and Implications for System Design[J]. Journal of IEEE Internet Computing,2002,6(1):50-57
[72]Stutzbach D, Rejaie R, Sen S. Characterizing unstructured overlay topologies in modern P2P file-sharing systems. In:Proc. of the 5th ACM SIGCOMM Conf. on Internet Measurement.2005.146-158
[73]J, Stribling J, Morris R, Kaashoek F. Bandwidth-Efficient management of DHT routing tables. In:Proc. of the 2nd Conf. On Symp. on Networked Systems Design & Implementation (NSDI 2005). Berkeley:USENI Press,2005.99-114
[74]Li J, Stribling J, Morris R, Kaashoek F, Gil T. A performance vs. cost framework for evaluating DHT design tradeoffs under churn. In:Proc. of the 24th IEEE INFOCOM 2005. Piscataway:IEEE Press,2005.225-236
[75]Herrera O, Znati T. Static resiliency vs. churn-resistance capability of DHT-protocols. In:Proc. of thel8th Int'l Conf. on Paralleland Distributed Computing Systems (PDCS 2005). Phoenix:IASTED/ACTA Press,2005.141-147
[76]Kersch P, Szabo R, Cheng L, Jean K, Galis A. Stochastic maintenance of overlays in structured P2P systems. Computer Communications,2008,31(3):603-619
[77]张宇翔,杨冬.P2P网络中Churn问题研究.软件学报,2007,20(5)：1362-1376
[78]Godfrey BP, Shenker S, Stoica I. Minimizing churn in distributed systems. In:Proc. of the ACM SIGCOMM 2006. New York:ACM Press,2006.147-158
[79]Wu D, Tian Y, Ng KW, Datta A. Stochastic analysis of the interplay between object maintenance and churn. Computer Communications,2008,31(2):220-239
[80]S. Zoels, W. Kellerer, Z. Despotovic. On hierarchical DHT systems-An analytical approach for optimal designs. Computer Communications,2008,31(3):576-590
[81]S. Zoels, Z. Despotovic, W. Kellerer. Cost-based analysis of hierarchical DHT design. IEEE International Conference on Peer-to-Peer Computing (P2P 2006), 2006.103-112
[82]PARKER, A. The true picture of peer-to-peer file sharing, http://www.cachelogic. com,2004
[83]BitTorrent, http://www.bittorrent.com
[84]T. S. Eugene Ng, Y. H. Chu, S. G Rao, et al. Measurement-based Optimization Techniques for Bandwidth-Demanding Peer-to-Peer Systems. Proc. IEEE INFO-COM, San Francisco, April 2003.273-282
[85]S. G. M. Koo, C. S. G. Lee, and K. Kannan. A Genetic-Algorithmbased Neighbor-Selection Strategy for Hybrid Peer-to-Peer Networks. Proc. IEEE International Conference on Computer Communications and Networks(ICCCN'04), Chicago, IL, USA, October,2004.182-193
[86]A. Legout, G Urvoy-Keller, and P. Michiardi. Rarest First and Choke Algorithms Are Enough. Technical Report(inria-00001111, version 2-1 June 2006), INRIA, Sophia Antipolis, June 2006
[87]M. Izal, G Urvoy-Keller, E. Biersack, et al. Dissecting BitTorrent:Five Months in a Torrent's Lifetime. Proc. Passive and Active Measurements, Antibes Juan-les-Pins, France, April 2004.83-92
[88]J. A. Pouwelse, P. Garbacki, D. H. J. Epema, et al. The BitTorrent P2P File-Sharing System:Measurements and Analysis. Proc.4th International Workshop on Peer-to-Peer Systems (IPTPS'05), February 2005.47-59
[89]R. Krishnan, M. Smith, Z. Tang, et al. The Virtual Commons:Why Free-Riding can be Tolerated in Peer-to-Peer Networks. Proc. Worshop on Information Systems and Economics, December 2003.56-67
[90]M. Feldman, C. Papadimitriou, J. Chuang, et al. Free-Riding and Whitewashing in Peer-to-Peer Systems. Proc. ACM SIGCOMM Workshop on. Practice and Theory of Incentives in Networked Systems(PINS'04), August 2004.86-97
[91]J. Li, and S. T. Vuong. An Efficient Clustered Architecture for P2P Networks. Proc. the 18th International Conference on Advanced Information Networking and Applications(AINA'04),2004.278-283
[92]Z. Bellahsene, M. Roantree, and N. King. Services for Large Scale P2P Networks. European Research Consortium for Informatics and Mathematics News Journal(ERCIM'04),2004
[93]X. Yang and G. de Veciana. Service Capacity of Peer-to-Peer Networks. Proc. IEEE INFOCOM,2004.157-169
[94]D. Qiu and R. Srikant. Modeling and Performance Analysis of BitTorrent_like Peer_to_Peer Networks. Proc. ACMSIGCOMM, Portland, OR, August 2004. 268-282
[95]林闯.计算机网络和计算机系统性能评价.北京：清华大学出版社,2001
[96]L. Plissonneau, J. L. Costeux, and P. Brown. Analysis of Peer-to-Peer Traffic on ADSL. Proc. Passive and Active Measurement Conf. (PAM), Mar.2005.69-82
[97]B. Chun, B. Zhao, and J. Kubiatowicz. Impact of Neighbor Selection on Performance and Resilience of Structured P2P Networks. Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS), Feb.2005.264-274
[98]Zhongmei Yao, Member, IEEE, and Dmitri Loguinov, Understanding Disconnection and Stabilization of Chord. IEEE Transactions on Parallel and Distributed System,22(4,)APRIL 2011.650-661
[99]P. B. Godfrey, S. Shenker, and I. Stoica. Minimizing Churn in Distributed Systems. Proc. ACM SIGCOMM, Sept.2006.253-264
[100]L. Xiao, Z. Y. Zhuang, Y. H. Liu. Dynamic Layer Management in Superpeer Architectures. IEEE Transactions on Parallel and Distributed System,2005,16(11): 1078-1091
[101]John F. Buford, Heather Yu, Eng Keong Lua. Structured Overlays:Maintenance and Dynamics. P2P Networking and Applications,2009.107-134
[102]Saroiu S, Gummadi K P and Gribble S D. Measuring and Analyzing the Characteristics of Napster and Gnutella Hosts. Multimedia Systems,2003,9(2): 170-184
[103]A. W. Loo. The Future of Peer-to-Peer Computing. Communications of ACM,2003, 46:56-61
[2]Dejan S. Milojicic, Vana Kalogeraki, Rajan Lukose, et al. Peer-to-Peer Computing[R]. Tech. Rep. HPL-2002-57, HP Laboratories Palo Alto,2002,3
[3]Stephanos Androutsellis-Theotokis and Diomidis Spinellis, A Survey of Peer-to-Peer Content Distribution Technologies, ACM Computing Surveys,2004, 36(4):127-139
[4]Detlef Schoder, Kai Fischbach. Peer-to-Peer Prospects[J]. Communications of the ACM,2003,46(2):729-736
[5]IMlogic Threat Center.2005 real-time communication security:The year in review. http://www.imlogic.com/pdf/2005ThreatCenter_report.2005
[6]Weaver N. Warhol worms:The potential for very fast Internet plagues, http://www. cs.berkeley.edu/~nweaver/warhol.html.2002
[7]R. Sandberg, The Sun Network Filesystem:Design, Implementation and Experience, presented at Proceedings of the1987 Summer Usenix Conference,1987.57-65
[8]Sidebotham. B. Volumes:The Andrew File System Data Structuring Primitive. Technical Report CMU-ITC-053, Carnegie Melon University,1986
[9]M. Satyanarayanan, J. J. Kistler, P. Kumar. Coda:a Highly Available File System for a Distributed Workstation Environment. IEEE Transactions on Computers,1990. 6(4):715-726
[10]M. A. Baker, G C. Fox and H. W. Yau. Cluster Computing Review. Northeast Parallel Architectures Center, Syracuse University, November 16,1995
[11]Burns, M. George and Wallace B. Modeling and Simulative Performance Analysis of SMP and Clustered Computer Architectures. Simulation. February 2000
[12]Wang R. Y., Anderson T. E.. xFS:a wide area mass storage file system. In: Proceedings of the Fourth Workshop on Workstation Operating Systems,1993. 71-78
[13]Sweeney A., Doucette D., Wei Hu. Scalability in the XFS file system. In: Proceedings of the USENIX 1996 Annual Technical Conference,1996.1-14
[14]Kuhn Michael, Kunkel Julian Martin, Ludwig Thomas. Dynamic file system semantics to enable metadata optimizations in PVFS. Concurrency Computation Practice and Experience, September 25,2009,21(14):1775-1788
[15]Cams P. H., Ligon W. B. Ⅲ, Ross R. B.. PVFS:a parallel file system for Linux clusters. In:Proceedings of the 4th Annual Linux Showcase and Conference,2000. 317-327
[16]Braam P. J.. The Lustre storage architecture. Technical report, Cluster File Systems, Inc.,2002. http://www.lustre.org/docs/lustre.pdf:21-45
[17]Stephanos Androutsellis-Theotokis and Diomidis Spinellis, A Survey of Peer-to-Peer Content Distribution Technologies, ACM Computing Surveys,2004, 36(4):516-527
[18]Napster home page, http://www.napster.com
[19]Matei Ripeanu. Peer-to-Peer Architecture Case Study:Gnutella Network. In proceedings of 2001 International Conference on Peer-to-peer Computing (P2P2001), Linkoping Sweden, August,2001.27-29
[20]Druschel P, Rowstron A. PAST:A large-scale, persistent peer-to-peer storage utility. In:Proc. of the HOTOS Conf.2001.75-80
[21]Kubiatowicz, David Bindel, Yan Chen, et al. OceanStore:An Architecture forGlobal-Scale Persistent Storage. In Proceedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), November 2000.95-104
[22]Frank Dabek, M. Frans Kaashoek, David Karger, et al. Wide-area Cooperative Storage with CFS. In SOSP, Oct.2001.126-137
[23]A. Rowstron and P. Druschel. Pastry:Scalable, distributed object location and routing for large-scale peer-to-peer systems. IFIP/ACM International Conference on Distributed Systems Platforms(Middleware), Heidelberg, Germany, pages November 2001.329-350
[24]W. J. Bolosky, M. Castro. Wattenhofer. FARSITE:Federated, Available, and Reliable Storage for an Incompletely Trusted Environment. In Proceedings of OSDI, December 2002.176-185
[25]S. Kubiatowicz, J, C Wells. OceanStore:an architecture for global-scale persistent storage. Proceedings of the ninth international conference on Architectural support for programming languages and operating systems,2000.190-201
[26]XML Doeuments, http://www.w3.org/XML
[27]RDF Doeuments. http://www.w3.org/RDF
[28]Stoica I, Morris R, Liben-Nowell D, Karger DR, Kaashoek MF, Dabek F, Balakrishnan H. Chord:A scalable peer-to-peer lookup service for Internet applications. IEEE/ACM Trans.on Networking,2003,11(1):17-32
[29]S. Ratnasamy, P. Francis, M. Handley, et al. "A scalable content-addressable network", Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM'01), ACM Press,2001.161-172
[30]Zhao BY, Huang L, Stribling J, Rhea SC, Joseph AD. Tapestry:A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications,2004,22(1):41-53
[31]A. Rowstron, P. Druschel, "Pastry:scalable, decentralized object location and routing for large-scale peer-to-peer systems", Proceedings of the 2001 IFIP/ACM International Conference on Distributed Systems Platforms vol.2218 of Lecture Notes in Computer Science, Springer-Verlag,2001.329-350
[32]B. C. Neuman. The Prospero File System:A Global File System Based on the Virtual. System. Computing Systems,1992,5(4):407-432
[33]B. W. Lampson. Designing a global name service. In Proceedings of the 4th ACM. Symposium on Principles of Distributed Computing, August 1986.1-10
[34]I. Foster, C Kesselman.:GLOBUS:a Metacomputing Infrastructure Toolkit, Int. J. Supercomputing Applications,1997,11(2):115-128
[35]A. Bosselaers, R. Govaerts. SHA:a design for Parallel architectures? AdvnaeesinCryPtolog, yProe. EuroeryPt,97, LNCS1233, W. Fum, yEd., SPringe-rVerlag,1997.348-362
[36]Lei S., Grama A.. Extended consistent hashing:an efficient framework for object location. In:Proceedings of the 2nd IEEE International Conference on Distributed Computing Systems. Tokyo, Japan. March 2004.254-262
[37]Swart G. Spreading the load using consistent hashing:a preliminary report. In: Proceeding of Third International Symposium on Parallel and Distributed Computing/HeteroPar. Cork, Ireland. July 2004.169-176
[38]A. Rowstron and P. Druschel. Storage Management and Caching in PAST, a Large-scale Persistent Peer-to-Peer Storage Utility.18th ACM Symposium on Operating Systems Principles (SOSP'01). October 2001.115-123
[39]Lian, Q, W Chen, and Z Zhang, On the Impact of Replica Placement to the Reliability of Distributed Brick Storage Systems. Distributed Computing Systems, 2005. ICDCS 2005. Proceedings.25th IEEE International Conference on,2005. 187-196
[40]Douceur, JR and RP Wartenhofer, Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System. Proceedings ofl5th DISC,2001.48-62
[41]Ramanathan, MK, Increasing object availability in peer-to-peer systems. In Proc. of Parallel and Distributed Processing Symposium,2004.128-136
[42]Schwarz, Thomas J. E., Qin Xin, and Ethen L. Miller, Availability in Global Peer-To-Peer Storage Systems. In Proc. of 6th Workshop onDistributed Data and Structures (WDAS),2004.58-71
[43]L. Avinash and M. Prashant. Cassandra-A Decentralized Structured Storage System. In Proceedings of the 3rd ACM SIGOPS International Workshop on Large Scale Distributed Systems and Middleware Workshop (LADIS'09), Big Sky, MT, USA,2009.81-89
[44]Bhagwan, R, S Savage, and G Voelker, Replication strategies for highly available peer-to-peer storage systems, proc. of FuDiCo:Future directions in Distributed Computing, June,2002.152-163
[45]Rodrigues, R and B Liskov, High Availability in DHTs:Erasure Coding vs. Replication. Proc. of the 4th International Workshop on Peer-to-Peer Systems,2005. 73-82
[46]Lin, WK, DM Chiu, and YB Lee, Erasure code replication revisited. In Proc. of Fourth International Conference on Peer-to-Peer Computing,2004.90-97
[47]田敬.P2P持久存储研究综述.软件学报,2007,15(7)：1056-1063
[48]Ghemawat, S, H Gobioff, and ST Leung, The Google file system. Proceedings of the nineteenth ACM symposium on Operating systemsprinciples,2003.29-43
[49]L. Mihai and Nuno Pregui. Consistency without Concurrency Control in Large, Dynamic Systems. In Proceedings of the 3rd ACM SIGOPS International Workshop on Large Scale Distributed Systems and Middleware Workshop (LADIS '09), Big Sky, MT, USA,2009.125-134
[50]Saito, Y., and Shapiro, M. Optimistic replication. Computing Surveys 37,1 (Mar. 2005),42-81
[51]David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, Rina Panigrahy "Consistent Hashing and Random Trees:Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web". In Proceedings of the 29th Annual ACM Sym-posium on Theory of Computing. El Paso, TX, May 1997. 654-663
[52]E. K. Lua, J. Crowcroft, M. Pias, R. Sharma and S. Lim, A Survey and Comparison of Peer-to-Peer Overlay. Network Schemes, IEEE Communications Survey and. Tutorial,2004,5(7):830-843
[53]E. P. Markatos, Tracing A Large-Scale Peer-to-Peer System:An Hour in the Life of Gnutella, Proc. Second IEEE/ACM Int'l Symp. Cluster Computing and the Grid, 2002.149-158
[54]Kunwadee Sripanidkulchai, Bruce Maggs, and Hui Zhang, Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems, Infocom 2003. 205-217
[55]Ratnasamy. S,. Handley M,. Topologically-aware overlay construction and server selection. In Proc.21st IEEE INFOCOM, volume 21, New York, NY, June 2002. 1190-1199
[56]T. S. Eugene Ng and H. Zhang. Global Network Positioning:A New Approach to Network Distance Prediction. CCR,2001.76-86
[57]Marc S, Antonio F. A Comparative Study of Hierarchical DHT Systems,32nd IEEE Conference on Local Computer Networks,2007.325-333
[58]P. Ganesan, K. Gummadi, H. Garcia-Molina, "Canon in G major:designing DHTs with hierarchical structure", IEEE International Conference on Distributed Computing Systems (ICDCS'04), Tokyo, Japan,2004.263-272
[59]王庆波,代亚非,田敬.基于特征信息定位的P2P网络模型：Barnet.软件学报,2003,14(8)：1481-1488
[60]Z. Xu, R. Min and Y. M. Hu. HIERAS:A DHT based hierarchical P2P routing algorithm.2003 International Conference on Parallel Processing, Kaohsiung, Taiwan, October 2003.6-9
[61]L. Garces-Erice, E. W. Biersack, K. W. Ross, et al. Hierarchical Peer-to-peer Systems. Parallel Processing Letters,2003,13(4):643-657
[62]L. Xiao, Z. Y. Zhuang, Y. H. Liu. Dynamic Layer Management in Superpeer Architectures. IEEE Transactions on Parallel and Distributed System,2005,16(11): 1078-1091
[63]p2psim http://www.pdos.lcs.mit.edu/p2psim/
[64]K Calvert, M Doar, E Zegura. Modeling Internet topology [J]. IEEE Communications Magazine (S0163-6804),1997,35(6):160-163
[65]Zegura E W, Calvert K L, Donaoo M J. A quantitative comparison of graph based models for Internet topology. IEEE/ACM Transactions on Networking,1997,5(6): 770-783
[66]S. Rhea, D. Geels, et al. Handling churn in a DHT[A]. Proceedings of the 2004 USENIX Technical Conference[C]. Boston MA, USA,2004.127-146
[67]Godfrey P B, Shenker S, Stoica I. Minimizing Churn in Distributed Systems[C]. Proc of the 2006 Conf on Applications, Technologies, Architectures, and Protocols for Computer Communications,2006:147-158
[68]M. R and I. Foster. Mapp ing the Gnutella network. IEEE Internet Computing,2002, 6:50-57
[69]S. Saroiu, P. K. Gummadi, S. D. Gribble. A Measurement Study of Peer to Peer File Sharing Systems. Proc. of the Multimedia Computing and Networking 2002 (MMCN 2002).2002.156-170
[70]S. Sen and J. Wang. Analyzing Peer to Peer Traffic Across Large Networks. ACM/ IEEE Transactions on Networking,2004,12(2):137-150
[71]Ripeanu M, Foster I, Iamnitchi A. Mapping the Gnutella Network:Properties of Large-scale Peer-to-Peer Systems and Implications for System Design[J]. Journal of IEEE Internet Computing,2002,6(1):50-57
[72]Stutzbach D, Rejaie R, Sen S. Characterizing unstructured overlay topologies in modern P2P file-sharing systems. In:Proc. of the 5th ACM SIGCOMM Conf. on Internet Measurement.2005.146-158
[73]J, Stribling J, Morris R, Kaashoek F. Bandwidth-Efficient management of DHT routing tables. In:Proc. of the 2nd Conf. On Symp. on Networked Systems Design & Implementation (NSDI 2005). Berkeley:USENI Press,2005.99-114
[74]Li J, Stribling J, Morris R, Kaashoek F, Gil T. A performance vs. cost framework for evaluating DHT design tradeoffs under churn. In:Proc. of the 24th IEEE INFOCOM 2005. Piscataway:IEEE Press,2005.225-236
[75]Herrera O, Znati T. Static resiliency vs. churn-resistance capability of DHT-protocols. In:Proc. of thel8th Int'l Conf. on Paralleland Distributed Computing Systems (PDCS 2005). Phoenix:IASTED/ACTA Press,2005.141-147
[76]Kersch P, Szabo R, Cheng L, Jean K, Galis A. Stochastic maintenance of overlays in structured P2P systems. Computer Communications,2008,31(3):603-619
[77]张宇翔,杨冬.P2P网络中Churn问题研究.软件学报,2007,20(5)：1362-1376
[78]Godfrey BP, Shenker S, Stoica I. Minimizing churn in distributed systems. In:Proc. of the ACM SIGCOMM 2006. New York:ACM Press,2006.147-158
[79]Wu D, Tian Y, Ng KW, Datta A. Stochastic analysis of the interplay between object maintenance and churn. Computer Communications,2008,31(2):220-239
[80]S. Zoels, W. Kellerer, Z. Despotovic. On hierarchical DHT systems-An analytical approach for optimal designs. Computer Communications,2008,31(3):576-590
[81]S. Zoels, Z. Despotovic, W. Kellerer. Cost-based analysis of hierarchical DHT design. IEEE International Conference on Peer-to-Peer Computing (P2P 2006), 2006.103-112
[82]PARKER, A. The true picture of peer-to-peer file sharing, http://www.cachelogic. com,2004
[83]BitTorrent, http://www.bittorrent.com
[84]T. S. Eugene Ng, Y. H. Chu, S. G Rao, et al. Measurement-based Optimization Techniques for Bandwidth-Demanding Peer-to-Peer Systems. Proc. IEEE INFO-COM, San Francisco, April 2003.273-282
[85]S. G. M. Koo, C. S. G. Lee, and K. Kannan. A Genetic-Algorithmbased Neighbor-Selection Strategy for Hybrid Peer-to-Peer Networks. Proc. IEEE International Conference on Computer Communications and Networks(ICCCN'04), Chicago, IL, USA, October,2004.182-193
[86]A. Legout, G Urvoy-Keller, and P. Michiardi. Rarest First and Choke Algorithms Are Enough. Technical Report(inria-00001111, version 2-1 June 2006), INRIA, Sophia Antipolis, June 2006
[87]M. Izal, G Urvoy-Keller, E. Biersack, et al. Dissecting BitTorrent:Five Months in a Torrent's Lifetime. Proc. Passive and Active Measurements, Antibes Juan-les-Pins, France, April 2004.83-92
[88]J. A. Pouwelse, P. Garbacki, D. H. J. Epema, et al. The BitTorrent P2P File-Sharing System:Measurements and Analysis. Proc.4th International Workshop on Peer-to-Peer Systems (IPTPS'05), February 2005.47-59
[89]R. Krishnan, M. Smith, Z. Tang, et al. The Virtual Commons:Why Free-Riding can be Tolerated in Peer-to-Peer Networks. Proc. Worshop on Information Systems and Economics, December 2003.56-67
[90]M. Feldman, C. Papadimitriou, J. Chuang, et al. Free-Riding and Whitewashing in Peer-to-Peer Systems. Proc. ACM SIGCOMM Workshop on. Practice and Theory of Incentives in Networked Systems(PINS'04), August 2004.86-97
[91]J. Li, and S. T. Vuong. An Efficient Clustered Architecture for P2P Networks. Proc. the 18th International Conference on Advanced Information Networking and Applications(AINA'04),2004.278-283
[92]Z. Bellahsene, M. Roantree, and N. King. Services for Large Scale P2P Networks. European Research Consortium for Informatics and Mathematics News Journal(ERCIM'04),2004
[93]X. Yang and G. de Veciana. Service Capacity of Peer-to-Peer Networks. Proc. IEEE INFOCOM,2004.157-169
[94]D. Qiu and R. Srikant. Modeling and Performance Analysis of BitTorrent_like Peer_to_Peer Networks. Proc. ACMSIGCOMM, Portland, OR, August 2004. 268-282
[95]林闯.计算机网络和计算机系统性能评价.北京：清华大学出版社,2001
[96]L. Plissonneau, J. L. Costeux, and P. Brown. Analysis of Peer-to-Peer Traffic on ADSL. Proc. Passive and Active Measurement Conf. (PAM), Mar.2005.69-82
[97]B. Chun, B. Zhao, and J. Kubiatowicz. Impact of Neighbor Selection on Performance and Resilience of Structured P2P Networks. Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS), Feb.2005.264-274
[98]Zhongmei Yao, Member, IEEE, and Dmitri Loguinov, Understanding Disconnection and Stabilization of Chord. IEEE Transactions on Parallel and Distributed System,22(4,)APRIL 2011.650-661
[99]P. B. Godfrey, S. Shenker, and I. Stoica. Minimizing Churn in Distributed Systems. Proc. ACM SIGCOMM, Sept.2006.253-264
[100]L. Xiao, Z. Y. Zhuang, Y. H. Liu. Dynamic Layer Management in Superpeer Architectures. IEEE Transactions on Parallel and Distributed System,2005,16(11): 1078-1091
[101]John F. Buford, Heather Yu, Eng Keong Lua. Structured Overlays:Maintenance and Dynamics. P2P Networking and Applications,2009.107-134
[102]Saroiu S, Gummadi K P and Gribble S D. Measuring and Analyzing the Characteristics of Napster and Gnutella Hosts. Multimedia Systems,2003,9(2): 170-184
[103]A. W. Loo. The Future of Peer-to-Peer Computing. Communications of ACM,2003, 46:56-61