对等环境下信誉机制的若干关键问题研究
|
摘要
对等(Peer-to-Peer,简称P2P)技术己在流媒体、文件共享、内容分发、分布式存储、分布式计算等众多领域得到了广泛应用,但仍然存在很多需要研究的问题。对等网络的动态性、开放性、自治性与节点自私性向网络的安全性与公平性提出了挑战,造成“搭便车”、“公共悲剧”以及“资源不可信”等问题。虽然信誉机制可以有效激励公平、增强安全,但信誉机制却带来其特有的安全问题及“热点”(Hot-Spot)问题。
本文围绕P2P环境下信誉机制面临的安全问题以及负载均衡问题,对信誉管理机制、信誉度量算法、机制的安全性与性能这三个关键技术展开研究,集中解决了信誉机制中的团体欺骗问题,并且提高了网络的整体资源利用率。
本文的研究重点如下:
首先阐述了P2P网络的演变过程、分类和应用,分析了P2P网络应用所呈现出来的安全性问题、不公平现象、动态性以及资源利用不均匀的原因,并对解决上述问题的信誉机制进行了全面深入的分析,总结了现有的相关领域研究成果,分析了未来研究工作发展的趋势。
其次,对信誉机制的安全性展开研究。一方面研究了P2P网络的匿名性,针对交互节点双方的安全性提出了新的模型;另一方面对社会网络和P2P网络的相似特性进行研究,利用成熟的社会网络分析方法,提出了新的算法、机制来抵御信誉机制中的团体欺骗问题。
再次,对P2P网络的动态性与开放性进行研究。针对“网络波动”(Chum)问题对P2P系统性能、安全性的影响,结合信誉机制,提出新的信誉管理系统来解决“网络波动”以及多种恶意攻击带来的负面影响。
最后,研究P2P网络中的负载均衡问题,并对现实生活中的P2P网络用户需求进行调查研究。针对信誉机制给P2P文件共享系统带来的“热点”问题,结合经济学原理,提出一种新的信誉模型来提高网络资源利用率。
本文的主要创新点如下:
针对信誉机制的安全性,基于P2P网络的匿名性,提出一种无需CA的组匿名信誉模型(GARM模型)。GARM根据节点所捌有的资源对节点进行分组,保证组与组之间的匿名性。在实现P2P网络公平性的同时,保护了服务节点的安全,并避免P2P网络中的节点报复行为。
针对目前大多数系统没有考虑到的团体欺骗问题,提出可抵御团体欺骗的信誉值度量算法。基于社会网络中的社团结构理论,分析了P2P信任网络的社团结构,并将信任团体的可信度用于节点信誉值度量。在此基础上,提出一种基于团体信任度的P2P信誉机制。该机制可以适应动态、开放的P2P环境,在不限制节点加入退出的情况下抵御团体欺骗行为。
针对P2P网络的动态性与开放性,提出基于持续在线时间的信誉管理系统(SOD-based reoutation management system),用以减少“网络波动”现象,提高整体资源利用率。通过在信誉值算法中加入SOD因子,激励节点增加在线时间,并通过限制服务提供次数以及引入差评记录来防止一些节点的恶意行为。SOD系统能够增加下载次数,减少Churn,并解决了Cold-Start和“马太效应”问题。
针对P2P网络中Hot-Spot现象,借鉴经济学原理,提出基于用户下载需求偏好的信誉模型来提高整体资源利用率。将服务节点所承诺提供的带宽大小和单个文件的评价值相结合,作为请求节点选择下载的依据。根据不同偏好的效用大小不同,服务节点可以动态制定当前的承诺带宽以吸引其他节点下载。从而缓解热门节点造成的网络拥塞现象,提高网络的整体资源利用率。
While P2P technology has been widely deployed and successfully applied in the fields of stream media,file-sharing,content distribution,distributed storage management,distributed computing and so on,there still exists some issues need to be studied.In P2P networks,the dynamic characteristic,openness and autonomy challenge security and fairness.Problems such as Free-Riding,Tragedy of the Commons,and Incredible Resources have emerged.Reputation mechanism is an effective solution to these problems.However,reputation mechanism brings its own security issues and faces the Hot-Spot problem.
This dissertation mainly discusses the issues of security and load-balancing in P2P environments and shows our researches on reputation management mechanism, reputation measurement algorithm and security and performance of the mechanism.
The simulation results show that the group attacks can be defended against effectively and the resource utilization of P2P networks has been increased.
The major topics of this dissertation are as follows:
Firstly,the dissertation introduces the development,classification and applications of P2P network and deeply analyzes the main reasons that cause security issues,unfairness,network dynamic characteristic and inhomogeneity of resources utilization.The dissertation also analyzes the existing reputation mechanisms in P2P networks,summarizes the achievements of the related researches and gives the trends of the future research work.
Secondly,the dissertation discusses some security issues of reputation mechanism.On the one side,the anonymity of P2P network is discussed and a new model to protect each side of the interactions is proposed.On the other side,the dissertation does some researches on the similarities between P2P networks and social networks.Based on some mature theories in sociology,a new algorithm and a new mechanism are proposed to defend against the group attacks in P2P reputation networks.
Thirdly,focusing on the dynamic characteristic and openness of P2P networks, this dissertation proposes a reputation management system to solve the bad influences of Churn and malicious attacks.
Finally,the load-balancing problem is discussed.The dissertation shows the requirements of real users who are being engaged in P2P file-sharing systems.In allusion to the problem of Hot-Spot,a reputation model is proposed to promote the resources utilization in P2P file-sharing systems.
The main innovations and contributions in this dissertation are as follows:
Concerning peers security in reputation mechanism and anonymity of P2P networks,a reputation model(GARM) without CA is proposed.Peers are assigned in some different groups according to the resources they possess and the anonymity between each group is protected.The model realizes the fairness in P2P network.At the same time,it protects service peers and avoids the retaliatory actions between peers.
For the group attacks that current P2P networks ignore,a reputation measurement algorithm to defend against these attacks is proposed.Based on the community structure theories in social network,this dissertation analyzes the group structure in the P2P reputation network,and utilizes the reputation value of groups in measuring reputation of peers.On the basis of the algorithm,a group-based reputation mechanism is proposed.This mechanism adapts to dynamic and open P2P environments,and can defend against group attacks without limiting peers joining and leaving.
Concerning the dynamic characteristic and openness of P2P network,this dissertation proposes a sustained online duration-based reputation management system(SOD-based system) to reduce the phenomenon of Churn and increases the resourtces utilization in the whole network Rv adding the factor of SOD,the.duration online time of peers is increased.SOD-based system also solves the problems of Cold-Start and Matthew Effect.
For the congestion of network and the phenomenon of Hot-Spot in P2P Networks,using economic principles,a downloading requirements preference-based P2P reputation model combining bandwidth commitment with the evaluation of files is proposed.According to the preference of downloading requirements,a server peer allocates the bandwidth commitment dynamically to attract request peers.The simulation results show that this method raises the overall rate of utilization of resources in P2P file-sharing systems and eases the congestion.
本文围绕P2P环境下信誉机制面临的安全问题以及负载均衡问题,对信誉管理机制、信誉度量算法、机制的安全性与性能这三个关键技术展开研究,集中解决了信誉机制中的团体欺骗问题,并且提高了网络的整体资源利用率。
本文的研究重点如下:
首先阐述了P2P网络的演变过程、分类和应用,分析了P2P网络应用所呈现出来的安全性问题、不公平现象、动态性以及资源利用不均匀的原因,并对解决上述问题的信誉机制进行了全面深入的分析,总结了现有的相关领域研究成果,分析了未来研究工作发展的趋势。
其次,对信誉机制的安全性展开研究。一方面研究了P2P网络的匿名性,针对交互节点双方的安全性提出了新的模型;另一方面对社会网络和P2P网络的相似特性进行研究,利用成熟的社会网络分析方法,提出了新的算法、机制来抵御信誉机制中的团体欺骗问题。
再次,对P2P网络的动态性与开放性进行研究。针对“网络波动”(Chum)问题对P2P系统性能、安全性的影响,结合信誉机制,提出新的信誉管理系统来解决“网络波动”以及多种恶意攻击带来的负面影响。
最后,研究P2P网络中的负载均衡问题,并对现实生活中的P2P网络用户需求进行调查研究。针对信誉机制给P2P文件共享系统带来的“热点”问题,结合经济学原理,提出一种新的信誉模型来提高网络资源利用率。
本文的主要创新点如下:
针对信誉机制的安全性,基于P2P网络的匿名性,提出一种无需CA的组匿名信誉模型(GARM模型)。GARM根据节点所捌有的资源对节点进行分组,保证组与组之间的匿名性。在实现P2P网络公平性的同时,保护了服务节点的安全,并避免P2P网络中的节点报复行为。
针对目前大多数系统没有考虑到的团体欺骗问题,提出可抵御团体欺骗的信誉值度量算法。基于社会网络中的社团结构理论,分析了P2P信任网络的社团结构,并将信任团体的可信度用于节点信誉值度量。在此基础上,提出一种基于团体信任度的P2P信誉机制。该机制可以适应动态、开放的P2P环境,在不限制节点加入退出的情况下抵御团体欺骗行为。
针对P2P网络的动态性与开放性,提出基于持续在线时间的信誉管理系统(SOD-based reoutation management system),用以减少“网络波动”现象,提高整体资源利用率。通过在信誉值算法中加入SOD因子,激励节点增加在线时间,并通过限制服务提供次数以及引入差评记录来防止一些节点的恶意行为。SOD系统能够增加下载次数,减少Churn,并解决了Cold-Start和“马太效应”问题。
针对P2P网络中Hot-Spot现象,借鉴经济学原理,提出基于用户下载需求偏好的信誉模型来提高整体资源利用率。将服务节点所承诺提供的带宽大小和单个文件的评价值相结合,作为请求节点选择下载的依据。根据不同偏好的效用大小不同,服务节点可以动态制定当前的承诺带宽以吸引其他节点下载。从而缓解热门节点造成的网络拥塞现象,提高网络的整体资源利用率。
While P2P technology has been widely deployed and successfully applied in the fields of stream media,file-sharing,content distribution,distributed storage management,distributed computing and so on,there still exists some issues need to be studied.In P2P networks,the dynamic characteristic,openness and autonomy challenge security and fairness.Problems such as Free-Riding,Tragedy of the Commons,and Incredible Resources have emerged.Reputation mechanism is an effective solution to these problems.However,reputation mechanism brings its own security issues and faces the Hot-Spot problem.
This dissertation mainly discusses the issues of security and load-balancing in P2P environments and shows our researches on reputation management mechanism, reputation measurement algorithm and security and performance of the mechanism.
The simulation results show that the group attacks can be defended against effectively and the resource utilization of P2P networks has been increased.
The major topics of this dissertation are as follows:
Firstly,the dissertation introduces the development,classification and applications of P2P network and deeply analyzes the main reasons that cause security issues,unfairness,network dynamic characteristic and inhomogeneity of resources utilization.The dissertation also analyzes the existing reputation mechanisms in P2P networks,summarizes the achievements of the related researches and gives the trends of the future research work.
Secondly,the dissertation discusses some security issues of reputation mechanism.On the one side,the anonymity of P2P network is discussed and a new model to protect each side of the interactions is proposed.On the other side,the dissertation does some researches on the similarities between P2P networks and social networks.Based on some mature theories in sociology,a new algorithm and a new mechanism are proposed to defend against the group attacks in P2P reputation networks.
Thirdly,focusing on the dynamic characteristic and openness of P2P networks, this dissertation proposes a reputation management system to solve the bad influences of Churn and malicious attacks.
Finally,the load-balancing problem is discussed.The dissertation shows the requirements of real users who are being engaged in P2P file-sharing systems.In allusion to the problem of Hot-Spot,a reputation model is proposed to promote the resources utilization in P2P file-sharing systems.
The main innovations and contributions in this dissertation are as follows:
Concerning peers security in reputation mechanism and anonymity of P2P networks,a reputation model(GARM) without CA is proposed.Peers are assigned in some different groups according to the resources they possess and the anonymity between each group is protected.The model realizes the fairness in P2P network.At the same time,it protects service peers and avoids the retaliatory actions between peers.
For the group attacks that current P2P networks ignore,a reputation measurement algorithm to defend against these attacks is proposed.Based on the community structure theories in social network,this dissertation analyzes the group structure in the P2P reputation network,and utilizes the reputation value of groups in measuring reputation of peers.On the basis of the algorithm,a group-based reputation mechanism is proposed.This mechanism adapts to dynamic and open P2P environments,and can defend against group attacks without limiting peers joining and leaving.
Concerning the dynamic characteristic and openness of P2P network,this dissertation proposes a sustained online duration-based reputation management system(SOD-based system) to reduce the phenomenon of Churn and increases the resourtces utilization in the whole network Rv adding the factor of SOD,the.duration online time of peers is increased.SOD-based system also solves the problems of Cold-Start and Matthew Effect.
For the congestion of network and the phenomenon of Hot-Spot in P2P Networks,using economic principles,a downloading requirements preference-based P2P reputation model combining bandwidth commitment with the evaluation of files is proposed.According to the preference of downloading requirements,a server peer allocates the bandwidth commitment dynamically to attract request peers.The simulation results show that this method raises the overall rate of utilization of resources in P2P file-sharing systems and eases the congestion.
引文
陈贵海,李振华.2007.对等网络:结构、应用与设计[M].清华大学出版社,ISBN 987-7-302-15892-9.
邓爱林,朱扬勇,施伯乐.2003.基于项目评分预测的协同过滤推荐算法[J].软件学报,14(9).
李景涛.2006.P2P环境下的信任模型与副本方案研究.博士学位论文.
李小勇,桂小林.2007.大规模分布式环境下动态信任模型研究[J].软件学报,18(6):1510-1521.
杨冬,董平,张宏科.2007.对等网络Churn问题评估模型与分析[J].通信学报,28(6).
袁巍,李津生,洪佩琳.2006.一种P2P网络分布式信任模型及仿真[J].系统仿真学报,18(14):938-942.
中国互联网络信息中心.2009.中国互联网络发展状况统计报告[EB/OL].中国互联网络信息中心,[2009-01-12].HTTP://www.cnnic.net.cn/uploadfiles/doc/2009/1/13/92209.doc.
姜红德.2006.P2P发展将最终把人们从电视机前解放出来[EB/OL].Donews:新经济导刊,[2006-05-14].HTTP://www.donews.com/Content/200605/3d7fbf9a5f12465696243fa498c34d34.shtm.
汪小帆,李翔,陈关荣等.2006.复杂网络理论及其应用[M].北京:清华大学出版社,ISBN 7-302-12505-8.
维基百科.2008.点对点技术[EB/OL].维基百科,自由的百科全书.HTTP://zh.wikipedia.org/w/index.php?title=%E9%BB%9E%E5%B0%8D%E9%BB%9E%E 6%8A%80%E8%A1%93&variant=zh-cn#.E5.8E.86.E5.8F.B2.
维基百科.2009.大型计算机[EB/OL].维基百科,自由的百科全书.HTTP://zh.wikipedia.org/w/index.php?title=%E5%A4%A7%E5%9E%8B%E6%9C%BA&v ariant=zh-cn.
Aberer K,Hauswirth M.2002.Peer-to-peer information systems:concepts and models,state-of-the-art,and future systems[C].Proceedings of the 18th International Conference on Data Engineering.
Adamic A L,Adar E.2003.Friends and neighbors on the web[J].Social networks,25:211-230.
Adar E,Huberman B.2000.Free riding on Gnutella[J].First Monday.
Adya A,Bolosky W J,Castro M,et al.2002.Farsite:Federated,available,and reliable storage for an incompletely trusted environment[C].Proceedings of OSDI:1-14.
Androutsellis-Theotokis S,Spinellis D.2002.A survey of peer-to-peer file sharing technologies[EB/OL].Electronic Trading Research Unit(ELTRUN):Athens University of Economics and Business.HTTP://citeseer.istpsu.edu/androutsellis-theoto02survey.html.
Awerbuch B,Scheideler C.2004a.Robust distributed name service[C].Proceedings of Intl Workshop on Peer-to-Peer Systems:237-249.
Awerbuch B,Scheideler C.2004b.Group spreading:A protocol for provably secure distributed name service[C].Proceedings of Automata,Languages and Programming(ICALP):183-195.
Barber B.1983.The logic and limits of trust[J].New Brunswick,NJ:Rutgers University Press.
Bhagwan R,Savage S,Voelker GM.2003.Understanding availability[C].IPTPS 2003,LNCS 2735:256-267.
Bharambe A,Agrawal M,Mercury S.2004.Suppporting scalable multi-attribute range queries[C].Proceedings of the ACM SIGCOMM:353-366.
Bhattacharjee R,Goel A.2005.Avoiding ballot stuffing in eBay-like reputation systems[C].Proceedings of ACM SIGCOMM Workshop on the Economics of Peer-to-Peer Systems.
Bianchini M,Gori M,Scarselli F.2005.Inside pagerank[C].ACM Trans.Inter.Tech.,5(1):92-128.
Bono S C,Soghoian C A,Monrose F.2004.Mantis:A lightweight,server-anonymity preserving,searchable P2P[R].Information Security Institute of the Johns Hopkins University,Technical Report TR-2004-01-B-ISI-JHU.
Borisov N.2006.Computational puzzles as sybil defenses[C].Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing:171-176.
Breslau L,Cao P,Fan L.1999.Web caching and Zipf-like distributions:Evidence and implications[C].Proceedings of the IEEE INFOCOM:126-134.
Rulgatz J.1992.More extraordinary popular delusions and the madness of crowds[J]Three Rivers Press.
Buragohain C.Agrawasl D,Subhash S.2003.A game theoretic framework for incentives in P2P systems[C].Proceedings of the 3rd International IEEE Conferenceon Peer to Peer Computing:48-56.
Busi N,Manfredini C,Montresor A,et al.2008.Towards a data-driven coordination infrastructure for peer-to-peer systems[J].Web Engineering and Peer-to-Peer Computing,2376:295-299.
Chaum D.1981.Untraceable electronic mail,return addresses and digital pseudonyms[J].Communications of the ACM,24(2):84-88.
Chaum D.1988.The dining cryptographers problem[J].Journal of Cryptology,1(1):65-75.
Chen S.Wu Z.2003.PBiz:An e-Business model based on peer-to-peer network[C].Proceedings of the 2nd International Workshop on Grid and Cooperative Computing:277-284.
Chen X,Ren S S,Wang H N,et al.2005.SCOPE:scalable consistency maintenance in structured P2P systems[C].Proceedings of 24th Annual Joint Conference of the IEEE Computer and Communications Societies,3:1502-1513.
Cheng A,Friedman E.2005.Sybilproof reputation mechanisms.Proceedings of ACM Workshopon the Economics of Peer-to-Peer Systems.
Chu J,Labonte K,Levine B.2002.Availability and locality measurements of peer-to-per file systems[C].Proceedings of IT Com:Scalability and Traffic Control in IP Networks:310-321.
Clarke I,Sandberg O,Wiley B,et al.2000.Freenet:A distributed anonymous information storage and retrieval system[C].nternational Workshop on Design Issues in Anonymity and Unobservability.
Claudiu D,Shahmehri N.2005.Dynamic trust metrics for peer-to-peer system[C].Proceedings of the 16th Int'l Workshop on Database and Expert Systems Applications:776-781.
Clauset A,Newman M E J,Moore C.2004.Finding community structure in very large networks[M].Phys.Rev.E.,70:066111.
Cohen B.2001.BitTorrent[EB/OL].BitTorrent Inc.HTTP://www.bittorrent.com/.
Coleman J S．1990．社会理论的基础[M]．社会科学文献出版社．
ComScore.2009.Internet population passes one billion;top 15 countries[EB/OL].Elanso,[2009-01-24].HTTP://www.elanso.com/ArticleModule/ODHvNiTgPKR6IsHQG9QmPAIi.html.
Cornelli F,Damiani E,Samarati S.2002.Implementing a reputation-aware Gnutella servent[C].Proceedings of Intl Workshop on Peer-to-Peer Computing.
Crocker S.1969.Host software[EB/OL].Network Working Group Request for Comment.HTTP://www.ietf.org/rfc/rfc1.txt.
Damiani E,Capitani V S,Paraboschi S,et al.2002.A reputation-based approach for choosing reliable resources in peer-to-peer networks[C],Proceedings of the 9th Conference on Computer and Communications Security:207-216.
Dasgupta P.1990.Trust as a commodity.Trust:Making and Breaking Cooperative Relations[EB/OL].HTTP://citeseer.ist.psu.edu/dasgupta00trust.html/.
Dou W,Wang H M,Jia Y.2004.A recommendation-based peer-to-peer trust model[J].Journal of Software,15(4):571-583.
Douceur J.The sybil attack[C].2002.Proceedings of 2nd Workshop on Peer-to-Peer System,2002,LNCS 2429:251-260.
Faloutsos M,Faloutsos P,Faloutsos C.1999.On power-law relationship of the internet topology[C].Proceedings of the ACM SIGCOMM 1999 Conference on Applications,Technologies,Architectures,and Protocols for Computer Communication:251-262.
Farhad Manjoo.2002.Gnutella bandwidth bandits[EB/OL].HTTP://www.linux.com/feed/24453/.
Feldman M,Papadimitriou C.2006.Free-riding and whitewashing in peer-to-peer systems[J].Selected areas in communications,24(5):1010-1019.
Fiedler M.1973.Algebraic connectivity of graphs[J].Math,23:298.
Fightaids@home.2003.Fightaids@home[EB/OL].HTTP://fightaidsathome.stripps.edu/.
Figueiredo D,Shapiro J,Towsley D.2005.Incentives to promote availability in peer-to-peer anonymity systems[C].Proceedings of the 13th IEEE International Conference on Network Protocols(ICNP'05).
Fischmann M,Gunther O.2003.Free riders:Fact or fiction?[R].
FoIding@home.2000.Folding@home[EB/OL].HTTP://folding.stanfoSD.edu/.
Frankel J,Pepper T.2000.Gnutella[EB/OL].Nullsoft.HTTP://www.gnutella.com/.
Freedman M J,Morris R.2002.Tarzan:A peer-to-peer anonymizing network layer[C].Proceedings of the 9th CCS.
Friedman E,Resniek P.1998.The social cost of cheap pseudonyms[J].Journal of Economics and Management Strategy,10(2):173—199.
Gallaugher J M,Ramanathan S C.1996.Choosing a client/server architecture[J].Information Systems Management,13(2):7-13.
Girvan M,Newman M E.2001.Community structure in social and biological networks[M].Proc.Natl.Acad.Sci.,99:7821-7826.
Goel S,Robson M,Polte M,et al.2003.Herbivore:A scalable and efficient protocol for anonymous communication[R].Technical Report 2003-1890,Cornell University.
Goldberg I Shostack A.1999.Freedom network 1.0 architecture[EB/QL].HTTP://www.freedom.net/.
Gopalakrishnan V,Silaghi B,Bhattacharjee B,et al.2004.Adaptive replication in peer-to-peer systems[C].Proceedings of 24th International Conference on Distributed Computing SystemsICDCS2004:360-369.
Graham R.2001.Peer-to-peer:towards a definition[J].Proceedings of the 1st International Conference on Peer-to-Peer Computing.
Gummadi K,Dunn R,Saroiu S.2003.Measurement,modeling,and analysis of a peer-to-peer file-sharing workload[C].Proceedings of ACM SOSP2003,5(37):314-329.
Gupta M,Judge P,Ammar M.2003.A reputation system for peer-to-peer networks[C].13th International Workshop on Network and Operating Systems Support for Digital Audio and Video.
Hasdin G.1968.The Tragedy of the Commons[J].Science,162:1243-1248.
Hassan J,Hung L X,Kalim U,et al.2005.A trust model for ubiquitous systems based on vectors of trust values[C].Proceedings of the 7th IEEE Int'l Symp.on Multimedia:674-679.
Hildrum K,Kubiatowicz J,Rao S,et al.2002.Distributed data location in a dynamic network[J].Theory of Computing Systems Expanded journal version of SPAA 2002.
Homayounfar H,Wang F,Areibi S.2002.Advanced P2P architecture using autonomous agents[C].The ISCA 15th International Conference on Computer Applications in Industry and Engineering:115-118.
Houser D E,Wooders J.2005.Reputation in auctions:theory and evidence from eBay[J].Journal of Economics and Management Strategy.
Internet World Stats.2009.Internet usage statistics[EB/OL].Internet World Stats:Usage and Populartion Statistics,[2009-02-09].HTTP://www.internetworldstats.com/stats.htm.
Jelasity M,Montresor A,Babaoglu O.2004.Towards secure epidemics:Detection and removal of malicious peers in epidemic-style protocols[R].Technical Report.
Judge P.2002.ZDNet:.net vote rigging illustrates importance of web services[EB/OL].HTTP://news.zdnet.co.uk/software/0,39020381,2102244,00.htm/.
Kaelbling L P,Littman M L,Moore AW.1996.Reinforcement learning:A survey[J].Journal of Artificial Intelligence Research,4:237-285.
Kamvar S,Schlosser M,Garcia-Molina H.2003a.The EigenTrust algorithm for reputation management in P2P networks[C].Proceedings of the Twelfth International World Wide Web Conference:640-651.
Kamvar S,Schlosser M,Garcia-Molina H.2003b.Eigenrep:Reputation management in P2P networks[C],Proceedings of the Twelfth International World Wide Web Conference.
Kant K,Iyer R,Tewari V.2007.On the potential of peer-to-peer computing[EB/OL].Citeseerx.HTTP://kkant.ccwebhost.com/papers/taxonomy.pdf.
Kernighan B W,Lin S.1970.A efficient heuristic procedure for partitioning graphs[J].Bell System Technical Journal,49:291-307.
Kinateder M,Baschny E,Rothermel K.2005.Towards a generic trust model-Comparison of various trust update algorithms[C].Proceedings of iTrust 2005:177-192.
Krackhardt D,Lundberg M,Rourke L O.1993.KrackPlot:A picture's worth athousand words[J].Connections,16:37-47.
Kutzner K,Fuhrmann T.2005.Measuring large overlay networks-The overnet example[J].Proceedings of KiVS2005.
Ledlie J,Seltzer M.2005.Distributed,secure load balancing with skew,heterogeneity,and churn.Proceedings of IEEE INFOCOM.
Levine B N,Shields C,Margolin N B.2006.A survey of solutions to the sybil attack[R].Tech report 2006-052,University of Massachusetts Amherst,Amherst,MA.
Li J T,Jing Y N.A trust model based on similarity-weighted recommendation for P2P environments[J].Journal of Software,18(1):157-167.
Liao X F,Jin H,Liu Y H,et al.2006.AnySee:Peer-to-Peer Live Streaming[EB/OL].CiteULike.HTTP://www.cs.ust.hk/～liu/AnySee.pdf.
Liang J,Kumar R,Ross K W.2001.The KaZaA overlay:a measurement study,computer networks(special issue on overlays),to appear[EB/OL].KaZaA.HTTP://www.KaZaA.com.
Liang J,Kumar R,Xi Y,et al.2005.Pollution in file sharing systems[C].Proceedings of the IEEE Infocom 2005.
Liang J,Naoumov N,Ross K W.2006.The Index Poisoning Attack in P2P File-Sharing Systems[C].Proceedings of IEEE Infocom 2006.
Lua E,Crowcroft J,Pias M,et al.2005.A survey and comparison of peer-to-peer overlay network schemes[J].IEEE Communications Survey and Tutorial,7(2):72-93.
Mankiw N G.2003.Principles of economics[M],3~(rd)Edition.Thomson Learning.
Maniatis P,Rosenthal D S H,Roussopoulos M,et al.2003.Preserving peer replicas by rate-limited sampled voting[C].Proceedings of ACM SOSP:44-59.
Maniatis P,Roussopoulos M,Giuli T J,et al.2005.The lockss peer-to-peer digital preservation system[J].ACM Trans.Comput.Syst,23(1):2-50.
Marsh S.1994.Formalising trust as a computational concept.PhD thesis,University of Stirling.
Marti S,Garcia-Molina H.2004.Limited reputation sharing in p2p systems[C].Proceedings of 5th ACM conference on Electronic commerce.
McCaleb J.2000.eDonkey2000 network[EB/OL].HTTP://www.edonkey2000.com/.
McCaleb J.2006.Overnet[EB/OL].HTTP://www.overnet.org/.
Merkur.2002.eMule[EB/OL].HTTP://www.emule-project.net/.
Merton R K.1968.The matthew effect in science:The reward and communication systems of science are considered.Science.199(3810):55-63.
Milojicic D S,Kalogeraki V,Lukose R M.2002.Peer-to-peer computing[R].Hewlett-Packard Company.
Montresor A,Meling H,Babaoglu O.2002.Towards adaptive,resilient and self-organizing peer-to-peer systems[C].Networking 2002 Workshop:300-305.
MUTE.2004.MUTE:Simple,Anonymous File Sharing[EB/OL].HTTP://mutenet.sourceforge.net/.
Netbatch.1990.Netbatch[EB/OL].HTTP://www.intel.com/.
Newman M E J.2004.Fast algorithm for detecting community structure in network[J].Phy.Rev.E.
Oram A.2001.Peer-to-peer:Harnessing the power of disruptive technology[M].Sebastopol:O'Reilly Press:222～238.
Padmanabhan V,Qiu L L.2000.The content and access dynamic of a busy web site:Findings and implications[C].Proceedings of the SIGCOM:111-123.
Pfitzmann A,Kohntopp M.2000.Anonymity,unobservability,and pseudonymity:A proposal for terminology[J],Designing Privacy Enhancing Technologies:Design Issues in Anonymity and Observability.
Philippe G,Brown K L,Ilya mironov,et al.2001.Incentives for sharing in peer-to-peer networks[c].Proceedings of the 3rd ACM conference on Electronic Commerce.
Plissonneau L,Costeux J L,Brown P.2005.Analysis of peer-to-peer traffic on ADSL[C].Proceedings of PAM:69～82.
Pothen A,Simon H,Liou K P.1990.Partitioning sparse matrices with eigenvectors of graphs[J].Matrix Anal,11:430.
PPlive.2004.PPlive[EB/OL].HTTP://www.pplive.com/.
PPStream.2005.PPStream[EB/OL].HTTP://nj.onlinedown.net/soft/40670.htm/.
Ramaswamy L,Liu L.2003.FreeRiding:A new challenge for peer-to-peer file sharing systems[C].Proceedings of the 2003 Hawaii International Conference on System Sciences(P2P Track)HICSS2003.
Ratnasamy S,Francis P,Handley M,et al.2001.A scalable content-addressable network[C].Proceedings of the ACM SIGCOMM 2001 Conference on Applications,Technologies,Architectures,and Protocols for Computer Communication:161-172.
Reed M G,Syverson P F.1999.Onion routing[C].Proceeding of AIPA'99.
Reiter M K,Rubin A D.1998.Crowds:anonymity for Web transactions[J].ACM Transactions on Information and System Security(TISSEC).
Rhea S,Geels D,Roscoe T.2004.Handling chum in a DHT[C].Proceedings of the 2004 USENIX Technical Conference:127-146.
Rowstron A,Druschel P.2001.Pastry:Scalable,decentralized object location and routing for large scale peer-to-peer systems[C].Proceedings of the 1FTP/ACM International Conference on Distributed Systems Platforms(Middleware'01):329-350.
Saroiu S,Gummadi P K,Gribble.2002.A Measurement study of peer-to-peer file sharing systems[C].Proceedings of Multimedia Computing Networking 2002.
Schollmeier R.2001.A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications[C].Proceedings of the 1st International Conference on Peer-to-Peer Computing:101-102.
Selcuk,A,Uzun E,Pariente M R.2004.A reputation-based trust management system for P2P networks[C].Proceedings of 4th International Workshop on Global and Peer-to-Peer Computing.
Scott J.2002.Social network snalysis:A handbook[M].London:Sage Publications,2nd ed.
Sen S,Wang J.2002.Analyzing peer-to-peer traffic across large networks[C].Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurement workshop:219-232.
Shields C,Levine B N.2000.A protocol for anonymous communication over the Internet[C].Proceedings of CCS:33-42.
Shirk C.2000.What is P2P and what isn't[EB/OL].O'REILLY.[2000-11-24].HTTP://www.openp2p.com/pub/a/p2p/2000/ll/24/shirkyl-whatisp2p.html.
Shneidman J,Parkes D C,Massoulie L.2004.Faithfulness in internet algorithms[C].Proceedings of Workshop on Practice and Theory of Incentives and Game Theory in Networked Systems.
Singh A,Liu L.2003.TrustME:Anonymous management of trust relationships in decentralized P2P systems[C].Proceedings of the Third International IEEE Conference on Peer-to-Peer Computing.
Sit E,Morris R.2002.Security considerations for peer-to-peer distributed hash tables[J],Peer-to-Peer Systems,2429:261-269.
Srivatsa M,Liu L.2004.Vulnerabilities and security threats in structured overlay networks:A quantitative analysis[C].Proceedings of ACSAC 2004:252-261.
Stoica I,Morris R,Liben-Nowell D,et al.2003.Chord:A scalable peer-to-peer lookup protocol for internet applications[J].IEEE/ACM Transactions on Networking,11(1):17-32.
Stutzbach D,Rejaie R.2004.Towards a better understanding of churn in peer-to-peer networks[R].Technical Report.
Tallinn J.2001.FastTrack[EB/OL].HTTP://www.slyck.com/ft.php/.
Tian J,Dai Y F.2007.Understanding the dynamic of peer-to-peer systems[C].Proceedings of IPTPS 2007.
Varian H R.2006.Intermediate Microeconomics[M],6th edition.
Vroonhoven J V.2006.Peer to peer security[C],Proceedings of 4th Twente Student Conference on IT.
VBS.Gnutella Worm.2000.VBS.Gnutella Worm[EB/OL].HTTP://securityresponse.symantec.com/avcenter/venc/data/vbs.gnutella.html/.
Waterhouse S,Doolin D M,Kan G,et al.2002[C].Distributed search in peer-to-peer networks. IEEE Internet Computing 2002.
Wang X Y,NG W S,Ooi B C,et al.2008.Buddy Web:a P2P-based collaborative web caching system[J].Web Engineering and Peer-to-Peer Computing,2376:247-251.
Wang Y,Vassileva J.2003.Bayesian network-based trust model[C],Proceedings of IEEE/WIC International Conference on Web IntelligenceWI:372-378.
Wu H F,Shi C J.2008.A trust management model for P2P file sharing system[C].International Conference on Multimedia and Ubiquitous Engineering:41-44.
Xie H,Krishnanmurthy A,Yang R Y,et al.2007.P4P:proactive provider participation for P2P[EB/OL].HTTP://codex.cs.yale.edu/avi/home-page/p4p-dir/publications/trl377.pdf.
Xiong L,Liu L.2004.PeerTrust:Supporting reputation-based trust for peer-to-peer electronic communities[J].IEEE Transactions on Knowledge and Data Engineering,16(7):843-857.
Yu H F,Kaminsky M,Gibbons P B.2006.SybilGuard:defending against sybil attacks via social networks[C].Proceedings of SIGCOMM'06:267-278.
Yurkewych M,Levine B N,Rosenberg A L.2005.On the cost-ineffectiveness of redundancy in commercial p2p computing[C].Proceedings of ACM CCS:280-288.
Zennstr(o|¨)m N,Friis J.2006.Skype[EB/OL].HTTP://www.skype.com.
Zhang X,Liu J.2005.CoolStreaming/DONet:A data-driven overlay network for efficient live media streaming[C].Proceedings of IEEE INFOCOM.
Zhao B,Kubiatowocz J,Joseph A.2001.Tapestry:an infrastructure for fault-tolerant wide-area location and routing[R].Technical Report UCB/CSD-01-114.
Zhu B,Setia S,Jajodia S.2006.Providing witness anonymity in peer-to-peer systems[C].Proceedings of CCS'06.
邓爱林,朱扬勇,施伯乐.2003.基于项目评分预测的协同过滤推荐算法[J].软件学报,14(9).
李景涛.2006.P2P环境下的信任模型与副本方案研究.博士学位论文.
李小勇,桂小林.2007.大规模分布式环境下动态信任模型研究[J].软件学报,18(6):1510-1521.
杨冬,董平,张宏科.2007.对等网络Churn问题评估模型与分析[J].通信学报,28(6).
袁巍,李津生,洪佩琳.2006.一种P2P网络分布式信任模型及仿真[J].系统仿真学报,18(14):938-942.
中国互联网络信息中心.2009.中国互联网络发展状况统计报告[EB/OL].中国互联网络信息中心,[2009-01-12].HTTP://www.cnnic.net.cn/uploadfiles/doc/2009/1/13/92209.doc.
姜红德.2006.P2P发展将最终把人们从电视机前解放出来[EB/OL].Donews:新经济导刊,[2006-05-14].HTTP://www.donews.com/Content/200605/3d7fbf9a5f12465696243fa498c34d34.shtm.
汪小帆,李翔,陈关荣等.2006.复杂网络理论及其应用[M].北京:清华大学出版社,ISBN 7-302-12505-8.
维基百科.2008.点对点技术[EB/OL].维基百科,自由的百科全书.HTTP://zh.wikipedia.org/w/index.php?title=%E9%BB%9E%E5%B0%8D%E9%BB%9E%E 6%8A%80%E8%A1%93&variant=zh-cn#.E5.8E.86.E5.8F.B2.
维基百科.2009.大型计算机[EB/OL].维基百科,自由的百科全书.HTTP://zh.wikipedia.org/w/index.php?title=%E5%A4%A7%E5%9E%8B%E6%9C%BA&v ariant=zh-cn.
Aberer K,Hauswirth M.2002.Peer-to-peer information systems:concepts and models,state-of-the-art,and future systems[C].Proceedings of the 18th International Conference on Data Engineering.
Adamic A L,Adar E.2003.Friends and neighbors on the web[J].Social networks,25:211-230.
Adar E,Huberman B.2000.Free riding on Gnutella[J].First Monday.
Adya A,Bolosky W J,Castro M,et al.2002.Farsite:Federated,available,and reliable storage for an incompletely trusted environment[C].Proceedings of OSDI:1-14.
Androutsellis-Theotokis S,Spinellis D.2002.A survey of peer-to-peer file sharing technologies[EB/OL].Electronic Trading Research Unit(ELTRUN):Athens University of Economics and Business.HTTP://citeseer.istpsu.edu/androutsellis-theoto02survey.html.
Awerbuch B,Scheideler C.2004a.Robust distributed name service[C].Proceedings of Intl Workshop on Peer-to-Peer Systems:237-249.
Awerbuch B,Scheideler C.2004b.Group spreading:A protocol for provably secure distributed name service[C].Proceedings of Automata,Languages and Programming(ICALP):183-195.
Barber B.1983.The logic and limits of trust[J].New Brunswick,NJ:Rutgers University Press.
Bhagwan R,Savage S,Voelker GM.2003.Understanding availability[C].IPTPS 2003,LNCS 2735:256-267.
Bharambe A,Agrawal M,Mercury S.2004.Suppporting scalable multi-attribute range queries[C].Proceedings of the ACM SIGCOMM:353-366.
Bhattacharjee R,Goel A.2005.Avoiding ballot stuffing in eBay-like reputation systems[C].Proceedings of ACM SIGCOMM Workshop on the Economics of Peer-to-Peer Systems.
Bianchini M,Gori M,Scarselli F.2005.Inside pagerank[C].ACM Trans.Inter.Tech.,5(1):92-128.
Bono S C,Soghoian C A,Monrose F.2004.Mantis:A lightweight,server-anonymity preserving,searchable P2P[R].Information Security Institute of the Johns Hopkins University,Technical Report TR-2004-01-B-ISI-JHU.
Borisov N.2006.Computational puzzles as sybil defenses[C].Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing:171-176.
Breslau L,Cao P,Fan L.1999.Web caching and Zipf-like distributions:Evidence and implications[C].Proceedings of the IEEE INFOCOM:126-134.
Rulgatz J.1992.More extraordinary popular delusions and the madness of crowds[J]Three Rivers Press.
Buragohain C.Agrawasl D,Subhash S.2003.A game theoretic framework for incentives in P2P systems[C].Proceedings of the 3rd International IEEE Conferenceon Peer to Peer Computing:48-56.
Busi N,Manfredini C,Montresor A,et al.2008.Towards a data-driven coordination infrastructure for peer-to-peer systems[J].Web Engineering and Peer-to-Peer Computing,2376:295-299.
Chaum D.1981.Untraceable electronic mail,return addresses and digital pseudonyms[J].Communications of the ACM,24(2):84-88.
Chaum D.1988.The dining cryptographers problem[J].Journal of Cryptology,1(1):65-75.
Chen S.Wu Z.2003.PBiz:An e-Business model based on peer-to-peer network[C].Proceedings of the 2nd International Workshop on Grid and Cooperative Computing:277-284.
Chen X,Ren S S,Wang H N,et al.2005.SCOPE:scalable consistency maintenance in structured P2P systems[C].Proceedings of 24th Annual Joint Conference of the IEEE Computer and Communications Societies,3:1502-1513.
Cheng A,Friedman E.2005.Sybilproof reputation mechanisms.Proceedings of ACM Workshopon the Economics of Peer-to-Peer Systems.
Chu J,Labonte K,Levine B.2002.Availability and locality measurements of peer-to-per file systems[C].Proceedings of IT Com:Scalability and Traffic Control in IP Networks:310-321.
Clarke I,Sandberg O,Wiley B,et al.2000.Freenet:A distributed anonymous information storage and retrieval system[C].nternational Workshop on Design Issues in Anonymity and Unobservability.
Claudiu D,Shahmehri N.2005.Dynamic trust metrics for peer-to-peer system[C].Proceedings of the 16th Int'l Workshop on Database and Expert Systems Applications:776-781.
Clauset A,Newman M E J,Moore C.2004.Finding community structure in very large networks[M].Phys.Rev.E.,70:066111.
Cohen B.2001.BitTorrent[EB/OL].BitTorrent Inc.HTTP://www.bittorrent.com/.
Coleman J S．1990．社会理论的基础[M]．社会科学文献出版社．
ComScore.2009.Internet population passes one billion;top 15 countries[EB/OL].Elanso,[2009-01-24].HTTP://www.elanso.com/ArticleModule/ODHvNiTgPKR6IsHQG9QmPAIi.html.
Cornelli F,Damiani E,Samarati S.2002.Implementing a reputation-aware Gnutella servent[C].Proceedings of Intl Workshop on Peer-to-Peer Computing.
Crocker S.1969.Host software[EB/OL].Network Working Group Request for Comment.HTTP://www.ietf.org/rfc/rfc1.txt.
Damiani E,Capitani V S,Paraboschi S,et al.2002.A reputation-based approach for choosing reliable resources in peer-to-peer networks[C],Proceedings of the 9th Conference on Computer and Communications Security:207-216.
Dasgupta P.1990.Trust as a commodity.Trust:Making and Breaking Cooperative Relations[EB/OL].HTTP://citeseer.ist.psu.edu/dasgupta00trust.html/.
Dou W,Wang H M,Jia Y.2004.A recommendation-based peer-to-peer trust model[J].Journal of Software,15(4):571-583.
Douceur J.The sybil attack[C].2002.Proceedings of 2nd Workshop on Peer-to-Peer System,2002,LNCS 2429:251-260.
Faloutsos M,Faloutsos P,Faloutsos C.1999.On power-law relationship of the internet topology[C].Proceedings of the ACM SIGCOMM 1999 Conference on Applications,Technologies,Architectures,and Protocols for Computer Communication:251-262.
Farhad Manjoo.2002.Gnutella bandwidth bandits[EB/OL].HTTP://www.linux.com/feed/24453/.
Feldman M,Papadimitriou C.2006.Free-riding and whitewashing in peer-to-peer systems[J].Selected areas in communications,24(5):1010-1019.
Fiedler M.1973.Algebraic connectivity of graphs[J].Math,23:298.
Fightaids@home.2003.Fightaids@home[EB/OL].HTTP://fightaidsathome.stripps.edu/.
Figueiredo D,Shapiro J,Towsley D.2005.Incentives to promote availability in peer-to-peer anonymity systems[C].Proceedings of the 13th IEEE International Conference on Network Protocols(ICNP'05).
Fischmann M,Gunther O.2003.Free riders:Fact or fiction?[R].
FoIding@home.2000.Folding@home[EB/OL].HTTP://folding.stanfoSD.edu/.
Frankel J,Pepper T.2000.Gnutella[EB/OL].Nullsoft.HTTP://www.gnutella.com/.
Freedman M J,Morris R.2002.Tarzan:A peer-to-peer anonymizing network layer[C].Proceedings of the 9th CCS.
Friedman E,Resniek P.1998.The social cost of cheap pseudonyms[J].Journal of Economics and Management Strategy,10(2):173—199.
Gallaugher J M,Ramanathan S C.1996.Choosing a client/server architecture[J].Information Systems Management,13(2):7-13.
Girvan M,Newman M E.2001.Community structure in social and biological networks[M].Proc.Natl.Acad.Sci.,99:7821-7826.
Goel S,Robson M,Polte M,et al.2003.Herbivore:A scalable and efficient protocol for anonymous communication[R].Technical Report 2003-1890,Cornell University.
Goldberg I Shostack A.1999.Freedom network 1.0 architecture[EB/QL].HTTP://www.freedom.net/.
Gopalakrishnan V,Silaghi B,Bhattacharjee B,et al.2004.Adaptive replication in peer-to-peer systems[C].Proceedings of 24th International Conference on Distributed Computing SystemsICDCS2004:360-369.
Graham R.2001.Peer-to-peer:towards a definition[J].Proceedings of the 1st International Conference on Peer-to-Peer Computing.
Gummadi K,Dunn R,Saroiu S.2003.Measurement,modeling,and analysis of a peer-to-peer file-sharing workload[C].Proceedings of ACM SOSP2003,5(37):314-329.
Gupta M,Judge P,Ammar M.2003.A reputation system for peer-to-peer networks[C].13th International Workshop on Network and Operating Systems Support for Digital Audio and Video.
Hasdin G.1968.The Tragedy of the Commons[J].Science,162:1243-1248.
Hassan J,Hung L X,Kalim U,et al.2005.A trust model for ubiquitous systems based on vectors of trust values[C].Proceedings of the 7th IEEE Int'l Symp.on Multimedia:674-679.
Hildrum K,Kubiatowicz J,Rao S,et al.2002.Distributed data location in a dynamic network[J].Theory of Computing Systems Expanded journal version of SPAA 2002.
Homayounfar H,Wang F,Areibi S.2002.Advanced P2P architecture using autonomous agents[C].The ISCA 15th International Conference on Computer Applications in Industry and Engineering:115-118.
Houser D E,Wooders J.2005.Reputation in auctions:theory and evidence from eBay[J].Journal of Economics and Management Strategy.
Internet World Stats.2009.Internet usage statistics[EB/OL].Internet World Stats:Usage and Populartion Statistics,[2009-02-09].HTTP://www.internetworldstats.com/stats.htm.
Jelasity M,Montresor A,Babaoglu O.2004.Towards secure epidemics:Detection and removal of malicious peers in epidemic-style protocols[R].Technical Report.
Judge P.2002.ZDNet:.net vote rigging illustrates importance of web services[EB/OL].HTTP://news.zdnet.co.uk/software/0,39020381,2102244,00.htm/.
Kaelbling L P,Littman M L,Moore AW.1996.Reinforcement learning:A survey[J].Journal of Artificial Intelligence Research,4:237-285.
Kamvar S,Schlosser M,Garcia-Molina H.2003a.The EigenTrust algorithm for reputation management in P2P networks[C].Proceedings of the Twelfth International World Wide Web Conference:640-651.
Kamvar S,Schlosser M,Garcia-Molina H.2003b.Eigenrep:Reputation management in P2P networks[C],Proceedings of the Twelfth International World Wide Web Conference.
Kant K,Iyer R,Tewari V.2007.On the potential of peer-to-peer computing[EB/OL].Citeseerx.HTTP://kkant.ccwebhost.com/papers/taxonomy.pdf.
Kernighan B W,Lin S.1970.A efficient heuristic procedure for partitioning graphs[J].Bell System Technical Journal,49:291-307.
Kinateder M,Baschny E,Rothermel K.2005.Towards a generic trust model-Comparison of various trust update algorithms[C].Proceedings of iTrust 2005:177-192.
Krackhardt D,Lundberg M,Rourke L O.1993.KrackPlot:A picture's worth athousand words[J].Connections,16:37-47.
Kutzner K,Fuhrmann T.2005.Measuring large overlay networks-The overnet example[J].Proceedings of KiVS2005.
Ledlie J,Seltzer M.2005.Distributed,secure load balancing with skew,heterogeneity,and churn.Proceedings of IEEE INFOCOM.
Levine B N,Shields C,Margolin N B.2006.A survey of solutions to the sybil attack[R].Tech report 2006-052,University of Massachusetts Amherst,Amherst,MA.
Li J T,Jing Y N.A trust model based on similarity-weighted recommendation for P2P environments[J].Journal of Software,18(1):157-167.
Liao X F,Jin H,Liu Y H,et al.2006.AnySee:Peer-to-Peer Live Streaming[EB/OL].CiteULike.HTTP://www.cs.ust.hk/～liu/AnySee.pdf.
Liang J,Kumar R,Ross K W.2001.The KaZaA overlay:a measurement study,computer networks(special issue on overlays),to appear[EB/OL].KaZaA.HTTP://www.KaZaA.com.
Liang J,Kumar R,Xi Y,et al.2005.Pollution in file sharing systems[C].Proceedings of the IEEE Infocom 2005.
Liang J,Naoumov N,Ross K W.2006.The Index Poisoning Attack in P2P File-Sharing Systems[C].Proceedings of IEEE Infocom 2006.
Lua E,Crowcroft J,Pias M,et al.2005.A survey and comparison of peer-to-peer overlay network schemes[J].IEEE Communications Survey and Tutorial,7(2):72-93.
Mankiw N G.2003.Principles of economics[M],3~(rd)Edition.Thomson Learning.
Maniatis P,Rosenthal D S H,Roussopoulos M,et al.2003.Preserving peer replicas by rate-limited sampled voting[C].Proceedings of ACM SOSP:44-59.
Maniatis P,Roussopoulos M,Giuli T J,et al.2005.The lockss peer-to-peer digital preservation system[J].ACM Trans.Comput.Syst,23(1):2-50.
Marsh S.1994.Formalising trust as a computational concept.PhD thesis,University of Stirling.
Marti S,Garcia-Molina H.2004.Limited reputation sharing in p2p systems[C].Proceedings of 5th ACM conference on Electronic commerce.
McCaleb J.2000.eDonkey2000 network[EB/OL].HTTP://www.edonkey2000.com/.
McCaleb J.2006.Overnet[EB/OL].HTTP://www.overnet.org/.
Merkur.2002.eMule[EB/OL].HTTP://www.emule-project.net/.
Merton R K.1968.The matthew effect in science:The reward and communication systems of science are considered.Science.199(3810):55-63.
Milojicic D S,Kalogeraki V,Lukose R M.2002.Peer-to-peer computing[R].Hewlett-Packard Company.
Montresor A,Meling H,Babaoglu O.2002.Towards adaptive,resilient and self-organizing peer-to-peer systems[C].Networking 2002 Workshop:300-305.
MUTE.2004.MUTE:Simple,Anonymous File Sharing[EB/OL].HTTP://mutenet.sourceforge.net/.
Netbatch.1990.Netbatch[EB/OL].HTTP://www.intel.com/.
Newman M E J.2004.Fast algorithm for detecting community structure in network[J].Phy.Rev.E.
Oram A.2001.Peer-to-peer:Harnessing the power of disruptive technology[M].Sebastopol:O'Reilly Press:222～238.
Padmanabhan V,Qiu L L.2000.The content and access dynamic of a busy web site:Findings and implications[C].Proceedings of the SIGCOM:111-123.
Pfitzmann A,Kohntopp M.2000.Anonymity,unobservability,and pseudonymity:A proposal for terminology[J],Designing Privacy Enhancing Technologies:Design Issues in Anonymity and Observability.
Philippe G,Brown K L,Ilya mironov,et al.2001.Incentives for sharing in peer-to-peer networks[c].Proceedings of the 3rd ACM conference on Electronic Commerce.
Plissonneau L,Costeux J L,Brown P.2005.Analysis of peer-to-peer traffic on ADSL[C].Proceedings of PAM:69～82.
Pothen A,Simon H,Liou K P.1990.Partitioning sparse matrices with eigenvectors of graphs[J].Matrix Anal,11:430.
PPlive.2004.PPlive[EB/OL].HTTP://www.pplive.com/.
PPStream.2005.PPStream[EB/OL].HTTP://nj.onlinedown.net/soft/40670.htm/.
Ramaswamy L,Liu L.2003.FreeRiding:A new challenge for peer-to-peer file sharing systems[C].Proceedings of the 2003 Hawaii International Conference on System Sciences(P2P Track)HICSS2003.
Ratnasamy S,Francis P,Handley M,et al.2001.A scalable content-addressable network[C].Proceedings of the ACM SIGCOMM 2001 Conference on Applications,Technologies,Architectures,and Protocols for Computer Communication:161-172.
Reed M G,Syverson P F.1999.Onion routing[C].Proceeding of AIPA'99.
Reiter M K,Rubin A D.1998.Crowds:anonymity for Web transactions[J].ACM Transactions on Information and System Security(TISSEC).
Rhea S,Geels D,Roscoe T.2004.Handling chum in a DHT[C].Proceedings of the 2004 USENIX Technical Conference:127-146.
Rowstron A,Druschel P.2001.Pastry:Scalable,decentralized object location and routing for large scale peer-to-peer systems[C].Proceedings of the 1FTP/ACM International Conference on Distributed Systems Platforms(Middleware'01):329-350.
Saroiu S,Gummadi P K,Gribble.2002.A Measurement study of peer-to-peer file sharing systems[C].Proceedings of Multimedia Computing Networking 2002.
Schollmeier R.2001.A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications[C].Proceedings of the 1st International Conference on Peer-to-Peer Computing:101-102.
Selcuk,A,Uzun E,Pariente M R.2004.A reputation-based trust management system for P2P networks[C].Proceedings of 4th International Workshop on Global and Peer-to-Peer Computing.
Scott J.2002.Social network snalysis:A handbook[M].London:Sage Publications,2nd ed.
Sen S,Wang J.2002.Analyzing peer-to-peer traffic across large networks[C].Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurement workshop:219-232.
Shields C,Levine B N.2000.A protocol for anonymous communication over the Internet[C].Proceedings of CCS:33-42.
Shirk C.2000.What is P2P and what isn't[EB/OL].O'REILLY.[2000-11-24].HTTP://www.openp2p.com/pub/a/p2p/2000/ll/24/shirkyl-whatisp2p.html.
Shneidman J,Parkes D C,Massoulie L.2004.Faithfulness in internet algorithms[C].Proceedings of Workshop on Practice and Theory of Incentives and Game Theory in Networked Systems.
Singh A,Liu L.2003.TrustME:Anonymous management of trust relationships in decentralized P2P systems[C].Proceedings of the Third International IEEE Conference on Peer-to-Peer Computing.
Sit E,Morris R.2002.Security considerations for peer-to-peer distributed hash tables[J],Peer-to-Peer Systems,2429:261-269.
Srivatsa M,Liu L.2004.Vulnerabilities and security threats in structured overlay networks:A quantitative analysis[C].Proceedings of ACSAC 2004:252-261.
Stoica I,Morris R,Liben-Nowell D,et al.2003.Chord:A scalable peer-to-peer lookup protocol for internet applications[J].IEEE/ACM Transactions on Networking,11(1):17-32.
Stutzbach D,Rejaie R.2004.Towards a better understanding of churn in peer-to-peer networks[R].Technical Report.
Tallinn J.2001.FastTrack[EB/OL].HTTP://www.slyck.com/ft.php/.
Tian J,Dai Y F.2007.Understanding the dynamic of peer-to-peer systems[C].Proceedings of IPTPS 2007.
Varian H R.2006.Intermediate Microeconomics[M],6th edition.
Vroonhoven J V.2006.Peer to peer security[C],Proceedings of 4th Twente Student Conference on IT.
VBS.Gnutella Worm.2000.VBS.Gnutella Worm[EB/OL].HTTP://securityresponse.symantec.com/avcenter/venc/data/vbs.gnutella.html/.
Waterhouse S,Doolin D M,Kan G,et al.2002[C].Distributed search in peer-to-peer networks. IEEE Internet Computing 2002.
Wang X Y,NG W S,Ooi B C,et al.2008.Buddy Web:a P2P-based collaborative web caching system[J].Web Engineering and Peer-to-Peer Computing,2376:247-251.
Wang Y,Vassileva J.2003.Bayesian network-based trust model[C],Proceedings of IEEE/WIC International Conference on Web IntelligenceWI:372-378.
Wu H F,Shi C J.2008.A trust management model for P2P file sharing system[C].International Conference on Multimedia and Ubiquitous Engineering:41-44.
Xie H,Krishnanmurthy A,Yang R Y,et al.2007.P4P:proactive provider participation for P2P[EB/OL].HTTP://codex.cs.yale.edu/avi/home-page/p4p-dir/publications/trl377.pdf.
Xiong L,Liu L.2004.PeerTrust:Supporting reputation-based trust for peer-to-peer electronic communities[J].IEEE Transactions on Knowledge and Data Engineering,16(7):843-857.
Yu H F,Kaminsky M,Gibbons P B.2006.SybilGuard:defending against sybil attacks via social networks[C].Proceedings of SIGCOMM'06:267-278.
Yurkewych M,Levine B N,Rosenberg A L.2005.On the cost-ineffectiveness of redundancy in commercial p2p computing[C].Proceedings of ACM CCS:280-288.
Zennstr(o|¨)m N,Friis J.2006.Skype[EB/OL].HTTP://www.skype.com.
Zhang X,Liu J.2005.CoolStreaming/DONet:A data-driven overlay network for efficient live media streaming[C].Proceedings of IEEE INFOCOM.
Zhao B,Kubiatowocz J,Joseph A.2001.Tapestry:an infrastructure for fault-tolerant wide-area location and routing[R].Technical Report UCB/CSD-01-114.
Zhu B,Setia S,Jajodia S.2006.Providing witness anonymity in peer-to-peer systems[C].Proceedings of CCS'06.