对等网络中的内容搜索、定位和下载技术研究
|
摘要
随着Internet的广泛使用以及接入Internet的计算机系统性能的持续增长，一种新的计算模式——P2P计算得到蓬勃发展。P2P计算致力于高效合理地组织和利用Internet边缘上大量分布的计算、存储、通信、信息等资源。从1999年Napster的出现到现在，短短的几年中，P2P应用已经成为成长速度最快，最流行的互联网应用之一，拥有巨大数量的用户。
内容服务是P2P系统的基本功能模块，内容服务应用是P2P技术当前最主要的应用领域。如何在用户广泛分布、数量巨大、节点行为不可控、计算能力和网络连接不均匀的复杂环境下实现高效的内容服务具有重大的研究意义，同时又是具有挑战性的研究课题。
本文的研究聚焦于P2P网络中的内容服务，分析了P2P网络中内容服务的特殊性以及内容服务技术的研究现状，围绕如何在P2P网络中提供灵活、高效、可扩展的内容服务，深入研究了P2P网络中提供内容服务的关键技术，包括内容服务模型的构造、内容搜索技术、内容定位技术、内容下载技术。主要研究工作包括：
1)提出一种基于内容关联的内容服务模型，充分考虑了原始内容和元数据的管理需求差异，在内容空间完成原始内容的管理，侧重解决原始内容的存储、定位和下载；在元数据空间完成元数据的管理，侧重解决元数据的存储、内容关联管理和搜索。利用元数据建立内容之间的关联关系，并给出基于内容关联的内容搜索方法。
2)提出一种基于兴趣相似度的搜索方法——SBIS：在元数据空间通过内容关联关系的发现度量用户之间的兴趣相似度，在具有相似访问兴趣的用户之间建立逻辑连接关系，限制搜索请求优先在具有相似兴趣的朋友节点之间传播。在内容空间为结构P2P网络的情况下，提出SBISS算法实现基于结构P2P网络的兴趣相似度的计算和内容搜索算法。并在SBISS算法基础上提出集成无描述的内容分组方法的SBISSG算法，进一步提高了搜索算法的可扩展性和搜索质量。在内容空间为非结构P2P网络的情况下，提出SBISU算法实现基于非结构P2P网络的兴趣相似度的学习算法和内容搜索算法。SBISU算法根据历史搜索结果被动学习节点之间的兴趣相似度，学习结果稳定而且收敛速度快。仿真实验结果表明SBIS方法稳定高效，在搜索效率和搜索代价上相对于传统算法有数量级的提高。
3)提出一种层次DHT网络的构造方法——HDHT：通过层次式的DHT进一步提高了传统DHT算法的可缩放性；通过对物理邻居节点的聚合降低了网络访问延迟；通过层次式结构的管理优势实现对网络的管理；通过层次管理策略和节点的能力分类提供了一定的服务质量保证；提出一种低冗余的消息广播算法和一种利用并发下载完成大尺寸内容广播的方法。理论分析和模拟实验验证了算法的性能。
4)提出一种基于分组的并发下载方法——GBD：通过内容分组压缩内容分布信息，降低其传播开销、扩大其传播范围；通过节点分组和下载阶段划分的结合优化连接管理，提高邻居节点的内容可用度和连接平均持续时间；采用在考虑自身下载需求的同时考虑邻
With the wide application of the Internet and the continuously improved performance of the computer systems connected to the Internet, a new computing pattern, Peer-to-Peer computing, is booming. P2P computing devotes to sufficiently and reasonably organize and utilize the Internet edge's huge decentralized resources of computing, storage, communication and information. Since the introduction of Napster in 1999, P2P applications have become, only in a few years, one of the fastest growing and most popular Internet applications, which hold a huge number of users.
Content service is one of the basic function modules of P2P systems. Content service application is one of the most important applications of P2P technology. How to implement efficient content service in a complex environment which contains decentralized and huge-amount users, uncontrollable nodes with unbalanced computing capacity and network connection is a challenging research area and of great importance.
The research in this thesis focuses on content service in P2P network. It analyzes the particularity of content service in P2P network and the current research status on content service. In order to provide a flexible, efficient and extensible content service, we did much research on the key technologies for providing content service in P2P networks, including the construction of content service model, content searching techniques, content locationg techniques and content downloading techniques. This thesis makes key contributions to the following areas:
1) A content service model based on content correlation is proposed. Based on the different requirements from the management of the original content and metadata, the model manages the storage, locating and downloading of original content in the content space, and it manages the storage of metadata, content correlating and content searching in the metadata space. In this model, the correlation among content is set up by the use of metadata, while the searching of content is based on the correlation of content.
2) A search method—SBIS, based on interest similarity is proposed. SBIS computes the interest similarities among users by discovering the content correlations in the metedata space, and constructs logic connections among users with simliar interests. Search requests spread to friend nodes with similar interests with priority. When the content space is a structured P2P network, SBISS algorithm based on the particularity of structured P2P network is proposed to compute the interest similarities and the route search requests. Also SBISSG algorithm based on SBISS is proposed to integrate a new content grouping method without the need of users' descriptions and improves the extensibility of search algorithm and search quality. While the content space is an unstructured P2P network, SBISU algorithm based on the particularity of an
内容服务是P2P系统的基本功能模块，内容服务应用是P2P技术当前最主要的应用领域。如何在用户广泛分布、数量巨大、节点行为不可控、计算能力和网络连接不均匀的复杂环境下实现高效的内容服务具有重大的研究意义，同时又是具有挑战性的研究课题。
本文的研究聚焦于P2P网络中的内容服务，分析了P2P网络中内容服务的特殊性以及内容服务技术的研究现状，围绕如何在P2P网络中提供灵活、高效、可扩展的内容服务，深入研究了P2P网络中提供内容服务的关键技术，包括内容服务模型的构造、内容搜索技术、内容定位技术、内容下载技术。主要研究工作包括：
1)提出一种基于内容关联的内容服务模型，充分考虑了原始内容和元数据的管理需求差异，在内容空间完成原始内容的管理，侧重解决原始内容的存储、定位和下载；在元数据空间完成元数据的管理，侧重解决元数据的存储、内容关联管理和搜索。利用元数据建立内容之间的关联关系，并给出基于内容关联的内容搜索方法。
2)提出一种基于兴趣相似度的搜索方法——SBIS：在元数据空间通过内容关联关系的发现度量用户之间的兴趣相似度，在具有相似访问兴趣的用户之间建立逻辑连接关系，限制搜索请求优先在具有相似兴趣的朋友节点之间传播。在内容空间为结构P2P网络的情况下，提出SBISS算法实现基于结构P2P网络的兴趣相似度的计算和内容搜索算法。并在SBISS算法基础上提出集成无描述的内容分组方法的SBISSG算法，进一步提高了搜索算法的可扩展性和搜索质量。在内容空间为非结构P2P网络的情况下，提出SBISU算法实现基于非结构P2P网络的兴趣相似度的学习算法和内容搜索算法。SBISU算法根据历史搜索结果被动学习节点之间的兴趣相似度，学习结果稳定而且收敛速度快。仿真实验结果表明SBIS方法稳定高效，在搜索效率和搜索代价上相对于传统算法有数量级的提高。
3)提出一种层次DHT网络的构造方法——HDHT：通过层次式的DHT进一步提高了传统DHT算法的可缩放性；通过对物理邻居节点的聚合降低了网络访问延迟；通过层次式结构的管理优势实现对网络的管理；通过层次管理策略和节点的能力分类提供了一定的服务质量保证；提出一种低冗余的消息广播算法和一种利用并发下载完成大尺寸内容广播的方法。理论分析和模拟实验验证了算法的性能。
4)提出一种基于分组的并发下载方法——GBD：通过内容分组压缩内容分布信息，降低其传播开销、扩大其传播范围；通过节点分组和下载阶段划分的结合优化连接管理，提高邻居节点的内容可用度和连接平均持续时间；采用在考虑自身下载需求的同时考虑邻
With the wide application of the Internet and the continuously improved performance of the computer systems connected to the Internet, a new computing pattern, Peer-to-Peer computing, is booming. P2P computing devotes to sufficiently and reasonably organize and utilize the Internet edge's huge decentralized resources of computing, storage, communication and information. Since the introduction of Napster in 1999, P2P applications have become, only in a few years, one of the fastest growing and most popular Internet applications, which hold a huge number of users.
Content service is one of the basic function modules of P2P systems. Content service application is one of the most important applications of P2P technology. How to implement efficient content service in a complex environment which contains decentralized and huge-amount users, uncontrollable nodes with unbalanced computing capacity and network connection is a challenging research area and of great importance.
The research in this thesis focuses on content service in P2P network. It analyzes the particularity of content service in P2P network and the current research status on content service. In order to provide a flexible, efficient and extensible content service, we did much research on the key technologies for providing content service in P2P networks, including the construction of content service model, content searching techniques, content locationg techniques and content downloading techniques. This thesis makes key contributions to the following areas:
1) A content service model based on content correlation is proposed. Based on the different requirements from the management of the original content and metadata, the model manages the storage, locating and downloading of original content in the content space, and it manages the storage of metadata, content correlating and content searching in the metadata space. In this model, the correlation among content is set up by the use of metadata, while the searching of content is based on the correlation of content.
2) A search method—SBIS, based on interest similarity is proposed. SBIS computes the interest similarities among users by discovering the content correlations in the metedata space, and constructs logic connections among users with simliar interests. Search requests spread to friend nodes with similar interests with priority. When the content space is a structured P2P network, SBISS algorithm based on the particularity of structured P2P network is proposed to compute the interest similarities and the route search requests. Also SBISSG algorithm based on SBISS is proposed to integrate a new content grouping method without the need of users' descriptions and improves the extensibility of search algorithm and search quality. While the content space is an unstructured P2P network, SBISU algorithm based on the particularity of an
引文
[1] Dejan S. Milojicic, Vana Kalogeraki. Peer-to-Peer Computing. HP technical report HPL-2002-57.
[2] XML Documents. http://www.w3.org/XML.
[3] Web Service Documents. http://www.w3.org/2002/ws/.
[4] Napster. www.napster.com.
[5] Leonard Kleinrock, Holger Opderbeck. Throughput in the ARPANET -Protocols and measurement. IEEE transaction on Comunications, Vol com-25, No 1, 1997, 95～104.
[6] Gnutella. www.gnutella.com.
[7] B. Cohen. Incentives build robustness in bittorrent. In Proc of workshop on Economics of Peer-to-Peer Systems, Berkeley, USA, 2003.
[8] Hari Balakrishnan, M. F. Kaashoek, David Karger, Robert Morris, Ion Stoica, Looking Up Data in P2P Systems, Communications of the ACM, Vol. 46, No. 2, February 2003, pp. 43～48
[9] D.Clark. Face to Face with Peer-to-Peer Networking. IEEE Computer, Vol.34, NO.1, 2001.
[10] Clay Shirky, What is P2P and what Isn't. www.openp2p.com/Ipt/a//p2p/2000/11/24/shirky1-whatisp2p.html
[11] M. R Singh. Peering at peer-to-peer computing. IEEE Internet Computing, Vol.5, No. 1, 2001.
[12] 王庆波．基于特征定位的P2P网络．哈尔滨工业大学硕士论文，2002．
[13] B. Bollobas, Modern Graph Theory. Springer-verlag, New York. 1998.
[14] Lada A. Adamic, Rajan M. Lukose, Amit R. Puniyani, and Bernardo A. Huberman, Search in power-law networks, Physical Review E, Volume 64, 046135.
[15] Reka Albert and Albert-Laszlo Barabasi, Statistical mechanics of complex networks, Rev. Mod. Phys. 74(2002), 47-97.
[16] K.I. Goh, E. Oh, B.Kahng and D.Kim, Betweeness centrality correlation in social networks, Phys. Rev. E, 67(2003), 017101.
[17] D.Watts, S.Strogatz: Collective dynamics of small-world networks. Nature 393-440 (1998).
[18] Eng Keong Lua, Jon Crowcroft, Marcelo Pias, etc. a survey and comparision of??peer-to-peer overlay network schemes, IEEE COMMUNICATIONS SURVEY and TUTORIAL, 2004.
[19] M.Castro, P.Druschel, Y.C. Hu, and A. Rowstron, Exploiting network proximity in peer-to-peer overlay networks, Microsoft Research Laboratory, Tech, Rep.Technical report MST-TR-2002-82, 2002.
[20] SAROIU, S., GUMMADI, P.K., and GRIBBLE, S.D. A Measurement Study of peer-to-peer File Sharing Systems. In proc of Multimedia Computing and Networking 2002, Boston, MA.
[21] J. Li, B.T.Loo, J.Hellerstein, F. Kaashoek, D.R. Karge, and R.Morris. On the feasibility of peer-to-peer web indexing and search. In Proc of IPTPS 2003.
[22] Y. CHawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S.Shenker. Making Gnutella-like p2p systems scalable. In Proc of ACM SIGCOMM, 2003.
[23] I.Clarke, O.Sandberg, and B.Wiley. Freenet: A distributed anonymous information storage and retrieval system. In Proceedings of the Workshop on Design Issues in Anonymity and Unobservability, Berkeley, California, June 2000.
[24] Edith Cohen, Amos Fiat, Haim Kaplan. Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. In Proc of INFOCOM 2003.
[25] Joseph, S.R.H. NeuroGrid: Semantically Routing Queries in Peer-to-Peer Networks. In Proc of International Workshop on Peer-to-Peer Computing, Pisa, 2002.
[26] I.Stoica, R.Morris, D.Karger, M.F.Kaashoek, H.Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications, In Proc of ACM SIGCOMM,San Diego, California, 2001.
[27] Ratnasamy, S.Francis, etc. A scalable content-addressable network, In Proc. ACM SIGCOMM, San Diego, CA, 2001, pp161-172.
[28] A.Rowstron, P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc of Distributed Systems Platforms (Middleware), Heidelberg, Germany, pp329~350, 2001.
[29] B.Y.Zhao, J.D.Kubiatowicz, A.D.Joseph. Tapestry: An infrastructure for fault-resilient wide-area location and routing, Technical Report UCB//CSD-01-1141, U. C. Berkeley, April 2001.
[30] Kazaa. http://www.kazaa.com/
[31] Ben Y. Zhao, Yitao Duan, etc. Brocade: Landmark Routing on Overlay Networks.In Proc of IPTPS 2002, lncs2429 pp34~44.
[32] Boon Thau Loo, Ryan Huebsch, Ion Stoica, Joseph M. Hellerstein. The Case for a Hybrid P2P Search Infrastructure, In Proc of IPTPS, San Diego, CA, 2004.[33] Miguel Castro, Manuel Costa and Antony Rowstron Peer-to-peer overlays: structured, unstructured, or both. Microsoft Research Technical Report,MSR-TR-2004-73.
[34] V. Jacobson. Pathchar. Lawrence Berkeley Lab Network Research Group. http://morpheus.com/ [
35] M. Izal, G. Urvoy-Keller, E. Biersack, P. Felber, A. AlHamra, and L. Garces-Erice. Dissecting bittorrent: Five months in a torrent's lifetime. In Passive and Active Measurements, Antibes Juan-les-Pins, France, April 2004.
[36] P. Druschel and A. Rowstron. PAST: A large-scale, persistent peer-to-peer storage utility, HotOS VIII, Schoss Elmau, Germany, 2001.
[37] KUBIATOWICZ, J.BINDEL, D.CHEN, etc, OceanStore: An Architecture for Global-Scale Persistent Storage. In Proc of 9th international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), November 2000.
[38] GROOVE NETWORKS White Paper, www.groove.net.
[39] BOLCER, GET AL. 2000. Peer-to-Peer Architectures and the Magi Open Source nfrastructure. Endeavors technologies White Paper, www.endeavors.com.
[40] QQ, software, www.tencent.com
[41] MSN messenger, messenger.msn.com.
[42] AIM , AOL Instant Messenger, www.aim.com.
[43] Jabber, http://jabber.org/
[44] SETI@HOME, 2001.setiathome.ssl.berkeley.edu
[45] GENOME@HOME, 2001. genomeathome.stanford.edu
[46] FOLDING@HOME, 2001. foldingathome.stanford.edu
[47] distributed.net, www.distributed.net.
[48] Gerd Kortuem.Proem: A Peer-to-Peer Computing Platform for Mobile Ad-hoc Networks. In Proc of Advanced Topic Workshop Middleware for Mobile Computing. 2001.
[49] C. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and Replication in Unstructured Peer-to-Peer Networks. In Proc of ICS, 2002.
[50] C. Tang, Z. Xu, and M. Mahalingam. pSearch: Information Retrieval in Structured Overlays. In Proc of HotNets 2002.
[51] Bawa, Mayank; Manku, Gurmeet; Raghavan, Prabhakar. SETS: Search Enhanced by Topic Segmentation. In Proc of ACM SIGIR 2003
[52] Malkhi D, Naor M, Ratajczak D. Viceroy: a scalable and dynamic emulation of the??butterfly. In Proc of the 21st ACM Symposium on Principles of Distributed Computing. New York: ACM Press, 2002:183～192.
[53] Kumar, A., Merugu, S., Xu, J., Yu, X., Ulysses: A Robust, Low-Diameter, Low-Latency Peer-to-peer Network, in Proc. of IEEE ICNP 2003
[54] 李祖鹏，黄建华，唐辉．基于P2P计算模式的自组织网络路由模型。软件学报，2005，16(5)：916～930．
[55] Jie Lu, Jamie Callan. Merging Retrieval Results in Hierarchical peer-to-Peer Networks. SIGIR 2004.
[56] S. A., D. S. A Survey of Peer-to-Peer Content Distribution Technologies, ACM computing Surveys, Vol 36, No 4, 2004, pp335～371.
[57] Zihui Ge, Daniel R. Figueiredo, Sharad Jaiswal, Jim Kurose, Don Towsley, Modeling Peer-Peer File Sharing Systems, In Proc of IEEE INFOCOM, 2003.
[58] 石明宏，P2P网络中的性能和安全机制研究，上海交通大学博士论文，2005．
[59] Johannes Borgstrm, Uwe Nestmann, Luc Onana, and Dilian Gurov, Verifying a Structured Peer-to-peer Overlay Network:The Static Case. In Proc of Global Computing 2004.
[60] S. G. M. Koo, C. S. G. Lee, and K. Kannan. A Resource-trading Mechanism for Efficient Distribution of Large-volume Contents on Peer-to-Peer Networks. In Proc of 14th IEEE International Conference on Computer Communications and Networks (ICCCN'05), San Diego, CA, 2005.
[61] Jeffrey Shneidman and David C. Parkes.Rationality and Self-Interest in Peer to Peer Networks. In Proc of IPTPS 2003.
[62] S.Wang and D. Xuan, A Markov-chain based approach to resilience of structured P2P systems under failures and attacks. Technical Report, 2002.
[63] Krishna P. Gummadi, Richard J. Dunn, Stefan Saroiu, Steven D. Gribble, Henry M. Levy, and John Zahorjan. Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload. In Proc of SOSP, 2003, Bolton Landing, New York, USA.
[64] Dongyu qiu, R.Srikant. Modeling and Performance Analysis of Bit Torrent-Like Peer-to-Peer Networks, In Proc ofACM SIGCOMM, 2004.
[65] Chonggang Wang, Bo Li. Peer-to-peer overlay networks: A survey, Technical Report, Department of Computer Science, HKUST, Feb 2003.
[66] Dongsheng Li, Xicheng Lu, and Jie Wu. FISSIONE: A Scalable Constant Degree and Low Congestion DHT Scheme Based on Kautz Graphs. In Proc of IEEE INFOCOM 2005.
[67] 周世杰，对等计算中的分布式路由算法及其安全性研究，博士学位论文，电子??科技大学，2004．
[68] 王庆波，代亚非，田敬，基于特征信息定位的P2P网络模型：Barnet，软件学报，2003，Vol．14，No．8，1481～1488
[69] Fraigniaud P, Gauron P. The Content-Addressable Network D2B. Tech Rept. 1349, CNRS University paris-Sud, France, 2003
[70] 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 Proc of the 29th Annual ACM Symposium on Theory of Computing, 1997, pp. 654～663.
[71] C. Plaxton, R. Rajaraman, and A. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proc of ACM SPAA, pages 311～320, Newport, Rhode Island, June 1997.
[72] John Risson, Tim Moors. Survey of research towards robust peer-to-peer networks: search methods, Technical Report UNSW-EE-P2P-1-1, University of New South Wales, Australia, September 2004.
[73] 周晋，路海明，李衍达．用Small-World设计无组织P2P系统的路由算法．软件学报，2004，15(6)：915～923．
[74] 宋建涛，沙朝锋，杨智应，朱洪．语义对等网构造及搜索机制研究．计算机研究与发展．Vol．41(4)：645-652，2004．
[75] Sam Joseph. Decentralized Meta-data strategies: Effective Peer-to-Peer Search. IEICE TRANS. COMMUN, VOL E86-B, NO.6, 2003.
[76] Ashwin R. Bharambe, Mukesh Agrawal, Srinivasan Seshan: Mercury: Supporting Scalable Multi Attribute Range Queries. ACM SIGCOMM 2004.
[77] Hamid Nazerzadeh, Mohammad Ghodsi. RAQ: A Range-Queriable Distributed Data Structure. In Proc of SOFSEM, 269～277, 2005.
[78] Yatin Chawathe, Sriram Ramabhadran, Sylvia Ratnasamy, Anthony LaMarca, Joseph Hellerstein and Scott Shenker.A Case Study in Building Layered DHT Applications. IRS-TR-05-001.
[79] V. Kalogeraki, D. Gunopulos, and D. Zeinalipour-Yazti. A Local Search Mechanism for Peer-to-Peer Networks. In Proc of CIKM, 2002.
[80] Kunwadee Sripanidkulchai, Bruce Maggs, Hui Zhang. Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems, In Proc of INFOCOM 2003
[81] Marcelo Werneck Barbosa, Melissa Morgado Costa, etc. Using Locality of Reference to Improve Performance of Peer-to-Peer Applications. In Proc of WOSP2004, Redwood City, California, 2004.[82] JXTASearch White Paper. http://www.jxta.org/JXTAsearch. pdf
[83] Flashget. www.amazesoft.com.
[84] NetAnts. www.netants.com.
[85] Pablo Rodriguez, Ernst W. Biersack. Dynamic Parallel Access to Replicated Content in the Internet. IEEE/ACM TRANSACTIONS ON NETWORKING, Vol.10, No.4, 2002, pp455~465.
[86] J. Kangasharju, K.W. Ross, and J. Roberts, Locating copies of objects using the domain name system, 4th Int. Web Caching Workshop, San Diego, CA, Mar. 1999.OpenCola Swarmcast. http://www.opencola.org/projects/swarmcast.shtml
[87] 周旭, 卢显良, 候孟书, 詹川. adPD:一种速度自适应当动态并行下载技术. 计算机科学, 2005 vol. 32 No. 4, pp 168-170.
[88] S. G. M. Koo, C. Rosenberg, and D. Xu. Analysis of Parallel Downloading for Large File Distribution. In Proc of the 9th IEEE International Workshop on Future Trends of Distributed Computing Systems (FTDCS 2003), 2003, pp128~135.
[89] Gkantsidis C, Ammar M, Zegura E. On the Effect of Large-Scale Deployment of Parallel Downloading. In Proc of IEEE Workshop on Internet Applications (WIAPP'03), 2003.
[90] Yang-hua Chu, Sanjay G. Rao, and Hui Zhang, A case for end-system multicast, IN Proc of ACM SIGMETRICS, Santa Clara, CA, 2000, pp.1~12.
[91] Miguel Castro, Peter Druschel, etc. Splitstream: High-bandwidth multicast in cooperative environments, In Proc of 19th Symposium on Operating Systems Principles (SOSP). 2003, ACM.
[92] V. Padmanabhan, H. Wang, P. Chou, and K. Sripanidkulchai, Distributing streaming media content using cooperating networking, In Proc of NOSSDAV, 2002.
[93] S. G. M. Koo, C. S. G. Lee, and K. Kannan. A Genetic-Algorithm-Based Neighbor-Selection Strategy for Hybrid Peer-to-Peer Networks. In Proc of the 13th IEEE International Conference on Computer Communications and Networks (ICCCN'04), Chicago, IL, 2004, pp. 469-474.
[94] Slurpie. R. Sherwood, R. Braud, and B. Bhattacharjee, Slurpie: A Cooperative Bulk Data Transfer Protocol, In Proc of IEEE INFOCOM, 2004.
[95] Bullet. D. Kostic, A. Rodriguez, J. Albrecht, and A. Vahdat, Bullet: High bandwidth data dissemination using an overlay mesh, In Proc of Symposium on Operating Systems Principles (SOSP), 2003.
[96] Christos Gkantsidis, Pablo Rodriguez Rodriguez. Network Coding for Large Scale Content Distribution, In Proc of IEEE INFOCOM 2005.[97] J.A. Pouwelse, P. Garbacki, D.H.J. Epema, H.J. Sips. The Bittorrent P2P file -sharing system: measurements and analysis. In Proc of IPTPS 2005.
[98] John Byers, Michael Luby, etc. A digital fountain approach to reliable distribution of bulk data, In Proc of ACM SIGCOMM, 1998.
[99] Philip Chou, Yunnan Wu, and Kamal Jain, Network coding for the internet, In Proc of IEEE Communication Theory Workshop, 2004.
[100] Chord simulator, http://pdos.csail.mit.edu/chord/sim.html.
[101]Tapestry simulator, http://www.cs.ucsb.edu/~ravenben/tapestry/
[102] M. Schlosser, T. Conide, S. Kamvar, Simulating a P2P-File-Sharing Network, In Proc of 1st Workshop on Semantics in Peer-to-Peer and Grid Computing. 2003: 239-246.
[103] LI, J., JANNOTTI, J., DE COUTO, D., KARGER, D., and MORRIS, R. A scalable location service for geographic ad hoc routing. In Proceedings of the 6th ACM International Conference on Mobile Computing and Networking (Boston,Massachusetts, August 2000), pp. 120-130.
[104]P-Sim Shashidhar Merugu, Sridhar Srinivasan, Ellen Zegura. p-sim: A Simulator for Peer-to-Peer Networks. MASCOTS 2003: 213-218.
[105] Sam Joseph, An Extendible Open Source P2P Simulator. P2PJournal. 2003.
[106] E. Zegura, K. Calvert, and M. J. Donahoo. A Quantitative Comparison of Graph-based Models for Internet Topology. IEEE/ACM Transactions on Networking, pp770~783, 1997.
[107]G. Salton, C. Yang. On the specification of term values in atutomatic indexing. J.Doc, Vol.29, pp351-372,1973
[108]S.Deerwester, S.T.Dumais, GW.Furnas, T.K.Landauer and R.Harshman. Indexing by latent semantic indexing. J.Am.Soc. Inf.Sci., Vol.41, No.6, pp391~397, 1990.
[109] RDF Documents. http://www.w3.org/RDF/
[110] S.E.Robertson, K.Sparck-jones, relevance weighting of search terms, J.Am. Soc. Inf.Sci.,pp129~146, 1976.
[111]Reed, M.G., Syverson, P.F., Goldschlag, D.M.: Anonymous connections and onion routing.IEEE Journal on Selected Areas in Communication: Special Issue on Copyright and Privacy Protection 16 (1998)
[112]Waldman, M., Rubin, A.D., Cranor, L.F.: Publius: A robust, tamper-evident,censorshipresistant, web publishing system. In Proc of 9th USENIX Security Symposium, Denver, Colorado, 2000, pp59~72.
[113] Waldman, M., Mazires, D.: Tangier: A censorship resistant publishing system based??on document entanglements. In Proc of 8th ACM Conference on Computer and Communcation Security (CCS-8), Philadelphia, Pennsylvania (2001)
[114] Bruce M.Hill, Zipf's law and prior distributions for the composition of a population, Journal of the American Statistical Association, 65:1220-1232 (1970).
[115] Adriana Iamnitchi, Matei Ripeanu, Ian Foster. Small-World File-Sharing Communities. In Proc of IEEE INFOCOM 2004.
[116] webtraces, http://www.web-caching.corrdtraces-logs.html.
[117] Sameh El-Ansary, Luc Onana Alima, Per Brand, Seif Haridi. Efficient Broadcast in Structured P2P Networks. In Proc of IPTPS, Berkeley, CA, 2003.
[118] Evangelos E Markatos. Tracing a large-scale Peer to Peer System: an hour in the life of Gnutella.In Proc of 2th IEEE/ACM Int. Symp. on Cluster Computing and the Grid, 2002.
[119] Bitcomet software, www.bitcomet.com.
[120] S.Sen, J.Wang. Analyzing peer-to-peer traffic across large networks. IEEE/ACM Transactions on Networking, 12(2):219-232,2004
[121] Stefan Saroiu, P. Krishna Gummadi, and Steven D. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems, In Proc of Multimedia Computing and Networking (MMCN), 2002.
[122] Venkata N. Padmanabhan, Kunwadee Sripanidkulchai. The Case for Cooperative Networking. In Proc of IPTPS 2002, LNCS 2429, pp178～190.
[123] XiaoYu Wang, WeeSiong Ng, etc. Buddyweb: A P2P-Based Collaborative web Caching System. In Proc of Networking Workshops, 2002, LNCS 2376, pp 247～251.
[124] 黄桂敏，杨明福，王学光．分散型web缓存模型，计算机工程，2004．Vol 29．No17．pp29～30．
[125] 田辉，基于802.1x认证技术的应用分析，http://www.net5u.net/ Article/Other_Technology/Item/200502/458.html.
[126] 黄叔武，计算机网络教程，ISBN 7302094101，清华大学出版社 2004．
[127] Jxta Documents, www.jxta.org/project/www/docs/JXTAprotocols.pdf.
[2] XML Documents. http://www.w3.org/XML.
[3] Web Service Documents. http://www.w3.org/2002/ws/.
[4] Napster. www.napster.com.
[5] Leonard Kleinrock, Holger Opderbeck. Throughput in the ARPANET -Protocols and measurement. IEEE transaction on Comunications, Vol com-25, No 1, 1997, 95～104.
[6] Gnutella. www.gnutella.com.
[7] B. Cohen. Incentives build robustness in bittorrent. In Proc of workshop on Economics of Peer-to-Peer Systems, Berkeley, USA, 2003.
[8] Hari Balakrishnan, M. F. Kaashoek, David Karger, Robert Morris, Ion Stoica, Looking Up Data in P2P Systems, Communications of the ACM, Vol. 46, No. 2, February 2003, pp. 43～48
[9] D.Clark. Face to Face with Peer-to-Peer Networking. IEEE Computer, Vol.34, NO.1, 2001.
[10] Clay Shirky, What is P2P and what Isn't. www.openp2p.com/Ipt/a//p2p/2000/11/24/shirky1-whatisp2p.html
[11] M. R Singh. Peering at peer-to-peer computing. IEEE Internet Computing, Vol.5, No. 1, 2001.
[12] 王庆波．基于特征定位的P2P网络．哈尔滨工业大学硕士论文，2002．
[13] B. Bollobas, Modern Graph Theory. Springer-verlag, New York. 1998.
[14] Lada A. Adamic, Rajan M. Lukose, Amit R. Puniyani, and Bernardo A. Huberman, Search in power-law networks, Physical Review E, Volume 64, 046135.
[15] Reka Albert and Albert-Laszlo Barabasi, Statistical mechanics of complex networks, Rev. Mod. Phys. 74(2002), 47-97.
[16] K.I. Goh, E. Oh, B.Kahng and D.Kim, Betweeness centrality correlation in social networks, Phys. Rev. E, 67(2003), 017101.
[17] D.Watts, S.Strogatz: Collective dynamics of small-world networks. Nature 393-440 (1998).
[18] Eng Keong Lua, Jon Crowcroft, Marcelo Pias, etc. a survey and comparision of??peer-to-peer overlay network schemes, IEEE COMMUNICATIONS SURVEY and TUTORIAL, 2004.
[19] M.Castro, P.Druschel, Y.C. Hu, and A. Rowstron, Exploiting network proximity in peer-to-peer overlay networks, Microsoft Research Laboratory, Tech, Rep.Technical report MST-TR-2002-82, 2002.
[20] SAROIU, S., GUMMADI, P.K., and GRIBBLE, S.D. A Measurement Study of peer-to-peer File Sharing Systems. In proc of Multimedia Computing and Networking 2002, Boston, MA.
[21] J. Li, B.T.Loo, J.Hellerstein, F. Kaashoek, D.R. Karge, and R.Morris. On the feasibility of peer-to-peer web indexing and search. In Proc of IPTPS 2003.
[22] Y. CHawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S.Shenker. Making Gnutella-like p2p systems scalable. In Proc of ACM SIGCOMM, 2003.
[23] I.Clarke, O.Sandberg, and B.Wiley. Freenet: A distributed anonymous information storage and retrieval system. In Proceedings of the Workshop on Design Issues in Anonymity and Unobservability, Berkeley, California, June 2000.
[24] Edith Cohen, Amos Fiat, Haim Kaplan. Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. In Proc of INFOCOM 2003.
[25] Joseph, S.R.H. NeuroGrid: Semantically Routing Queries in Peer-to-Peer Networks. In Proc of International Workshop on Peer-to-Peer Computing, Pisa, 2002.
[26] I.Stoica, R.Morris, D.Karger, M.F.Kaashoek, H.Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications, In Proc of ACM SIGCOMM,San Diego, California, 2001.
[27] Ratnasamy, S.Francis, etc. A scalable content-addressable network, In Proc. ACM SIGCOMM, San Diego, CA, 2001, pp161-172.
[28] A.Rowstron, P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc of Distributed Systems Platforms (Middleware), Heidelberg, Germany, pp329~350, 2001.
[29] B.Y.Zhao, J.D.Kubiatowicz, A.D.Joseph. Tapestry: An infrastructure for fault-resilient wide-area location and routing, Technical Report UCB//CSD-01-1141, U. C. Berkeley, April 2001.
[30] Kazaa. http://www.kazaa.com/
[31] Ben Y. Zhao, Yitao Duan, etc. Brocade: Landmark Routing on Overlay Networks.In Proc of IPTPS 2002, lncs2429 pp34~44.
[32] Boon Thau Loo, Ryan Huebsch, Ion Stoica, Joseph M. Hellerstein. The Case for a Hybrid P2P Search Infrastructure, In Proc of IPTPS, San Diego, CA, 2004.[33] Miguel Castro, Manuel Costa and Antony Rowstron Peer-to-peer overlays: structured, unstructured, or both. Microsoft Research Technical Report,MSR-TR-2004-73.
[34] V. Jacobson. Pathchar. Lawrence Berkeley Lab Network Research Group. http://morpheus.com/ [
35] M. Izal, G. Urvoy-Keller, E. Biersack, P. Felber, A. AlHamra, and L. Garces-Erice. Dissecting bittorrent: Five months in a torrent's lifetime. In Passive and Active Measurements, Antibes Juan-les-Pins, France, April 2004.
[36] P. Druschel and A. Rowstron. PAST: A large-scale, persistent peer-to-peer storage utility, HotOS VIII, Schoss Elmau, Germany, 2001.
[37] KUBIATOWICZ, J.BINDEL, D.CHEN, etc, OceanStore: An Architecture for Global-Scale Persistent Storage. In Proc of 9th international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), November 2000.
[38] GROOVE NETWORKS White Paper, www.groove.net.
[39] BOLCER, GET AL. 2000. Peer-to-Peer Architectures and the Magi Open Source nfrastructure. Endeavors technologies White Paper, www.endeavors.com.
[40] QQ, software, www.tencent.com
[41] MSN messenger, messenger.msn.com.
[42] AIM , AOL Instant Messenger, www.aim.com.
[43] Jabber, http://jabber.org/
[44] SETI@HOME, 2001.setiathome.ssl.berkeley.edu
[45] GENOME@HOME, 2001. genomeathome.stanford.edu
[46] FOLDING@HOME, 2001. foldingathome.stanford.edu
[47] distributed.net, www.distributed.net.
[48] Gerd Kortuem.Proem: A Peer-to-Peer Computing Platform for Mobile Ad-hoc Networks. In Proc of Advanced Topic Workshop Middleware for Mobile Computing. 2001.
[49] C. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and Replication in Unstructured Peer-to-Peer Networks. In Proc of ICS, 2002.
[50] C. Tang, Z. Xu, and M. Mahalingam. pSearch: Information Retrieval in Structured Overlays. In Proc of HotNets 2002.
[51] Bawa, Mayank; Manku, Gurmeet; Raghavan, Prabhakar. SETS: Search Enhanced by Topic Segmentation. In Proc of ACM SIGIR 2003
[52] Malkhi D, Naor M, Ratajczak D. Viceroy: a scalable and dynamic emulation of the??butterfly. In Proc of the 21st ACM Symposium on Principles of Distributed Computing. New York: ACM Press, 2002:183～192.
[53] Kumar, A., Merugu, S., Xu, J., Yu, X., Ulysses: A Robust, Low-Diameter, Low-Latency Peer-to-peer Network, in Proc. of IEEE ICNP 2003
[54] 李祖鹏，黄建华，唐辉．基于P2P计算模式的自组织网络路由模型。软件学报，2005，16(5)：916～930．
[55] Jie Lu, Jamie Callan. Merging Retrieval Results in Hierarchical peer-to-Peer Networks. SIGIR 2004.
[56] S. A., D. S. A Survey of Peer-to-Peer Content Distribution Technologies, ACM computing Surveys, Vol 36, No 4, 2004, pp335～371.
[57] Zihui Ge, Daniel R. Figueiredo, Sharad Jaiswal, Jim Kurose, Don Towsley, Modeling Peer-Peer File Sharing Systems, In Proc of IEEE INFOCOM, 2003.
[58] 石明宏，P2P网络中的性能和安全机制研究，上海交通大学博士论文，2005．
[59] Johannes Borgstrm, Uwe Nestmann, Luc Onana, and Dilian Gurov, Verifying a Structured Peer-to-peer Overlay Network:The Static Case. In Proc of Global Computing 2004.
[60] S. G. M. Koo, C. S. G. Lee, and K. Kannan. A Resource-trading Mechanism for Efficient Distribution of Large-volume Contents on Peer-to-Peer Networks. In Proc of 14th IEEE International Conference on Computer Communications and Networks (ICCCN'05), San Diego, CA, 2005.
[61] Jeffrey Shneidman and David C. Parkes.Rationality and Self-Interest in Peer to Peer Networks. In Proc of IPTPS 2003.
[62] S.Wang and D. Xuan, A Markov-chain based approach to resilience of structured P2P systems under failures and attacks. Technical Report, 2002.
[63] Krishna P. Gummadi, Richard J. Dunn, Stefan Saroiu, Steven D. Gribble, Henry M. Levy, and John Zahorjan. Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload. In Proc of SOSP, 2003, Bolton Landing, New York, USA.
[64] Dongyu qiu, R.Srikant. Modeling and Performance Analysis of Bit Torrent-Like Peer-to-Peer Networks, In Proc ofACM SIGCOMM, 2004.
[65] Chonggang Wang, Bo Li. Peer-to-peer overlay networks: A survey, Technical Report, Department of Computer Science, HKUST, Feb 2003.
[66] Dongsheng Li, Xicheng Lu, and Jie Wu. FISSIONE: A Scalable Constant Degree and Low Congestion DHT Scheme Based on Kautz Graphs. In Proc of IEEE INFOCOM 2005.
[67] 周世杰，对等计算中的分布式路由算法及其安全性研究，博士学位论文，电子??科技大学，2004．
[68] 王庆波，代亚非，田敬，基于特征信息定位的P2P网络模型：Barnet，软件学报，2003，Vol．14，No．8，1481～1488
[69] Fraigniaud P, Gauron P. The Content-Addressable Network D2B. Tech Rept. 1349, CNRS University paris-Sud, France, 2003
[70] 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 Proc of the 29th Annual ACM Symposium on Theory of Computing, 1997, pp. 654～663.
[71] C. Plaxton, R. Rajaraman, and A. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proc of ACM SPAA, pages 311～320, Newport, Rhode Island, June 1997.
[72] John Risson, Tim Moors. Survey of research towards robust peer-to-peer networks: search methods, Technical Report UNSW-EE-P2P-1-1, University of New South Wales, Australia, September 2004.
[73] 周晋，路海明，李衍达．用Small-World设计无组织P2P系统的路由算法．软件学报，2004，15(6)：915～923．
[74] 宋建涛，沙朝锋，杨智应，朱洪．语义对等网构造及搜索机制研究．计算机研究与发展．Vol．41(4)：645-652，2004．
[75] Sam Joseph. Decentralized Meta-data strategies: Effective Peer-to-Peer Search. IEICE TRANS. COMMUN, VOL E86-B, NO.6, 2003.
[76] Ashwin R. Bharambe, Mukesh Agrawal, Srinivasan Seshan: Mercury: Supporting Scalable Multi Attribute Range Queries. ACM SIGCOMM 2004.
[77] Hamid Nazerzadeh, Mohammad Ghodsi. RAQ: A Range-Queriable Distributed Data Structure. In Proc of SOFSEM, 269～277, 2005.
[78] Yatin Chawathe, Sriram Ramabhadran, Sylvia Ratnasamy, Anthony LaMarca, Joseph Hellerstein and Scott Shenker.A Case Study in Building Layered DHT Applications. IRS-TR-05-001.
[79] V. Kalogeraki, D. Gunopulos, and D. Zeinalipour-Yazti. A Local Search Mechanism for Peer-to-Peer Networks. In Proc of CIKM, 2002.
[80] Kunwadee Sripanidkulchai, Bruce Maggs, Hui Zhang. Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems, In Proc of INFOCOM 2003
[81] Marcelo Werneck Barbosa, Melissa Morgado Costa, etc. Using Locality of Reference to Improve Performance of Peer-to-Peer Applications. In Proc of WOSP2004, Redwood City, California, 2004.[82] JXTASearch White Paper. http://www.jxta.org/JXTAsearch. pdf
[83] Flashget. www.amazesoft.com.
[84] NetAnts. www.netants.com.
[85] Pablo Rodriguez, Ernst W. Biersack. Dynamic Parallel Access to Replicated Content in the Internet. IEEE/ACM TRANSACTIONS ON NETWORKING, Vol.10, No.4, 2002, pp455~465.
[86] J. Kangasharju, K.W. Ross, and J. Roberts, Locating copies of objects using the domain name system, 4th Int. Web Caching Workshop, San Diego, CA, Mar. 1999.OpenCola Swarmcast. http://www.opencola.org/projects/swarmcast.shtml
[87] 周旭, 卢显良, 候孟书, 詹川. adPD:一种速度自适应当动态并行下载技术. 计算机科学, 2005 vol. 32 No. 4, pp 168-170.
[88] S. G. M. Koo, C. Rosenberg, and D. Xu. Analysis of Parallel Downloading for Large File Distribution. In Proc of the 9th IEEE International Workshop on Future Trends of Distributed Computing Systems (FTDCS 2003), 2003, pp128~135.
[89] Gkantsidis C, Ammar M, Zegura E. On the Effect of Large-Scale Deployment of Parallel Downloading. In Proc of IEEE Workshop on Internet Applications (WIAPP'03), 2003.
[90] Yang-hua Chu, Sanjay G. Rao, and Hui Zhang, A case for end-system multicast, IN Proc of ACM SIGMETRICS, Santa Clara, CA, 2000, pp.1~12.
[91] Miguel Castro, Peter Druschel, etc. Splitstream: High-bandwidth multicast in cooperative environments, In Proc of 19th Symposium on Operating Systems Principles (SOSP). 2003, ACM.
[92] V. Padmanabhan, H. Wang, P. Chou, and K. Sripanidkulchai, Distributing streaming media content using cooperating networking, In Proc of NOSSDAV, 2002.
[93] S. G. M. Koo, C. S. G. Lee, and K. Kannan. A Genetic-Algorithm-Based Neighbor-Selection Strategy for Hybrid Peer-to-Peer Networks. In Proc of the 13th IEEE International Conference on Computer Communications and Networks (ICCCN'04), Chicago, IL, 2004, pp. 469-474.
[94] Slurpie. R. Sherwood, R. Braud, and B. Bhattacharjee, Slurpie: A Cooperative Bulk Data Transfer Protocol, In Proc of IEEE INFOCOM, 2004.
[95] Bullet. D. Kostic, A. Rodriguez, J. Albrecht, and A. Vahdat, Bullet: High bandwidth data dissemination using an overlay mesh, In Proc of Symposium on Operating Systems Principles (SOSP), 2003.
[96] Christos Gkantsidis, Pablo Rodriguez Rodriguez. Network Coding for Large Scale Content Distribution, In Proc of IEEE INFOCOM 2005.[97] J.A. Pouwelse, P. Garbacki, D.H.J. Epema, H.J. Sips. The Bittorrent P2P file -sharing system: measurements and analysis. In Proc of IPTPS 2005.
[98] John Byers, Michael Luby, etc. A digital fountain approach to reliable distribution of bulk data, In Proc of ACM SIGCOMM, 1998.
[99] Philip Chou, Yunnan Wu, and Kamal Jain, Network coding for the internet, In Proc of IEEE Communication Theory Workshop, 2004.
[100] Chord simulator, http://pdos.csail.mit.edu/chord/sim.html.
[101]Tapestry simulator, http://www.cs.ucsb.edu/~ravenben/tapestry/
[102] M. Schlosser, T. Conide, S. Kamvar, Simulating a P2P-File-Sharing Network, In Proc of 1st Workshop on Semantics in Peer-to-Peer and Grid Computing. 2003: 239-246.
[103] LI, J., JANNOTTI, J., DE COUTO, D., KARGER, D., and MORRIS, R. A scalable location service for geographic ad hoc routing. In Proceedings of the 6th ACM International Conference on Mobile Computing and Networking (Boston,Massachusetts, August 2000), pp. 120-130.
[104]P-Sim Shashidhar Merugu, Sridhar Srinivasan, Ellen Zegura. p-sim: A Simulator for Peer-to-Peer Networks. MASCOTS 2003: 213-218.
[105] Sam Joseph, An Extendible Open Source P2P Simulator. P2PJournal. 2003.
[106] E. Zegura, K. Calvert, and M. J. Donahoo. A Quantitative Comparison of Graph-based Models for Internet Topology. IEEE/ACM Transactions on Networking, pp770~783, 1997.
[107]G. Salton, C. Yang. On the specification of term values in atutomatic indexing. J.Doc, Vol.29, pp351-372,1973
[108]S.Deerwester, S.T.Dumais, GW.Furnas, T.K.Landauer and R.Harshman. Indexing by latent semantic indexing. J.Am.Soc. Inf.Sci., Vol.41, No.6, pp391~397, 1990.
[109] RDF Documents. http://www.w3.org/RDF/
[110] S.E.Robertson, K.Sparck-jones, relevance weighting of search terms, J.Am. Soc. Inf.Sci.,pp129~146, 1976.
[111]Reed, M.G., Syverson, P.F., Goldschlag, D.M.: Anonymous connections and onion routing.IEEE Journal on Selected Areas in Communication: Special Issue on Copyright and Privacy Protection 16 (1998)
[112]Waldman, M., Rubin, A.D., Cranor, L.F.: Publius: A robust, tamper-evident,censorshipresistant, web publishing system. In Proc of 9th USENIX Security Symposium, Denver, Colorado, 2000, pp59~72.
[113] Waldman, M., Mazires, D.: Tangier: A censorship resistant publishing system based??on document entanglements. In Proc of 8th ACM Conference on Computer and Communcation Security (CCS-8), Philadelphia, Pennsylvania (2001)
[114] Bruce M.Hill, Zipf's law and prior distributions for the composition of a population, Journal of the American Statistical Association, 65:1220-1232 (1970).
[115] Adriana Iamnitchi, Matei Ripeanu, Ian Foster. Small-World File-Sharing Communities. In Proc of IEEE INFOCOM 2004.
[116] webtraces, http://www.web-caching.corrdtraces-logs.html.
[117] Sameh El-Ansary, Luc Onana Alima, Per Brand, Seif Haridi. Efficient Broadcast in Structured P2P Networks. In Proc of IPTPS, Berkeley, CA, 2003.
[118] Evangelos E Markatos. Tracing a large-scale Peer to Peer System: an hour in the life of Gnutella.In Proc of 2th IEEE/ACM Int. Symp. on Cluster Computing and the Grid, 2002.
[119] Bitcomet software, www.bitcomet.com.
[120] S.Sen, J.Wang. Analyzing peer-to-peer traffic across large networks. IEEE/ACM Transactions on Networking, 12(2):219-232,2004
[121] Stefan Saroiu, P. Krishna Gummadi, and Steven D. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems, In Proc of Multimedia Computing and Networking (MMCN), 2002.
[122] Venkata N. Padmanabhan, Kunwadee Sripanidkulchai. The Case for Cooperative Networking. In Proc of IPTPS 2002, LNCS 2429, pp178～190.
[123] XiaoYu Wang, WeeSiong Ng, etc. Buddyweb: A P2P-Based Collaborative web Caching System. In Proc of Networking Workshops, 2002, LNCS 2376, pp 247～251.
[124] 黄桂敏，杨明福，王学光．分散型web缓存模型，计算机工程，2004．Vol 29．No17．pp29～30．
[125] 田辉，基于802.1x认证技术的应用分析，http://www.net5u.net/ Article/Other_Technology/Item/200502/458.html.
[126] 黄叔武，计算机网络教程，ISBN 7302094101，清华大学出版社 2004．
[127] Jxta Documents, www.jxta.org/project/www/docs/JXTAprotocols.pdf.