结构化对等网络路由机制关键技术研究
|
摘要
结构化对等网络是一种采用纯分布式的消息传递机制和根据关键字进行查找的定位服务模型,目前在分布式存储、应用层多播、文件共享等领域已经得到广泛应用。结构化对等网络路由算法研究面临许多问题,例如状态和效率的折衷、拓扑失配、查询热点、结点异构等,如何解决这些问题具有重要意义。本文针对结点异构、查询热点、降低系统负载等关键技术问题进行了较为深入的研究,论文主要包括以下工作:
(1)普遍认为在结构化P2P协议中实现能力感知会增加网络开销,如何建立高效、低开销的能力感知协议具有重要意义。分析了传统的结点通过周期性交换路由表信息实现能力感知的算法,该算法收敛时间长且不可避免增大网络开销。提出一种高效的能力感知协议-HeteroChord,HeteroChord协议在结点的路由表建立算法、更新算法、路由表维护算法中实现能力感知。HeteroChord协议在新结点加入时即可计算出需要更新的其他结点,能力感知速度快、效率高。实验结果表明,建立同样大小的网络,HeteroChord中结点更新算法产生的总开销远小于Chord;在动态环境下,HeteroChord具有比Chord更小的维护开销。
(2)以HeteroChord为基础建立了一种虚拟双层结构化模型Vring,Vring的外层是由所有结点组建的结构化HeteroChord网络,内层是由超级结点组建的Chord网络。Vring与目前典型的双层结构化网络模型不同的是:超级结点具有和普通结点相同的路由表大小,仅比普通结点多维护一个超级叶子结点集,超级结点路由表维护简单;单个超级结点失败不会造成其他结点脱离网络,不存在单点故障。建立了三种Vring的简单应用系统,通过实验测试了基于本地索引的非DHT查找方式的数据共享系统的查询特征。
(3) P2P系统是一种分布式系统,降低系统负载对提高P2P系统的扩展性具有重要意义。目前结构化P2P协议主要利用缓存方法解决查询热点问题,这些缓存方法对数据缓存后的收益无法预测,是一种较盲目的缓存,往往导致系统负载加重。提出一种结构化P2P协议中的缓存计算模型,该模型以降低系统负载为目标,结点采用一种文件访问统计方法跟踪查询本地文件的消息途经邻居结点的历史次数,根据文件访问历史统计记录预测缓存该文件到邻居结点可能减少的查询负载,然后与缓存后可能产生的更新开销对比,进而确定是否缓存文件到相应的邻居结点。实验表明,该缓存计算模型可以有效降低系统负载。
(4)仅采用虚拟服务器、多Hash技术或复制不能解决Zipf查询环境下的负载均衡问题。提出一种自适应负载均衡方法,方法采用一种被动式结点负载统计方法生成局部负载视图;采用一种文件访问统计方法生成局部文件访问视图;当系统内结点负载存在差异,重载结点把指向自身的逻辑链路迁移至指向局部负载视图中的轻载结点,通过减小重载结点入度和增加轻载结点入度来减小结点间负载差异;当结点的请求负载较高时,通过局部文件访问视图计算需要缓存的热点文件及目标结点,降低承载热点文件的结点的请求负载。实验表明,在用户查询服从Zipf分布的环境下,自适应负载均衡方法可使结点负载达到较好的均衡。
(5)分析了Zipf查询下无状态限制的结构化P2P协议的结点负载不平衡的形成因素,提出一种适合于该类结构化P2P协议的PLC负载均衡方法,该方法采用负载感知的被动式路由表维护算法和基于概率的路由算法提高轻载结点作为路由中继结点的概率,并通过一种缓存机制来降低承载热点文件的结点的请求负载。实验表明,在用户查询服从Zipf分布的环境下,PLC负载均衡方法可使系统达到较好的负载均衡。
Structured peer to peer networks are service discovery models that utilize pure distributed routing mechanisms and discovery the services by key, and there are a lot of applications built on them, for example, distributed storage systems, application layer multicast systems and file sharing systems. Many issues relative to routing algorithms have been raised in structured peer to peer protocols, for example, state-efficiency tradeoff, query hotspots, topology mismatch, and heterogeneity. This dissertation mainly focuses on heterogeneity, query hotspots, and how to decrease system load in structured peer to peer networks. The main works are as follows:
(1) It is commonly believed that extending structured peer to peer overlays to be capacity-aware will increase maintenance overhead, and it is important to build a capacity aware protocol that is effective and has low maintenance overhead. This paper analyzes the reason why the traditional capacity aware mechanisms implemented by exchanging routing states between peers have long convergence time and increase maintenance overhead inevitably, and then presents an effective capacity-aware structured peer to peer protocol—HeteroChord. HeteroChord implements the capacity aware mechanisms in the peer’s joining algorithm, updating algorithm and maintenance algorithms. In HeteroChord, the peers whose routing tables should be updated can be calculated when a new peer joins the system, so the capacity aware mechanisms are efficient. Simulation results indicate that the overhead of the updating algorithm to build a same size network in HeteroChord is far less than the overhead of the updating algorithm in Chord, and the maintenance overhead of HeteroChord is less than that of Chord under churn.
(2) This paper presents a virtual double layer structured peer to peer model called Vring based on HeteroChord. The outer layer structure of Vring is HeteroChord which includes all peers, and the inner layer structure is Chord which only includes super peers. There are many differences between Vring and other superpeer-based structured models. In Vring, the routing tables of all peers are the same size, and the superpeers only maintain a super leaf set more than common peers, so the maintenance algorithm of superpeers is simple,and there is no single point of failure. Lastly this paper proposes three application models based on Vring, and tests the characteristics of local indies-based data sharing system by simulation.
(3) Peer to peer systems are distributed systems, and decreasing system load is important for improving the scalability of the systems. Caching is always used to achieve load balance in structured p2p systems currently, but none of the current caching algorithms have mechanisms to compute whether a caching is worthwhile, so the current caching algorithms are blindness and always increase system load. This paper presents a caching model in structured peer to peer systems. In order to reduce system load, this caching model uses a passive file requested statistic method which records the current accessing times of each neighbor,and then estimates the reducible query load on the assumption that we cache the file to each neighbor. The reducible query load and the overhead caused by caching determine whether it is worthwhile to cache the file to a neighbor. Simulation results indicate the caching model can reduce system load effectively.
(4) Algorithms using virtual server, power of two choices, or replication can not balance the load of peers under Zipf-like requests distribution. This paper presents a self-adaptive load balancing algorithm, in which each peer creates a local load distribution view using a passive load statistic method and a local file requested view using file requested statistic method. When load imbalance exists in the system, the heavy loaded peer will make the logical links which point to itself to point to a light loaded peer in its local load distribution view, with the indegree of the heavy loaded peer decreasing and the indegree of the light loaded peer increasing, the load imbalance magnitude will decrease. When the request load of the heavy loaded peer is high, the peer will use its local file request view to get the popular file and cache the file to corresponding target peer. Simulation results indicate that the system has a good load balance under Zipf-like requests distribution if it runs the balancing algorithm.
(5) This paper analyzes the reason for load imbalance under Zipf-like requests distribution in unlimited-state-per-node architecture, and presents a load balancing algorithm called PLC for this kind of structured overlays. PLC uses load aware reactive routing state maintenance strategy and probability-based routing algorithm to improve the probability of the light loaded peers as the intermediate peers forwarding messages, and uses a caching mechanism to decrease the request load of the heavy loaded peers that store popular objects. Results from the simulation experiments indicate that the system has a good load balance under Zipf-like requests distribution if it runs PLC algorithm.
(1)普遍认为在结构化P2P协议中实现能力感知会增加网络开销,如何建立高效、低开销的能力感知协议具有重要意义。分析了传统的结点通过周期性交换路由表信息实现能力感知的算法,该算法收敛时间长且不可避免增大网络开销。提出一种高效的能力感知协议-HeteroChord,HeteroChord协议在结点的路由表建立算法、更新算法、路由表维护算法中实现能力感知。HeteroChord协议在新结点加入时即可计算出需要更新的其他结点,能力感知速度快、效率高。实验结果表明,建立同样大小的网络,HeteroChord中结点更新算法产生的总开销远小于Chord;在动态环境下,HeteroChord具有比Chord更小的维护开销。
(2)以HeteroChord为基础建立了一种虚拟双层结构化模型Vring,Vring的外层是由所有结点组建的结构化HeteroChord网络,内层是由超级结点组建的Chord网络。Vring与目前典型的双层结构化网络模型不同的是:超级结点具有和普通结点相同的路由表大小,仅比普通结点多维护一个超级叶子结点集,超级结点路由表维护简单;单个超级结点失败不会造成其他结点脱离网络,不存在单点故障。建立了三种Vring的简单应用系统,通过实验测试了基于本地索引的非DHT查找方式的数据共享系统的查询特征。
(3) P2P系统是一种分布式系统,降低系统负载对提高P2P系统的扩展性具有重要意义。目前结构化P2P协议主要利用缓存方法解决查询热点问题,这些缓存方法对数据缓存后的收益无法预测,是一种较盲目的缓存,往往导致系统负载加重。提出一种结构化P2P协议中的缓存计算模型,该模型以降低系统负载为目标,结点采用一种文件访问统计方法跟踪查询本地文件的消息途经邻居结点的历史次数,根据文件访问历史统计记录预测缓存该文件到邻居结点可能减少的查询负载,然后与缓存后可能产生的更新开销对比,进而确定是否缓存文件到相应的邻居结点。实验表明,该缓存计算模型可以有效降低系统负载。
(4)仅采用虚拟服务器、多Hash技术或复制不能解决Zipf查询环境下的负载均衡问题。提出一种自适应负载均衡方法,方法采用一种被动式结点负载统计方法生成局部负载视图;采用一种文件访问统计方法生成局部文件访问视图;当系统内结点负载存在差异,重载结点把指向自身的逻辑链路迁移至指向局部负载视图中的轻载结点,通过减小重载结点入度和增加轻载结点入度来减小结点间负载差异;当结点的请求负载较高时,通过局部文件访问视图计算需要缓存的热点文件及目标结点,降低承载热点文件的结点的请求负载。实验表明,在用户查询服从Zipf分布的环境下,自适应负载均衡方法可使结点负载达到较好的均衡。
(5)分析了Zipf查询下无状态限制的结构化P2P协议的结点负载不平衡的形成因素,提出一种适合于该类结构化P2P协议的PLC负载均衡方法,该方法采用负载感知的被动式路由表维护算法和基于概率的路由算法提高轻载结点作为路由中继结点的概率,并通过一种缓存机制来降低承载热点文件的结点的请求负载。实验表明,在用户查询服从Zipf分布的环境下,PLC负载均衡方法可使系统达到较好的负载均衡。
Structured peer to peer networks are service discovery models that utilize pure distributed routing mechanisms and discovery the services by key, and there are a lot of applications built on them, for example, distributed storage systems, application layer multicast systems and file sharing systems. Many issues relative to routing algorithms have been raised in structured peer to peer protocols, for example, state-efficiency tradeoff, query hotspots, topology mismatch, and heterogeneity. This dissertation mainly focuses on heterogeneity, query hotspots, and how to decrease system load in structured peer to peer networks. The main works are as follows:
(1) It is commonly believed that extending structured peer to peer overlays to be capacity-aware will increase maintenance overhead, and it is important to build a capacity aware protocol that is effective and has low maintenance overhead. This paper analyzes the reason why the traditional capacity aware mechanisms implemented by exchanging routing states between peers have long convergence time and increase maintenance overhead inevitably, and then presents an effective capacity-aware structured peer to peer protocol—HeteroChord. HeteroChord implements the capacity aware mechanisms in the peer’s joining algorithm, updating algorithm and maintenance algorithms. In HeteroChord, the peers whose routing tables should be updated can be calculated when a new peer joins the system, so the capacity aware mechanisms are efficient. Simulation results indicate that the overhead of the updating algorithm to build a same size network in HeteroChord is far less than the overhead of the updating algorithm in Chord, and the maintenance overhead of HeteroChord is less than that of Chord under churn.
(2) This paper presents a virtual double layer structured peer to peer model called Vring based on HeteroChord. The outer layer structure of Vring is HeteroChord which includes all peers, and the inner layer structure is Chord which only includes super peers. There are many differences between Vring and other superpeer-based structured models. In Vring, the routing tables of all peers are the same size, and the superpeers only maintain a super leaf set more than common peers, so the maintenance algorithm of superpeers is simple,and there is no single point of failure. Lastly this paper proposes three application models based on Vring, and tests the characteristics of local indies-based data sharing system by simulation.
(3) Peer to peer systems are distributed systems, and decreasing system load is important for improving the scalability of the systems. Caching is always used to achieve load balance in structured p2p systems currently, but none of the current caching algorithms have mechanisms to compute whether a caching is worthwhile, so the current caching algorithms are blindness and always increase system load. This paper presents a caching model in structured peer to peer systems. In order to reduce system load, this caching model uses a passive file requested statistic method which records the current accessing times of each neighbor,and then estimates the reducible query load on the assumption that we cache the file to each neighbor. The reducible query load and the overhead caused by caching determine whether it is worthwhile to cache the file to a neighbor. Simulation results indicate the caching model can reduce system load effectively.
(4) Algorithms using virtual server, power of two choices, or replication can not balance the load of peers under Zipf-like requests distribution. This paper presents a self-adaptive load balancing algorithm, in which each peer creates a local load distribution view using a passive load statistic method and a local file requested view using file requested statistic method. When load imbalance exists in the system, the heavy loaded peer will make the logical links which point to itself to point to a light loaded peer in its local load distribution view, with the indegree of the heavy loaded peer decreasing and the indegree of the light loaded peer increasing, the load imbalance magnitude will decrease. When the request load of the heavy loaded peer is high, the peer will use its local file request view to get the popular file and cache the file to corresponding target peer. Simulation results indicate that the system has a good load balance under Zipf-like requests distribution if it runs the balancing algorithm.
(5) This paper analyzes the reason for load imbalance under Zipf-like requests distribution in unlimited-state-per-node architecture, and presents a load balancing algorithm called PLC for this kind of structured overlays. PLC uses load aware reactive routing state maintenance strategy and probability-based routing algorithm to improve the probability of the light loaded peers as the intermediate peers forwarding messages, and uses a caching mechanism to decrease the request load of the heavy loaded peers that store popular objects. Results from the simulation experiments indicate that the system has a good load balance under Zipf-like requests distribution if it runs PLC algorithm.
引文
[1] Gallaugher JM, Ramanathan SC. Choosing a client/server architecture. Information Systems Management,1996,13(2):7 -13
[2] Hypertext transfer protocol. ftp://ftp.isi.edu/in-notes/rfc2616.txt, December 2006
[3] File transfer protocol. http://www.w3.org/Protocols/rfc959, July 2006
[4] Web services. http://www.w3.org/2002/ws, September 2006
[5] Oram A. Peer-to-Peer: Harnessing the benefits of a disruptive technology. California: O'Reilly and Associates, 2001, 9-10
[6] Napster. http://www.Napster.com, December 2004
[7] Gnutella. http://gnutella.wego.com, December 2004
[8] KaZaA. http://www.KaZaA.com, December 2004
[9] Haeberlen A, Mislove A, Post A, et al. Fallacies in evaluating decentralized systems. http://iptps06.cs.ucsb.edu/papers/Post-fallacies06.pdf, 2006
[10] Karl A, Manfred H. Peer to peer information systems. concepts and models, state of the art, and future systems. In: Proc. of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering. New York:ACM Press, 2002, 326-327
[11] Milojicic DS, Kalogeraki V, Lukose RM. Peer-to-peer computing. http://www.hpl.hp.com/ techreports/2002/HPL-2002-57R1.pdf, 2002
[12] Michael M. Discovering P2P. Alameda:Sybex international, 2001, 12-20
[13] Aberer K, Hauswirth M. An overview on peer-to-peer information systems. In: Litwin W, Lévy G, eds. Proc. in Informatics (14). Waterloo: Carleton Scientific, 2002, 171-188
[14] Schollmeier R. A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications. In: Proc. of the First International Conference on Peer-to-Peer Computing. Washington: IEEE Computer Society, 2002, 27-29
[15] Ramesh S, Brian DG. Peer to peer computing: The evolution of a Disruptive Technology. Hershey: Idea group publishing, 2004, 2-4
[16] Lua EK, Crowcroft J, Pias M, et al. A survey and comparison of peer-to-peeroverlay network schemes. Journal of IEEE Communications Survey and Tutorial, 2005,7(2):72-93
[17] Bailes JE, Templeton GF. Managing P2P security. communications of the ACM, 2004, 47(9):95-98
[18] Wang Y, Vassileva J. Trust and reputation model in peer-to-peer networks. In: Proc. of the 3rd Int'l Conf. on Peer-to-Peer Computing. IEEE Press, 2003, 150-157
[19] BitTorrent. http://www.bittorrent.com, December 2004
[20] Chawathe Y, Ratnasamy S, Breslau L, et al. Making gnutella-like P2P systems scalable. In: Crowcroft J, Wetherall D, eds. Proc. of the Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York: ACM Press, 2003, 407-418
[21] Ganesan P, Sun Q, Garcia-Molina H. YAPPERS: A peer-to-peer lookup service over arbitrary topology. Proceedings of IEEE INFOCOM, IEEE Press, USA , 2003, 1250-1260
[22] Lv Q, Ratnasamy S, Shenker S. Can heterogeneity make Gnutella scalable. In: Proc. of the 1st Int'l Workshop on Peer-to-Peer Systems (IPTPS). London: Springer-Verlag, 2002, 94-103
[23] Clarke I, Sandberg O, Wiley B, et al. Freenet: A distributed anonymous information storage and retrieval system. In: Federrath H, ed. Proc. of the Workshop on Design Issues in Anonymity and Unobservability. Berlin: Springer-Verlag, 2001, 46?66
[24] FastTrack,http://www.fasttrack.com, December 2004
[25] Klingberg T, Manfredi R. Gnutella Protocol Development. http://rfc-gnutella.sourceforge.net/src/rfc-0_6-draft.html, June 2002
[26] Kalogeraki V, Gunopulos D, Zeinalipour-Yazti D. A local search mechanism for peer-to-peer networks. In: Proc. of the 11th Int’l Conf. on Information and Knowledge Management. New York: ACM Press, 2002, 300?307
[27] Gkantsidis C, Mihail M, Saberi A. Random walks in peer-to-peer networks. In: Proc. of the IEEE INFOCOM 2004. New York: IEEE Press, 2004, 120-130
[28] LüQ, Cao P, Cohen E, et al. Search and replication in unstructured peer-to-peer networks. In: Proc. of the Int’l Conf. on Measurements and Modeling of Computer Systems. New York: ACM Press, 2002, 84?95
[29] Yamamoto H, Maruta D,Oie Y. Replication methods for load balancing on distributed storages in P2P networks. In: Proc. of the 2005 Symposium onApplications and the Internet (SAINT’05). Washington: IEEE Computer Society, 2005, 264 - 271
[30] Cohen E, Shenker S. Replication strategies in unstructured peer-to-peer networks. ACM SIGCOMM Computer Communication Review. New York: ACM Press,2002,32(4): 177 - 190
[31] Lei Guo, Song Jiang, Li Xiao, et al. Exploiting content localities for efficient search in P2P systems. In: Proc. of the 18th International Symposium on Distributed Computing, Amsterdam, Netherlands, October, 2004, 729-742
[32] Sripanidkulchai K, Maggs B, Zhang H. Efficient content location using interest-based locality in peer-to-peer systems. In: Anja F, Martina Z, Jon C, David W, eds. Proc. of the ACM SIGCOMM 2003. ACM Press, 2003, 175-186
[33] Cohen E, Fiat A, Kaplan H. A case for associative peer to peer overlays. SIGCOMM Comput. Commun. Rev., 2003, 33(1):95-100
[34] Yang Jian, Zhong Yiping, Zhang Shiyong. An efficient interest-group based search mechanism in unstructured peer-to-peer networks. In: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing. Washington: IEEE Computer Society, 2003, 247-257
[35] Xiaole Bai, Shuping Liu, Peng Zhang, et al. ICN: Interest-based clustering network, In: Proc. of the Fourth International Conference on Peer-to-Peer Computing(P2P), IEEE Press, 2004, 219- 226
[36] Wang W, Jin C, Jamin S. Network overlay construction under limited end-to-end reachability. In: Proc. of IEEE INFOCOM 2005, Miami, FL, Mar. 2005, 2124-2134
[37] Yang B, Garcia-Molina H. Designing a super-peer network. In: Proc. of the international Conference on Data Engineering (ICDE 2003), IEEE Press, 2003, 49-60
[38] Liu Y, Liu X, Xiao L, et al. Location awareness in unstructured P2P systems. IEEE Trans. on Parallel and Distributed Systems, 2005,16(2):163-174
[39] Xiao Li, Liu Yunhao, Lionel M Ni. Improving unstructured peer-to-peer systems by adaptive connection establishment. IEEE Trans. on Computers, 2005,54(9):1091-1103
[40] Padmanabhan V, Subramanian L. An investigation of geographic mapping techniques for Internet hosts. In Proc. ACM SIGCOMM, San Diego, Aug 2001. 173-185
[41] Ratnasamy S, Handley M, Karp R, et al. Application-level multicast using content-addressable networks. Lecture Notes in Computer Science. London: Springer-Verlag, 2001, 14 - 29
[42] Zhuang SQ, Zhao BY, Joseph AD, et al. Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination. In: Proc. of the 11th NOSSDAV. New York: ACM Press, 2001, 11-20
[43] Castro M, Druschel P, Kermarrec AM, et al. SCRIBE: A large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications. 2002, 20(8):1489-1499
[44] El-Ansary S, Alima LO, Brand P, et al. Efficient broadcast in structured P2P networks. Lecture Notes in Computer Science. Heidelberg: Spinger-Verlag, oct 2003, 304-314
[45] Castro M, Jones MB, Kermarrec AM, et al. An evaluation of scalable application-level multicast built using peer-to-peer overlay networks. In: Proc. of the IEEE INFOCOM. San Francisco: IEEE Society, 2003, 1510-1520
[46] Tan G, Jarvis SA. Stochastic analysis and improvement of the reliability of DHT-based multicast , In: Proc. of IEEE INFOCOM 2007. Anchorage, Alaska, USA, 2007, 2198-2206
[47] Cox R, Muthitacharoen A, Morris R. Serving DNS using a peer-to-peer lookup service. In: Proc. of the Int'l Workshop on Peer-To-Peer Systems 2002 (IPTPS 2002). London: Springer-Verlag, 2002, 155-165
[48] MARVIN T, MICHAEL J. Overlook: scalable name service on an overlay network[A]. Proceedings of the 22nd International Conference on Distributed Computing Systems[C].Vienna, Austria, IEEE Society, 2002, 52-61
[49] Bittorrent. http://www.bittorrent.com, 2006
[50] BitComet. http://www.bitcomet.com, 2006
[51] BitSpirit. http://www.bitspirit.com.cn, 2006
[52] eDonkey. http://www.edonkey2000.com, 2006
[53] eMule. http:// www.emule.org.cn, 2006
[54] Yang M, Zhao B, Dai Y, et al. Deployment of a large scale peer-to-peer social network. http://www.usenix.org/events/worlds04/tech/full_papers/yang/yang. pdf. 2004
[55] SETI@Home. http://setiathome.ssl.berkeley.edu, 2007
[56] Groove. http://www.groove.net, 2001
[57] Cheng S. Optional and responsive fine-grain locking in internet-basedcollaborative systems. IEEE Transactions on Parallel and Distributed Systems, 2002,13(9): 994-1008
[58] Kubiatowicz J, Wells C, Zhao B, et al. OceanStore: An architecture for global-scale persistent storage. In: Proc. of the 9th Int’l Conf. on Architectural Support for Programming Languages and Operating Systems. New York: ACM Press, 2000, 190?201
[59] Dabek F, Kaashoek M, Karger D, et al. Wide-Area cooperative storage with CFS. In: Proc. of the 18th ACM Symp. on Operating Systems Principles. New York: ACM Press, 2001, 202?215
[60] Rowstron A, Druschel P. Storage management and caching in PAST: A large-scale persistent peer-to-peer storage utility. In: Chateau Lake Louise, ed. ACM SOSP 2001. Banff: ACM Press, 2001, 188~201
[61] Adya A, Wattenhofer R, Bolosky W, et al. Farsite: Federated, available, and reliable storage for an incompletely trusted environment. In: Proc. of the 5th Symp. on Operating Systems Design and Implementation. New York: ACM Press, 2002, 1?12
[62] Bhagwan R, Tati K, Cheng Y, et al. Total recall: System support for automated availability management. In: Proc. of the 1st ACM/Usenix Symp. on Networked Systems Design and Implementation. Berkeley: USENIX Association, 2004, 25-25
[63] Stribling J. OverCite: A cooperative digital research library. http://citeseer.ist.psu.edu/stribling05overcite.html, 2005
[64] Zhang Z, Lian Q, Lin S, et al. BitVault: A highly reliable distributed data retention platform. Technical Report, MSR-TR-2005-179, Microsoft Research, 2005
[65] Castro M, Druschel P, Kermarrec AM, et al. SplitStream: High-bandwidth multicast in cooperative environments. In: Proc. of the 19th ACM SOSP. Bolton Landing: ACM Press, 2003, 298-313
[66] Zhang X, Liu JC, Li B, et al. Coolstreaming/donet: A data-driven overlay network for efficient live media streaming. In: Proc. of the IEEE INFOCOM. 2005, IEEE Press, 2005, 2102-2111
[67] Liao X, Jin H, Liu Y, et al. Anysee: Peer-to-Peer live streaming. In: Proc. of the INFOCOM. IEEE Press, 2006, 1-10
[68] Luo JG, Zhang M, Zhao L, et al. A large-scale live video streaming system based on P2P networks. Journal of Software, 2006,18(2):391?399
[69] PPLive. http://www.pplive.com, June 2006
[70] PPStream. http://www.ppstream.cn, July 2007
[71] Baset S A, Schulzrinne h G. An analysis of the skype peer-to-peer internet telephony Protocol. In: Proc. of 25th IEEE International Conference on Computer Communications, IEEE Press, Apr 2006, 1-11
[72] Jin H, YAO H, LIAO X, et al. PKTown: A peer-to-peer middleware to support multiplayer online games. In: Proc. of International Conference on Multimedia and Ubiquitous Engineering. IEEE Press, Apr 2007, 54-59
[73] Knutsson B, Lu H, Xu W, et al. Peer-to-Peer support for massively multiplayer games. In: IEEE Infocom 2004. IEEE Press, 2004, 96-107
[74] Xu J, Kumar A, Yu X. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. IEEE Journal on Selected Areas in Communications, 2004, 22(1): 151-163
[75] Gupta A, Liskov B, Rodrigues R. Efficient routing for peer-to-peer overlays. In: Proc. of the 1st Symp. on Networked Systems Design and Implementation (NSDI 2004). Berkeley: Usenix Association, March 2004, 113-126
[76] Xu Z, Tang C, Zhang Z. Building topology-aware overlays using global soft-state. In: Panda DK, Duato J, Stunkel C, eds. Proc. of the 23rd Int'l Conf. on Distributed Computing Systems (ICDCS 2003). New York: IEEE Press, 2003, 500-508
[77] Garces-Erice L, Ross KW, Biersack EW, et al. Topology-centric lookup service. In: Proc. of the 5th International Workshop on Networked Group Communications (NGC'03), Springer, 2003, 58-69
[78]邱彤庆,陈贵海.一种令P2P覆盖网络拓扑相关的通用方法.软件学报, 2007,18(2):381?390
[79] Castro M, Hu Y, Rowstron A. Exploiting network proximity in distributed hash tables. In: Proc. of the Int’l Workshop on Future Directions in Distributed Computing (FuDiCo 2002). Berlin: Springer-Verlag, 2002, 52?55
[80] Ratnasamy S, Francis P, Handley M, et al. A scalable content-addressable network. In: Cruz R, Varghese G, eds. Proc. of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SigComm). New York: ACM Press, 2001, 161-172.
[81] Ng T S E, Zhang H. Towards global network positioning. In: Proc. of ACM SIGCOMM 2001. New York: ACM Press, 2001, 25-29
[82] Saroiu S, Gummadi PK, Gribble SD. A measurement study of peer-to-peer
[83] Saroiu S, Gummadi PK, Gribble SD. Measuring and analyzing the characteristics of napster and gnutella hosts. Multimedia Systems Journal, 2003,8(5):170-184
[84] Gummadi KP, Dunn RJ, Saroiu S, et al. Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. In: Proc. of the 19th ACM Symp. on Operating Systems Principles. New York: ACM Press, 2003, 314-329
[85] Bhagwan R, Savage S, Voelker GM. Understanding availability. In: Kaashoek F, Stoica I, eds. Proc. of the IPTPS 2003. LNCS 2735, Berlin Heidelberg: Springer-Verlag, 2003, 256-267
[86] Sen S, Wang J. Analyzing peer-to-peer traffic across large networks. IEEE/ACM Transactions on networking, 2004, 12(4):219-232
[87] Joo SD, Lee CW, Chung YH. Analysis and modeling of traffic from residential high speed Internet subscribers. In: Kahng HK, Goto S, eds. Proc. of the ICOIN 2004. LNCS 3090, Heidelberg: Springer-Verlag, 2004, 410-419
[88] Liang J, Kumar R, Xi Y, et al. Pollution in file sharing systems. In: Proc. of the IEEE Infocom 2005. Miami,USA: IEEE, 2005, 1174-1185
[89] Steiner M, En-Najjary T, Biersack EW. A Global View of Kad. In: Proc. of the 7th ACM Sigcomm conference on internet measurement. ACM press, 2007, 117 - 122
[90] Handurukande SB, Kermarrec AM, Le Fessant F, et al. Peer sharing behavior in the eDonkey network, and implications for the design of server-less file sharing systems. SIGOPS Oper. Syst. Rev., 2006,40(4): 359-371
[91] Breslau L, Cao P, Fan L, et al. Web caching and Zipf-like distributions: Evidence and implications. In: Choudhury AK, Shroff N, eds. Proc. of the IEEE INFOCOM'99. Los Alamitos: IEEE Press, 1999, 126-134
[92] Jung J, Sit E, Balakrishnan H, et al. DNS performance and the effectiveness of caching. IEEE/ACM Transactions on Networking. Piscataway: IEEE Press, 2002,10(5): 589 - 603
[93] Bianchi Silvia, Serbu Sabina, Felber Pascal, et al. Adaptive load balancing for DHT lookups. In: Proceedings of the 15th international Conference on Computer Communications and Networks. IEEE Press, 2006, 411-418
[94] Datta Anwitaman, Schmidt Roman, Aberer Karl. Query-load balancing instructured overlays. In: Seventh IEEE International Symposium on Cluster Computing and the Grid. IEEE Press, 2007, 453-460
[95] Gopalakrishnan V, Silaghi B, Bhattacharjee B, et al. Adaptive replication in peer-to-peer systems. In: IEEE Computer Society ed. Proc. of the 24th Int'l Conf. on Distributed Computing Systems (ICDCS 2004). Washington: IEEE Computer Society, 2004, 360-369
[96] Godfrey PB , Stoica I. Heterogeneity and load balance in distributed hash tables. In: Proc. of IEEE. INFOCOM. Miami, FL, 2005, 596-606
[97] Garces-Erice L, Biersack EW, Ross KW, et al. Hierarchical P2P systems. In: Proc. of ACM/IFIP,International Conference on Parallel and Distributed Computing. Klagenfurt, Austria, 2003, 643--657
[98]夏启志,谢高岗,闵应骅等.一种基于索引的结构化P2P网络模型.计算机学报,2006, 29(4): 602-610
[99] Castro M, Costa M, Rowstron A. Debunking some myths about structured and unstructured overlays. In: Proc. of the 2nd USENIX Symp. on Networked Systems Design and Implementation. Berkeley: USENIX, 2005, 85-98
[100] Zhang Zhan, Chen Shigang, Ling Yibei, et al. Capacity-aware multicast algorithms on heterogeneous overlay networks. IEEE Transactions on Parallel and Distributed Systems, 2006, 17(2): 135-147
[101]胡进锋,黎明,郑纬民等.带宽自适应的P2P网络路由协议.软件学报,2005,16(5):991-999
[102] Xu Zhichen, Mahalingam Mallik, Karlsson Magnus. Turning heterogeneity into an advantage in overlay routing. in INFOCOM'03. San Francisco,2003,1499-1509
[103] Stoica I, Morris R, Karger D, et al. Chord: A scalable peer-to-peer lookup service for internet applications. In: Cruz R, Varghese G, eds. Proc. of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SigComm). New York: ACM Press, 2001, 149-160
[104] Leong B, Liskov B, Demaine ED. EpiChord: parallelizing the chord lookup algorithm with reactive routing state management. In: Proceedings of the 12th IEEE International Conference on Networks. IEEE Computer Society, 2004, 270 - 276
[105] Zhao B, Kubiatowicz J, Joseph A. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report,No.UCB/CSD-01-1141, Berkeley: Computer Science Division, University of California, 2001
[106] Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui R, ed. Proc. of the IFIP/ACM Int'l Middleware Conf. London: Springer-Verlag, 2001, 329-350
[107] Castro M, Costa M, Rowstron A. Performance and dependability of structured peer-to-peer overlays. In: Dependable Systems and Networks. Washington: IEEE Computer Society, 2004, 9-18
[108] Maymounkov P, Mazieres D. Kademlia: A peer-to-peer information system based on the XOR metric. In: Proc. of the 1st Int'l Workshop on Peer-to-Peer Systems. 2002, 258-263
[109] Gupta A, Liskov B, Rodrigues R. One hop lookups for peer-to -peer overlays. In Proceedings of the 9th Workshop on Hot Topics in Operating Systems. Berkeley: Usenix Association, 2003, 7-12
[110] Manku G S, Bawa M, Raghavan P. Symphony: Distributed hashing in a small world. In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems. 2003, 127-140
[111] Li J, Stribling J, Morris R, et al. A performance vs. cost framework for evaluating DHT design tradeoffs under churn. In Proceedings of the 24th INFOCOM (Mar. 2005). IEEE Press,2005, 225- 236
[112] Aberer K. P-Grid: A self-organizing access structure for P2P information systems. Sixth International Conference on Cooperative Information Systems. London: Springer-verlag, 2001, 179-194
[113] Harvey N, Jones M, Saroiu S, et al. A scalable overlay networkwith practical locality properties. In: Proceedings of the Fourth USENIX Symposium on Internet Technologies and Systems. Berkeley: Usenix Association,2003,9-22
[114] Gupta I, Birman K, Linga P, et al. Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead. Lecture Notes in Computer Science. Berlin: Springer-verlag, 2003, 160-169
[115] Kaashoek FM, Karger DR. Koorde: A simple degree-optimal distributed hash table. In: Proc. of the IPTPS 2003. Berkeley: Springer-Verlag, 2003, 98-107
[116] Malkhi D, Naor M, Ratajczak D. Viceroy: A scalable and dynamic emulation of the butterfly. In: Proc. of the 21st annual ACM Symp. on Principles of Distributed Computing. New York: ACM Press, 2002, 183-192
[117] Shen HY, Xu CZ, Ghen G. Cycloid: A constant-degree and lookup-efficientP2P overlay network. In: Panda DK, Duato J, Stunkel C, eds. Proc. of the 18th Int’l Parallel and Distributed Processing Symp. (IPDPS 2004). New York: IEEE Press, 2004, 26?30
[118] Karger D, Lehman E, Leighton F, et al. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing ,El Paso, TX, May 1997, 654-663
[119] National Institute of Standard and Technology. Secure hash standard. NIST FIPS PUB 180-1, Washington: Department of Commerce, NIST, 1995
[120] Athicha Muthitacharoen, Robert Morris, Thomer M Gil, et al. Ivy: A read/write peer-to-peer file system. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation, Boston, Massachusetts, USA, December 2002, 31-44
[121] Plaxton CG, Rajaraman R, Richa AW. Accessing nearby copies of replicated objects in a distributed environment. Theory of Computing Systems, 1999,32(3):241-280
[122] Steven Hand, Timothy Roscoe. Mnemosyne: Peer-to-peer steganographic storage. Lecture Notes in Computer Science. Springer-verlag, 2002, 130-140
[123] Zhou Feng, Zhuang Li, Zhao BY, et al. Approximate object location and spam filtering on peer-to-peer systems. In Proc. of Middleware, Rio de Janeiro, Brazil, June 2003, 1-20
[124] Iyer S, Rowstron A, Druschel P. Squirrel: A decentralized, peer-to-peer Web cache. In: Proc. of the 21st Symp. on Principles of Distributed Computing (PDOC 2002). New York: ACM Press, 2002, 213-222
[125] Gummadi K, Gummadi R, Gribble S, et al. The impact of DHT routing geometry on resilience and proximity. In: Proc. of the ACM SIGCOMM. Karlsruhe, Germany, 2003, 381- 394
[126] Zegura E, Calvert K, Bhattacharjee S. How to model an internetwork. In: Mukherjee B, ed. Proc. of the IEEE INFOCOM 1996. San Francisco: IEEE Communication Society, 1996, 594-602
[127] Gnawali OD. A Keyword Set Search System for Peer-to-Peer Networks. [MS. Thesis] Massachusetts Institute of Technology, 2002
[128] Harren M, Hellerstein JM, Huebsch R, et al. Complex queries in DHT-based peer-to-peer networks. In: Proc. the 1st Int. Workshop on Peer-to-Peer Systems . Cambridge, 2002, 242-250
[129] Schmidt C, Parashar M. Flexible information discovery in decentralized distributed systems. In: Proceedings of the 1wth High Performance Distributed Computing. Seattle, WA, June 2003, 226-235
[130] Li J, Loo B, Hellerstein J, et al. On the feasibility of peer-to-peer web indexing and search. Lecture Note in Computer Science , Berlin: Springer-verlag, 2003, 207-215
[131] Peng Zhuo, Duan Zhenhua, Qi Jian-Jun, et al. HP2P: A hybrid hierarchical P2P network. In: Proceedings of the First International Conference on the Digital Society, IEEE Computer Society, 2007,18-22
[132] Zhu Yingwu, Wang Honghao, Hu Yiming. A super-peer based lookup in structured peer-to-peer systems. In PDCS'03, 2003, 465-470
[133] Mizrak AT, Cheng YC, Kumar V, et al. Structured superpeers: Leveraging heterogeneity to provide constant-time lookup. In: Proc. of the 2nd Int'l Workshop on Peer-to-Peer Systems, 2003,104-111
[134] Zhao BY, Duan Y, Huang L, et al. Brocade: Landmark routing on overlay networks. In: Druschel P, Kaashoek M, Rowstron A, eds. Proc. of the 1st Int'l Workshop on Peer-to-Peer Systems (IPTPS 2002). Berlin: Springer-Verlag, 2002, 564-570
[135] Byers J, Considine J, Mitzenmacher M. Simple load balancing for distributed Hash tables. In: Kaashoek MF, Stoica I eds.Lecture Notes in Computer Science. Berlin: Springer-Verlag, 2003, 80-87
[136] King V, Saia J. Choosing a random peer. In PODC 2004. New York: ACM Press, 2004, 125-130
[137] Raab M, Steger A. Balls into Bins - A simple and tight analysis. In RANDOM’98: Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science. London: Springer-verlag, 1998, 159-170
[138] Karger D, Ruhl M. Simple efficient load balancing algorithms for peer-to-peer systems. in Proceedings of 16th ACM Symposium on Parallelism in Algorithms and Architectures. New York: ACM Press, 2004, 36-43
[139] Rao A, Lakshminarayanan K, Surana S, et al. Load balancing in structured P2P systems. Lecture Notes in Computer Science, Berlin: Springer-verlag, 2003, 69-79
[140] Surana S, Godfrey B, Lakshminarayanan K, et al. Load balancing in dynamic structured P2P systems. Performance Evaluation, 2006, 63(3): 217-240
[141] Li ZN, Xie GG. A load balancing algorithm for DHT-based P2P systems. Journal of Computer Research and Development, 2006 , 43(9): 1579-1585
[142] Ledlie J, Seltzer M. Distributed, secure load balancing with skew, heterogeneity, and churn. In: Proceedings of IEEE Infocom, 2005,1419-1430
[143] Zhu Y, Hu Y. Efficient, proximity-aware load balancing for DHT based P2P systems. IEEE Transactions on Parallel and Distributed Systems, 2005,16(4): 349-361
[144] Xu Z, Bhuyan L. Effective load balancing in P2P systems. In: Proc. of the Sixth IEEE International Symposium on Cluster Computing and the Grid. Washington: IEEE Computer Society, 2006, 81-88
[145]朱承,刘忠等.结构化P2P网络中基于流言传播的负载均衡.通信学报, 2004, 25(4):31-40
[2] Hypertext transfer protocol. ftp://ftp.isi.edu/in-notes/rfc2616.txt, December 2006
[3] File transfer protocol. http://www.w3.org/Protocols/rfc959, July 2006
[4] Web services. http://www.w3.org/2002/ws, September 2006
[5] Oram A. Peer-to-Peer: Harnessing the benefits of a disruptive technology. California: O'Reilly and Associates, 2001, 9-10
[6] Napster. http://www.Napster.com, December 2004
[7] Gnutella. http://gnutella.wego.com, December 2004
[8] KaZaA. http://www.KaZaA.com, December 2004
[9] Haeberlen A, Mislove A, Post A, et al. Fallacies in evaluating decentralized systems. http://iptps06.cs.ucsb.edu/papers/Post-fallacies06.pdf, 2006
[10] Karl A, Manfred H. Peer to peer information systems. concepts and models, state of the art, and future systems. In: Proc. of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering. New York:ACM Press, 2002, 326-327
[11] Milojicic DS, Kalogeraki V, Lukose RM. Peer-to-peer computing. http://www.hpl.hp.com/ techreports/2002/HPL-2002-57R1.pdf, 2002
[12] Michael M. Discovering P2P. Alameda:Sybex international, 2001, 12-20
[13] Aberer K, Hauswirth M. An overview on peer-to-peer information systems. In: Litwin W, Lévy G, eds. Proc. in Informatics (14). Waterloo: Carleton Scientific, 2002, 171-188
[14] Schollmeier R. A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications. In: Proc. of the First International Conference on Peer-to-Peer Computing. Washington: IEEE Computer Society, 2002, 27-29
[15] Ramesh S, Brian DG. Peer to peer computing: The evolution of a Disruptive Technology. Hershey: Idea group publishing, 2004, 2-4
[16] Lua EK, Crowcroft J, Pias M, et al. A survey and comparison of peer-to-peeroverlay network schemes. Journal of IEEE Communications Survey and Tutorial, 2005,7(2):72-93
[17] Bailes JE, Templeton GF. Managing P2P security. communications of the ACM, 2004, 47(9):95-98
[18] Wang Y, Vassileva J. Trust and reputation model in peer-to-peer networks. In: Proc. of the 3rd Int'l Conf. on Peer-to-Peer Computing. IEEE Press, 2003, 150-157
[19] BitTorrent. http://www.bittorrent.com, December 2004
[20] Chawathe Y, Ratnasamy S, Breslau L, et al. Making gnutella-like P2P systems scalable. In: Crowcroft J, Wetherall D, eds. Proc. of the Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York: ACM Press, 2003, 407-418
[21] Ganesan P, Sun Q, Garcia-Molina H. YAPPERS: A peer-to-peer lookup service over arbitrary topology. Proceedings of IEEE INFOCOM, IEEE Press, USA , 2003, 1250-1260
[22] Lv Q, Ratnasamy S, Shenker S. Can heterogeneity make Gnutella scalable. In: Proc. of the 1st Int'l Workshop on Peer-to-Peer Systems (IPTPS). London: Springer-Verlag, 2002, 94-103
[23] Clarke I, Sandberg O, Wiley B, et al. Freenet: A distributed anonymous information storage and retrieval system. In: Federrath H, ed. Proc. of the Workshop on Design Issues in Anonymity and Unobservability. Berlin: Springer-Verlag, 2001, 46?66
[24] FastTrack,http://www.fasttrack.com, December 2004
[25] Klingberg T, Manfredi R. Gnutella Protocol Development. http://rfc-gnutella.sourceforge.net/src/rfc-0_6-draft.html, June 2002
[26] Kalogeraki V, Gunopulos D, Zeinalipour-Yazti D. A local search mechanism for peer-to-peer networks. In: Proc. of the 11th Int’l Conf. on Information and Knowledge Management. New York: ACM Press, 2002, 300?307
[27] Gkantsidis C, Mihail M, Saberi A. Random walks in peer-to-peer networks. In: Proc. of the IEEE INFOCOM 2004. New York: IEEE Press, 2004, 120-130
[28] LüQ, Cao P, Cohen E, et al. Search and replication in unstructured peer-to-peer networks. In: Proc. of the Int’l Conf. on Measurements and Modeling of Computer Systems. New York: ACM Press, 2002, 84?95
[29] Yamamoto H, Maruta D,Oie Y. Replication methods for load balancing on distributed storages in P2P networks. In: Proc. of the 2005 Symposium onApplications and the Internet (SAINT’05). Washington: IEEE Computer Society, 2005, 264 - 271
[30] Cohen E, Shenker S. Replication strategies in unstructured peer-to-peer networks. ACM SIGCOMM Computer Communication Review. New York: ACM Press,2002,32(4): 177 - 190
[31] Lei Guo, Song Jiang, Li Xiao, et al. Exploiting content localities for efficient search in P2P systems. In: Proc. of the 18th International Symposium on Distributed Computing, Amsterdam, Netherlands, October, 2004, 729-742
[32] Sripanidkulchai K, Maggs B, Zhang H. Efficient content location using interest-based locality in peer-to-peer systems. In: Anja F, Martina Z, Jon C, David W, eds. Proc. of the ACM SIGCOMM 2003. ACM Press, 2003, 175-186
[33] Cohen E, Fiat A, Kaplan H. A case for associative peer to peer overlays. SIGCOMM Comput. Commun. Rev., 2003, 33(1):95-100
[34] Yang Jian, Zhong Yiping, Zhang Shiyong. An efficient interest-group based search mechanism in unstructured peer-to-peer networks. In: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing. Washington: IEEE Computer Society, 2003, 247-257
[35] Xiaole Bai, Shuping Liu, Peng Zhang, et al. ICN: Interest-based clustering network, In: Proc. of the Fourth International Conference on Peer-to-Peer Computing(P2P), IEEE Press, 2004, 219- 226
[36] Wang W, Jin C, Jamin S. Network overlay construction under limited end-to-end reachability. In: Proc. of IEEE INFOCOM 2005, Miami, FL, Mar. 2005, 2124-2134
[37] Yang B, Garcia-Molina H. Designing a super-peer network. In: Proc. of the international Conference on Data Engineering (ICDE 2003), IEEE Press, 2003, 49-60
[38] Liu Y, Liu X, Xiao L, et al. Location awareness in unstructured P2P systems. IEEE Trans. on Parallel and Distributed Systems, 2005,16(2):163-174
[39] Xiao Li, Liu Yunhao, Lionel M Ni. Improving unstructured peer-to-peer systems by adaptive connection establishment. IEEE Trans. on Computers, 2005,54(9):1091-1103
[40] Padmanabhan V, Subramanian L. An investigation of geographic mapping techniques for Internet hosts. In Proc. ACM SIGCOMM, San Diego, Aug 2001. 173-185
[41] Ratnasamy S, Handley M, Karp R, et al. Application-level multicast using content-addressable networks. Lecture Notes in Computer Science. London: Springer-Verlag, 2001, 14 - 29
[42] Zhuang SQ, Zhao BY, Joseph AD, et al. Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination. In: Proc. of the 11th NOSSDAV. New York: ACM Press, 2001, 11-20
[43] Castro M, Druschel P, Kermarrec AM, et al. SCRIBE: A large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications. 2002, 20(8):1489-1499
[44] El-Ansary S, Alima LO, Brand P, et al. Efficient broadcast in structured P2P networks. Lecture Notes in Computer Science. Heidelberg: Spinger-Verlag, oct 2003, 304-314
[45] Castro M, Jones MB, Kermarrec AM, et al. An evaluation of scalable application-level multicast built using peer-to-peer overlay networks. In: Proc. of the IEEE INFOCOM. San Francisco: IEEE Society, 2003, 1510-1520
[46] Tan G, Jarvis SA. Stochastic analysis and improvement of the reliability of DHT-based multicast , In: Proc. of IEEE INFOCOM 2007. Anchorage, Alaska, USA, 2007, 2198-2206
[47] Cox R, Muthitacharoen A, Morris R. Serving DNS using a peer-to-peer lookup service. In: Proc. of the Int'l Workshop on Peer-To-Peer Systems 2002 (IPTPS 2002). London: Springer-Verlag, 2002, 155-165
[48] MARVIN T, MICHAEL J. Overlook: scalable name service on an overlay network[A]. Proceedings of the 22nd International Conference on Distributed Computing Systems[C].Vienna, Austria, IEEE Society, 2002, 52-61
[49] Bittorrent. http://www.bittorrent.com, 2006
[50] BitComet. http://www.bitcomet.com, 2006
[51] BitSpirit. http://www.bitspirit.com.cn, 2006
[52] eDonkey. http://www.edonkey2000.com, 2006
[53] eMule. http:// www.emule.org.cn, 2006
[54] Yang M, Zhao B, Dai Y, et al. Deployment of a large scale peer-to-peer social network. http://www.usenix.org/events/worlds04/tech/full_papers/yang/yang. pdf. 2004
[55] SETI@Home. http://setiathome.ssl.berkeley.edu, 2007
[56] Groove. http://www.groove.net, 2001
[57] Cheng S. Optional and responsive fine-grain locking in internet-basedcollaborative systems. IEEE Transactions on Parallel and Distributed Systems, 2002,13(9): 994-1008
[58] Kubiatowicz J, Wells C, Zhao B, et al. OceanStore: An architecture for global-scale persistent storage. In: Proc. of the 9th Int’l Conf. on Architectural Support for Programming Languages and Operating Systems. New York: ACM Press, 2000, 190?201
[59] Dabek F, Kaashoek M, Karger D, et al. Wide-Area cooperative storage with CFS. In: Proc. of the 18th ACM Symp. on Operating Systems Principles. New York: ACM Press, 2001, 202?215
[60] Rowstron A, Druschel P. Storage management and caching in PAST: A large-scale persistent peer-to-peer storage utility. In: Chateau Lake Louise, ed. ACM SOSP 2001. Banff: ACM Press, 2001, 188~201
[61] Adya A, Wattenhofer R, Bolosky W, et al. Farsite: Federated, available, and reliable storage for an incompletely trusted environment. In: Proc. of the 5th Symp. on Operating Systems Design and Implementation. New York: ACM Press, 2002, 1?12
[62] Bhagwan R, Tati K, Cheng Y, et al. Total recall: System support for automated availability management. In: Proc. of the 1st ACM/Usenix Symp. on Networked Systems Design and Implementation. Berkeley: USENIX Association, 2004, 25-25
[63] Stribling J. OverCite: A cooperative digital research library. http://citeseer.ist.psu.edu/stribling05overcite.html, 2005
[64] Zhang Z, Lian Q, Lin S, et al. BitVault: A highly reliable distributed data retention platform. Technical Report, MSR-TR-2005-179, Microsoft Research, 2005
[65] Castro M, Druschel P, Kermarrec AM, et al. SplitStream: High-bandwidth multicast in cooperative environments. In: Proc. of the 19th ACM SOSP. Bolton Landing: ACM Press, 2003, 298-313
[66] Zhang X, Liu JC, Li B, et al. Coolstreaming/donet: A data-driven overlay network for efficient live media streaming. In: Proc. of the IEEE INFOCOM. 2005, IEEE Press, 2005, 2102-2111
[67] Liao X, Jin H, Liu Y, et al. Anysee: Peer-to-Peer live streaming. In: Proc. of the INFOCOM. IEEE Press, 2006, 1-10
[68] Luo JG, Zhang M, Zhao L, et al. A large-scale live video streaming system based on P2P networks. Journal of Software, 2006,18(2):391?399
[69] PPLive. http://www.pplive.com, June 2006
[70] PPStream. http://www.ppstream.cn, July 2007
[71] Baset S A, Schulzrinne h G. An analysis of the skype peer-to-peer internet telephony Protocol. In: Proc. of 25th IEEE International Conference on Computer Communications, IEEE Press, Apr 2006, 1-11
[72] Jin H, YAO H, LIAO X, et al. PKTown: A peer-to-peer middleware to support multiplayer online games. In: Proc. of International Conference on Multimedia and Ubiquitous Engineering. IEEE Press, Apr 2007, 54-59
[73] Knutsson B, Lu H, Xu W, et al. Peer-to-Peer support for massively multiplayer games. In: IEEE Infocom 2004. IEEE Press, 2004, 96-107
[74] Xu J, Kumar A, Yu X. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. IEEE Journal on Selected Areas in Communications, 2004, 22(1): 151-163
[75] Gupta A, Liskov B, Rodrigues R. Efficient routing for peer-to-peer overlays. In: Proc. of the 1st Symp. on Networked Systems Design and Implementation (NSDI 2004). Berkeley: Usenix Association, March 2004, 113-126
[76] Xu Z, Tang C, Zhang Z. Building topology-aware overlays using global soft-state. In: Panda DK, Duato J, Stunkel C, eds. Proc. of the 23rd Int'l Conf. on Distributed Computing Systems (ICDCS 2003). New York: IEEE Press, 2003, 500-508
[77] Garces-Erice L, Ross KW, Biersack EW, et al. Topology-centric lookup service. In: Proc. of the 5th International Workshop on Networked Group Communications (NGC'03), Springer, 2003, 58-69
[78]邱彤庆,陈贵海.一种令P2P覆盖网络拓扑相关的通用方法.软件学报, 2007,18(2):381?390
[79] Castro M, Hu Y, Rowstron A. Exploiting network proximity in distributed hash tables. In: Proc. of the Int’l Workshop on Future Directions in Distributed Computing (FuDiCo 2002). Berlin: Springer-Verlag, 2002, 52?55
[80] Ratnasamy S, Francis P, Handley M, et al. A scalable content-addressable network. In: Cruz R, Varghese G, eds. Proc. of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SigComm). New York: ACM Press, 2001, 161-172.
[81] Ng T S E, Zhang H. Towards global network positioning. In: Proc. of ACM SIGCOMM 2001. New York: ACM Press, 2001, 25-29
[82] Saroiu S, Gummadi PK, Gribble SD. A measurement study of peer-to-peer
[83] Saroiu S, Gummadi PK, Gribble SD. Measuring and analyzing the characteristics of napster and gnutella hosts. Multimedia Systems Journal, 2003,8(5):170-184
[84] Gummadi KP, Dunn RJ, Saroiu S, et al. Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. In: Proc. of the 19th ACM Symp. on Operating Systems Principles. New York: ACM Press, 2003, 314-329
[85] Bhagwan R, Savage S, Voelker GM. Understanding availability. In: Kaashoek F, Stoica I, eds. Proc. of the IPTPS 2003. LNCS 2735, Berlin Heidelberg: Springer-Verlag, 2003, 256-267
[86] Sen S, Wang J. Analyzing peer-to-peer traffic across large networks. IEEE/ACM Transactions on networking, 2004, 12(4):219-232
[87] Joo SD, Lee CW, Chung YH. Analysis and modeling of traffic from residential high speed Internet subscribers. In: Kahng HK, Goto S, eds. Proc. of the ICOIN 2004. LNCS 3090, Heidelberg: Springer-Verlag, 2004, 410-419
[88] Liang J, Kumar R, Xi Y, et al. Pollution in file sharing systems. In: Proc. of the IEEE Infocom 2005. Miami,USA: IEEE, 2005, 1174-1185
[89] Steiner M, En-Najjary T, Biersack EW. A Global View of Kad. In: Proc. of the 7th ACM Sigcomm conference on internet measurement. ACM press, 2007, 117 - 122
[90] Handurukande SB, Kermarrec AM, Le Fessant F, et al. Peer sharing behavior in the eDonkey network, and implications for the design of server-less file sharing systems. SIGOPS Oper. Syst. Rev., 2006,40(4): 359-371
[91] Breslau L, Cao P, Fan L, et al. Web caching and Zipf-like distributions: Evidence and implications. In: Choudhury AK, Shroff N, eds. Proc. of the IEEE INFOCOM'99. Los Alamitos: IEEE Press, 1999, 126-134
[92] Jung J, Sit E, Balakrishnan H, et al. DNS performance and the effectiveness of caching. IEEE/ACM Transactions on Networking. Piscataway: IEEE Press, 2002,10(5): 589 - 603
[93] Bianchi Silvia, Serbu Sabina, Felber Pascal, et al. Adaptive load balancing for DHT lookups. In: Proceedings of the 15th international Conference on Computer Communications and Networks. IEEE Press, 2006, 411-418
[94] Datta Anwitaman, Schmidt Roman, Aberer Karl. Query-load balancing instructured overlays. In: Seventh IEEE International Symposium on Cluster Computing and the Grid. IEEE Press, 2007, 453-460
[95] Gopalakrishnan V, Silaghi B, Bhattacharjee B, et al. Adaptive replication in peer-to-peer systems. In: IEEE Computer Society ed. Proc. of the 24th Int'l Conf. on Distributed Computing Systems (ICDCS 2004). Washington: IEEE Computer Society, 2004, 360-369
[96] Godfrey PB , Stoica I. Heterogeneity and load balance in distributed hash tables. In: Proc. of IEEE. INFOCOM. Miami, FL, 2005, 596-606
[97] Garces-Erice L, Biersack EW, Ross KW, et al. Hierarchical P2P systems. In: Proc. of ACM/IFIP,International Conference on Parallel and Distributed Computing. Klagenfurt, Austria, 2003, 643--657
[98]夏启志,谢高岗,闵应骅等.一种基于索引的结构化P2P网络模型.计算机学报,2006, 29(4): 602-610
[99] Castro M, Costa M, Rowstron A. Debunking some myths about structured and unstructured overlays. In: Proc. of the 2nd USENIX Symp. on Networked Systems Design and Implementation. Berkeley: USENIX, 2005, 85-98
[100] Zhang Zhan, Chen Shigang, Ling Yibei, et al. Capacity-aware multicast algorithms on heterogeneous overlay networks. IEEE Transactions on Parallel and Distributed Systems, 2006, 17(2): 135-147
[101]胡进锋,黎明,郑纬民等.带宽自适应的P2P网络路由协议.软件学报,2005,16(5):991-999
[102] Xu Zhichen, Mahalingam Mallik, Karlsson Magnus. Turning heterogeneity into an advantage in overlay routing. in INFOCOM'03. San Francisco,2003,1499-1509
[103] Stoica I, Morris R, Karger D, et al. Chord: A scalable peer-to-peer lookup service for internet applications. In: Cruz R, Varghese G, eds. Proc. of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SigComm). New York: ACM Press, 2001, 149-160
[104] Leong B, Liskov B, Demaine ED. EpiChord: parallelizing the chord lookup algorithm with reactive routing state management. In: Proceedings of the 12th IEEE International Conference on Networks. IEEE Computer Society, 2004, 270 - 276
[105] Zhao B, Kubiatowicz J, Joseph A. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report,No.UCB/CSD-01-1141, Berkeley: Computer Science Division, University of California, 2001
[106] Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui R, ed. Proc. of the IFIP/ACM Int'l Middleware Conf. London: Springer-Verlag, 2001, 329-350
[107] Castro M, Costa M, Rowstron A. Performance and dependability of structured peer-to-peer overlays. In: Dependable Systems and Networks. Washington: IEEE Computer Society, 2004, 9-18
[108] Maymounkov P, Mazieres D. Kademlia: A peer-to-peer information system based on the XOR metric. In: Proc. of the 1st Int'l Workshop on Peer-to-Peer Systems. 2002, 258-263
[109] Gupta A, Liskov B, Rodrigues R. One hop lookups for peer-to -peer overlays. In Proceedings of the 9th Workshop on Hot Topics in Operating Systems. Berkeley: Usenix Association, 2003, 7-12
[110] Manku G S, Bawa M, Raghavan P. Symphony: Distributed hashing in a small world. In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems. 2003, 127-140
[111] Li J, Stribling J, Morris R, et al. A performance vs. cost framework for evaluating DHT design tradeoffs under churn. In Proceedings of the 24th INFOCOM (Mar. 2005). IEEE Press,2005, 225- 236
[112] Aberer K. P-Grid: A self-organizing access structure for P2P information systems. Sixth International Conference on Cooperative Information Systems. London: Springer-verlag, 2001, 179-194
[113] Harvey N, Jones M, Saroiu S, et al. A scalable overlay networkwith practical locality properties. In: Proceedings of the Fourth USENIX Symposium on Internet Technologies and Systems. Berkeley: Usenix Association,2003,9-22
[114] Gupta I, Birman K, Linga P, et al. Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead. Lecture Notes in Computer Science. Berlin: Springer-verlag, 2003, 160-169
[115] Kaashoek FM, Karger DR. Koorde: A simple degree-optimal distributed hash table. In: Proc. of the IPTPS 2003. Berkeley: Springer-Verlag, 2003, 98-107
[116] Malkhi D, Naor M, Ratajczak D. Viceroy: A scalable and dynamic emulation of the butterfly. In: Proc. of the 21st annual ACM Symp. on Principles of Distributed Computing. New York: ACM Press, 2002, 183-192
[117] Shen HY, Xu CZ, Ghen G. Cycloid: A constant-degree and lookup-efficientP2P overlay network. In: Panda DK, Duato J, Stunkel C, eds. Proc. of the 18th Int’l Parallel and Distributed Processing Symp. (IPDPS 2004). New York: IEEE Press, 2004, 26?30
[118] Karger D, Lehman E, Leighton F, et al. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing ,El Paso, TX, May 1997, 654-663
[119] National Institute of Standard and Technology. Secure hash standard. NIST FIPS PUB 180-1, Washington: Department of Commerce, NIST, 1995
[120] Athicha Muthitacharoen, Robert Morris, Thomer M Gil, et al. Ivy: A read/write peer-to-peer file system. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation, Boston, Massachusetts, USA, December 2002, 31-44
[121] Plaxton CG, Rajaraman R, Richa AW. Accessing nearby copies of replicated objects in a distributed environment. Theory of Computing Systems, 1999,32(3):241-280
[122] Steven Hand, Timothy Roscoe. Mnemosyne: Peer-to-peer steganographic storage. Lecture Notes in Computer Science. Springer-verlag, 2002, 130-140
[123] Zhou Feng, Zhuang Li, Zhao BY, et al. Approximate object location and spam filtering on peer-to-peer systems. In Proc. of Middleware, Rio de Janeiro, Brazil, June 2003, 1-20
[124] Iyer S, Rowstron A, Druschel P. Squirrel: A decentralized, peer-to-peer Web cache. In: Proc. of the 21st Symp. on Principles of Distributed Computing (PDOC 2002). New York: ACM Press, 2002, 213-222
[125] Gummadi K, Gummadi R, Gribble S, et al. The impact of DHT routing geometry on resilience and proximity. In: Proc. of the ACM SIGCOMM. Karlsruhe, Germany, 2003, 381- 394
[126] Zegura E, Calvert K, Bhattacharjee S. How to model an internetwork. In: Mukherjee B, ed. Proc. of the IEEE INFOCOM 1996. San Francisco: IEEE Communication Society, 1996, 594-602
[127] Gnawali OD. A Keyword Set Search System for Peer-to-Peer Networks. [MS. Thesis] Massachusetts Institute of Technology, 2002
[128] Harren M, Hellerstein JM, Huebsch R, et al. Complex queries in DHT-based peer-to-peer networks. In: Proc. the 1st Int. Workshop on Peer-to-Peer Systems . Cambridge, 2002, 242-250
[129] Schmidt C, Parashar M. Flexible information discovery in decentralized distributed systems. In: Proceedings of the 1wth High Performance Distributed Computing. Seattle, WA, June 2003, 226-235
[130] Li J, Loo B, Hellerstein J, et al. On the feasibility of peer-to-peer web indexing and search. Lecture Note in Computer Science , Berlin: Springer-verlag, 2003, 207-215
[131] Peng Zhuo, Duan Zhenhua, Qi Jian-Jun, et al. HP2P: A hybrid hierarchical P2P network. In: Proceedings of the First International Conference on the Digital Society, IEEE Computer Society, 2007,18-22
[132] Zhu Yingwu, Wang Honghao, Hu Yiming. A super-peer based lookup in structured peer-to-peer systems. In PDCS'03, 2003, 465-470
[133] Mizrak AT, Cheng YC, Kumar V, et al. Structured superpeers: Leveraging heterogeneity to provide constant-time lookup. In: Proc. of the 2nd Int'l Workshop on Peer-to-Peer Systems, 2003,104-111
[134] Zhao BY, Duan Y, Huang L, et al. Brocade: Landmark routing on overlay networks. In: Druschel P, Kaashoek M, Rowstron A, eds. Proc. of the 1st Int'l Workshop on Peer-to-Peer Systems (IPTPS 2002). Berlin: Springer-Verlag, 2002, 564-570
[135] Byers J, Considine J, Mitzenmacher M. Simple load balancing for distributed Hash tables. In: Kaashoek MF, Stoica I eds.Lecture Notes in Computer Science. Berlin: Springer-Verlag, 2003, 80-87
[136] King V, Saia J. Choosing a random peer. In PODC 2004. New York: ACM Press, 2004, 125-130
[137] Raab M, Steger A. Balls into Bins - A simple and tight analysis. In RANDOM’98: Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science. London: Springer-verlag, 1998, 159-170
[138] Karger D, Ruhl M. Simple efficient load balancing algorithms for peer-to-peer systems. in Proceedings of 16th ACM Symposium on Parallelism in Algorithms and Architectures. New York: ACM Press, 2004, 36-43
[139] Rao A, Lakshminarayanan K, Surana S, et al. Load balancing in structured P2P systems. Lecture Notes in Computer Science, Berlin: Springer-verlag, 2003, 69-79
[140] Surana S, Godfrey B, Lakshminarayanan K, et al. Load balancing in dynamic structured P2P systems. Performance Evaluation, 2006, 63(3): 217-240
[141] Li ZN, Xie GG. A load balancing algorithm for DHT-based P2P systems. Journal of Computer Research and Development, 2006 , 43(9): 1579-1585
[142] Ledlie J, Seltzer M. Distributed, secure load balancing with skew, heterogeneity, and churn. In: Proceedings of IEEE Infocom, 2005,1419-1430
[143] Zhu Y, Hu Y. Efficient, proximity-aware load balancing for DHT based P2P systems. IEEE Transactions on Parallel and Distributed Systems, 2005,16(4): 349-361
[144] Xu Z, Bhuyan L. Effective load balancing in P2P systems. In: Proc. of the Sixth IEEE International Symposium on Cluster Computing and the Grid. Washington: IEEE Computer Society, 2006, 81-88
[145]朱承,刘忠等.结构化P2P网络中基于流言传播的负载均衡.通信学报, 2004, 25(4):31-40