P2P系统性能优化若干关键技术研究
|
摘要
P2P (Peer-to-Peer)系统为充分利用网络边缘的计算资源提供了一个理想的架构,在内容共享、信息检索、即时通信、协作计算等诸多领域得到广泛应用,被看作是影响因特网未来的重要科技之一。P2P网络对等端的自治性和开放性使得P2P系统更难以进行有效的安全控制,设计工具来简化安全P2P系统的开发部署、提高P2P网络的可监管性,有利于推动P2P系统的进一步发展；P2P流量已经占据互联网最主要的部分,大量的P2P流量给承载网带来了巨大的冲击,严重影响到其他互联网应用的服务质量,优化P2P流量有利于提高承载网带宽的利用率；内容分发速度是P2P系统最重要的性能指标之一,提高分发速度和公平合理性有利于进一步满足P2P的用户体验；高效的P2P应用程序需要用到多进程、多线程等并发技术,先进并发控制方法的研究有利于保障P2P系统的并发性能。基于上述目的,本文从宏观架构到实现细节对P2P系统性能优化若干关键技术展开研究,论文的主要工作包括以下内容：
1.设计了面向P2P的安全服务平台POSSP,以简化安全可控的P2P系统的开发部署。平台包含控制中心覆盖网、跟踪服务覆盖网和共享服务器集群等三个部分,基于分布式散列表技术组织控制中心和跟踪服务覆盖网,基于Web Services提供基本的P2P服务和高级的安全控制功能。新的P2P应用可以在平台上自由的创建,支持快速难以抵赖的对称加密通信,定性分析表明POSSP能够简化安全P2P系统的开发,有效的防止恶意节点、抵抗Dos攻击、实现监管。
2.提出了基于遗传算法的协作缓存转发策略,以优化资源利用,提高P2P整体分发性能、减少P2P网络带宽消耗。首先采用不同网络之间相互转发、就近获取数据的分发机制有效的降低了P2P流量。然后,得出协作缓存转发的多目标约束优化数学模型,指出了相应优化算法的要求,分别设计了单目标遗传算法SOGA和多目标非劣遗传算法NSBGA来求解。NSBGA针对协作缓存转发模型定制了初始化策略和遗传操作算子,比原有多目标约束优化算法有着更好的性能。通过仿真实验做了相关验证分析。
3.提出了状态位置感知的运营商协作P2P流量优化方案SLAOC,以加快内容分发速度、减少P2P跨域流量。SLAOC引入传感器防火墙实现P2P应用的注册分类,有利于实现运营、鼓励P2P用户参与。提出了基于传感器防火墙的距离测算方法,通过拥塞折算算法实现了综合位置和网络连接状态的通信代价评估,信息跟踪服务器基于分布式散列表组成覆盖网为P2P应用提供标准的通信代价查询Web服务。面向Bittorrent,改进了Tracker节点选择、Peer节点选择和上传下载控制等算法,改进算法对流量优化具有通用性。仿真实验表明SLAOC能够在加快P2P用户下载的同时降低跨域流量、自动的对网络拥塞做出减少P2P流量的响应,实现了网络运营商和P2P用户的双赢。
4.从实例出发,系统的定义了并发计算重复问题(CCRP),传统的并发控制方法难以直接消除因并发而导致的计算重复,重复会影响系统的性能。给出了CCRP相关性能指标和判断方法,基于生产者/消费者模型提出了通用并发重复控制机制。给出了单条件、条件交叉两个重复控制算法,算法具有不同的适用范围,都可以作为固定模式来解决CCRP,基于Petri网做了相关性质的证明与仿真。并发程序实验验证了并发重复控制的必要性、有效性和适应范围。该研究基于一般的并发程序进行讨论,所得结论对于数据竞争检测、并发程序设计具有普遍的参考价值。
P2P (Peer-to-Peer) system provides an ideal framework for fully utilizing the network edge computing resources. It has been widely used in many fields including content sharing, information retrieval, instant messaging, collaborative computing, and has been regarded as one of the most important technologies affecting the future of the Internet. The autonomy and openness of P2P networks makes it more difficult to carry out effective security controls, so disignning tools to simplify development and deployment of P2P systems can help to improve monitoring of P2P networks and promote the further development of P2P systems. P2P traffic has occupied the main part of the Internet and a large number of P2P traffic impacts the bearer network very much which affects the quality of services of other Internet applications seriously. Optimization of P2P traffic will help improve the bearer network bandwidth utilization. The speed of P2P systems distributing data is one of the most important indicators of performance, and improving the speed and fairness of distribution can service P2P customers better. In order to improve the performance of P2P application, such concurrent technologies as multi-process and multi-thread are needed. The advanced concurrency control method will help protect the concurrent performance of P2P systems. For these above purposes, several key performance optimization technologies for P2P systems have been studed in this dissertation, from macro framework to the implementation details. The contributions are as follows:
First, the P2P Oriented Security Service Platform (POSSP) is designed to simplify the development and deployment of the secure P2P systems. The platform consists of three partition including network control center, tracker overlay network and the shared server cluster, the overlay networks of control center and tracker are organized on distributed hash table technology, and the functions of P2P basic services and advanced security are provided in web services. The new P2P applications can be deployed on the platform freely and the fast non-repudiation of the symmetric encryption communication are supported in POSSP. The qualitative analysis shows that POSSP can simplify the development of the safe P2P systems and prevent malicious nodes, resist Dos attack, realize supervision effectively.
Second, the genetic algorithm based cooperative relay strategy is proposed to optimize resource utilization, improve the global distribution performance, and reduce the network bandwidth consumption of P2P. Firstly the data distribution mechanism of cooperatively relaying between different networks and fetching the data as near as possible reduces the P2P traffic effectively. Then, the constrained multi-objective model of cooperative relay is derived and the optimization algorithms' requirements are also proposed. The single objective genetic algorithm (SOGA) and the multi-objective non-dominated genetic algorithm (NSBGA) are designed. With respect to the model of cooperative relay, NSBGA customizes the initialize policy and genetic operators, which has better performance than the original multi-objective constrained optimization algorithm. The performances are verified and analyzed in the simulation.
Third, a P2P traffic optimization schema of Status and Locality Aware Operator Cooperative (SLAOC) is proposed to speedup data distribution and reduce P2P transit traffic. The sensor firewall is designed in SLAOC, which can help to realize the P2P registration and classification, so it helps to implete operation and encourage P2P users to participate SLAOC. The sensor firewall based distance calculation method is proposed, using congestion conversion algorithm the communication cost evaluation integerates the location and network connection status, and the trackers, which are constructed to an overlay network based on the distributed hash table, provides standard web services for the P2P communication cost query. The tracker node selection, peer node selection and the uploading and downloading control algorithms of Bittorrent are improved, and the improved algorithms can be used in other traffic optimization architectures. The simulation results show SLAOC can speed up peers' downloading and reduce inter-domain traffic, and respond to network congestion automatically. A win-win case is achieved in operators and P2P users.
Finally, starting from the examples, the Concurrent Computation Redundancy Problem (CCRP) is defined systematicly. The traditional concurrent control methods can not directly avoid duplicate computing which may decrease the concurrent performance. The related performance index and judging methods are given, and the general concurrent redundancy control mechanism is designed based on Producer/Consumer model. The single condition and cross condition redundancy control algorithms have different application scopes and can be used as fixed patterns to solve CCRP. Relative property proofs and simulations are given based on Petri net. The concurrent program experiments show the concurrent redundancy control is necessary and efficient. Two control algorithms are compared in the experiments. The research is discussed on the general concurrent program and so the conclusions have universal reference value for the data race detection and concurrent programming.
1.设计了面向P2P的安全服务平台POSSP,以简化安全可控的P2P系统的开发部署。平台包含控制中心覆盖网、跟踪服务覆盖网和共享服务器集群等三个部分,基于分布式散列表技术组织控制中心和跟踪服务覆盖网,基于Web Services提供基本的P2P服务和高级的安全控制功能。新的P2P应用可以在平台上自由的创建,支持快速难以抵赖的对称加密通信,定性分析表明POSSP能够简化安全P2P系统的开发,有效的防止恶意节点、抵抗Dos攻击、实现监管。
2.提出了基于遗传算法的协作缓存转发策略,以优化资源利用,提高P2P整体分发性能、减少P2P网络带宽消耗。首先采用不同网络之间相互转发、就近获取数据的分发机制有效的降低了P2P流量。然后,得出协作缓存转发的多目标约束优化数学模型,指出了相应优化算法的要求,分别设计了单目标遗传算法SOGA和多目标非劣遗传算法NSBGA来求解。NSBGA针对协作缓存转发模型定制了初始化策略和遗传操作算子,比原有多目标约束优化算法有着更好的性能。通过仿真实验做了相关验证分析。
3.提出了状态位置感知的运营商协作P2P流量优化方案SLAOC,以加快内容分发速度、减少P2P跨域流量。SLAOC引入传感器防火墙实现P2P应用的注册分类,有利于实现运营、鼓励P2P用户参与。提出了基于传感器防火墙的距离测算方法,通过拥塞折算算法实现了综合位置和网络连接状态的通信代价评估,信息跟踪服务器基于分布式散列表组成覆盖网为P2P应用提供标准的通信代价查询Web服务。面向Bittorrent,改进了Tracker节点选择、Peer节点选择和上传下载控制等算法,改进算法对流量优化具有通用性。仿真实验表明SLAOC能够在加快P2P用户下载的同时降低跨域流量、自动的对网络拥塞做出减少P2P流量的响应,实现了网络运营商和P2P用户的双赢。
4.从实例出发,系统的定义了并发计算重复问题(CCRP),传统的并发控制方法难以直接消除因并发而导致的计算重复,重复会影响系统的性能。给出了CCRP相关性能指标和判断方法,基于生产者/消费者模型提出了通用并发重复控制机制。给出了单条件、条件交叉两个重复控制算法,算法具有不同的适用范围,都可以作为固定模式来解决CCRP,基于Petri网做了相关性质的证明与仿真。并发程序实验验证了并发重复控制的必要性、有效性和适应范围。该研究基于一般的并发程序进行讨论,所得结论对于数据竞争检测、并发程序设计具有普遍的参考价值。
P2P (Peer-to-Peer) system provides an ideal framework for fully utilizing the network edge computing resources. It has been widely used in many fields including content sharing, information retrieval, instant messaging, collaborative computing, and has been regarded as one of the most important technologies affecting the future of the Internet. The autonomy and openness of P2P networks makes it more difficult to carry out effective security controls, so disignning tools to simplify development and deployment of P2P systems can help to improve monitoring of P2P networks and promote the further development of P2P systems. P2P traffic has occupied the main part of the Internet and a large number of P2P traffic impacts the bearer network very much which affects the quality of services of other Internet applications seriously. Optimization of P2P traffic will help improve the bearer network bandwidth utilization. The speed of P2P systems distributing data is one of the most important indicators of performance, and improving the speed and fairness of distribution can service P2P customers better. In order to improve the performance of P2P application, such concurrent technologies as multi-process and multi-thread are needed. The advanced concurrency control method will help protect the concurrent performance of P2P systems. For these above purposes, several key performance optimization technologies for P2P systems have been studed in this dissertation, from macro framework to the implementation details. The contributions are as follows:
First, the P2P Oriented Security Service Platform (POSSP) is designed to simplify the development and deployment of the secure P2P systems. The platform consists of three partition including network control center, tracker overlay network and the shared server cluster, the overlay networks of control center and tracker are organized on distributed hash table technology, and the functions of P2P basic services and advanced security are provided in web services. The new P2P applications can be deployed on the platform freely and the fast non-repudiation of the symmetric encryption communication are supported in POSSP. The qualitative analysis shows that POSSP can simplify the development of the safe P2P systems and prevent malicious nodes, resist Dos attack, realize supervision effectively.
Second, the genetic algorithm based cooperative relay strategy is proposed to optimize resource utilization, improve the global distribution performance, and reduce the network bandwidth consumption of P2P. Firstly the data distribution mechanism of cooperatively relaying between different networks and fetching the data as near as possible reduces the P2P traffic effectively. Then, the constrained multi-objective model of cooperative relay is derived and the optimization algorithms' requirements are also proposed. The single objective genetic algorithm (SOGA) and the multi-objective non-dominated genetic algorithm (NSBGA) are designed. With respect to the model of cooperative relay, NSBGA customizes the initialize policy and genetic operators, which has better performance than the original multi-objective constrained optimization algorithm. The performances are verified and analyzed in the simulation.
Third, a P2P traffic optimization schema of Status and Locality Aware Operator Cooperative (SLAOC) is proposed to speedup data distribution and reduce P2P transit traffic. The sensor firewall is designed in SLAOC, which can help to realize the P2P registration and classification, so it helps to implete operation and encourage P2P users to participate SLAOC. The sensor firewall based distance calculation method is proposed, using congestion conversion algorithm the communication cost evaluation integerates the location and network connection status, and the trackers, which are constructed to an overlay network based on the distributed hash table, provides standard web services for the P2P communication cost query. The tracker node selection, peer node selection and the uploading and downloading control algorithms of Bittorrent are improved, and the improved algorithms can be used in other traffic optimization architectures. The simulation results show SLAOC can speed up peers' downloading and reduce inter-domain traffic, and respond to network congestion automatically. A win-win case is achieved in operators and P2P users.
Finally, starting from the examples, the Concurrent Computation Redundancy Problem (CCRP) is defined systematicly. The traditional concurrent control methods can not directly avoid duplicate computing which may decrease the concurrent performance. The related performance index and judging methods are given, and the general concurrent redundancy control mechanism is designed based on Producer/Consumer model. The single condition and cross condition redundancy control algorithms have different application scopes and can be used as fixed patterns to solve CCRP. Relative property proofs and simulations are given based on Petri net. The concurrent program experiments show the concurrent redundancy control is necessary and efficient. Two control algorithms are compared in the experiments. The research is discussed on the general concurrent program and so the conclusions have universal reference value for the data race detection and concurrent programming.
引文
[1]王菁.P2P系统中资源管理机制的研究[学位论文]中国科学技术大学.合肥,安徽.博士.2007
[2]Napsterwebsite. http//:www.napster.com.1999
[3]迅雷主页http://www.xunlei.com/.
[4]BitTorrent. http://www.bittorrent.com/.
[5]Skype Homepage, http://www.skype.com.
[6]SETI@home. http://setiathome.berkeley.edu.
[7]ipoque. http://www.ipoque.com/
[8]H.Schulze, K.Mochalski. Internet Study 2008/2009. https://portal.ipoque.com /downloads/index/get/id/265/,2009
[9]中国互联网网络安全报告(2008年上半年)http://www.cert.org.cn/ UserFiles/File/CISR2008fh.pdf
[10]K.Deb, A.Pratap, S.Agarwal, etc. A Fast and Elitist Multiobjective Genetic Algorithm:NSGA-Ⅱ. IEEE Transactions on evolutionary computation,2002,6(2): 182-197.
[1]A.Oram. Peer-to-Peer:Harnessing the Power of Disruptive Technologies. Sebastopol, CA, USA:O'Reilly & Associates,2001.
[2]R.Steinmetz,K.Wehrle. Peer-Peer-Networking &-Computing". Informatik Spektrum,2004,27(1):51-54.
[3]R.Schollmeier. A definition of Peer-to-Peer networking for the classifieation of Peer-to-Peer architectures and applieations. In:Proceedings of the 1st International Conference on Peer-to-Peer Computing(P2P'01), eLinkoPing, Sweden,2001: 101-102.
[4]RL.Graham. Towards a definition. In:Proceedings of the 1st International Conference on Peer-to-Peer Computing(P2P'01), eLinkoPing, Sweden,2001: 101-102.
[5]K.Aberer,M.Hauswirth.Peer-to-Peer information systems:Concepts and models,state-of-the-art,and future systems. In:Proceedings of the 18th International Conference on Data Engineering (ICDE'02), San Jose, CA, USA,2002:Tutorial Slides.
[6]C.Shirky.What is p2p? And what isn't? http://www.openp2p.com/pub/alp2p/2000/11/24 /shirkyl- whatisp2p.html,2001.
[7]DS.Milojicic, V.Kalogeraki, RM.Lukose. Peer-to-Peer computing. Technical report, Hewlett Packard Company,2002
[8]R.Steinmetz,K.Wehrle. Peer-to-Peer Systems and Applications:Lecture Notes in Computer Science, Springer,2005.
[9]王菁.P2P系统中资源管理机制的研究[学位论文].中国科学技术大学.合肥,安徽.博士.2007
[10]B.Amento, L.Terveen, W.Hill. From Usenet to CoWebs:Interacting with social information spaces. From Usenet to CoWebs, C. Lueg and D. Fisher, Eds. London, UK:Springer-Verlag,2003:54-85.
[11]Randy Bush. FidoNet:technology, tools, and history Communications of the ACM,1993,36(8):31-35.
[12]Napsterwebsite. http//:www.napster.com.1999
[13]gnutella forums. http://www.gnutellaforums.com/.
[14]Matei Ripeanu, Adriana Iamnitchi, Ian Foster. Mapping the Gnutella network. IEEE Internet Computing,2002,6(1):50-57.
[15]KazaA. http://www.kazaa.com/.
[16]BitTorrent. http://www.bittorrent.com/.
[17]Skype Homepage. http://www.skype.com.
[18]I.Stoica, R.Morrist, D.L.Nowell, et al. Chord:A scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Transactions on Networking, 2003,11(1):17-32.
[19]Zhao B. Y., Huang, L., Stribling, J., et al. Tapestry:A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 2004,22(1):41-53.
[20]A.Rowstron, P.Druschel,. Pastry:scalable, decentralized object location and routing for large-scale peer-to-peer systems. In:18th IFIP/ACM Conference on Distributed Systems Platforms, Heidelberg (D),2001:86-94.
[21]S.Ratnasamy, P.Francis, M.Handley, et al. A scalable content-addressable network. In, San Diego, CA, United states,2001:161-172.
[22]P.Maymounkov, D,.Mazieres. Kademlia:A Peer-to-peer Information System Based on the XOR Metric. In:Proceedings of the 1st International Workshop on Peer-to-peer Systems, MIT,2002
[23]蒋海,李军,李忠诚.混合内容分发网络及其性能分析模型.计算机学报,2009,32(3)：473-482.
[24]Sen, S.,Wang, J. Analyzing peer-to-peer traffic across large networks. IEEE/Acm Transactions on Networking,2004,12(2):219-232.
[25]Xiong, L.,Liu, L. PeerTrust:Supporting reputation-based trust for peer-to-peer electronic communities. IEEE Transactions on Knowledge and Data Engineering, 2004,16(7):843-857.
[26]Hei, X. J., Liang, C., Liang, J., et al. A measurement study of a large-scale P2P IPTV system. IEEE Transactions on Multimedia,2007,9(8):1672-1687.
[27]罗建光,张萌,赵黎等.基于P2P网络的大规模视频直播系统.软件学报,2007,18(2)：391-399.
[28]张宇翔,杨冬,张宏科.P2P网络中Churn问题研究.软件学报,2009,20(5)： 1362-1376.
[29]Maze主页http://maze.tianwang.com/.
[30]张萌.对等网络流媒体直播调度策略研究[学位论文]清华大学.北京.博士2008
[31]迅雷主页,"http://www.xunlei.com/.
[32]腾讯http://www.qq.com/.
[33]PPLive. http://www.pplive.com.
[34]K.Deb. Multi-Objective Optimization Using Evolutionary Algorithms. Chicester, UK:John Wiley&Son,2001.
[35]E.Zitzler, L.Thiele. Multi objective Evolutionary Algorithms:A ComParative Case Study and the Strength Pareto Approach. IEEE Transactions on Evolutionary Computation,1999,3(4):257-271.
[36]Coello, A.Carlos. Theoretical and numerical constraint-handling techniques used with evolutionary algorithms:A survey of the state of the art. Computer Methods in Applied Mechanics and Engineering,2002,191(11-12):1245-1287.
[37]L.Davis. Handbook of Genetic Algorithms. New York:Van Nostrand Reinhold, 1991.
[38]Z.Michalewicz. Genetic Algorithms+ Data Structures=Evolution Programs, second ed. Berlin:Springer,1992.
[39]L.A.Zadeh. Optimality and non scalar-valued performance criteria. IEEE transactions on Automatic Control,1963,8(1):59-60.
[40]A.M.Geoffrion. Proper efficiency and the theory of vector optimization. Journal of Mathematical Analysis and Application,1968,41:491-502.
[41]Y.Y.Haimes, L.S.Lasdon, D.A.Wismer. On a bicriterion formulation of the problems of integrated systems identification and system optimization. IEEE Transactions on System,Man,Cybernetics,1971,1(3):296-297.
[42]H.P.Benson. Existence of efficient solutions for vector maximization problems. Journal of Optimization Theory and Applications,1978,26(4):569-580.
[43]A.Chames, W.W.Cooper, R.O.Ferguson. Optimal estimation of executive compensation by linear programming. Management Science,1955,1(2):138-151.
[44]R.S.Rosenberg. Simulation of genetic population with biochemical properties[Dissertation] University of Michigan.Michigan.Ph.D.1967
[45]J.D.Shaffer. Multiple Objective Optimization with Vector Evaluated Genetic Algorithms[Dissertation] Vanderbilt University.1984
[46]C.M.Fonseca,P.J.Fleming. Genetic algorithms for multiobjective optimization: formulation, discussion and generation. In:Proceedings of the 5th International Conference on Genetic Algorithms, San Mateo, California,1993:416-423.
[47]J.Horn, N.Nafpliotis, "Multiobjective optimization using the niched Pareto genetic algorithm," University of Illinois at Urbana-Champaign, Urbana, Illinois, USA 1993.
[48]N.Srinivas,K.Deb. Multiobjective optimization using nondominated sorting in genetic algorithms. Evolutionary Computation,1994,2(3):221-248.
[49]Deb, Kalyanmoy, Pratap, Amrit, Agarwal, Sameer, et al. A Fast and Elitist Multiobjective Genetic Algorithm:NSGA-Ⅱ. IEEE Transactions on Evolutionary Computation,2002,6(2):182-197.
[50]E.Zitzler,LThiele. Multiobjective optimization using evolutionary algorithms-a comparative case study. In:Parallel Problem Solving from Nature, Berlin, Germany, 1998:292-301.
[51]J.Knowles,D.Corne. The Pareto archived evolution strategy:A new baseline algorithm for multiobjective optimization. In:Proceedings of the 1999 Congress on Evolutionary Computation, Washington DC,1999:98-105.
[52]T.M. Chan,. K.F..Man, S.Kwong.,etc A jumping gene paradigm for evolutionary multiobjective optimization. IEEE Transactions on Evolutionary Computation,2008,12(2):143-159.
[53]谢涛,陈火旺,康立山.多目标优化的演化算法.计算机学报,2003,26(8)：997-1003.
[54]曾三友,魏巍,康立山等.基于正交设计的多目标演化算法.计算机学报,2005,28(7)：1153-1162.
[55]赵曙光,焦李成,王宇平等.基于均匀设计的多目标自适应遗传算法及应用.电子学报,2004,32(10)：1723-1725,1729.
[56]郑金华,蒋浩,邝达等.用擂台赛法则构造多目标Pareto最优解集的方法.软件学报,2007,18(6)：1287-1297.
[57]郑金华,史忠植,谢勇.基于聚类的快速多目标遗传算法.计算机研究与发展,2004,41(7)：1081-1087.
[58]A.Rosenfel. Digital Picture Processi ng. New York:Academic Press,1976.
[59]M.Srinivas, L. M Patnaik. Genetic algorithms:a survey. Computer,1994,27(6): 17-26.
[60]周明,孙树栋.遗传算法原理及应用.北京：国防工业出版社,1996.
[61]王小平,曹立明.遗传算法—理论、应用与软件实现.西安：西安交通大学出版社,2002.
[62]G. A.Vignaux, Z.Michalewicz. A genetic algorithm for the linear transportation problem. IEEE Transactions on Systems, Man and Cybernetics,1991,21(2):445-452.
[63]崔逊学,林闯.基于多目标遗传算法的多播服务质量路由优化.计算机研究与发展,2004,41(7)：1144-1150.
[64]彭伟,卢锡城.一种函数优化问题的混合遗传算法.软件学报,1999,10(8)：819-823.
[65]张成文.基于遗传算法的具有全局QoS限制的Web服务选择[学位论文]北京邮电大学.北京.博士论文.2007
[66]袁崇义Petri网原理与应用.北京：电子工业出版社,2005
[67]Joachim Wehler. Petri Nets.http://www.pst.ifi.lmu.de/personen/wehler/,1999
[68]Wolfgang Reisig. Elements of Distributed Algorithms:Modeling and Analysis with Petri Nets. Springer-Verlag,1998
[69]Home of Fundamental Modeling Concepts, http://www.fmc-modeling.org/
[1]Justin Smith. Harness The Power Of P2P Communication In Windows Vista And WCF, "http://msdn.microsoft.com/en-us/magazine/cc188685.aspx".
[2]Daniel Brookshier, Darren Govoni, Navaneeth Krishnan, et al. JXTA:Java P2P Programming,Indianapolis, IN USA:Sams,2002.
[3]OpenSSL home page."http://www.openssl.org/".
[4]Cheng Bo, Zhang Yang, Lin Xiangtao, et al. Design of services-orientated multimedia conference process management. In:Proceedings of the International Conference on Computer Science and Information Technology (ICCSIT 2008), Singapore, Singapore,2008:915-922.
[5]Antony Rowstron, Peter Druschel. Pastry:scalable, decentralized object location and routing for large-scale peer-to-peer systems. In:18th IFIP/ACM Conference on Distributed Systems Platforms, Heidelberg(D),2001:86-94.
[6]Sylvia Ratnasamy, Paul Francis,Mark Handley, et al. A scalable content-addressable network. In:ACM SIGCOMM 2001, San Diego, CA, United states,2001:161-172.
[7]gSoap Toolkit."http://gsoap2.sourceforge.net/".
[8]Jiang, Shou-Xu,Li, Jian-Zhong. Reputation-based trust mechanism for P2P e-commerce systems. Ruan Jian Xue Bao/Journal of Software,2007,18(10): 2551-2563.
[9]Wang Yong, YangHui-Hua, Wang Xing-Yu, et al. Intrusion detection experimental system using evolutionary neural network. Huadong Ligong Daxue Xuebao/Journal of East China University of Science and Technology,2005,31(3):362-366.
[10]阎平凡,张长水.人工神经网络与模拟进化计算.北京：清华大学出版社,2000.
[11]张学工.关于统计学习理论与支持向量机.自动化学报,2000,26(1)：32-42.
[12]Srinivas, M.,Patnaik, L. M. Genetic algorithms:a survey. Computer,1994,27(6): 17-26.
[13]Ion Stoica, Robert Morris, Liben-Nowell, David, et al. Chord:A scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Transactions on Networking,2003,11(1):17-32.
[14]J.Byers, J.Considine, M.Mitzenmacher, Simple load balancing for distributed hash tables. Peer-to-Peer Systems Ii,2003,2735:80-87.
[15]Y.Azar, J.Naor, R. Rom, The Competitiveness of Online Assignments. Journal of Algorithms,1995,18(2):221-237.
[16]Simon Rieche, Leo Petrak, Klaus Wehrle,. A thermal-dissipation-based approach for balancing data load in distributed hash tables. In, Tampa, FL, United states,2004: 15-23.
[17]JXTA home page. "https://jxta.dev.java.net/".
[18]Joan Arnedo-Moreno, Jordi Herrera-Joancomarti. Persistent interoperable security for JXTA advertisements. In:2nd International Conference on Complex, Intelligent and Software Intensive Systems(CISIS 2008), Barcelona, Spain,2008: 354-359.
[19]Microsoft.Deploying Groove Server 2007 and Groove 2007 at Microsoft. http://msdn.microsoft.com/en-us/bb735162.aspx,2007.
[20]Kuz, Ihor,Steen, Maarten van, cP2Pc:Integrating P2P networks, "http://www.cs.vu.nl/pub/globe/cp2pc/".
[21]Gabor Paller, Heikki Kokkinen. Modular, service-oriented API for peer-to-peer middleware In:Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (ICST 2008), Rue Godecharle,41 Brussels Belgium 2008
[22]libTorrent Homepage."http://libtorrent.rakshasa.no/".
[1]Schulze, Hendrik,Mochalski, Klaus. Internet Study 2008/2009. https.//portal.ipoque.com/downloads/index/get/id/265/,2009
[2]"http://www.joltid.com/index.php/peercache/".2009.
[3]Dan, Gyorgy. Cooperative Caching and Relaying Strategies for Peer-to-peer Content Delivery. The 7th International Workshop on Peer-to-Peer Systems (IPTPS '08), Tampa Bay, Florida,2008
[4]Shen, Guobin, Wang, Ye, Xiong, Yongqiang, et al. HPTP:Relieving the tension between ISPs and P2P. The 6th International Workshop on Peer-to-Peer Systems (IPTPS'07), Bellevue, WA, USA,2007
[5]Aggarwal, V., O.Akonjang, A.Feldmann. Improving user and ISP experience through ISP-aided P2P locality. IEEE Infocomm 2008, Phoenix, AZ, USA,2008:1-6.
[6]Srinivas, M.,Patnaik, L. M. Genetic algorithms:a survey. Computer,1994,27(6): 17-26.
[7]Dykes, Sandra G.,Robbins, Kay A. A viability analysis of cooperative proxy caching. IEEE INFOCOM, Washington, D.C.,2001:1205-1214.
[8]Padmanabhan, Venkata N., Wang, Helen J., Chou, Philip A., et al. Distributing Streaming Media Content Using Cooperative Networking. NOSSDAV02, Miami Beach, FL, USA,2002
[9]Kumar, Rakesh. Measurement, Modeling and Economics of P2P Systems. Polytechnic University.New York, USA.PHD.2006
[10]Qiu, Dongyu,R., Srikant Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks. ACM SIGCOMM 2004, Portland, OR, USA,2004
[11]Clevenot, F., Nain, P., Ross, K.W. Multiclass p2p networks:Static resource allocation for service differentiation and bandwidth for service differentiation and bandwidth diversity Performance 2005 2005,62(1-4):32-49.
[12]Deb, Kalyanmoy, Pratap, Amrit, Agarwal, Sameer, et al. A Fast and Elitist Multiobjective Genetic Algorithm:NSGA-Ⅱ. IEEE transactions on evolutionary computation,2002,6(2):182-197.
[13]Favuzza, S., Ippolito, M. G., Sanseverino, E. R. Crowded comparison operators for constraints handling in NSGA-Ⅱ for optimal design of the compensation system in electrical distribution networks. Advanced Engineering Informatics,2006,20: 201-211.
[14]Kumar, Y., Das, B., Sharma, J. Service restoration in distribution system using non-dominated sorting genetic algorithm. Electric ower Syst. Res.,2006,76:768-777.
[15]Deb, K., Mitra, K., Dewri, R., et al. Towards a better understanding of the epoxy-polymerization process using multiobjective evolutionary computation. Chemical engineering science 2004,59:4261-4277.
[16]Akamai."http://www.akamai.com/".
[17]Cachelogic. "http://www.cachelogic.com/".
[18]ChinaCache. "http://www.chinacache.com/".
[1]"http://www.bittorrent.com/".
[2]"http://gnutella.wego.com/".
[3]Ivana Podnar, Martin Rajman, Toan Luu, et al. Beyond term indexing:A P2P framework for web information retrieval. Informatica (Ljubljana),2006,30(2): 153-161.
[4]凌波陆志国黄维雄等PeerlS:基于Peer-to-Pee(?)的信息检索系统[J].软件学报,2004,15(9)：1375-1384.
[5]Skype. "http://www.skyp.com/"
[6]Anderson, David P., Cobb, Jeff, Korpela, Eric, et al. SETI@home:An Experiment in Public-Resource Computing. Communications of the ACM, 2002,45(11):56-61.
[7]Hendrik Schulze, Klaus Mochalski. Internet Study 2008/2009. https://portal.ipoque.com/downloads/index/get/id/265/,2009
[8]王姣.基于行为的P2P流量及异常流量检测技术研究[学位论文].北京邮电大学.北京.博士论文.2008.
[9]Karagiannis, Thomas, Rodriguez, Pablo, Papagiannaki, Konstantina. Should internet service providers fear peer-assisted content distribution? In:Internet Measurement Conference 2005, Berkeley, CA,2005
[10]Xie, Haiyong, Yang, Y. Richard, Krishnamurthy, Arvind, et al. P4p:Provider portal for applications. In, Seattle, WA, United states,2008:351-362.
[11]Stoica, Ion, Morris, Robert, Liben-Nowell, David, et al. Chord:A scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Transactions on Networking,2003,11(1):17-32.
[12]Rowstron, Antony,Druschel, Peter. Pastry:scalable, decentralized object location and routing for large-scale peer-to-peer systems. In:18th IFIP/ACM Conference on Distributed Systems Platforms, Heidelberg (D),2001:86-94.
[13]Ratnasamy, Sylvia, Francis, Paul, Handley, Mark, et al. A scalable content-addressable network. In:ACM SIGCOMM 2001, San Diego, CA, United states,2001:161-172.
[14]Ratnasamy, Sylvia, Francis, Paul, Handley, Mark, et al. A scalable content-addressable network. In, San Diego, CA, United states,2001:161-172.
[15]Dana, Chris, Li, Danjue, Harrison, David, et al. BASS:BitTorrent assisted streaming system for video-on-demand. In, Shanghai, China,2006
[16]Vlavianos, Aggelos, Iliofotou, Marios, Faloutsos, Michalis. BiToS:Enhancing BitTorrent for supporting streaming applications. In, Barcelona, Spain,2006
[17]Bindal, Ruchir, Cao, Pei, Chan, William, et al. Improving traffic locality in BitTorrent via biased neighbor selection. In, Lisboa, Portugal,2006
[18]Liu, Bo, Cui, Yi, Lu, Yansheng, et al. Locality-awareness in BitTorrent-like P2P applications. IEEE Transactions on Multimedia,2009,11(3):361-371.
[19]Aggarwal, Vinay, Feldmann, Anja, Scheideler, Christian. Can ISPs and P2P Users Cooperate for Improved Performance? ACM SIGCOMM Computer Communication Review,2007,37(3):29-40.
[20]Yang, Weishuai,Abu-Ghazaleh, Nael. GPS:A general peer-to-peer simulator and its use for modeling BitTorrent. In, Atlanta, GA, United states,2005:425-432.
[21]Zegura, Ellen W., Calvert, Ken, Bhattacharjee., S. How to Model an Internetwork. In:IEEE Infocom '96, San Francisco, CA,1996
[22]Ratnasamy, Sylvia, Handley, Mark, Karp, Richard, et al. Application-level multicast using content-addressable networks. In:the 3rd International COST264 Workshop on Networked Group Communication (NGC),2001:14-29.
[23]Castro, Miguel, Druschel, Peter, Kermarrec, Anne-Marie, et al. Scribe:A large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications,2002,20(8):1489-1499.
[24]Dan, Gyorgy. Cooperative Caching and Relaying Strategies for Peer-to-peer Content Delivery. In:The 7th International Workshop on Peer-to-Peer Systems (IPTPS '08), Tampa Bay, Florida,2008
[25]Cai, H. L., Jun, W., Dong, L., et al. A novel state cache scheme in structured P2P systems. Journal of Parallel and Distributed Computing,2005,65(2):154-168.
[26]Horovitz, Shay,Dolev, Danny. LiteLoad:Content unaware routing for localizing P2P protocols. In, Miami, FL, United states,2008:IEEE Computer Society Technical Committee on Parallel Processing.
[27]Seedorf, Jan, Kiesel, Sebastian, Stiemerling, Martin. Traffic localization for P2P-applications: The ALTO approach. In, Seattle, WA, United states,2009:171-177.
[28]Cymru, "http://www.cymru.com."
[1]"http://www.bittorrent.com/".
[2]迅雷主页, "http://www.xunlei.com/."
[3]http://www.pptv.com/.
[4]Lee, Edward A. The problem with threads. Computer,2006,39(5):33-42.
[5]章隆兵,张福新,吴少刚等.基于锁集合的动态数据竞争检测方法.计算机学报,2003,26(10)：1217-1223.
[6]富浩,蔡铭,董金祥等.基于锁集合算法的增强型数据竞争检测方法.浙江大学学报：工学版,2009,43(2)：328-333.
[7]Marino, Daniel, Musuvathi, Madanlal, Narayanasamy, Satish. LiteRace:Effective sampling for lightweight data-race detection. ACM SIGPLAN Notices,2009,44(6): 134-143.
[8]Li, Xiaoou, Medina, Joselito M., Chapa, Sergio V. Applying Petri nets in active database systems. IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews,2007,37(4):482-493.
[9]Zeng, Qing-Tian. Behavior descriptions of structure-complex Petri nets based on synchronous composition. Ruan Jian Xue Bao/Journal of Software,2004,15(3): 327-337.
[10]Yamaguchi, Hirozumi, El-Fakih, Khaled, Bochmann, Gregor v, et al. Deriving protocol specifications from service specifications written as Predicate/Transition-nets. Computer Networks,2007,51(1):258-284.
[11]Kavi, Krishna M., Moshtaghi, Alireza, Chen, Deng-Jyi. Modeling Multithreaded Applications Using Petri Nets. International Journal of Parallel Programming, 2002,30(5):353-371.
[12]蒲飞,陆维明.同步合成Petri网系统活性与无死锁性的保持性.软件学报,2003,14(12)：1977-1988.
[13]Llorens, Marisa,Oliver, Javier. Structural and dynamic changes in concurrent systems:Reconfigurable Petri nets. IEEE Transactions on Computers,2004,53(9): 1147-1158.
[14]丁志军,蒋昌俊.并发程序验证的时序Petri网方法.计算机学报.2002,25(5)：467-475.
[15]Home of Fundamental Modeling Concepts.http://www.fmc-modeling.org/
[16]Douglas, C.Schmidt,Stephen, D.Huston. C++ Network Programming. vol.1: Addison-Wesley Professional,2001.
[17]Silberschatz, Abraham, Galvin, Peter Baer, Galvin, Peter, et al. Operating System Concepts (7th Edition):Wiley,2004.
[18]Gramma, Ananth, Gupta, Anshul, Karypis, George, et al. Introduction to Parallel Computing,2 ed:Addison Wesley,2003.
[19]Coffman, E G, Elphick, M J, Shoshani, A. System deadlocks. ACM Computing Surveys,1971,3(2):67-78.
[20]Home of SQLite. http://www.sqlite.org
[21]Douglas C.Schmidt, Stephen D.Huston/. C++ Network Programming, vol.2: Addison-Wesley Professional,2001.
[22]Home of OpenSSL. http://www.openssl.org
[23]Voung, Jan Wen, Jhala, Ranjit, Lerner, Sorin. RELAY:Static race detection on millions of lines of code. In:6th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC-FSE'07), Dubrovnik, Croatia,2007:205-214.
[24]Boyapati, Chandrasekhar, Lee, Robert, Rinard, Martin. Ownership types for safe programming:Preventing data races and deadlocks. In:Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA), Seattle, WA, United states,2002:211-230.
[25]Prvulovic, Milos. CORD:Cost-effective (and nearly overhead-free) order-recording and data race detection. In:Proceedings - Twelfth International Symposium on High-Performance Computer Architecture, Austin, TX, United states, 2006:236-247.
[26]Palm, Rainer. Synchronization of Decentralized Multiple-Model Systems by Market-Based Optimization. IEEE Transactions on Systems, Man, and Cybernetics, Part B:Cybernetics,2004,34(1):665-672.
[27]Raghunathan, Sriram. Extending inter-process synchronization with robust mutex and variants in condition wait. In:Proceedings of the 2008 14th IEEE International Conference on Parallel and Distributed Systems (ICPADS'08), Melbourne, VIC, Australia,2008:121-128
[1]Marco Dorigo,Blum, Christian. Ant colony optimization theory:A survey. Theoretical Computer Science,2005,344(2-3):243-278.
[2]张利彪,周春光,马铭等.基于粒子群算法求解多目标优化问题.计算机研究与发展,2004,41(7)：1286-1291.
[3]K. Aihara, Takabe, T., Toyoda, M. Chaotic neural networks. Physics Letters A, 1990,144(6-7):333-340.
[4]Kumar Sailesh, Jonathan, Turner, John, Williams, "Advanced algorithms for fast and scalable deep packet inspection," in Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems. San Jose, California, USA:ACM,2006.
[5]Smith Randy, Cristian, Estan, Somesh, Jha, et al. Deflating the big bang:fast and scalable deep packet inspection with extended finite automata. SIGCOMM Comput. Commun. Rev.,2008,38(4):207-218.
[2]Napsterwebsite. http//:www.napster.com.1999
[3]迅雷主页http://www.xunlei.com/.
[4]BitTorrent. http://www.bittorrent.com/.
[5]Skype Homepage, http://www.skype.com.
[6]SETI@home. http://setiathome.berkeley.edu.
[7]ipoque. http://www.ipoque.com/
[8]H.Schulze, K.Mochalski. Internet Study 2008/2009. https://portal.ipoque.com /downloads/index/get/id/265/,2009
[9]中国互联网网络安全报告(2008年上半年)http://www.cert.org.cn/ UserFiles/File/CISR2008fh.pdf
[10]K.Deb, A.Pratap, S.Agarwal, etc. A Fast and Elitist Multiobjective Genetic Algorithm:NSGA-Ⅱ. IEEE Transactions on evolutionary computation,2002,6(2): 182-197.
[1]A.Oram. Peer-to-Peer:Harnessing the Power of Disruptive Technologies. Sebastopol, CA, USA:O'Reilly & Associates,2001.
[2]R.Steinmetz,K.Wehrle. Peer-Peer-Networking &-Computing". Informatik Spektrum,2004,27(1):51-54.
[3]R.Schollmeier. A definition of Peer-to-Peer networking for the classifieation of Peer-to-Peer architectures and applieations. In:Proceedings of the 1st International Conference on Peer-to-Peer Computing(P2P'01), eLinkoPing, Sweden,2001: 101-102.
[4]RL.Graham. Towards a definition. In:Proceedings of the 1st International Conference on Peer-to-Peer Computing(P2P'01), eLinkoPing, Sweden,2001: 101-102.
[5]K.Aberer,M.Hauswirth.Peer-to-Peer information systems:Concepts and models,state-of-the-art,and future systems. In:Proceedings of the 18th International Conference on Data Engineering (ICDE'02), San Jose, CA, USA,2002:Tutorial Slides.
[6]C.Shirky.What is p2p? And what isn't? http://www.openp2p.com/pub/alp2p/2000/11/24 /shirkyl- whatisp2p.html,2001.
[7]DS.Milojicic, V.Kalogeraki, RM.Lukose. Peer-to-Peer computing. Technical report, Hewlett Packard Company,2002
[8]R.Steinmetz,K.Wehrle. Peer-to-Peer Systems and Applications:Lecture Notes in Computer Science, Springer,2005.
[9]王菁.P2P系统中资源管理机制的研究[学位论文].中国科学技术大学.合肥,安徽.博士.2007
[10]B.Amento, L.Terveen, W.Hill. From Usenet to CoWebs:Interacting with social information spaces. From Usenet to CoWebs, C. Lueg and D. Fisher, Eds. London, UK:Springer-Verlag,2003:54-85.
[11]Randy Bush. FidoNet:technology, tools, and history Communications of the ACM,1993,36(8):31-35.
[12]Napsterwebsite. http//:www.napster.com.1999
[13]gnutella forums. http://www.gnutellaforums.com/.
[14]Matei Ripeanu, Adriana Iamnitchi, Ian Foster. Mapping the Gnutella network. IEEE Internet Computing,2002,6(1):50-57.
[15]KazaA. http://www.kazaa.com/.
[16]BitTorrent. http://www.bittorrent.com/.
[17]Skype Homepage. http://www.skype.com.
[18]I.Stoica, R.Morrist, D.L.Nowell, et al. Chord:A scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Transactions on Networking, 2003,11(1):17-32.
[19]Zhao B. Y., Huang, L., Stribling, J., et al. Tapestry:A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 2004,22(1):41-53.
[20]A.Rowstron, P.Druschel,. Pastry:scalable, decentralized object location and routing for large-scale peer-to-peer systems. In:18th IFIP/ACM Conference on Distributed Systems Platforms, Heidelberg (D),2001:86-94.
[21]S.Ratnasamy, P.Francis, M.Handley, et al. A scalable content-addressable network. In, San Diego, CA, United states,2001:161-172.
[22]P.Maymounkov, D,.Mazieres. Kademlia:A Peer-to-peer Information System Based on the XOR Metric. In:Proceedings of the 1st International Workshop on Peer-to-peer Systems, MIT,2002
[23]蒋海,李军,李忠诚.混合内容分发网络及其性能分析模型.计算机学报,2009,32(3)：473-482.
[24]Sen, S.,Wang, J. Analyzing peer-to-peer traffic across large networks. IEEE/Acm Transactions on Networking,2004,12(2):219-232.
[25]Xiong, L.,Liu, L. PeerTrust:Supporting reputation-based trust for peer-to-peer electronic communities. IEEE Transactions on Knowledge and Data Engineering, 2004,16(7):843-857.
[26]Hei, X. J., Liang, C., Liang, J., et al. A measurement study of a large-scale P2P IPTV system. IEEE Transactions on Multimedia,2007,9(8):1672-1687.
[27]罗建光,张萌,赵黎等.基于P2P网络的大规模视频直播系统.软件学报,2007,18(2)：391-399.
[28]张宇翔,杨冬,张宏科.P2P网络中Churn问题研究.软件学报,2009,20(5)： 1362-1376.
[29]Maze主页http://maze.tianwang.com/.
[30]张萌.对等网络流媒体直播调度策略研究[学位论文]清华大学.北京.博士2008
[31]迅雷主页,"http://www.xunlei.com/.
[32]腾讯http://www.qq.com/.
[33]PPLive. http://www.pplive.com.
[34]K.Deb. Multi-Objective Optimization Using Evolutionary Algorithms. Chicester, UK:John Wiley&Son,2001.
[35]E.Zitzler, L.Thiele. Multi objective Evolutionary Algorithms:A ComParative Case Study and the Strength Pareto Approach. IEEE Transactions on Evolutionary Computation,1999,3(4):257-271.
[36]Coello, A.Carlos. Theoretical and numerical constraint-handling techniques used with evolutionary algorithms:A survey of the state of the art. Computer Methods in Applied Mechanics and Engineering,2002,191(11-12):1245-1287.
[37]L.Davis. Handbook of Genetic Algorithms. New York:Van Nostrand Reinhold, 1991.
[38]Z.Michalewicz. Genetic Algorithms+ Data Structures=Evolution Programs, second ed. Berlin:Springer,1992.
[39]L.A.Zadeh. Optimality and non scalar-valued performance criteria. IEEE transactions on Automatic Control,1963,8(1):59-60.
[40]A.M.Geoffrion. Proper efficiency and the theory of vector optimization. Journal of Mathematical Analysis and Application,1968,41:491-502.
[41]Y.Y.Haimes, L.S.Lasdon, D.A.Wismer. On a bicriterion formulation of the problems of integrated systems identification and system optimization. IEEE Transactions on System,Man,Cybernetics,1971,1(3):296-297.
[42]H.P.Benson. Existence of efficient solutions for vector maximization problems. Journal of Optimization Theory and Applications,1978,26(4):569-580.
[43]A.Chames, W.W.Cooper, R.O.Ferguson. Optimal estimation of executive compensation by linear programming. Management Science,1955,1(2):138-151.
[44]R.S.Rosenberg. Simulation of genetic population with biochemical properties[Dissertation] University of Michigan.Michigan.Ph.D.1967
[45]J.D.Shaffer. Multiple Objective Optimization with Vector Evaluated Genetic Algorithms[Dissertation] Vanderbilt University.1984
[46]C.M.Fonseca,P.J.Fleming. Genetic algorithms for multiobjective optimization: formulation, discussion and generation. In:Proceedings of the 5th International Conference on Genetic Algorithms, San Mateo, California,1993:416-423.
[47]J.Horn, N.Nafpliotis, "Multiobjective optimization using the niched Pareto genetic algorithm," University of Illinois at Urbana-Champaign, Urbana, Illinois, USA 1993.
[48]N.Srinivas,K.Deb. Multiobjective optimization using nondominated sorting in genetic algorithms. Evolutionary Computation,1994,2(3):221-248.
[49]Deb, Kalyanmoy, Pratap, Amrit, Agarwal, Sameer, et al. A Fast and Elitist Multiobjective Genetic Algorithm:NSGA-Ⅱ. IEEE Transactions on Evolutionary Computation,2002,6(2):182-197.
[50]E.Zitzler,LThiele. Multiobjective optimization using evolutionary algorithms-a comparative case study. In:Parallel Problem Solving from Nature, Berlin, Germany, 1998:292-301.
[51]J.Knowles,D.Corne. The Pareto archived evolution strategy:A new baseline algorithm for multiobjective optimization. In:Proceedings of the 1999 Congress on Evolutionary Computation, Washington DC,1999:98-105.
[52]T.M. Chan,. K.F..Man, S.Kwong.,etc A jumping gene paradigm for evolutionary multiobjective optimization. IEEE Transactions on Evolutionary Computation,2008,12(2):143-159.
[53]谢涛,陈火旺,康立山.多目标优化的演化算法.计算机学报,2003,26(8)：997-1003.
[54]曾三友,魏巍,康立山等.基于正交设计的多目标演化算法.计算机学报,2005,28(7)：1153-1162.
[55]赵曙光,焦李成,王宇平等.基于均匀设计的多目标自适应遗传算法及应用.电子学报,2004,32(10)：1723-1725,1729.
[56]郑金华,蒋浩,邝达等.用擂台赛法则构造多目标Pareto最优解集的方法.软件学报,2007,18(6)：1287-1297.
[57]郑金华,史忠植,谢勇.基于聚类的快速多目标遗传算法.计算机研究与发展,2004,41(7)：1081-1087.
[58]A.Rosenfel. Digital Picture Processi ng. New York:Academic Press,1976.
[59]M.Srinivas, L. M Patnaik. Genetic algorithms:a survey. Computer,1994,27(6): 17-26.
[60]周明,孙树栋.遗传算法原理及应用.北京：国防工业出版社,1996.
[61]王小平,曹立明.遗传算法—理论、应用与软件实现.西安：西安交通大学出版社,2002.
[62]G. A.Vignaux, Z.Michalewicz. A genetic algorithm for the linear transportation problem. IEEE Transactions on Systems, Man and Cybernetics,1991,21(2):445-452.
[63]崔逊学,林闯.基于多目标遗传算法的多播服务质量路由优化.计算机研究与发展,2004,41(7)：1144-1150.
[64]彭伟,卢锡城.一种函数优化问题的混合遗传算法.软件学报,1999,10(8)：819-823.
[65]张成文.基于遗传算法的具有全局QoS限制的Web服务选择[学位论文]北京邮电大学.北京.博士论文.2007
[66]袁崇义Petri网原理与应用.北京：电子工业出版社,2005
[67]Joachim Wehler. Petri Nets.http://www.pst.ifi.lmu.de/personen/wehler/,1999
[68]Wolfgang Reisig. Elements of Distributed Algorithms:Modeling and Analysis with Petri Nets. Springer-Verlag,1998
[69]Home of Fundamental Modeling Concepts, http://www.fmc-modeling.org/
[1]Justin Smith. Harness The Power Of P2P Communication In Windows Vista And WCF, "http://msdn.microsoft.com/en-us/magazine/cc188685.aspx".
[2]Daniel Brookshier, Darren Govoni, Navaneeth Krishnan, et al. JXTA:Java P2P Programming,Indianapolis, IN USA:Sams,2002.
[3]OpenSSL home page."http://www.openssl.org/".
[4]Cheng Bo, Zhang Yang, Lin Xiangtao, et al. Design of services-orientated multimedia conference process management. In:Proceedings of the International Conference on Computer Science and Information Technology (ICCSIT 2008), Singapore, Singapore,2008:915-922.
[5]Antony Rowstron, Peter Druschel. Pastry:scalable, decentralized object location and routing for large-scale peer-to-peer systems. In:18th IFIP/ACM Conference on Distributed Systems Platforms, Heidelberg(D),2001:86-94.
[6]Sylvia Ratnasamy, Paul Francis,Mark Handley, et al. A scalable content-addressable network. In:ACM SIGCOMM 2001, San Diego, CA, United states,2001:161-172.
[7]gSoap Toolkit."http://gsoap2.sourceforge.net/".
[8]Jiang, Shou-Xu,Li, Jian-Zhong. Reputation-based trust mechanism for P2P e-commerce systems. Ruan Jian Xue Bao/Journal of Software,2007,18(10): 2551-2563.
[9]Wang Yong, YangHui-Hua, Wang Xing-Yu, et al. Intrusion detection experimental system using evolutionary neural network. Huadong Ligong Daxue Xuebao/Journal of East China University of Science and Technology,2005,31(3):362-366.
[10]阎平凡,张长水.人工神经网络与模拟进化计算.北京：清华大学出版社,2000.
[11]张学工.关于统计学习理论与支持向量机.自动化学报,2000,26(1)：32-42.
[12]Srinivas, M.,Patnaik, L. M. Genetic algorithms:a survey. Computer,1994,27(6): 17-26.
[13]Ion Stoica, Robert Morris, Liben-Nowell, David, et al. Chord:A scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Transactions on Networking,2003,11(1):17-32.
[14]J.Byers, J.Considine, M.Mitzenmacher, Simple load balancing for distributed hash tables. Peer-to-Peer Systems Ii,2003,2735:80-87.
[15]Y.Azar, J.Naor, R. Rom, The Competitiveness of Online Assignments. Journal of Algorithms,1995,18(2):221-237.
[16]Simon Rieche, Leo Petrak, Klaus Wehrle,. A thermal-dissipation-based approach for balancing data load in distributed hash tables. In, Tampa, FL, United states,2004: 15-23.
[17]JXTA home page. "https://jxta.dev.java.net/".
[18]Joan Arnedo-Moreno, Jordi Herrera-Joancomarti. Persistent interoperable security for JXTA advertisements. In:2nd International Conference on Complex, Intelligent and Software Intensive Systems(CISIS 2008), Barcelona, Spain,2008: 354-359.
[19]Microsoft.Deploying Groove Server 2007 and Groove 2007 at Microsoft. http://msdn.microsoft.com/en-us/bb735162.aspx,2007.
[20]Kuz, Ihor,Steen, Maarten van, cP2Pc:Integrating P2P networks, "http://www.cs.vu.nl/pub/globe/cp2pc/".
[21]Gabor Paller, Heikki Kokkinen. Modular, service-oriented API for peer-to-peer middleware In:Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (ICST 2008), Rue Godecharle,41 Brussels Belgium 2008
[22]libTorrent Homepage."http://libtorrent.rakshasa.no/".
[1]Schulze, Hendrik,Mochalski, Klaus. Internet Study 2008/2009. https.//portal.ipoque.com/downloads/index/get/id/265/,2009
[2]"http://www.joltid.com/index.php/peercache/".2009.
[3]Dan, Gyorgy. Cooperative Caching and Relaying Strategies for Peer-to-peer Content Delivery. The 7th International Workshop on Peer-to-Peer Systems (IPTPS '08), Tampa Bay, Florida,2008
[4]Shen, Guobin, Wang, Ye, Xiong, Yongqiang, et al. HPTP:Relieving the tension between ISPs and P2P. The 6th International Workshop on Peer-to-Peer Systems (IPTPS'07), Bellevue, WA, USA,2007
[5]Aggarwal, V., O.Akonjang, A.Feldmann. Improving user and ISP experience through ISP-aided P2P locality. IEEE Infocomm 2008, Phoenix, AZ, USA,2008:1-6.
[6]Srinivas, M.,Patnaik, L. M. Genetic algorithms:a survey. Computer,1994,27(6): 17-26.
[7]Dykes, Sandra G.,Robbins, Kay A. A viability analysis of cooperative proxy caching. IEEE INFOCOM, Washington, D.C.,2001:1205-1214.
[8]Padmanabhan, Venkata N., Wang, Helen J., Chou, Philip A., et al. Distributing Streaming Media Content Using Cooperative Networking. NOSSDAV02, Miami Beach, FL, USA,2002
[9]Kumar, Rakesh. Measurement, Modeling and Economics of P2P Systems. Polytechnic University.New York, USA.PHD.2006
[10]Qiu, Dongyu,R., Srikant Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks. ACM SIGCOMM 2004, Portland, OR, USA,2004
[11]Clevenot, F., Nain, P., Ross, K.W. Multiclass p2p networks:Static resource allocation for service differentiation and bandwidth for service differentiation and bandwidth diversity Performance 2005 2005,62(1-4):32-49.
[12]Deb, Kalyanmoy, Pratap, Amrit, Agarwal, Sameer, et al. A Fast and Elitist Multiobjective Genetic Algorithm:NSGA-Ⅱ. IEEE transactions on evolutionary computation,2002,6(2):182-197.
[13]Favuzza, S., Ippolito, M. G., Sanseverino, E. R. Crowded comparison operators for constraints handling in NSGA-Ⅱ for optimal design of the compensation system in electrical distribution networks. Advanced Engineering Informatics,2006,20: 201-211.
[14]Kumar, Y., Das, B., Sharma, J. Service restoration in distribution system using non-dominated sorting genetic algorithm. Electric ower Syst. Res.,2006,76:768-777.
[15]Deb, K., Mitra, K., Dewri, R., et al. Towards a better understanding of the epoxy-polymerization process using multiobjective evolutionary computation. Chemical engineering science 2004,59:4261-4277.
[16]Akamai."http://www.akamai.com/".
[17]Cachelogic. "http://www.cachelogic.com/".
[18]ChinaCache. "http://www.chinacache.com/".
[1]"http://www.bittorrent.com/".
[2]"http://gnutella.wego.com/".
[3]Ivana Podnar, Martin Rajman, Toan Luu, et al. Beyond term indexing:A P2P framework for web information retrieval. Informatica (Ljubljana),2006,30(2): 153-161.
[4]凌波陆志国黄维雄等PeerlS:基于Peer-to-Pee(?)的信息检索系统[J].软件学报,2004,15(9)：1375-1384.
[5]Skype. "http://www.skyp.com/"
[6]Anderson, David P., Cobb, Jeff, Korpela, Eric, et al. SETI@home:An Experiment in Public-Resource Computing. Communications of the ACM, 2002,45(11):56-61.
[7]Hendrik Schulze, Klaus Mochalski. Internet Study 2008/2009. https://portal.ipoque.com/downloads/index/get/id/265/,2009
[8]王姣.基于行为的P2P流量及异常流量检测技术研究[学位论文].北京邮电大学.北京.博士论文.2008.
[9]Karagiannis, Thomas, Rodriguez, Pablo, Papagiannaki, Konstantina. Should internet service providers fear peer-assisted content distribution? In:Internet Measurement Conference 2005, Berkeley, CA,2005
[10]Xie, Haiyong, Yang, Y. Richard, Krishnamurthy, Arvind, et al. P4p:Provider portal for applications. In, Seattle, WA, United states,2008:351-362.
[11]Stoica, Ion, Morris, Robert, Liben-Nowell, David, et al. Chord:A scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Transactions on Networking,2003,11(1):17-32.
[12]Rowstron, Antony,Druschel, Peter. Pastry:scalable, decentralized object location and routing for large-scale peer-to-peer systems. In:18th IFIP/ACM Conference on Distributed Systems Platforms, Heidelberg (D),2001:86-94.
[13]Ratnasamy, Sylvia, Francis, Paul, Handley, Mark, et al. A scalable content-addressable network. In:ACM SIGCOMM 2001, San Diego, CA, United states,2001:161-172.
[14]Ratnasamy, Sylvia, Francis, Paul, Handley, Mark, et al. A scalable content-addressable network. In, San Diego, CA, United states,2001:161-172.
[15]Dana, Chris, Li, Danjue, Harrison, David, et al. BASS:BitTorrent assisted streaming system for video-on-demand. In, Shanghai, China,2006
[16]Vlavianos, Aggelos, Iliofotou, Marios, Faloutsos, Michalis. BiToS:Enhancing BitTorrent for supporting streaming applications. In, Barcelona, Spain,2006
[17]Bindal, Ruchir, Cao, Pei, Chan, William, et al. Improving traffic locality in BitTorrent via biased neighbor selection. In, Lisboa, Portugal,2006
[18]Liu, Bo, Cui, Yi, Lu, Yansheng, et al. Locality-awareness in BitTorrent-like P2P applications. IEEE Transactions on Multimedia,2009,11(3):361-371.
[19]Aggarwal, Vinay, Feldmann, Anja, Scheideler, Christian. Can ISPs and P2P Users Cooperate for Improved Performance? ACM SIGCOMM Computer Communication Review,2007,37(3):29-40.
[20]Yang, Weishuai,Abu-Ghazaleh, Nael. GPS:A general peer-to-peer simulator and its use for modeling BitTorrent. In, Atlanta, GA, United states,2005:425-432.
[21]Zegura, Ellen W., Calvert, Ken, Bhattacharjee., S. How to Model an Internetwork. In:IEEE Infocom '96, San Francisco, CA,1996
[22]Ratnasamy, Sylvia, Handley, Mark, Karp, Richard, et al. Application-level multicast using content-addressable networks. In:the 3rd International COST264 Workshop on Networked Group Communication (NGC),2001:14-29.
[23]Castro, Miguel, Druschel, Peter, Kermarrec, Anne-Marie, et al. Scribe:A large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications,2002,20(8):1489-1499.
[24]Dan, Gyorgy. Cooperative Caching and Relaying Strategies for Peer-to-peer Content Delivery. In:The 7th International Workshop on Peer-to-Peer Systems (IPTPS '08), Tampa Bay, Florida,2008
[25]Cai, H. L., Jun, W., Dong, L., et al. A novel state cache scheme in structured P2P systems. Journal of Parallel and Distributed Computing,2005,65(2):154-168.
[26]Horovitz, Shay,Dolev, Danny. LiteLoad:Content unaware routing for localizing P2P protocols. In, Miami, FL, United states,2008:IEEE Computer Society Technical Committee on Parallel Processing.
[27]Seedorf, Jan, Kiesel, Sebastian, Stiemerling, Martin. Traffic localization for P2P-applications: The ALTO approach. In, Seattle, WA, United states,2009:171-177.
[28]Cymru, "http://www.cymru.com."
[1]"http://www.bittorrent.com/".
[2]迅雷主页, "http://www.xunlei.com/."
[3]http://www.pptv.com/.
[4]Lee, Edward A. The problem with threads. Computer,2006,39(5):33-42.
[5]章隆兵,张福新,吴少刚等.基于锁集合的动态数据竞争检测方法.计算机学报,2003,26(10)：1217-1223.
[6]富浩,蔡铭,董金祥等.基于锁集合算法的增强型数据竞争检测方法.浙江大学学报：工学版,2009,43(2)：328-333.
[7]Marino, Daniel, Musuvathi, Madanlal, Narayanasamy, Satish. LiteRace:Effective sampling for lightweight data-race detection. ACM SIGPLAN Notices,2009,44(6): 134-143.
[8]Li, Xiaoou, Medina, Joselito M., Chapa, Sergio V. Applying Petri nets in active database systems. IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews,2007,37(4):482-493.
[9]Zeng, Qing-Tian. Behavior descriptions of structure-complex Petri nets based on synchronous composition. Ruan Jian Xue Bao/Journal of Software,2004,15(3): 327-337.
[10]Yamaguchi, Hirozumi, El-Fakih, Khaled, Bochmann, Gregor v, et al. Deriving protocol specifications from service specifications written as Predicate/Transition-nets. Computer Networks,2007,51(1):258-284.
[11]Kavi, Krishna M., Moshtaghi, Alireza, Chen, Deng-Jyi. Modeling Multithreaded Applications Using Petri Nets. International Journal of Parallel Programming, 2002,30(5):353-371.
[12]蒲飞,陆维明.同步合成Petri网系统活性与无死锁性的保持性.软件学报,2003,14(12)：1977-1988.
[13]Llorens, Marisa,Oliver, Javier. Structural and dynamic changes in concurrent systems:Reconfigurable Petri nets. IEEE Transactions on Computers,2004,53(9): 1147-1158.
[14]丁志军,蒋昌俊.并发程序验证的时序Petri网方法.计算机学报.2002,25(5)：467-475.
[15]Home of Fundamental Modeling Concepts.http://www.fmc-modeling.org/
[16]Douglas, C.Schmidt,Stephen, D.Huston. C++ Network Programming. vol.1: Addison-Wesley Professional,2001.
[17]Silberschatz, Abraham, Galvin, Peter Baer, Galvin, Peter, et al. Operating System Concepts (7th Edition):Wiley,2004.
[18]Gramma, Ananth, Gupta, Anshul, Karypis, George, et al. Introduction to Parallel Computing,2 ed:Addison Wesley,2003.
[19]Coffman, E G, Elphick, M J, Shoshani, A. System deadlocks. ACM Computing Surveys,1971,3(2):67-78.
[20]Home of SQLite. http://www.sqlite.org
[21]Douglas C.Schmidt, Stephen D.Huston/. C++ Network Programming, vol.2: Addison-Wesley Professional,2001.
[22]Home of OpenSSL. http://www.openssl.org
[23]Voung, Jan Wen, Jhala, Ranjit, Lerner, Sorin. RELAY:Static race detection on millions of lines of code. In:6th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC-FSE'07), Dubrovnik, Croatia,2007:205-214.
[24]Boyapati, Chandrasekhar, Lee, Robert, Rinard, Martin. Ownership types for safe programming:Preventing data races and deadlocks. In:Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA), Seattle, WA, United states,2002:211-230.
[25]Prvulovic, Milos. CORD:Cost-effective (and nearly overhead-free) order-recording and data race detection. In:Proceedings - Twelfth International Symposium on High-Performance Computer Architecture, Austin, TX, United states, 2006:236-247.
[26]Palm, Rainer. Synchronization of Decentralized Multiple-Model Systems by Market-Based Optimization. IEEE Transactions on Systems, Man, and Cybernetics, Part B:Cybernetics,2004,34(1):665-672.
[27]Raghunathan, Sriram. Extending inter-process synchronization with robust mutex and variants in condition wait. In:Proceedings of the 2008 14th IEEE International Conference on Parallel and Distributed Systems (ICPADS'08), Melbourne, VIC, Australia,2008:121-128
[1]Marco Dorigo,Blum, Christian. Ant colony optimization theory:A survey. Theoretical Computer Science,2005,344(2-3):243-278.
[2]张利彪,周春光,马铭等.基于粒子群算法求解多目标优化问题.计算机研究与发展,2004,41(7)：1286-1291.
[3]K. Aihara, Takabe, T., Toyoda, M. Chaotic neural networks. Physics Letters A, 1990,144(6-7):333-340.
[4]Kumar Sailesh, Jonathan, Turner, John, Williams, "Advanced algorithms for fast and scalable deep packet inspection," in Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems. San Jose, California, USA:ACM,2006.
[5]Smith Randy, Cristian, Estan, Somesh, Jha, et al. Deflating the big bang:fast and scalable deep packet inspection with extended finite automata. SIGCOMM Comput. Commun. Rev.,2008,38(4):207-218.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |