基于DHT的分布式网络中负载均衡机制及其安全性的研究
|
摘要
随着互联网的快速发展、各种新型业务应用架构的出现和兴起、未来网络的发展演进,基于DHT的分布式网络以其分布式、自组织、资源共享等特性,在业务创新模式、业务应用架构、未来网络架构的构建中发挥了重要作用,但仍面临诸如负载均衡、安全等关键技术的挑战。
一方面,由于节点承载地址空间存在不均衡因子、节点处理能力的异构性、资源对象大小及查询分布的不均匀、系统的动态性等因素,导致基于DHT的分布式网络存在负载不均衡的问题。负载不均衡问题严重影响整个系统的服务质量,已经成为制约基于DHT的分布式网络发展的主要因素之一,如何实现高效低开销的负载均衡机制已成为亟待解决的问题。另一方面,由于DHT技术的分布式、自组织特性,使得它存在许多不可忽视的安全威胁。而具有负载均衡机制的DHT网络,在获得良好负载均衡效果的同时,不仅面临与普通DHT网络相同的安全威胁,而且带来了新的安全挑战。
为了有效解决上述问题和挑战,本论文在分析总结DHT系统负载不均衡及其安全问题根源的基础上,对DHT网络的负载均衡关键技术及其安全性进行深入研究,并取得若干具有创新性的成果,主要的工作和创新点包括以下几个方面：
第一：针对主要由节点承载地址空间存在不均衡因子、节点处理能力的异构性引起负载不均衡问题的场景,提出了一种基于虚拟服务器策略的混合式负载均衡(SDYA)算法,分为具有负载均衡的ID生成算法和快速动态调整负载算法。提出的具有负载均衡的ID生成算法,能够解决节点能力同构或异构环境中节点承载地址空间的不均衡问题和虚拟服务器数量过多造成路由开销过大的问题,可以较大程度地抵御系统的动荡。提出的快速动态调整负载算法主要解决由系统的动荡性、资源对象大小及查询分布的不均匀产生的负载不均衡问题。最后,通过实验仿真比较证明了SDYA算法在负载均衡效果、路由及路由维护开销、负载转移开销方面的优越性。
第二：针对主要由资源对象大小及查询分布的不均匀、系统动态性引起负载不均衡问题的场景,提出了一种动态调整负载机制,即基于蚁群优化的DHT负载均衡(Ant-based)算法,设计了候选轻载节点发现机制和目标节点选择机制,并由前向蚂蚁和后向蚂蚁合作实现。候选轻载节点发现机制提出了一种有效低开销的负载收集方式,目标节点选择机制则提出了一种简单有效的负载重分配方式。最后,通过仿真比较验证了Ant-based算法在负载均衡效果、负载收集开销和负载转移开销方面的性能,并分析了系统和算法参数对Ant-based算法性能的影响,仿真结果验证了算法的有效性和可扩展性。
第三：针对目前负载重分配机制只停留在与应用场景紧耦合的特例方法上的研究现状,提出了一种通用的负载重分配算法,即基于优先级迭代的多目标优化的负载重分配(PIMO)算法。该算法综合考虑了负载重分配的均衡效果、开销及负载重分配后负载资源的系统属性的变化,较大限度地提高了负载均衡程度、减小了负载转移开销、保证了转移负载资源的系统属性。仿真实验验证了PIMO算法的有效性。另外,PIMO算法还可以通过设置不同的负载偏差率的门限值、权重向量和相对熵的重要系数,满足系统对于不同负载均衡效果、开销和系统属性方面的需求。
第四：针对基于DHT的负载均衡机制的安全问题,研究和分析了基于DHT负载均衡机制的安全威胁。首先,总结并构建了DHT负载均衡机制的架构模型；然后,基于该架构模型,采用攻击树定性地分析和构建了基于DHT的负载均衡机制的安全威胁模型；再者,结合构建的DHT负载均衡机制的架构模型及其安全威胁模型,总结归纳了架构模型中影响安全性的关键实体和流程；最后,着重分析了引入负载均衡机制产生安全威胁的根本原因。
第五：通过研究抵御系统内部安全威胁的安全策略,提出了一种具有安全策略的负载均衡(SLBA)算法,包括考虑安全的具有负载均衡的虚拟ID生成(SLBA-ID)算法和考虑节点信誉度的动态调整负载(SLBA-DA)算法。算法在解决DHT系统的负载不均衡问题的同时,可以抵御来自节点ID生成流程和两类关键实体(收集负载和制定负载重分配策略的节点、重分配资源的新存储节点)的安全威胁。
论文最后对全文进行了总结,并对进一步的研究方向提出了一些想法和思路。
With the rapid development of Internet, the emergence and rise of various new business application architectures, and the evolution of future network, DHT-based distributed network is developing dramatically as the features of distributed, self-organization, and resource sharing. It has played an important role in the construction of business model innovation, business applications architecture and the future network architecture. However, it has encountered key technical challenges such as load balancing technology and security technology.
On the one hand, due to the imbalance address space and objects of node carrying, the heterogeneity of node capacity, the uneven object size and query distribution, the dynamic of system, the DHT network load becomed not balanced. The problem of load imbalance affects the service quality of DHT system seriously, and has constrained the development of DHT-based distributed network. Thus, the realization of a low consumption and high efficiency load balancing mechanism is an urgent problem to be solved. On the other hand, due to the characteristic of distributed and self-organizing of DHT systems, there are security threats that can not be ignored. With load balancing mechanism, DHT networks can raise the availability of system. However, many threats are also introduced by the load balancing in DHT.
In order to address above problems and challenges effectively, based on analyzing and summing up the root causes of the load imbalance and security issues, the DHT load balancing algorithms and their security are investigated. The main contributions of this dissertation include the following aspects:
Firstly, considering a DHT network environment in which the load is imbalance caused by the imbalance address space and objects of node carrying and the heterogeneity of node capacity, based on the virtual server strategy, a hybrid load balancing (SDYA) algorithm is proposed. It is divided into load balancing ID generation algorithm and dynamic load adjustment algorithm. The proposed load balancing ID generation algorithm can solve the problem caused by the imbalance address space of node carrying in the homogeneous and heterogeneous environments and the problem of higher routing maintenance and routing overhead which caused by an excessive number of virtual servers, and it can resist the dynamic of the system. The proposed dynamic load adjustment algorithm can mainly solve the load imbalance caused by the uneven object size and query distribution, and the system dynamic. Finally, the effectiveness of SDYA algorithm is verified by simulation and experiment, and the experiment indicated that it improved in terms of the load balancing effect, the routing overhead and load transfer overhead.
Secondly, considering a DHT network environment in which the load is imbalance caused by the uneven object size and query distribution and the system dynamic, a dynamic adjustment load mechanism, Ant-based DHT load balancing algorithm, is proposed. It designs a candidate light-load nodes discovery mechanism and a target nodes selection mechanism. Two types of agents, Forward Ant and Backward Ant, were adopted to realize them. The candidate light-load nodes discovery mechanism provides a way for effective and low-cost load collection. The target nodes selection mechanism provides a way for simple and effective load redistribution. The experimental results showed that Ant-based algorithm has better performance in terms of load balancing effect, load collection overhead and load transfer overhead. In addition, this paper in-depth analysis how system and algorithm parameters affect the performance of proposed algorithm. Simulation results demonstrate Ant-based algorithm is effective and scalability.
Thirdly, considering the investigated phenomenon of the load redistribution mechanism which just stay on the special case and tightly coupled with scenarios, a general load redistribution algorithm, priority-based iterative multi-objective load re-distribution (PIMO) algorithm, is proposed. It takes into consideration load balancing effect, load balancing overhead and the change of system attributes for resources after load redistribution. PIMO algorithm can maximize load balancing effect, and reduce load balancing overhead, and ensure the system attributes of the transfer resources. The simulation experiments verified the effectiveness of algorithm. In addition, PIMO algorithm can meet the different requirements of load balancing effect, cost, and system attributes through setting different threshold of load deviation rate, the weight vector and the coefficient of relative entropy.
Fourthly, considering the security issues of DHT-based load balancing mechanisms, the security threats are studied and analyzed. This dissertation builds the framework model for DHT load balancing mechanisms. Based on the model, we analyze the root causes of the threats introduced by load balancing mechanisms emphatically, and propose the attack tree model of these threats. Combined with the framework model and its threat model, the key entities and flows affecting the security were summarized and classified.
Fifthly, to resolve the major security issues, a security load balancing (SLBA) algorithm for DHT system is proposed. It includes two parts: SLBA-ID algorithm and SLBA-DA algorithm. While addressing the load imbalance problem in DHT systems, SLBA algorithm can fend off security threats that arrive by way of the key flow, node ID generation, and the key entities, the nodes who generate the load reassignment strategy and the nodes who are responsible for transfer resource.
Summary is given in the end, where the future research directions related to this doctoral dissertation are also putted forward.
一方面,由于节点承载地址空间存在不均衡因子、节点处理能力的异构性、资源对象大小及查询分布的不均匀、系统的动态性等因素,导致基于DHT的分布式网络存在负载不均衡的问题。负载不均衡问题严重影响整个系统的服务质量,已经成为制约基于DHT的分布式网络发展的主要因素之一,如何实现高效低开销的负载均衡机制已成为亟待解决的问题。另一方面,由于DHT技术的分布式、自组织特性,使得它存在许多不可忽视的安全威胁。而具有负载均衡机制的DHT网络,在获得良好负载均衡效果的同时,不仅面临与普通DHT网络相同的安全威胁,而且带来了新的安全挑战。
为了有效解决上述问题和挑战,本论文在分析总结DHT系统负载不均衡及其安全问题根源的基础上,对DHT网络的负载均衡关键技术及其安全性进行深入研究,并取得若干具有创新性的成果,主要的工作和创新点包括以下几个方面：
第一：针对主要由节点承载地址空间存在不均衡因子、节点处理能力的异构性引起负载不均衡问题的场景,提出了一种基于虚拟服务器策略的混合式负载均衡(SDYA)算法,分为具有负载均衡的ID生成算法和快速动态调整负载算法。提出的具有负载均衡的ID生成算法,能够解决节点能力同构或异构环境中节点承载地址空间的不均衡问题和虚拟服务器数量过多造成路由开销过大的问题,可以较大程度地抵御系统的动荡。提出的快速动态调整负载算法主要解决由系统的动荡性、资源对象大小及查询分布的不均匀产生的负载不均衡问题。最后,通过实验仿真比较证明了SDYA算法在负载均衡效果、路由及路由维护开销、负载转移开销方面的优越性。
第二：针对主要由资源对象大小及查询分布的不均匀、系统动态性引起负载不均衡问题的场景,提出了一种动态调整负载机制,即基于蚁群优化的DHT负载均衡(Ant-based)算法,设计了候选轻载节点发现机制和目标节点选择机制,并由前向蚂蚁和后向蚂蚁合作实现。候选轻载节点发现机制提出了一种有效低开销的负载收集方式,目标节点选择机制则提出了一种简单有效的负载重分配方式。最后,通过仿真比较验证了Ant-based算法在负载均衡效果、负载收集开销和负载转移开销方面的性能,并分析了系统和算法参数对Ant-based算法性能的影响,仿真结果验证了算法的有效性和可扩展性。
第三：针对目前负载重分配机制只停留在与应用场景紧耦合的特例方法上的研究现状,提出了一种通用的负载重分配算法,即基于优先级迭代的多目标优化的负载重分配(PIMO)算法。该算法综合考虑了负载重分配的均衡效果、开销及负载重分配后负载资源的系统属性的变化,较大限度地提高了负载均衡程度、减小了负载转移开销、保证了转移负载资源的系统属性。仿真实验验证了PIMO算法的有效性。另外,PIMO算法还可以通过设置不同的负载偏差率的门限值、权重向量和相对熵的重要系数,满足系统对于不同负载均衡效果、开销和系统属性方面的需求。
第四：针对基于DHT的负载均衡机制的安全问题,研究和分析了基于DHT负载均衡机制的安全威胁。首先,总结并构建了DHT负载均衡机制的架构模型；然后,基于该架构模型,采用攻击树定性地分析和构建了基于DHT的负载均衡机制的安全威胁模型；再者,结合构建的DHT负载均衡机制的架构模型及其安全威胁模型,总结归纳了架构模型中影响安全性的关键实体和流程；最后,着重分析了引入负载均衡机制产生安全威胁的根本原因。
第五：通过研究抵御系统内部安全威胁的安全策略,提出了一种具有安全策略的负载均衡(SLBA)算法,包括考虑安全的具有负载均衡的虚拟ID生成(SLBA-ID)算法和考虑节点信誉度的动态调整负载(SLBA-DA)算法。算法在解决DHT系统的负载不均衡问题的同时,可以抵御来自节点ID生成流程和两类关键实体(收集负载和制定负载重分配策略的节点、重分配资源的新存储节点)的安全威胁。
论文最后对全文进行了总结,并对进一步的研究方向提出了一些想法和思路。
With the rapid development of Internet, the emergence and rise of various new business application architectures, and the evolution of future network, DHT-based distributed network is developing dramatically as the features of distributed, self-organization, and resource sharing. It has played an important role in the construction of business model innovation, business applications architecture and the future network architecture. However, it has encountered key technical challenges such as load balancing technology and security technology.
On the one hand, due to the imbalance address space and objects of node carrying, the heterogeneity of node capacity, the uneven object size and query distribution, the dynamic of system, the DHT network load becomed not balanced. The problem of load imbalance affects the service quality of DHT system seriously, and has constrained the development of DHT-based distributed network. Thus, the realization of a low consumption and high efficiency load balancing mechanism is an urgent problem to be solved. On the other hand, due to the characteristic of distributed and self-organizing of DHT systems, there are security threats that can not be ignored. With load balancing mechanism, DHT networks can raise the availability of system. However, many threats are also introduced by the load balancing in DHT.
In order to address above problems and challenges effectively, based on analyzing and summing up the root causes of the load imbalance and security issues, the DHT load balancing algorithms and their security are investigated. The main contributions of this dissertation include the following aspects:
Firstly, considering a DHT network environment in which the load is imbalance caused by the imbalance address space and objects of node carrying and the heterogeneity of node capacity, based on the virtual server strategy, a hybrid load balancing (SDYA) algorithm is proposed. It is divided into load balancing ID generation algorithm and dynamic load adjustment algorithm. The proposed load balancing ID generation algorithm can solve the problem caused by the imbalance address space of node carrying in the homogeneous and heterogeneous environments and the problem of higher routing maintenance and routing overhead which caused by an excessive number of virtual servers, and it can resist the dynamic of the system. The proposed dynamic load adjustment algorithm can mainly solve the load imbalance caused by the uneven object size and query distribution, and the system dynamic. Finally, the effectiveness of SDYA algorithm is verified by simulation and experiment, and the experiment indicated that it improved in terms of the load balancing effect, the routing overhead and load transfer overhead.
Secondly, considering a DHT network environment in which the load is imbalance caused by the uneven object size and query distribution and the system dynamic, a dynamic adjustment load mechanism, Ant-based DHT load balancing algorithm, is proposed. It designs a candidate light-load nodes discovery mechanism and a target nodes selection mechanism. Two types of agents, Forward Ant and Backward Ant, were adopted to realize them. The candidate light-load nodes discovery mechanism provides a way for effective and low-cost load collection. The target nodes selection mechanism provides a way for simple and effective load redistribution. The experimental results showed that Ant-based algorithm has better performance in terms of load balancing effect, load collection overhead and load transfer overhead. In addition, this paper in-depth analysis how system and algorithm parameters affect the performance of proposed algorithm. Simulation results demonstrate Ant-based algorithm is effective and scalability.
Thirdly, considering the investigated phenomenon of the load redistribution mechanism which just stay on the special case and tightly coupled with scenarios, a general load redistribution algorithm, priority-based iterative multi-objective load re-distribution (PIMO) algorithm, is proposed. It takes into consideration load balancing effect, load balancing overhead and the change of system attributes for resources after load redistribution. PIMO algorithm can maximize load balancing effect, and reduce load balancing overhead, and ensure the system attributes of the transfer resources. The simulation experiments verified the effectiveness of algorithm. In addition, PIMO algorithm can meet the different requirements of load balancing effect, cost, and system attributes through setting different threshold of load deviation rate, the weight vector and the coefficient of relative entropy.
Fourthly, considering the security issues of DHT-based load balancing mechanisms, the security threats are studied and analyzed. This dissertation builds the framework model for DHT load balancing mechanisms. Based on the model, we analyze the root causes of the threats introduced by load balancing mechanisms emphatically, and propose the attack tree model of these threats. Combined with the framework model and its threat model, the key entities and flows affecting the security were summarized and classified.
Fifthly, to resolve the major security issues, a security load balancing (SLBA) algorithm for DHT system is proposed. It includes two parts: SLBA-ID algorithm and SLBA-DA algorithm. While addressing the load imbalance problem in DHT systems, SLBA algorithm can fend off security threats that arrive by way of the key flow, node ID generation, and the key entities, the nodes who generate the load reassignment strategy and the nodes who are responsible for transfer resource.
Summary is given in the end, where the future research directions related to this doctoral dissertation are also putted forward.
引文
[1]D. Milojicic, V. Kalogeraki, R. Lukose, et al, Peer-to-Peer Computing, HP Technical Report, HPL-2002-57,2002.
[2]Napster官方网站：http://www.napster.com/
[3]P. Maymounkov and D. Mazieres, "Kademlia:A peer-to-peer information system based on the xor metric," in the 1st Internation Workshop on Peer to Peer Systems (IPTPS),2002.
[4]A. Rowstron and P. Druschel, "Pastry:Scalable, distributed object location and routing for large-scale peer-to-peer systems". IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, pages 329-350, November,2001.
[5]Sean Rhea, Dennis Geels, Timothy Roscoe, and John Kubiatowicz, "Handling Churn in a DHT", in Proceedings of the USENIX Annual Technical Conference, June 20
[6]E. Sit, F. Dabek and J. Robertson, UsenetDHT:A low overhead Usenet server, in the 3rd IPTPS,2004.
[7]M. Castro, P. Druschel, A-M. Kermarrec and A. Rowstron, "SCRIBE:A large-scale and decentralised application-level multicast infrastructure", IEEE Journal on Selected Areas in Communications (JSAC) (Special issue on Network Support for Multicast Communications).2002.
[8]S. Iyer, A. Rowstron and P. Druschel, "SQUIRREL:A decentralized, peer-to-peer web cache", appeared in Principles of Distributed Computing (PODC 2002), Monterey, CA,2002.
[9]S. Rhea, B. Godfrey, B. Karp, J. Kubiatowicz, S. Ratnasamy, S. Shenker, I. Stoica, and H. Yu, "OpenDHT:A Public DHT Service and Its Uses," ACM SIGCOMM Computer Communication Review, pp.73-84,2005.
[10]S. Ratsanamy, P. Francis, M. Handley, and R. Karp. A Scalable Content-Addressable Network. In Proceedings of ACM Sigcomm, pages 161-172, San Diego, CA, USA.2001.
[11]Stoica I, Morris R, Karger D, Kaashoek F, Balakrishnan H. Chord:A scalable peer-to-peer lookup service for Internet applications.In.Cruz R, Varghese G, eds. Proc. of the 2001 Conf.on Applications, Technologies, Architectures, and Protocols for Computer Communications (SigComm).New York:ACM Press, 2001.149-160.
[12]Dabek F, Kaashoek M.F, Karger D, Morris R, Stoica I.Wide-Area Cooperative storage with CFS. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP),2001,35(5):202-215.
[13]Maymounkov P., Mazieres, D. Kademlia:A peer to peer information systems based on the XOR metric. In:Peer-to-Peer Systems. PP.53-65,2002.
[14]Li L, Zhang C, Wang Y, Ji Y.Reliable and Scalable DHT-Based SIP Server Farm.In:IEEE GLOBECOM.IEEE Global Telecommunications Conference.New Orleans:IEEE GLOBECOM,2008.1-6.
[15]Matuszewski M, Garcia-Martin M.A.A Distributed IP Multimedia Subsystem (IMS).In:WoWMoM.IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.Espoo, Finland:IEEE.2007.1-8.
[16]Pappas V, Massey D, Terzis A, Zhang L.A Comparative Study of the DNS Design with DHT-Based Alternatives.In:Proc.INFOCOM 2006.25th IEEE International Conference on Computer Communications.Barcelona, Spain:IEEE INFOCOM,2006.1-1.
[17]Freedman M.J, Freudenthal E, Mazieres D.Democratizing Content Publication with Coral.In:USENIX Association.The 1st USENIX Symposium on Networked Systems Design and Implementation.Berkeley:USENIX Association,2004.18-18.
[18]中国移动通信研究院,分布式业务网络(DSN)技术白皮书,http://labs.chinamobile.com/showarticle.php?id=10386&action=view&grade=4.5
[19]Maruoka, M. and Nemati, A.G. and Barolli, V. and Enokido, T. and Takizawa, M.Making Societies in Peer-to-Peer (P2P) Overlay Networks. In:Complex, Intelligent and Software Intensive Systems,2008. CISIS 2008. International Conference on. PP.41-47,2008.
[20]Saberi S., Trunfio P. Talia D., et al.Using Social Network and Semantic Overlay Network approaches to share knowledge in distributed data mining scenarios. In: High Performance Computing and Simulation (HPCS),2010 International Conference on. PP.536--544,2010.
[21]Ekler P., Devai I., Bakos B., Kiss AJ. BitTorrent Based Solution for Efficient Content Sharing on Next Generation Networks. In:Next Generation Internet Networks,2008. NGI 2008. PP.300-307,2008.
[22]张智,李瑞轩,杨俊,WebPeer:一个基于P2P的Web服务平台,计算机应用研究,2006年第5期
[23]方启明,杨广文,武永卫等.基于P2P的Web搜索技术.软件学报,2008,19(10)：2706-2719
[24]Seok-Won Seong, Jiwon Seo, Matthew Nasielski, et al.PrP1:A Decentralized Social Networking Infrastructure. In Proceedings of the 1st ACM Workshop on Mobile Cloud Computing& Services:Social Networks and Beyond
[25]IETF DECADE WG, https://datatracker.ietf.org/wg/decade/charter/
[26]IETF Peer to Peer Streaming Protocol (ppsp), https://datatracker.ietf.org/wg/ppsp/.
[27]3GPP, Study on IMS based Peer-to-Peer Content Distribution Services, http://www.3gpp.org/Highlights-from-SA-45-Seville.
[28]Comcast's ISP Experiences in a Proactive Network Provider Participation for P2P (P4P) Technical Trial. draft-livingood-woundy-p4p-experiences
[29]C. Jennings, S. Baset, H. Schulzrinne, et al. Resource location and discovery (reload) base protocol, IETF P2PSIP,2012.
[30]IETF Application-Layer Traffic Optimization (alto), https://datatracker.ietf.org/wg/alto/.
[31]V. Jacobson, D. K. Smetters, J. D. Thornton, et al. Networking named content. In CoNext'09,2009.
[32]Hanka, O., Spleiss, C., Kunzmann, G., et al. A novel DHT-based network architecture for the Next Generation Internet. In Proc. ICN (2009).
[33]Suman Srinivasan, Arezu Moghadam and Henning Schulzrinne, BonAHA: Service Discovery Framework for Mobile Ad-Hoc Applications, in CCNC,2009
[34]Bent Guldbjerg Christensen. LightPeers A Framework Supporting Nomadic Learning in Mixed Environments with Mobile Ad Hoc Networking. In Workshop on Middleware for Mobile Environments,2006
[35]Peer2ME, http://org.ntnu.no/mobcscw/
[36]A Constrained Application Protocol (CoAP) Usage for REsource LOcation And Discovery (RELOAD), draft-jimenez-p2psip-coap-reload-01.
[37]Karger D, Lehman E, Leighton T, Panigrahy R, Levine M, Lewin D. Consistent hashing and random trees:Distributed caching protocols for relieving hot spots on the World Wide Web.In:ACM.The 29th Annual ACM Symposium on Theory of Computing.Texas, USA:ACM,1997.654-663.
[38]Saroiu S, Gummadi P.K, Gribble S.D. A measurement study of peer-to-peer file sharing systems. In proceedings of Multimedia Computing and Networking(MMCN), vol.2002, pp.152, San Jose, CA, USA, January 2002
[39]Prasanna Ganesan, Mayank Bawa, Hector Garcia-Molina. Online balancing of range-partitioned data with applications to peer-to-peer systems. In VLDB'04: Proceedings of the Thirtieth International Conference on Very Large Data Bases, pages 444-455. VLDB Endowment,2004.
[40]Min Cai, Martin Frank, Jinbo Chen, and Pedro Szekely. MAAN:A multi-attribute addressable network for grid information services. In GRID'03: Proceedings of the Fourth International Workshop on Grid Computing, page 184, Washington, DC, USA,2003. IEEE Computer Society.
[41]J.Chu, K. Labonte, B. Levine. Availability and locality measurements of peer-to-peer file system. In Proceedings of the ITCom:Scalability and Traffic Control in IP Networks,2002.
[42]Stutzbach D, Rejaie R. Understanding churn in peer-to-peer networks. In Proceedings of the 6th ACM SIGCOMM conference on Internet measurement, ACM, pp.189-202,2006.
[43]S. Ratnasamy, I. Stoica, S. Shenker. Routing algorithms for DHTs:some open questions. In Proceedings of IPTPS,2002.
[44]J. Ledlie and M. Seltzer. Distributed, secure load balancing with skew, heterogeneity and churn. INFOCOM 2005. Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies,2:1419-1430 vol.2, March 2005.
[45]Z. Xu, L. Bhuyan. Effective load balancing in P2P systems. In:Cluster Computing and the Grid,2006. CCGRID 06. Sixth IEEE International Symposium on. Vol.1, pp.81-88,2006.
[46]Z. Li, C. Lu, Y. Zhang. Research of Load-Balancing in P2P Network Based on Matching Load Capacity with ID Address Space. In:Information Technology and Computer Science,2009. ITCS 2009. International Conference on. Vol.1, pp. 400-403,2009.
[47]K. Kenthapadi and G. S. Manku. Decentralized algorithms using both local and random probes for p2p load balancing. In SPAA. PP.135-144,2005.
[48]G. Manku. Balanced Binary Trees for ID Management and Load Balance in Distributed Hash Tables. In Proc. of ACM PODC. PP.197-205,2004.
[49]D. Warneke, C. Dannewitz. Statistics-based ID management for load balancing in structured P2P networks. In:Local Computer Networks,2009. LCN 2009. IEEE 34th Conference on. Pp.273-276,2009.
[50]D. Karger, M. Ruhl. New Algorithms for Load Balancing in Peer-to-Peer Systems. In Proceedings of the Fourth Internation Peer to Peer Symposium (IPTPS),2004.
[51]G. Park, M. Kwon. Distributed tries for load balancing in peer-to-peer systems. In: Quality of Service (IWQoS),2010 18th International Workshop on. Pp.1-9, 2010.
[52]X. Wang, Y. Peng, D. Li. A Load Balancing-Supported ID Management Method for Constant Degree DHTs. In:Computer Science and Information Technology (ICCSIT),2010 3rd IEEE International Conference on. Vol.7, pp.300-304,2010.
[53]B. Wang, Q. Shen. ID Management and Allocation Algorithm for P2P Load Balancing. In:Communication Technology (ICCT),2010 12th IEEE International Conference on, pp.1232-1235,2010.
[54]M. Naor and U. Wieder, "Novel Architectures for P2P Applications:The Continuous-Discrete Approach," in Proc. of ACM SPAA, June 2003, pp.50-59.
[55]P. Godfrey and I. Stoica. Heterogeneity and load balance in distributed hash tables. In:INFOCOM 2005.24th Annual Joint Conference of the IEEE Computer and Communications Societies. Vol.1, pp.596-606,2005.
[56]Karger D, Ruhl M. Simple efficient load balancing algorithms for peer-to-peer systems. In:Voelkerm GM, Shenker S, eds.LNCS.Berlin:Springer-Verlag, 2005.131-140.
[57]X. Wang, Y. Zhang, X. Li, and D. Loguinov. On zone balancing of peer-to-peer networks:Analysis of random node join. In Proc. of ACM SIGMETRICS,2004.
[58]I. Abraham, B.Awerbuch, Y. Azar, Y. Bartal, D. Malkhi,, and E. Pavlov, "A Generic Scheme for Building Overlay Networks in Adversarial Scenarios," in Proc. of ACM IPDPS, Apr 2003, p.40.2.
[59]G. Giakkopis and V. Hadzilacos, "A Scheme for Load Balancing in Heterogeneous Distributed Hash Tables," in Proc. of ACM PODC,2005, pp. 302-311.
[60]L. Devroye, G. Lugosi, G. Park, and W. Szpankowski, "Multiple Choice Tries and Distributed Hash Tables," in Proc. of ACM/SIAM SODA, January 2007, pp. 891-899.
[61]J. Byers, J. Considine, and M. Mitzenmacher, "Geometric generalizations of the power of two choices," in Proc. of ACM SPAA,2004, pp.54-63.
[62]Y. Xia, A. Dobra, and S.-C. Han, "Multiple-Choice Random Network for Server Load Balancing," in Proc. of IEEE INFOCOM,2007.
[63]Y. Xia, S. Chen, and S. Korgaonkar, "Load Balancing with Multiple Hash Functions in Peer-to-Peer Networks," in Proc. of International Conference on Parallel and Distributed Systems,2006, pp.411^420.
[64]draft-saumitra-p2psip-loadbalance-00. A Load Balancing Mechanism for REsource Location And Discovery,2009.03.03
[65]Karthik A R, Lakshminarayanan K, Surana S, Karp R, Stoica I. Load balancing in structured P2P systems. In:Kaashoek MF, Stoica I, eds.LNCS.Berlin:Springer-Verlag,2003.68-79.
[66]Godfrey B, Lakshminarayanan K, Surana S, Karp R, Stoica I. Load balancing in dynamic structured P2P systems. In:Kaashoek MF, Stoica I, eds.Proc.of the IEEE Infocom.2004.http://www.ieee-infocom.org/2004/Papers/46_4.pdf
[67]Zhu Y, Hu Y. Efficient, proximity-aware load balancing for DHT based P2P systems. IEEE Trans.on Parallel and Distributed Systems,2005,6(4):349-361.
[68]Shen, H. and Xu, C.Z., "Locality-Aware Randomized Load Balancing Algorithms for DHT Networks," IEEE Computer Society Washington, DC, USA, 2005.
[69]S.I. Mirrezaei, J. Shahparian, M. Ghodsi. A topology-aware load balancing algorithm for P2P systems. In Digital Information Management,2009. ICDIM 2009. Fourth International Conference on, PP.1-6,2009.
[70]Z. Li, G. Xie. A Distributed Load Balancing Algorithm for Structured P2P Systems. In:Computers and Communications,2006. ISCC'06. Proceedings.11th IEEE Symposium on. PP.417-422,2006.
[71]C.W. Chang, H.C. Hsiao. Stochastic Load Rebalancing in Distributed Hash Tables. In:Parallel and Distributed Systems (ICPADS),2011 IEEE 17th International Conference on. PP.841-846,2011.
[72]H.C. Hsiao, I.T. Lin, H. Liao. Load Balancing in Peer-to-Peer Networks Based on Sampling System States. In:Embedded and Ubiquitous Computing,2008. EUC'08. IEEE/IFIP International Conference on. Vol.1, pp.417-423,2008.
[73]M.W. Akhtar, M.T. Kechadi. On the Efficiency of Dynamic Load Balancing on P2P Irregular Network Topologies. ln:Parallel and Distributed Computing,2006. ISPDC'06. The Fifth International Symposium on. PP.271-280,2006.
[74]J. Sun, L. Li, H. Chen, H. Tan. A Proximity-Aware Load Balancing Algorithm in P2P Systems. In:Grid and Pervasive Computing Workshops,2008. GPC Workshops'08. The 3rd International Conference on. PP.364-369,2008.
[75]N. Kraber, M. Hogqvist, T. Schutt. The Benefits of Estimated Global Information in DHT Load Balancing.In:Cluster, Cloud and Grid Computing (CCGrid),2011 11th IEEE/ACM International Symposium on. PP.382-391,2011.
[76]Q.H. Vu, B.C. Ooi, M. Rinard, K.L. Tan. Histogram-based global load balancing in structured peer-to-peer systems. In:Knowledge and Data Engineering, IEEE Transactions on. Vol.21, No.4, pp.595-608,2009.
[77]Y. Lv, J. Song. A dynamic group-based load balancing approach in a DHT-P2P system. In:Pervasive Computing and Applications (ICPCA),2010 5th International Conference on. PP.213-217,2010.
[78]H. Shen, C.Z. Xu. Hash-based proximity clustering for load balancing in heterogeneous DHT networks. In:Parallel and Distributed Processing Symposium,2006. IPDPS 2006.20th International. PP.10-14,2006.
[79]D. Wu, Y. Tian, K.W. Ng. Achieving Resilient and Efficient Load Balancing in DHT-based P2P Systems.In:Local Computer Networks, Proceedings 2006 31st IEEE Conference on. PP.115-122,2006.
[80]Shen, H. and Xu, C.Z., "Locality-Aware Randomized Load Balancing Algorithms for DHT Networks," IEEE Computer Society Washington, DC, USA, 2005.
[81]Byers J, Considine J, Mitzenmacher M. Simple load balancing for distributed hash tables.In:Kaashoek MF, Stoica I, eds.LNCS.Berlin:Springer-Verlag, 2003.80-87.
[82]P. Triantafillou, C. Xiruhaki, M. Koubarakis, and N. Ntarmos. Towards High Performance Peer-to-Peer Content and Resource Sharing Systems,1st Conference on Innovative Data Systems Research (CIDR 2003), Asilomar, CA, USA,2003.
[83]Pitoura T, Ntaimos N, Triantafillou P. Replication, load balancing and efficient range query processing in DHTs. Proceedings of the EDBT. Munich, Germany, 2006.
[84]Gopalakrishnan V, Silaghi B, Bhattachariee B, Keleher P. Adaptive replication in Peer to Peer systems. Proceedings of the ICDCS. Washington,2004.
[85]V. Gopalakrishnan, B. Silaghi, B. Bhattacharjee, and P. Keleher, "Adaptive replication in peer-to-peer systems," in Proceedings of 24th ICDCS,2004, pp. 360-369.
[86]H. Yamamoto, D. Maruta, and Y Oie, "Replication methods for load balancing on distributed storages in p2p networks," in Proceedings of Symposium on Applications and the Internet,2005, pp.264-271.
[87]G. Swart, "Spreading the load using consistent hashing:A preliminary report," in Proceedings of Models and Tools for Parallel Computing on Heterogeneous Networks,2004, pp.169-176.
[88]M. Engle, J.I. Khan. Vulnerabilities of P2P Systems and a Critical Look at their Solutions. In:http://medianet.kent.edu/technicalreports.html. Internetworking and Media Communications Research Laboratories, Department of Computer Science, Kent State University,2006.11.01.
[89]L. Ganesh, B.Y Zhao. Identity theft protection in structured overlays. In:Secure Network Protocols,2005.(NPSec).1st IEEE ICNP Workshop on. IEEE, PP. 49-54,2005.
[90]A. Singh, T. Wan, S. Dan. Eclipse Attacks on Overlay Networks:Threats and Defenses. In:IEEE INFOCOM.2006.
[91]E. Sit, R. Morris. Security considerations for peer-to-peer distribution hash tables. Peer-to-Peer Systems. Springer, pp.261-269,2002.
[92]D. Stutzbach, R. Rejaie. Understanding Churn in Peer-to-Peer Networks. In: Proceedings of the 6th ACM SIGCOMM conference on Internet measurement. PP.189-202,2006.
[93]J. Douceur. The Sybil Attack. Peer-to-Peer Systems. Springer, pp.251-260,2002.
[94]D. Cerri, A. Ghiono. ID Mapping Attacks in P2P Networks. Global Telecommunications Conference,2005. GLOBECOM'05. IEEE, vol.3, pp.6-9, 2005.
[95]L. Wang. Attacks Against Peer-to-peer Networks and Countermeasures. In:TKK T-Ⅱ0. Vol.5290,2006.
[96]Ruichuan Chen, Eng keong Lua, J. Crowcroft. Securing Peer-to-Peer Content Sharing Service from Poisoning Attacks. Peer-to-Peer Computing,2008. P2P'08. Eighth International Conference on. PP.22-29,2008.
[97]Jian Liang, Naoum Naoumov, Keith W. The Index Poisoning Attack in P2P File Sharing Systems. IEEE INFOCOM, vol.6,2006.
[1]Karger D, Lehman E, Leighton T, Panigrahy R, Levine M, Lewin D. Consistent hashing and random trees:Distributed caching protocols for relieving hot spots on the World Wide Web.In:ACM.The 29th Annual ACM Symposium on Theory of Computing.Texas, USA:ACM,1997.654-663.
[2]H. Shen, C.-Z. Xu. Locality-aware and churn-resilient load balancing algorithms in structured Peer-to-Peer networks. IEEE Trans. on Parallel and Distributed Systems,18(6):849-862,2007.
[3]D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and P. R. Consistent hashing and random trees:Distributed caching protocols for relieving hot spots on the World Wide Web. In Proc. of STOC, pages 654-663,1997.
[4]George Giakkoupis and Vassos Hadzilacos. A scheme for load balancing in heterogenous distributed hash tables. In PODC'05:Proceedings of the Twenty-fourth Annual ACM Symposium on Principles of Distributed Computing, pages 302-311, New York, NY, USA,2005. ACM.
[5]X. Wang, D. loguinov. Load-balancing performance of consistent hashing: asymptotic analysis of random node join. In:IEEE/ACM Transactions on Networking. Vol.15, no.4, pp.892-905,2007.
[6]M. Naor and U. Wieder, "Novel Architectures for P2P Applications:The Continuous-Discrete Approach," in Proc. of ACM SPAA, June 2003, pp.50-59.
[7]Saroiu S, Gummadi P.K, Gribble S.D. A measurement study of peer-to-peer file sharing systems. In proceedings of Multimedia Computing and Networking(MMCN), vol.2002, pp.152, San Jose, CA, USA, January 2002
[8]Q. Lv, S. Ratnasamy, and S. Shenker. Can heterogeneity make gnutella scalable? In Proceedings of the first International Workshop on Peer-to-Peer Systems (IPTPS), Mar.2002.
[9]Stoica I, Morris R, Karger D, et al. Chord:A scalable peer-to-peer lookup service for Internet applications. In:ACM SIGCOMM Computer Communication Review. Vol.31, no.4, pp.149-160,2001.
[10]S. Ratsanamy, P. Francis, M. Handley, et al. "A Scalable Content-Addressable Network". In Proceedings of ACM Sigcomm. PP.161-172, San Diego, CA, USA. 2001.
[11]Dabek F, Kaashoek M.F, Karger D, et al. Wide-Area Cooperative storage with CFS. In:Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP). Vol.35, no.5, pp.202-215,2001.
[12]P. Godfrey and I. Stoica. Heterogeneity and load balance in distributed hash tables. In:INFOCOM 2005.24th Annual Joint Conference of the IEEE Computer and Communications Societies. Vol.1, pp.596-606,2005.
[13]draft-saumitra-p2psip-loadbalance-00. A Load Balancing Mechanism for REsource LOcation And Discovery,2009.03.03
[14]Z. Xu, L. Bhuyan. Effective load balancing in P2P systems. In:Cluster Computing and the Grid,2006. CCGRID 06. Sixth IEEE International Symposium on. Vol.1, pp.81-88,2006.
[15]Z. Li, C. Lu, Y. Zhang. Research of Load-Balancing in P2P Network Based on Matching Load Capacity with ID Address Space. In:Information Technology and Computer Science,2009. ITCS 2009. International Conference on. Vol.1, pp. 400-403,2009.
[16]K. Kenthapadi and G. S. Manku. Decentralized algorithms using both local and random probes for p2p load balancing. In SPAA. PP.135-144,2005.
[17]G. Manku. Balanced Binary Trees for ID Management and Load Balance in Distributed Hash Tables. In Proc. of ACM PODC. PP.197-205,2004.
[18]D. Warneke, C. Dannewitz. Statistics-based ID management for load balancing in structured P2P networks. In:Local Computer Networks,2009. LCN 2009. IEEE 34th Conference on. Pp.273-276,2009.
[19]D. Karger, M. Ruhl. New Algorithms for Load Balancing in Peer-to-Peer Systems. In Proceedings of the Fourth Internation Peer to Peer Symposium (IPTPS),2004.
[20]G. Park, M. Kwon. Distributed tries for load balancing in peer-to-peer systems. In: Quality of Service (IWQoS),2010 18th International Workshop on. Pp.1-9, 2010.
[21]X. Wang, Y. Peng, D. Li. A Load Balancing-Supported ID Management Method for Constant Degree DHTs. In:Computer Science and Information Technology (ICCSIT),2010 3rd IEEE International Conference on. Vol.7, pp.300-304, 2010.
[22]B. Wang, Q. Shen. ID Management and Allocation Algorithm for P2P Load Balancing. In:Communication Technology (ICCT),2010 12th IEEE International Conference on, pp.1232-1235,2010.
[23]Karger D, Ruhl M. Simple efficient load balancing algorithms for peer-to-peer systems. In:Voelkerm GM, Shenker S, eds.LNCS.Berlin:Springer-Verlag, 2005.131-140.
[24]J. Ledlie and M. Seltzer, "Distributed, Secure Load Balancing with Skew, Heterogeneity, and Churn," In Proc. of IEEE INFOCOM, March 2005, pp. 1419-1430.
[25]X. Wang, Y. Zhang, X. Li, and D. Loguinov. On zone balancing of peer-to-peer networks:Analysis of random node join. In Proc. of ACM SIGMETRICS,2004.
[26]I. Abraham, B.Awerbuch, Y. Azar, Y. Bartal, D. Malkhi,, and E. Pavlov, "A Generic Scheme for Building Overlay Networks in Adversarial Scenarios," in Proc. of ACM IPDPS, Apr 2003, p.40.2.
[27]G. Giakkopis and V. Hadzilacos, "A Scheme for Load Balancing in Heterogeneous Distributed Hash Tables," in Proc. of ACM PODC,2005, pp. 302-311.
[28]L. Devroye, G. Lugosi, G. Park, and W. Szpankowski, "Multiple Choice Tries and Distributed Hash Tables," in Proc. of ACM/SIAM SODA, January 2007, pp. 891-899.
[29]J. Byers, J. Considine, and M. Mitzenmacher, "Geometric generalizations of the power of two choices," in Proc. of ACM SPAA,2004, pp.54-63.
[30]Y. Xia, A. Dobra, and S.-C. Han, "Multiple-Choice Random Network for Server Load Balancing," in Proc. of IEEE INFOCOM,2007.
[31]Y. Xia, S. Chen, and S. Korgaonkar, "Load Balancing with Multiple Hash Functions in Peer-to-Peer Networks," in Proc. of International Conference on Parallel and Distributed Systems,2006, pp.411-420.
[32]D. Loguinov, A. Kumar, V. Rai, and S. Ganesh, "Graphtheoretic analysis of structured peer-to-peer systems:routing distances and fault resilience," in SIGCOMM,2003, pp.395-406.
[1]Prasanna Ganesan, Mayank Bawa, Hector Garcia-Molina. Online balancing of range-partitioned data with applications to peer-to-peer systems. In VLDB'04: Proceedings of the Thirtieth International Conference on Very Large Data Bases, pages 444-455. VLDB Endowment,2004.
[2]Min Cai, Martin Frank, Jinbo Chen, and Pedro Szekely. MA AN:A multi-attribute addressable network for grid information services. In GRID'03: Proceedings of the Fourth International Workshop on Grid Computing, page 184, Washington, DC, USA,2003. IEEE Computer Society.
[3]J. Chu, K. Labonte, and B. N. Levine, "Availability and Locality Measurements of Peer-to-Peer File Systems," in Proceedings of ITCom:Scalability and Traffi c Control in IP Networks II Conferences, July 2002.
[4]J. Ledlie and M. Seltzer. Distributed, secure load balancing with skew, heterogeneity and churn. INFOCOM 2005. Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies,2:1419-1430 vol.2, March 2005.
[5]A. Gupta, P. Dinda, and F. E. Bustamante, "Distributed popularity indices," in Proceedings of ACM SIGCOMM,2005.
[6]K. Gummadi, R. Dunn, S. Saroiu, S. Gribble, H. Levy, and J. Zahorjan, "Measurement, modeling, and analysis of a peer-to-peer file-sharing workload," in Proceedings of 19th ACM SOSPS,2003, pp.314-329.
[7]Karthik A R, Lakshminarayanan K, Surana S, Karp R, Stoica I. Load balancing in structured P2P systems. In:Kaashoek MF, Stoica I, eds.LNCS.Berlin:Springer-Verlag,2003.68-79.
[8]Godfrey B, Lakshminarayanan K, Surana S, Karp R, Stoica I. Load balancing in dynamic structured P2P systems.In:Kaashoek MF, Stoica I, eds.Proc.of the IEEE Infocom.2004.http://www.ieee-infocom.org/2004/Papers/46_4.pdf
[9]Zhu Y, Hu Y. Efficient, proximity-aware load balancing for DHT based P2P systems.IEEE Trans.on Parallel and Distributed Systems,2005,6(4):349-361.
[10]P.B. Godfrey and I.Stoica, "Heterogeneity and load balance in distributed hash tables," in INFOCOM 2005.24th Annual Joint Conference of the IEEE Computer and Communications Societies. Miami, FL, USA:IEEE, vol.1, pp. 596-606,2005.
[11]S.I. Mirrezaei, J. Shahparian, M. Ghodsi. A topology-aware load balancing algorithm for P2P systems. In Digital Information Management,2009. ICDIM 2009. Fourth International Conference on, PP.1-6,2009.
[12]D. Karger and M. Ruhl. New Algorithms for Load Balancing in Peer-to-Peer Systems. In Proceedings of the Fourth International Peer to Peer Symposium (IPTPS),2004.
[13]Karger D, Ruhl M. Simple efficient load balancing algorithms for peer-to-peer systems. In:Voelkerm GM, Shenker S, eds.LNCS.Berlin:Springer-Verlag, 2005.131-140.
[14]Z. Xu, L. Bhuyan. Effective load balancing in P2P systems. In:Cluster Computing and the Grid,2006. CCGRID 06. Sixth IEEE International Symposium on. Vol.1, pp.81-88,2006.
[15]Z. Li, G. Xie. A Distributed Load Balancing Algorithm for Structured P2P Systems. In:Computers and Communications,2006. ISCC'06. Proceedings.11th IEEE Symposium on. PP.417-422,2006.
[16]C.W. Chang, H.C. Hsiao. Stochastic Load Rebalancing in Distributed Hash Tables. In:Parallel and Distributed Systems (ICPADS),2011 IEEE 17th International Conference on. PP.841-846,2011.
[17]H.C. Hsiao, I.T. Lin, H. Liao. Load Balancing in Peer-to-Peer Networks Based on Sampling System States. In:Embedded and Ubiquitous Computing,2008. EUC'08. IEEE/IFIP International Conference on. Vol.1, pp.417-423,2008.
[18]D. Warneke, C. Dannewitz. Statistics-based ID management for load balancing in structured P2P networks. In:Local Computer Networks,2009. LCN 2009. IEEE 34th Conference on. Pp.273-276,2009.
[19]M.W. Akhtar, M.T. Kechadi. On the Efficiency of Dynamic Load Balancing on P2P Irregular Network Topologies. In:Parallel and Distributed Computing,2006. ISPDC'06. The Fifth International Symposium on. PP.271-280,2006.
[20]J. Sun, L. Li, H. Chen, H. Tan. A Proximity-Aware Load Balancing Algorithm in P2P Systems. In:Grid and Pervasive Computing Workshops,2008. GPC Workshops'08. The 3rd International Conference on. PP.364-369,2008.
[21]N. Kruber, M. Hogqvist, T. Schutt. The Benefits of Estimated Global Information in DHT Load Balancing.In:Cluster, Cloud and Grid Computing (CCGrid),2011 1 lth IEEE/ACM International Symposium on. PP.382-391,2011.
[22]Q.H. Vu, B.C. Ooi, M. Rinard, K.L. Tan. Histogram-based global load balancing in structured peer-to-peer systems. In:Knowledge and Data Engineering, IEEE Transactions on. Vol.21, No.4, pp.595-608,2009.
[23]Y. Lv, J. Song. A dynamic group-based load balancing approach in a DHT-P2P system. In:Pervasive Computing and Applications (ICPCA),2010 5th International Conference on. PP.213-217,2010.
[24]H. Shen, C.Z. Xu. Hash-based proximity clustering for load balancing in heterogeneous DHT networks. In:Parallel and Distributed Processing Symposium,2006. IPDPS 2006.20th International. PP.10-14,2006.
[25]D. Wu, Y. Tian, K.W. Ng. Achieving Resilient and Efficient Load Balancing in DHT-based P2P Systems.In:Local Computer Networks, Proceedings 2006 31st IEEE Conference on. PP.115-122,2006.
[26]Shen, H. and Xu, C.Z., "Locality-Aware Randomized Load Balancing Algorithms for DHT Networks," IEEE Computer Society Washington, DC, USA, 2005.
[27]Colorni A, Dorigo M, Maniezzo V, et al. Distributed optimization by ant colonies. Proceeding of the 1st European Conference on Artificial Life,1991,134-142.
[28]M. Dorigo, G. Di Caro, and L. M. Gambardella. Ant algorithms for discrete optimization. Artificial Life,5(2):137-172,1999.
[29]T. Stutzle, M. Dorigo. ACO algorithms for the traveling salesman problem. In: Evolutionary Algorithms in Engineering and Computer Science. PP.163-183, 1999.
[1]Prasanna Ganesan, Mayank Bawa, Hector Garcia-Molina. Online balancing of range-partitioned data with applications to peer-to-peer systems. In VLDB'04: Proceedings of the Thirtieth International Conference on Very Large Data Bases, pages 444-455. VLDB Endowment,2004.
[2]Min Cai, Martin Frank, Jinbo Chen, and Pedro Szekely. MAAN:A multi-attribute addressable network for grid information services. In GRID'03: Proceedings of the Fourth International Workshop on Grid Computing, page 184, Washington, DC, USA,2003. IEEE Computer Society.
[3]J. Chu, K. Labonte, and B. N. Levine, "Availability and Locality Measurements of Peer-to-Peer File Systems," in Proceedings of ITCom:Scalability and Traffi c Control in IP Networks II Conferences, July 2002.
[4]J. Ledlie and M. Seltzer. Distributed, secure load balancing with skew, heterogeneity and churn. INFOCOM 2005. Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies,2:1419-1430 vol.2, March 2005.
[5]A. Gupta, P. Dinda, and F. E. Bustamante, "Distributed popularity indices," in Proceedings of ACM SIGCOMM,2005.
[6]K. Gummadi, R. Dunn, S. Saroiu, S. Gribble, H. Levy, and J. Zahorjan, "Measurement, modeling, and analysis of a peer-to-peer file-sharing workload," in Proceedings of 19th ACM SOSPS,2003, pp.314-329.
[7]Zhu Y, Hu Y. Efficient, proximity-aware load balancing for DHT based P2P systems. IEEE Trans.on Parallel and Distributed Systems,2005,6(4):349-361.
[8]Shen, H. and Xu, C.Z., "Locality-Aware Randomized Load Balancing Algorithms for DHT Networks," IEEE Computer Society Washington, DC, USA, 2005.
[9]Godfrey B, Lakshminarayanan K, Surana S, Karp R, Stoica I. Load balancing in dynamic structured P2P systems.In:Kaashoek MF, Stoica I, eds.Proc.of the IEEE Infocom.2004.
[10]Karthik A R, Lakshminarayanan K, Surana S, et al. Load balancing in structured P2P systems. In:Kaashoek MF, Stoica I, eds.LNCS.Berlin:Springer-Verlag, 2003.68-79.
[11]S.I. Mirrezaei, J. Shahparian, M. Ghodsi. A topology-aware load balancing algorithm for P2P systems. In Digital Information Management,2009. ICDIM 2009. Fourth International Conference on, PP.1-6,2009.
[12]M.W. Akhtar, M.T. Kechadi. On the Efficiency of Dynamic Load Balancing on P2P Irregular Network Topologies. In:Parallel and Distributed Computing,2006. ISPDC'06. The Fifth International Symposium on. PP.271-280,2006.
[13]D. Wu, Y. Tian, K.W. Ng. Achieving Resilient and Efficient Load Balancing in DHT-based P2P Systems.In:Local Computer Networks, Proceedings 200631st IEEE Conference on. PP.115-122,2006.
[14]Z. Li, G. Xie. A Distributed Load Balancing Algorithm for Structured P2P Systems. In:Computers and Communications,2006. ISCC'06. Proceedings.11th IEEE Symposium on. PP.417-422,2006.
[15]P. Godfrey and I. Stoica. Heterogeneity and load balance in distributed hash tables. In:INFOCOM 2005.24th Annual Joint Conference of the IEEE Computer and Communications Societies. Vol.1, pp.596-606,2005.
[16]Karger D, Ruhl M. Simple efficient load balancing algorithms for peer-to-peer systems. In:Voelkerm GM, Shenker S, eds.LNCS.Berlin:Springer-Verlag, 2005.131-140.
[17]D. Karger, M. Ruhl. "New Algorithms for Load Balancing in Peer-to-Peer Systems". In Proceedings of the Fourth Internation Peer to Peer Symposium (IPTPS),2004.
[18]Zitzler E. Evolutionary algorithm for multiobjective optimization:Methods and application [Ph.D. Dissertation]. Zurich:Swiss Federal Institude of Technology, 1999.
[1]M. Engle, J.I. Khan. Vulnerabilities of P2P Systems and a Critical Look at their Solutions. In:http://medianet.kent.edu/technicalreports.html. Internetworking and Media Communications Research Laboratories, Department of Computer Science, Kent State University,2006.11.01.
[2]L. Ganesh, B.Y Zhao. Identity theft protection in structured overlays. In:Secure Network Protocols,2005.(NPSec).1st IEEE ICNP Workshop on. IEEE, PP. 49-54,2005.
[3]A. Singh, T. Wan, S. Dan. Eclipse Attacks on Overlay Networks:Threats and Defenses. In:IEEE INFOCOM.2006.
[4]Pankaj Kohli, Umadevi Ganugula. DDoS Attacks using P2P Networks.2007.
[5]E. Sit, R. Morris. Security considerations for peer-to-peer distribution hash tables. Peer-to-Peer Systems. Springer, pp.261-269,2002.
[6]D. Stutzbach, R. Rejaie. Understanding Churn in Peer-to-Peer Networks. In: Proceedings of the 6th ACM SIGCOMM conference on Internet measurement. PP.189-202,2006.
[7]J. Douceur. The Sybil Attack. Peer-to-Peer Systems. Springer, pp.251-260,2002.
[8]D. Cerri, A. Ghiono. ID Mapping Attacks in P2P Networks. Global Telecommunications Conference,2005. GLOBECOM'05. IEEE, vol.3, pp.5-9, 2005.
[9]L. Wang. Attacks Against Peer-to-peer Networks and Countermeasures. In:TKK T-Ⅱ0. Vol.5290,2006.
[10]Ruichuan Chen, Eng keong Lua, J. Crowcroft. Securing Peer-to-Peer Content Sharing Service from Poisoning Attacks. Peer-to-Peer Computing,2008. P2P'08. Eighth International Conference on. PP.22-29,2008.
[11]Jian Liang, Naoum Naoumov, Keith W. The Index Poisoning Attack in P2P File Sharing Systems. IEEE INFOCOM, vol.6,2006.
[12]J. Ledlie, M. Seltzer. Distributed, secure load balancing with skew, heterogeneity and churn. INFOCOM 2005, vol.2, pp.1419-1430,2005.
[13]Bruce Schneier. Attack trees:Modeling security threats. Dr. Dobb's journal, 1999.
[14]B. Mitra, S. Ghose, N. Ganguly. Effect of dynamicity on peer to peer networks. In:Proceedings of the 14th international conference on High performance computing. PP.452-463,2007.
[15]B. Mitra, S. Ghose, N. Ganguly, et al. Stability analysis of peer-to-peer networks against churn. In:Pramana. Vol.71, no.2, pp.263-273,2008.
[16]M. Brinkmeier, G. Schafer, T. Strufe. Optimally dos resistant p2p topologies for live multimedia streaming. In:Parallel and Distributed Systems, IEEE Transactions on. Vol.20, no.6, pp.831-844,2009.
[17]N. Naoumov, K. Ross. Exploiting p2p systems for ddos attacks. In Proceedings of the 1st international conference on Scalable information systems. pp.47,2006.
[18]S. Marti, H. Garcia-Molina. Taxonomy of trust:Categorizing P2P reputation systems. In:Computer Networks. Vol.50, no.4, pp.472-484,2006.
[19]Godfrey B, Lakshminarayanan K, Surana S, Karp R, Stoica I. Load balancing in dynamic structured P2P systems.In:Kaashoek MF, Stoica I, eds.Proc.of the IEEE Infocom.2004.
[20]P. Godfrey and I. Stoica. Heterogeneity and load balance in distributed hash tables. In:INFOCOM 2005.24th Annual Joint Conference of the IEEE Computer and Communications Societies. Vol.1, pp.595-606,2005.
[21]Karger D, Ruhl M. Simple efficient load balancing algorithms for peer-to-peer systems. In:Voelkerm GM, Shenker S, eds.LNCS.Berlin:Springer-Verlag, 2005.131-140.
[22]D. Karger, M. Ruhl. "New Algorithms for Load Balancing in Peer-to-Peer Systems". In Proceedings of the Fourth Internation Peer to Peer Symposium (IPTPS),2004.
[23]Zhu Y, Hu Y. Efficient, proximity-aware load balancing for DHT based P2P systems. IEEE Trans.on Parallel and Distributed Systems,2005,6(4):349-361.
[24]Shen, H. and Xu, C.Z., "Locality-Aware Randomized Load Balancing Algorithms for DHT Networks," IEEE Computer Society Washington, DC, USA, 2005.
[25]S.I. Mirrezaei, J. Shahparian, M. Ghodsi. A topology-aware load balancing algorithm for P2P systems. In Digital Information Management,2009. ICDIM 2009. Fourth International Conference on, PP.1-6,2009.
[26]D. Wu, Y. Tian, K.W. Ng. Achieving Resilient and Efficient Load Balancing in DHT-based P2P Systems. In:Local Computer Networks, Proceedings 2006 31st IEEE Conference on. PP.115-122,2006.
[27]Li L, Zhang C, Wang Y. Reliable and Scalable DHT-Based SIP Server Farm. In: IEEE GLOBECOM. IEEE Global Telecommunications Conference. PP.1-6, 2008.
[28]Matuszewski M, Garcia-Martin M.A. A Distributed IP Multimedia Subsystem (IMS). In:IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks. PP.1-8,2007.
[29]Pappas V, Massey D, Terzis A. A Comparative Study of the DNS Design with DHT-Based Alternatives. In:Proc. INFOCOM.2006.
[30]Freedman M.J, Freudenthal E, Mazieres D. Democratizing Content Publication with Coral. In:Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation. Vol.1, pp.18-18,2004.
[31]赵洋,王忠仁.SSLv3/TLS网络安全协议的研究与实现.电子科技大学.2004.
[32]S. Rafaeli, D. Hutchison. A Survey of Key Management for Secure Group Communication. ACM Computing Surveys. Vol.35(3), pp.309-329,2003.
[2]Napster官方网站：http://www.napster.com/
[3]P. Maymounkov and D. Mazieres, "Kademlia:A peer-to-peer information system based on the xor metric," in the 1st Internation Workshop on Peer to Peer Systems (IPTPS),2002.
[4]A. Rowstron and P. Druschel, "Pastry:Scalable, distributed object location and routing for large-scale peer-to-peer systems". IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, pages 329-350, November,2001.
[5]Sean Rhea, Dennis Geels, Timothy Roscoe, and John Kubiatowicz, "Handling Churn in a DHT", in Proceedings of the USENIX Annual Technical Conference, June 20
[6]E. Sit, F. Dabek and J. Robertson, UsenetDHT:A low overhead Usenet server, in the 3rd IPTPS,2004.
[7]M. Castro, P. Druschel, A-M. Kermarrec and A. Rowstron, "SCRIBE:A large-scale and decentralised application-level multicast infrastructure", IEEE Journal on Selected Areas in Communications (JSAC) (Special issue on Network Support for Multicast Communications).2002.
[8]S. Iyer, A. Rowstron and P. Druschel, "SQUIRREL:A decentralized, peer-to-peer web cache", appeared in Principles of Distributed Computing (PODC 2002), Monterey, CA,2002.
[9]S. Rhea, B. Godfrey, B. Karp, J. Kubiatowicz, S. Ratnasamy, S. Shenker, I. Stoica, and H. Yu, "OpenDHT:A Public DHT Service and Its Uses," ACM SIGCOMM Computer Communication Review, pp.73-84,2005.
[10]S. Ratsanamy, P. Francis, M. Handley, and R. Karp. A Scalable Content-Addressable Network. In Proceedings of ACM Sigcomm, pages 161-172, San Diego, CA, USA.2001.
[11]Stoica I, Morris R, Karger D, Kaashoek F, Balakrishnan H. Chord:A scalable peer-to-peer lookup service for Internet applications.In.Cruz R, Varghese G, eds. Proc. of the 2001 Conf.on Applications, Technologies, Architectures, and Protocols for Computer Communications (SigComm).New York:ACM Press, 2001.149-160.
[12]Dabek F, Kaashoek M.F, Karger D, Morris R, Stoica I.Wide-Area Cooperative storage with CFS. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP),2001,35(5):202-215.
[13]Maymounkov P., Mazieres, D. Kademlia:A peer to peer information systems based on the XOR metric. In:Peer-to-Peer Systems. PP.53-65,2002.
[14]Li L, Zhang C, Wang Y, Ji Y.Reliable and Scalable DHT-Based SIP Server Farm.In:IEEE GLOBECOM.IEEE Global Telecommunications Conference.New Orleans:IEEE GLOBECOM,2008.1-6.
[15]Matuszewski M, Garcia-Martin M.A.A Distributed IP Multimedia Subsystem (IMS).In:WoWMoM.IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.Espoo, Finland:IEEE.2007.1-8.
[16]Pappas V, Massey D, Terzis A, Zhang L.A Comparative Study of the DNS Design with DHT-Based Alternatives.In:Proc.INFOCOM 2006.25th IEEE International Conference on Computer Communications.Barcelona, Spain:IEEE INFOCOM,2006.1-1.
[17]Freedman M.J, Freudenthal E, Mazieres D.Democratizing Content Publication with Coral.In:USENIX Association.The 1st USENIX Symposium on Networked Systems Design and Implementation.Berkeley:USENIX Association,2004.18-18.
[18]中国移动通信研究院,分布式业务网络(DSN)技术白皮书,http://labs.chinamobile.com/showarticle.php?id=10386&action=view&grade=4.5
[19]Maruoka, M. and Nemati, A.G. and Barolli, V. and Enokido, T. and Takizawa, M.Making Societies in Peer-to-Peer (P2P) Overlay Networks. In:Complex, Intelligent and Software Intensive Systems,2008. CISIS 2008. International Conference on. PP.41-47,2008.
[20]Saberi S., Trunfio P. Talia D., et al.Using Social Network and Semantic Overlay Network approaches to share knowledge in distributed data mining scenarios. In: High Performance Computing and Simulation (HPCS),2010 International Conference on. PP.536--544,2010.
[21]Ekler P., Devai I., Bakos B., Kiss AJ. BitTorrent Based Solution for Efficient Content Sharing on Next Generation Networks. In:Next Generation Internet Networks,2008. NGI 2008. PP.300-307,2008.
[22]张智,李瑞轩,杨俊,WebPeer:一个基于P2P的Web服务平台,计算机应用研究,2006年第5期
[23]方启明,杨广文,武永卫等.基于P2P的Web搜索技术.软件学报,2008,19(10)：2706-2719
[24]Seok-Won Seong, Jiwon Seo, Matthew Nasielski, et al.PrP1:A Decentralized Social Networking Infrastructure. In Proceedings of the 1st ACM Workshop on Mobile Cloud Computing& Services:Social Networks and Beyond
[25]IETF DECADE WG, https://datatracker.ietf.org/wg/decade/charter/
[26]IETF Peer to Peer Streaming Protocol (ppsp), https://datatracker.ietf.org/wg/ppsp/.
[27]3GPP, Study on IMS based Peer-to-Peer Content Distribution Services, http://www.3gpp.org/Highlights-from-SA-45-Seville.
[28]Comcast's ISP Experiences in a Proactive Network Provider Participation for P2P (P4P) Technical Trial. draft-livingood-woundy-p4p-experiences
[29]C. Jennings, S. Baset, H. Schulzrinne, et al. Resource location and discovery (reload) base protocol, IETF P2PSIP,2012.
[30]IETF Application-Layer Traffic Optimization (alto), https://datatracker.ietf.org/wg/alto/.
[31]V. Jacobson, D. K. Smetters, J. D. Thornton, et al. Networking named content. In CoNext'09,2009.
[32]Hanka, O., Spleiss, C., Kunzmann, G., et al. A novel DHT-based network architecture for the Next Generation Internet. In Proc. ICN (2009).
[33]Suman Srinivasan, Arezu Moghadam and Henning Schulzrinne, BonAHA: Service Discovery Framework for Mobile Ad-Hoc Applications, in CCNC,2009
[34]Bent Guldbjerg Christensen. LightPeers A Framework Supporting Nomadic Learning in Mixed Environments with Mobile Ad Hoc Networking. In Workshop on Middleware for Mobile Environments,2006
[35]Peer2ME, http://org.ntnu.no/mobcscw/
[36]A Constrained Application Protocol (CoAP) Usage for REsource LOcation And Discovery (RELOAD), draft-jimenez-p2psip-coap-reload-01.
[37]Karger D, Lehman E, Leighton T, Panigrahy R, Levine M, Lewin D. Consistent hashing and random trees:Distributed caching protocols for relieving hot spots on the World Wide Web.In:ACM.The 29th Annual ACM Symposium on Theory of Computing.Texas, USA:ACM,1997.654-663.
[38]Saroiu S, Gummadi P.K, Gribble S.D. A measurement study of peer-to-peer file sharing systems. In proceedings of Multimedia Computing and Networking(MMCN), vol.2002, pp.152, San Jose, CA, USA, January 2002
[39]Prasanna Ganesan, Mayank Bawa, Hector Garcia-Molina. Online balancing of range-partitioned data with applications to peer-to-peer systems. In VLDB'04: Proceedings of the Thirtieth International Conference on Very Large Data Bases, pages 444-455. VLDB Endowment,2004.
[40]Min Cai, Martin Frank, Jinbo Chen, and Pedro Szekely. MAAN:A multi-attribute addressable network for grid information services. In GRID'03: Proceedings of the Fourth International Workshop on Grid Computing, page 184, Washington, DC, USA,2003. IEEE Computer Society.
[41]J.Chu, K. Labonte, B. Levine. Availability and locality measurements of peer-to-peer file system. In Proceedings of the ITCom:Scalability and Traffic Control in IP Networks,2002.
[42]Stutzbach D, Rejaie R. Understanding churn in peer-to-peer networks. In Proceedings of the 6th ACM SIGCOMM conference on Internet measurement, ACM, pp.189-202,2006.
[43]S. Ratnasamy, I. Stoica, S. Shenker. Routing algorithms for DHTs:some open questions. In Proceedings of IPTPS,2002.
[44]J. Ledlie and M. Seltzer. Distributed, secure load balancing with skew, heterogeneity and churn. INFOCOM 2005. Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies,2:1419-1430 vol.2, March 2005.
[45]Z. Xu, L. Bhuyan. Effective load balancing in P2P systems. In:Cluster Computing and the Grid,2006. CCGRID 06. Sixth IEEE International Symposium on. Vol.1, pp.81-88,2006.
[46]Z. Li, C. Lu, Y. Zhang. Research of Load-Balancing in P2P Network Based on Matching Load Capacity with ID Address Space. In:Information Technology and Computer Science,2009. ITCS 2009. International Conference on. Vol.1, pp. 400-403,2009.
[47]K. Kenthapadi and G. S. Manku. Decentralized algorithms using both local and random probes for p2p load balancing. In SPAA. PP.135-144,2005.
[48]G. Manku. Balanced Binary Trees for ID Management and Load Balance in Distributed Hash Tables. In Proc. of ACM PODC. PP.197-205,2004.
[49]D. Warneke, C. Dannewitz. Statistics-based ID management for load balancing in structured P2P networks. In:Local Computer Networks,2009. LCN 2009. IEEE 34th Conference on. Pp.273-276,2009.
[50]D. Karger, M. Ruhl. New Algorithms for Load Balancing in Peer-to-Peer Systems. In Proceedings of the Fourth Internation Peer to Peer Symposium (IPTPS),2004.
[51]G. Park, M. Kwon. Distributed tries for load balancing in peer-to-peer systems. In: Quality of Service (IWQoS),2010 18th International Workshop on. Pp.1-9, 2010.
[52]X. Wang, Y. Peng, D. Li. A Load Balancing-Supported ID Management Method for Constant Degree DHTs. In:Computer Science and Information Technology (ICCSIT),2010 3rd IEEE International Conference on. Vol.7, pp.300-304,2010.
[53]B. Wang, Q. Shen. ID Management and Allocation Algorithm for P2P Load Balancing. In:Communication Technology (ICCT),2010 12th IEEE International Conference on, pp.1232-1235,2010.
[54]M. Naor and U. Wieder, "Novel Architectures for P2P Applications:The Continuous-Discrete Approach," in Proc. of ACM SPAA, June 2003, pp.50-59.
[55]P. Godfrey and I. Stoica. Heterogeneity and load balance in distributed hash tables. In:INFOCOM 2005.24th Annual Joint Conference of the IEEE Computer and Communications Societies. Vol.1, pp.596-606,2005.
[56]Karger D, Ruhl M. Simple efficient load balancing algorithms for peer-to-peer systems. In:Voelkerm GM, Shenker S, eds.LNCS.Berlin:Springer-Verlag, 2005.131-140.
[57]X. Wang, Y. Zhang, X. Li, and D. Loguinov. On zone balancing of peer-to-peer networks:Analysis of random node join. In Proc. of ACM SIGMETRICS,2004.
[58]I. Abraham, B.Awerbuch, Y. Azar, Y. Bartal, D. Malkhi,, and E. Pavlov, "A Generic Scheme for Building Overlay Networks in Adversarial Scenarios," in Proc. of ACM IPDPS, Apr 2003, p.40.2.
[59]G. Giakkopis and V. Hadzilacos, "A Scheme for Load Balancing in Heterogeneous Distributed Hash Tables," in Proc. of ACM PODC,2005, pp. 302-311.
[60]L. Devroye, G. Lugosi, G. Park, and W. Szpankowski, "Multiple Choice Tries and Distributed Hash Tables," in Proc. of ACM/SIAM SODA, January 2007, pp. 891-899.
[61]J. Byers, J. Considine, and M. Mitzenmacher, "Geometric generalizations of the power of two choices," in Proc. of ACM SPAA,2004, pp.54-63.
[62]Y. Xia, A. Dobra, and S.-C. Han, "Multiple-Choice Random Network for Server Load Balancing," in Proc. of IEEE INFOCOM,2007.
[63]Y. Xia, S. Chen, and S. Korgaonkar, "Load Balancing with Multiple Hash Functions in Peer-to-Peer Networks," in Proc. of International Conference on Parallel and Distributed Systems,2006, pp.411^420.
[64]draft-saumitra-p2psip-loadbalance-00. A Load Balancing Mechanism for REsource Location And Discovery,2009.03.03
[65]Karthik A R, Lakshminarayanan K, Surana S, Karp R, Stoica I. Load balancing in structured P2P systems. In:Kaashoek MF, Stoica I, eds.LNCS.Berlin:Springer-Verlag,2003.68-79.
[66]Godfrey B, Lakshminarayanan K, Surana S, Karp R, Stoica I. Load balancing in dynamic structured P2P systems. In:Kaashoek MF, Stoica I, eds.Proc.of the IEEE Infocom.2004.http://www.ieee-infocom.org/2004/Papers/46_4.pdf
[67]Zhu Y, Hu Y. Efficient, proximity-aware load balancing for DHT based P2P systems. IEEE Trans.on Parallel and Distributed Systems,2005,6(4):349-361.
[68]Shen, H. and Xu, C.Z., "Locality-Aware Randomized Load Balancing Algorithms for DHT Networks," IEEE Computer Society Washington, DC, USA, 2005.
[69]S.I. Mirrezaei, J. Shahparian, M. Ghodsi. A topology-aware load balancing algorithm for P2P systems. In Digital Information Management,2009. ICDIM 2009. Fourth International Conference on, PP.1-6,2009.
[70]Z. Li, G. Xie. A Distributed Load Balancing Algorithm for Structured P2P Systems. In:Computers and Communications,2006. ISCC'06. Proceedings.11th IEEE Symposium on. PP.417-422,2006.
[71]C.W. Chang, H.C. Hsiao. Stochastic Load Rebalancing in Distributed Hash Tables. In:Parallel and Distributed Systems (ICPADS),2011 IEEE 17th International Conference on. PP.841-846,2011.
[72]H.C. Hsiao, I.T. Lin, H. Liao. Load Balancing in Peer-to-Peer Networks Based on Sampling System States. In:Embedded and Ubiquitous Computing,2008. EUC'08. IEEE/IFIP International Conference on. Vol.1, pp.417-423,2008.
[73]M.W. Akhtar, M.T. Kechadi. On the Efficiency of Dynamic Load Balancing on P2P Irregular Network Topologies. ln:Parallel and Distributed Computing,2006. ISPDC'06. The Fifth International Symposium on. PP.271-280,2006.
[74]J. Sun, L. Li, H. Chen, H. Tan. A Proximity-Aware Load Balancing Algorithm in P2P Systems. In:Grid and Pervasive Computing Workshops,2008. GPC Workshops'08. The 3rd International Conference on. PP.364-369,2008.
[75]N. Kraber, M. Hogqvist, T. Schutt. The Benefits of Estimated Global Information in DHT Load Balancing.In:Cluster, Cloud and Grid Computing (CCGrid),2011 11th IEEE/ACM International Symposium on. PP.382-391,2011.
[76]Q.H. Vu, B.C. Ooi, M. Rinard, K.L. Tan. Histogram-based global load balancing in structured peer-to-peer systems. In:Knowledge and Data Engineering, IEEE Transactions on. Vol.21, No.4, pp.595-608,2009.
[77]Y. Lv, J. Song. A dynamic group-based load balancing approach in a DHT-P2P system. In:Pervasive Computing and Applications (ICPCA),2010 5th International Conference on. PP.213-217,2010.
[78]H. Shen, C.Z. Xu. Hash-based proximity clustering for load balancing in heterogeneous DHT networks. In:Parallel and Distributed Processing Symposium,2006. IPDPS 2006.20th International. PP.10-14,2006.
[79]D. Wu, Y. Tian, K.W. Ng. Achieving Resilient and Efficient Load Balancing in DHT-based P2P Systems.In:Local Computer Networks, Proceedings 2006 31st IEEE Conference on. PP.115-122,2006.
[80]Shen, H. and Xu, C.Z., "Locality-Aware Randomized Load Balancing Algorithms for DHT Networks," IEEE Computer Society Washington, DC, USA, 2005.
[81]Byers J, Considine J, Mitzenmacher M. Simple load balancing for distributed hash tables.In:Kaashoek MF, Stoica I, eds.LNCS.Berlin:Springer-Verlag, 2003.80-87.
[82]P. Triantafillou, C. Xiruhaki, M. Koubarakis, and N. Ntarmos. Towards High Performance Peer-to-Peer Content and Resource Sharing Systems,1st Conference on Innovative Data Systems Research (CIDR 2003), Asilomar, CA, USA,2003.
[83]Pitoura T, Ntaimos N, Triantafillou P. Replication, load balancing and efficient range query processing in DHTs. Proceedings of the EDBT. Munich, Germany, 2006.
[84]Gopalakrishnan V, Silaghi B, Bhattachariee B, Keleher P. Adaptive replication in Peer to Peer systems. Proceedings of the ICDCS. Washington,2004.
[85]V. Gopalakrishnan, B. Silaghi, B. Bhattacharjee, and P. Keleher, "Adaptive replication in peer-to-peer systems," in Proceedings of 24th ICDCS,2004, pp. 360-369.
[86]H. Yamamoto, D. Maruta, and Y Oie, "Replication methods for load balancing on distributed storages in p2p networks," in Proceedings of Symposium on Applications and the Internet,2005, pp.264-271.
[87]G. Swart, "Spreading the load using consistent hashing:A preliminary report," in Proceedings of Models and Tools for Parallel Computing on Heterogeneous Networks,2004, pp.169-176.
[88]M. Engle, J.I. Khan. Vulnerabilities of P2P Systems and a Critical Look at their Solutions. In:http://medianet.kent.edu/technicalreports.html. Internetworking and Media Communications Research Laboratories, Department of Computer Science, Kent State University,2006.11.01.
[89]L. Ganesh, B.Y Zhao. Identity theft protection in structured overlays. In:Secure Network Protocols,2005.(NPSec).1st IEEE ICNP Workshop on. IEEE, PP. 49-54,2005.
[90]A. Singh, T. Wan, S. Dan. Eclipse Attacks on Overlay Networks:Threats and Defenses. In:IEEE INFOCOM.2006.
[91]E. Sit, R. Morris. Security considerations for peer-to-peer distribution hash tables. Peer-to-Peer Systems. Springer, pp.261-269,2002.
[92]D. Stutzbach, R. Rejaie. Understanding Churn in Peer-to-Peer Networks. In: Proceedings of the 6th ACM SIGCOMM conference on Internet measurement. PP.189-202,2006.
[93]J. Douceur. The Sybil Attack. Peer-to-Peer Systems. Springer, pp.251-260,2002.
[94]D. Cerri, A. Ghiono. ID Mapping Attacks in P2P Networks. Global Telecommunications Conference,2005. GLOBECOM'05. IEEE, vol.3, pp.6-9, 2005.
[95]L. Wang. Attacks Against Peer-to-peer Networks and Countermeasures. In:TKK T-Ⅱ0. Vol.5290,2006.
[96]Ruichuan Chen, Eng keong Lua, J. Crowcroft. Securing Peer-to-Peer Content Sharing Service from Poisoning Attacks. Peer-to-Peer Computing,2008. P2P'08. Eighth International Conference on. PP.22-29,2008.
[97]Jian Liang, Naoum Naoumov, Keith W. The Index Poisoning Attack in P2P File Sharing Systems. IEEE INFOCOM, vol.6,2006.
[1]Karger D, Lehman E, Leighton T, Panigrahy R, Levine M, Lewin D. Consistent hashing and random trees:Distributed caching protocols for relieving hot spots on the World Wide Web.In:ACM.The 29th Annual ACM Symposium on Theory of Computing.Texas, USA:ACM,1997.654-663.
[2]H. Shen, C.-Z. Xu. Locality-aware and churn-resilient load balancing algorithms in structured Peer-to-Peer networks. IEEE Trans. on Parallel and Distributed Systems,18(6):849-862,2007.
[3]D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and P. R. Consistent hashing and random trees:Distributed caching protocols for relieving hot spots on the World Wide Web. In Proc. of STOC, pages 654-663,1997.
[4]George Giakkoupis and Vassos Hadzilacos. A scheme for load balancing in heterogenous distributed hash tables. In PODC'05:Proceedings of the Twenty-fourth Annual ACM Symposium on Principles of Distributed Computing, pages 302-311, New York, NY, USA,2005. ACM.
[5]X. Wang, D. loguinov. Load-balancing performance of consistent hashing: asymptotic analysis of random node join. In:IEEE/ACM Transactions on Networking. Vol.15, no.4, pp.892-905,2007.
[6]M. Naor and U. Wieder, "Novel Architectures for P2P Applications:The Continuous-Discrete Approach," in Proc. of ACM SPAA, June 2003, pp.50-59.
[7]Saroiu S, Gummadi P.K, Gribble S.D. A measurement study of peer-to-peer file sharing systems. In proceedings of Multimedia Computing and Networking(MMCN), vol.2002, pp.152, San Jose, CA, USA, January 2002
[8]Q. Lv, S. Ratnasamy, and S. Shenker. Can heterogeneity make gnutella scalable? In Proceedings of the first International Workshop on Peer-to-Peer Systems (IPTPS), Mar.2002.
[9]Stoica I, Morris R, Karger D, et al. Chord:A scalable peer-to-peer lookup service for Internet applications. In:ACM SIGCOMM Computer Communication Review. Vol.31, no.4, pp.149-160,2001.
[10]S. Ratsanamy, P. Francis, M. Handley, et al. "A Scalable Content-Addressable Network". In Proceedings of ACM Sigcomm. PP.161-172, San Diego, CA, USA. 2001.
[11]Dabek F, Kaashoek M.F, Karger D, et al. Wide-Area Cooperative storage with CFS. In:Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP). Vol.35, no.5, pp.202-215,2001.
[12]P. Godfrey and I. Stoica. Heterogeneity and load balance in distributed hash tables. In:INFOCOM 2005.24th Annual Joint Conference of the IEEE Computer and Communications Societies. Vol.1, pp.596-606,2005.
[13]draft-saumitra-p2psip-loadbalance-00. A Load Balancing Mechanism for REsource LOcation And Discovery,2009.03.03
[14]Z. Xu, L. Bhuyan. Effective load balancing in P2P systems. In:Cluster Computing and the Grid,2006. CCGRID 06. Sixth IEEE International Symposium on. Vol.1, pp.81-88,2006.
[15]Z. Li, C. Lu, Y. Zhang. Research of Load-Balancing in P2P Network Based on Matching Load Capacity with ID Address Space. In:Information Technology and Computer Science,2009. ITCS 2009. International Conference on. Vol.1, pp. 400-403,2009.
[16]K. Kenthapadi and G. S. Manku. Decentralized algorithms using both local and random probes for p2p load balancing. In SPAA. PP.135-144,2005.
[17]G. Manku. Balanced Binary Trees for ID Management and Load Balance in Distributed Hash Tables. In Proc. of ACM PODC. PP.197-205,2004.
[18]D. Warneke, C. Dannewitz. Statistics-based ID management for load balancing in structured P2P networks. In:Local Computer Networks,2009. LCN 2009. IEEE 34th Conference on. Pp.273-276,2009.
[19]D. Karger, M. Ruhl. New Algorithms for Load Balancing in Peer-to-Peer Systems. In Proceedings of the Fourth Internation Peer to Peer Symposium (IPTPS),2004.
[20]G. Park, M. Kwon. Distributed tries for load balancing in peer-to-peer systems. In: Quality of Service (IWQoS),2010 18th International Workshop on. Pp.1-9, 2010.
[21]X. Wang, Y. Peng, D. Li. A Load Balancing-Supported ID Management Method for Constant Degree DHTs. In:Computer Science and Information Technology (ICCSIT),2010 3rd IEEE International Conference on. Vol.7, pp.300-304, 2010.
[22]B. Wang, Q. Shen. ID Management and Allocation Algorithm for P2P Load Balancing. In:Communication Technology (ICCT),2010 12th IEEE International Conference on, pp.1232-1235,2010.
[23]Karger D, Ruhl M. Simple efficient load balancing algorithms for peer-to-peer systems. In:Voelkerm GM, Shenker S, eds.LNCS.Berlin:Springer-Verlag, 2005.131-140.
[24]J. Ledlie and M. Seltzer, "Distributed, Secure Load Balancing with Skew, Heterogeneity, and Churn," In Proc. of IEEE INFOCOM, March 2005, pp. 1419-1430.
[25]X. Wang, Y. Zhang, X. Li, and D. Loguinov. On zone balancing of peer-to-peer networks:Analysis of random node join. In Proc. of ACM SIGMETRICS,2004.
[26]I. Abraham, B.Awerbuch, Y. Azar, Y. Bartal, D. Malkhi,, and E. Pavlov, "A Generic Scheme for Building Overlay Networks in Adversarial Scenarios," in Proc. of ACM IPDPS, Apr 2003, p.40.2.
[27]G. Giakkopis and V. Hadzilacos, "A Scheme for Load Balancing in Heterogeneous Distributed Hash Tables," in Proc. of ACM PODC,2005, pp. 302-311.
[28]L. Devroye, G. Lugosi, G. Park, and W. Szpankowski, "Multiple Choice Tries and Distributed Hash Tables," in Proc. of ACM/SIAM SODA, January 2007, pp. 891-899.
[29]J. Byers, J. Considine, and M. Mitzenmacher, "Geometric generalizations of the power of two choices," in Proc. of ACM SPAA,2004, pp.54-63.
[30]Y. Xia, A. Dobra, and S.-C. Han, "Multiple-Choice Random Network for Server Load Balancing," in Proc. of IEEE INFOCOM,2007.
[31]Y. Xia, S. Chen, and S. Korgaonkar, "Load Balancing with Multiple Hash Functions in Peer-to-Peer Networks," in Proc. of International Conference on Parallel and Distributed Systems,2006, pp.411-420.
[32]D. Loguinov, A. Kumar, V. Rai, and S. Ganesh, "Graphtheoretic analysis of structured peer-to-peer systems:routing distances and fault resilience," in SIGCOMM,2003, pp.395-406.
[1]Prasanna Ganesan, Mayank Bawa, Hector Garcia-Molina. Online balancing of range-partitioned data with applications to peer-to-peer systems. In VLDB'04: Proceedings of the Thirtieth International Conference on Very Large Data Bases, pages 444-455. VLDB Endowment,2004.
[2]Min Cai, Martin Frank, Jinbo Chen, and Pedro Szekely. MA AN:A multi-attribute addressable network for grid information services. In GRID'03: Proceedings of the Fourth International Workshop on Grid Computing, page 184, Washington, DC, USA,2003. IEEE Computer Society.
[3]J. Chu, K. Labonte, and B. N. Levine, "Availability and Locality Measurements of Peer-to-Peer File Systems," in Proceedings of ITCom:Scalability and Traffi c Control in IP Networks II Conferences, July 2002.
[4]J. Ledlie and M. Seltzer. Distributed, secure load balancing with skew, heterogeneity and churn. INFOCOM 2005. Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies,2:1419-1430 vol.2, March 2005.
[5]A. Gupta, P. Dinda, and F. E. Bustamante, "Distributed popularity indices," in Proceedings of ACM SIGCOMM,2005.
[6]K. Gummadi, R. Dunn, S. Saroiu, S. Gribble, H. Levy, and J. Zahorjan, "Measurement, modeling, and analysis of a peer-to-peer file-sharing workload," in Proceedings of 19th ACM SOSPS,2003, pp.314-329.
[7]Karthik A R, Lakshminarayanan K, Surana S, Karp R, Stoica I. Load balancing in structured P2P systems. In:Kaashoek MF, Stoica I, eds.LNCS.Berlin:Springer-Verlag,2003.68-79.
[8]Godfrey B, Lakshminarayanan K, Surana S, Karp R, Stoica I. Load balancing in dynamic structured P2P systems.In:Kaashoek MF, Stoica I, eds.Proc.of the IEEE Infocom.2004.http://www.ieee-infocom.org/2004/Papers/46_4.pdf
[9]Zhu Y, Hu Y. Efficient, proximity-aware load balancing for DHT based P2P systems.IEEE Trans.on Parallel and Distributed Systems,2005,6(4):349-361.
[10]P.B. Godfrey and I.Stoica, "Heterogeneity and load balance in distributed hash tables," in INFOCOM 2005.24th Annual Joint Conference of the IEEE Computer and Communications Societies. Miami, FL, USA:IEEE, vol.1, pp. 596-606,2005.
[11]S.I. Mirrezaei, J. Shahparian, M. Ghodsi. A topology-aware load balancing algorithm for P2P systems. In Digital Information Management,2009. ICDIM 2009. Fourth International Conference on, PP.1-6,2009.
[12]D. Karger and M. Ruhl. New Algorithms for Load Balancing in Peer-to-Peer Systems. In Proceedings of the Fourth International Peer to Peer Symposium (IPTPS),2004.
[13]Karger D, Ruhl M. Simple efficient load balancing algorithms for peer-to-peer systems. In:Voelkerm GM, Shenker S, eds.LNCS.Berlin:Springer-Verlag, 2005.131-140.
[14]Z. Xu, L. Bhuyan. Effective load balancing in P2P systems. In:Cluster Computing and the Grid,2006. CCGRID 06. Sixth IEEE International Symposium on. Vol.1, pp.81-88,2006.
[15]Z. Li, G. Xie. A Distributed Load Balancing Algorithm for Structured P2P Systems. In:Computers and Communications,2006. ISCC'06. Proceedings.11th IEEE Symposium on. PP.417-422,2006.
[16]C.W. Chang, H.C. Hsiao. Stochastic Load Rebalancing in Distributed Hash Tables. In:Parallel and Distributed Systems (ICPADS),2011 IEEE 17th International Conference on. PP.841-846,2011.
[17]H.C. Hsiao, I.T. Lin, H. Liao. Load Balancing in Peer-to-Peer Networks Based on Sampling System States. In:Embedded and Ubiquitous Computing,2008. EUC'08. IEEE/IFIP International Conference on. Vol.1, pp.417-423,2008.
[18]D. Warneke, C. Dannewitz. Statistics-based ID management for load balancing in structured P2P networks. In:Local Computer Networks,2009. LCN 2009. IEEE 34th Conference on. Pp.273-276,2009.
[19]M.W. Akhtar, M.T. Kechadi. On the Efficiency of Dynamic Load Balancing on P2P Irregular Network Topologies. In:Parallel and Distributed Computing,2006. ISPDC'06. The Fifth International Symposium on. PP.271-280,2006.
[20]J. Sun, L. Li, H. Chen, H. Tan. A Proximity-Aware Load Balancing Algorithm in P2P Systems. In:Grid and Pervasive Computing Workshops,2008. GPC Workshops'08. The 3rd International Conference on. PP.364-369,2008.
[21]N. Kruber, M. Hogqvist, T. Schutt. The Benefits of Estimated Global Information in DHT Load Balancing.In:Cluster, Cloud and Grid Computing (CCGrid),2011 1 lth IEEE/ACM International Symposium on. PP.382-391,2011.
[22]Q.H. Vu, B.C. Ooi, M. Rinard, K.L. Tan. Histogram-based global load balancing in structured peer-to-peer systems. In:Knowledge and Data Engineering, IEEE Transactions on. Vol.21, No.4, pp.595-608,2009.
[23]Y. Lv, J. Song. A dynamic group-based load balancing approach in a DHT-P2P system. In:Pervasive Computing and Applications (ICPCA),2010 5th International Conference on. PP.213-217,2010.
[24]H. Shen, C.Z. Xu. Hash-based proximity clustering for load balancing in heterogeneous DHT networks. In:Parallel and Distributed Processing Symposium,2006. IPDPS 2006.20th International. PP.10-14,2006.
[25]D. Wu, Y. Tian, K.W. Ng. Achieving Resilient and Efficient Load Balancing in DHT-based P2P Systems.In:Local Computer Networks, Proceedings 2006 31st IEEE Conference on. PP.115-122,2006.
[26]Shen, H. and Xu, C.Z., "Locality-Aware Randomized Load Balancing Algorithms for DHT Networks," IEEE Computer Society Washington, DC, USA, 2005.
[27]Colorni A, Dorigo M, Maniezzo V, et al. Distributed optimization by ant colonies. Proceeding of the 1st European Conference on Artificial Life,1991,134-142.
[28]M. Dorigo, G. Di Caro, and L. M. Gambardella. Ant algorithms for discrete optimization. Artificial Life,5(2):137-172,1999.
[29]T. Stutzle, M. Dorigo. ACO algorithms for the traveling salesman problem. In: Evolutionary Algorithms in Engineering and Computer Science. PP.163-183, 1999.
[1]Prasanna Ganesan, Mayank Bawa, Hector Garcia-Molina. Online balancing of range-partitioned data with applications to peer-to-peer systems. In VLDB'04: Proceedings of the Thirtieth International Conference on Very Large Data Bases, pages 444-455. VLDB Endowment,2004.
[2]Min Cai, Martin Frank, Jinbo Chen, and Pedro Szekely. MAAN:A multi-attribute addressable network for grid information services. In GRID'03: Proceedings of the Fourth International Workshop on Grid Computing, page 184, Washington, DC, USA,2003. IEEE Computer Society.
[3]J. Chu, K. Labonte, and B. N. Levine, "Availability and Locality Measurements of Peer-to-Peer File Systems," in Proceedings of ITCom:Scalability and Traffi c Control in IP Networks II Conferences, July 2002.
[4]J. Ledlie and M. Seltzer. Distributed, secure load balancing with skew, heterogeneity and churn. INFOCOM 2005. Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies,2:1419-1430 vol.2, March 2005.
[5]A. Gupta, P. Dinda, and F. E. Bustamante, "Distributed popularity indices," in Proceedings of ACM SIGCOMM,2005.
[6]K. Gummadi, R. Dunn, S. Saroiu, S. Gribble, H. Levy, and J. Zahorjan, "Measurement, modeling, and analysis of a peer-to-peer file-sharing workload," in Proceedings of 19th ACM SOSPS,2003, pp.314-329.
[7]Zhu Y, Hu Y. Efficient, proximity-aware load balancing for DHT based P2P systems. IEEE Trans.on Parallel and Distributed Systems,2005,6(4):349-361.
[8]Shen, H. and Xu, C.Z., "Locality-Aware Randomized Load Balancing Algorithms for DHT Networks," IEEE Computer Society Washington, DC, USA, 2005.
[9]Godfrey B, Lakshminarayanan K, Surana S, Karp R, Stoica I. Load balancing in dynamic structured P2P systems.In:Kaashoek MF, Stoica I, eds.Proc.of the IEEE Infocom.2004.
[10]Karthik A R, Lakshminarayanan K, Surana S, et al. Load balancing in structured P2P systems. In:Kaashoek MF, Stoica I, eds.LNCS.Berlin:Springer-Verlag, 2003.68-79.
[11]S.I. Mirrezaei, J. Shahparian, M. Ghodsi. A topology-aware load balancing algorithm for P2P systems. In Digital Information Management,2009. ICDIM 2009. Fourth International Conference on, PP.1-6,2009.
[12]M.W. Akhtar, M.T. Kechadi. On the Efficiency of Dynamic Load Balancing on P2P Irregular Network Topologies. In:Parallel and Distributed Computing,2006. ISPDC'06. The Fifth International Symposium on. PP.271-280,2006.
[13]D. Wu, Y. Tian, K.W. Ng. Achieving Resilient and Efficient Load Balancing in DHT-based P2P Systems.In:Local Computer Networks, Proceedings 200631st IEEE Conference on. PP.115-122,2006.
[14]Z. Li, G. Xie. A Distributed Load Balancing Algorithm for Structured P2P Systems. In:Computers and Communications,2006. ISCC'06. Proceedings.11th IEEE Symposium on. PP.417-422,2006.
[15]P. Godfrey and I. Stoica. Heterogeneity and load balance in distributed hash tables. In:INFOCOM 2005.24th Annual Joint Conference of the IEEE Computer and Communications Societies. Vol.1, pp.596-606,2005.
[16]Karger D, Ruhl M. Simple efficient load balancing algorithms for peer-to-peer systems. In:Voelkerm GM, Shenker S, eds.LNCS.Berlin:Springer-Verlag, 2005.131-140.
[17]D. Karger, M. Ruhl. "New Algorithms for Load Balancing in Peer-to-Peer Systems". In Proceedings of the Fourth Internation Peer to Peer Symposium (IPTPS),2004.
[18]Zitzler E. Evolutionary algorithm for multiobjective optimization:Methods and application [Ph.D. Dissertation]. Zurich:Swiss Federal Institude of Technology, 1999.
[1]M. Engle, J.I. Khan. Vulnerabilities of P2P Systems and a Critical Look at their Solutions. In:http://medianet.kent.edu/technicalreports.html. Internetworking and Media Communications Research Laboratories, Department of Computer Science, Kent State University,2006.11.01.
[2]L. Ganesh, B.Y Zhao. Identity theft protection in structured overlays. In:Secure Network Protocols,2005.(NPSec).1st IEEE ICNP Workshop on. IEEE, PP. 49-54,2005.
[3]A. Singh, T. Wan, S. Dan. Eclipse Attacks on Overlay Networks:Threats and Defenses. In:IEEE INFOCOM.2006.
[4]Pankaj Kohli, Umadevi Ganugula. DDoS Attacks using P2P Networks.2007.
[5]E. Sit, R. Morris. Security considerations for peer-to-peer distribution hash tables. Peer-to-Peer Systems. Springer, pp.261-269,2002.
[6]D. Stutzbach, R. Rejaie. Understanding Churn in Peer-to-Peer Networks. In: Proceedings of the 6th ACM SIGCOMM conference on Internet measurement. PP.189-202,2006.
[7]J. Douceur. The Sybil Attack. Peer-to-Peer Systems. Springer, pp.251-260,2002.
[8]D. Cerri, A. Ghiono. ID Mapping Attacks in P2P Networks. Global Telecommunications Conference,2005. GLOBECOM'05. IEEE, vol.3, pp.5-9, 2005.
[9]L. Wang. Attacks Against Peer-to-peer Networks and Countermeasures. In:TKK T-Ⅱ0. Vol.5290,2006.
[10]Ruichuan Chen, Eng keong Lua, J. Crowcroft. Securing Peer-to-Peer Content Sharing Service from Poisoning Attacks. Peer-to-Peer Computing,2008. P2P'08. Eighth International Conference on. PP.22-29,2008.
[11]Jian Liang, Naoum Naoumov, Keith W. The Index Poisoning Attack in P2P File Sharing Systems. IEEE INFOCOM, vol.6,2006.
[12]J. Ledlie, M. Seltzer. Distributed, secure load balancing with skew, heterogeneity and churn. INFOCOM 2005, vol.2, pp.1419-1430,2005.
[13]Bruce Schneier. Attack trees:Modeling security threats. Dr. Dobb's journal, 1999.
[14]B. Mitra, S. Ghose, N. Ganguly. Effect of dynamicity on peer to peer networks. In:Proceedings of the 14th international conference on High performance computing. PP.452-463,2007.
[15]B. Mitra, S. Ghose, N. Ganguly, et al. Stability analysis of peer-to-peer networks against churn. In:Pramana. Vol.71, no.2, pp.263-273,2008.
[16]M. Brinkmeier, G. Schafer, T. Strufe. Optimally dos resistant p2p topologies for live multimedia streaming. In:Parallel and Distributed Systems, IEEE Transactions on. Vol.20, no.6, pp.831-844,2009.
[17]N. Naoumov, K. Ross. Exploiting p2p systems for ddos attacks. In Proceedings of the 1st international conference on Scalable information systems. pp.47,2006.
[18]S. Marti, H. Garcia-Molina. Taxonomy of trust:Categorizing P2P reputation systems. In:Computer Networks. Vol.50, no.4, pp.472-484,2006.
[19]Godfrey B, Lakshminarayanan K, Surana S, Karp R, Stoica I. Load balancing in dynamic structured P2P systems.In:Kaashoek MF, Stoica I, eds.Proc.of the IEEE Infocom.2004.
[20]P. Godfrey and I. Stoica. Heterogeneity and load balance in distributed hash tables. In:INFOCOM 2005.24th Annual Joint Conference of the IEEE Computer and Communications Societies. Vol.1, pp.595-606,2005.
[21]Karger D, Ruhl M. Simple efficient load balancing algorithms for peer-to-peer systems. In:Voelkerm GM, Shenker S, eds.LNCS.Berlin:Springer-Verlag, 2005.131-140.
[22]D. Karger, M. Ruhl. "New Algorithms for Load Balancing in Peer-to-Peer Systems". In Proceedings of the Fourth Internation Peer to Peer Symposium (IPTPS),2004.
[23]Zhu Y, Hu Y. Efficient, proximity-aware load balancing for DHT based P2P systems. IEEE Trans.on Parallel and Distributed Systems,2005,6(4):349-361.
[24]Shen, H. and Xu, C.Z., "Locality-Aware Randomized Load Balancing Algorithms for DHT Networks," IEEE Computer Society Washington, DC, USA, 2005.
[25]S.I. Mirrezaei, J. Shahparian, M. Ghodsi. A topology-aware load balancing algorithm for P2P systems. In Digital Information Management,2009. ICDIM 2009. Fourth International Conference on, PP.1-6,2009.
[26]D. Wu, Y. Tian, K.W. Ng. Achieving Resilient and Efficient Load Balancing in DHT-based P2P Systems. In:Local Computer Networks, Proceedings 2006 31st IEEE Conference on. PP.115-122,2006.
[27]Li L, Zhang C, Wang Y. Reliable and Scalable DHT-Based SIP Server Farm. In: IEEE GLOBECOM. IEEE Global Telecommunications Conference. PP.1-6, 2008.
[28]Matuszewski M, Garcia-Martin M.A. A Distributed IP Multimedia Subsystem (IMS). In:IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks. PP.1-8,2007.
[29]Pappas V, Massey D, Terzis A. A Comparative Study of the DNS Design with DHT-Based Alternatives. In:Proc. INFOCOM.2006.
[30]Freedman M.J, Freudenthal E, Mazieres D. Democratizing Content Publication with Coral. In:Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation. Vol.1, pp.18-18,2004.
[31]赵洋,王忠仁.SSLv3/TLS网络安全协议的研究与实现.电子科技大学.2004.
[32]S. Rafaeli, D. Hutchison. A Survey of Key Management for Secure Group Communication. ACM Computing Surveys. Vol.35(3), pp.309-329,2003.