对等网络中信任模型与激励机制研究
|
摘要
P2P网络具有开放、动态、异质、节点对等、资源共享自愿等特性，近年来，其优势已经在文件共享、协同计算、分布式存储以及应用层组播等应用领域得到了充分证实。然而，许多事实也表明P2P网络中存在大量自私的理性节点，他们的根本目标是最大化自身利益，而并不考虑网络的整体效用；甚至，一些恶意节点采用欺骗行为提供虚假资源与不良服务，企图破坏网络，从而造成数据污染、自由骑、公共悲剧以及不可靠服务的可用性等问题。这些问题不仅导致P2P网络本身资源利用率、可信度与服务成功率降低，而且会加重底层物理网络的负载与拥塞，严重地阻碍P2P网络的健康发展。本文围绕上述问题展开研究，试图从覆盖网络构造、信任模型与激励机制等方面提出一些理论方法与实用技术，以促进节点有效合作并合理使用网络资源，提高P2P网络的综合性能。
首先，提出一种层次型P2P覆盖网络构造方法，以提高逻辑覆盖网络与物理网络的匹配程度，并支持后续的全局信任值分级计算。逻辑覆盖网络与物理网络的不匹配现象会导致严重的路绕问题，造成大量的带宽浪费与系统延时，加重公共悲剧。针对这种现象，本文引入模糊逻辑学中基于密度的减法聚类方法，设计一种基于物理网络中节点间距离邻近度的子网划分算法，确保同一逻辑子网中的节点在物理网络上也是邻近的，每个子网络均基于Chord协议自组织为结构化P2P网络。同时，考虑到P2P网络中节点能力的差异性，设计一种基于DHT的超级节点选举算法，从每个子网络中选举计算能力强且在线时间长的节点作为各子网络的超级节点，所有超级节点又自组织形成一个小网络，这就是上层网络，整个网络被构造成为带有超级节点的层次型覆盖网。分析与实验结果表明这种层次型覆盖网络构造方法既能够解决P2P网络的路绕问题，又能够提高其稳定性。
其次，提出一种P2P网络全局信任模型并给出它的分布式实现，帮助节点进行服务选取，尽量回避污染数据与不可靠服务。该模型基于节点间的历史交易信息计算本地(局部)信任值，并通过分布式迭代算法求解节点基于整个网络的全局信任值，能够确保构成迭代算法的概率转移矩阵具有非周期、不可约的马尔柯夫统计特性，从而使得迭代算法收敛。模型在本地信任值计算方法中引入模糊函数处理正负评价，与将正负评价简单加减的常用方法相比，既提高了本地信任值计算的合理性，又兼顾了激励机制。针对P2P网络中全局迭代算法的计算量与通信开销随着网络规模二次方比率增长的问题，本文模型采用分级计算方法求解节点的全局信任值，利用上述提出的层次型覆盖网络，将大规模物理网络从逻辑上划分成若干小网络，迭代算法在各小网络中并行进行，待迭代收敛后逐层合成计算结果，便得到节点的全局信任值，该方法有效地降低了全局信任模型的计算量与通信开销。
然后，针对恶意节点提供虚假信任评价及策略性动态摇摆行为两种情形，分别提出了有效的遏制机制，以增强全局信任模型的抗攻击能力。利用评价管理节点监视节点的评价行为，并且计算节点的评价可信度；利用信任管理节点监视节点的动态摇摆行为，并且计算节点的动态摇摆度。模型通过反馈控制机制将评价可信度与动态摇摆度反馈到本地信任值求解阶段，间接地影响节点的全局信任值。节点无论评价可信度低还是摇摆度大都将受到系统的惩罚，它的全局信任值就会降低，反之亦然。仿真实验表明，本文模型较已有相关模型具有更强的抗攻击能力和更高的服务成功率。
再次，针对自由骑问题，提出一种基于全局信任值的激励机制。分析了BitTorrent系统中的TfT(Tit-for-Tat)策略，指出该策略在能够建立可重复博弈的理想网络中是实用的。但是，在规模较大且服务形式多样化的P2P网络中，节点间交易的随机性造成建立重复博弈的概率极低，因此，这种直接互惠式激励机制的可行性值得商榷。由于节点全局信任值的高低能够充分反映节点对网络贡献大小与服务质量好坏，据此，本文基于节点间全局信任值的差异设置服务响应规则、查询转发规则以及邻居选择规则，激励节点积极贡献与可靠服务，间接体现TfT策略。仿真实验表明，本文的激励机制能够改变自由骑的行为策略，鼓励他们共享资源，具有较强的普适性。
最后，设计并实现了一个集成信任管理与激励机制的P2P文件共享原型系统，验证了本文的研究成果。
P2P networks are open, dynamic and heterogeneous, and whose nodes are peer topeer and share their resources voluntarily. In recent years, the advantages of P2Pnetworks have been confirmed in some application fields including file sharing,collaborative computation, distributed storage, multicast of application layer, and soon. However, many facts also indicate that large numbers of self-interest rationalusers appear in P2P network and their basic purpose is just to maximize their owninterests while ignoring the whole utility of the network. More seriously, somemalicious nodes adopt cheating behavior to provide deceitful resources and badservices in order to damage the P2P network, and thus this result in data pollution,free riding, common tragedy and usability of incredible services. These problems notonly lower resources utilization, credibility and success rate of services in P2Pnetworks, but also aggravate the load and congestion in physical networks, whichhinder the healthy development of P2P networks seriously. Focusing on theseproblems this thesis tries to propose some theoretic methods and practical techniquefrom construction of overlay network, trust model and incentive mechanism topromote the effective cooperation between nodes and reasonable use of networkresources, and raise the comprehensive performance of P2P network.
Firstly, this thesis proposes a construction method of layered P2P overlaynetwork to raise the matching degree between logical overlay and physical networksand support the subsequent hierarchical computation of global trust value. Themismatching between logical overlay and physical networks can bring about a seriousroad-round problem and result in huge bandwidth waste and system delay, andaggravate the common tragedy. Aiming at the phenomenon, this thesis introduces thesubtractive clustering method based on density in fuzzy logic, and designs analgorithm which divides a large network into some small subnets based on theproximity of distance between nodes in physical network, and can ensure the nodes inthe same logical subnet are close in physical network. Each subnet self-organizes astructured P2P network based on Chord protocol. Considering the ability differencesof nodes in P2P network, at the same time, this thesis designs a super-node electionalgorithm based on DHT where the nodes which have strong compute ability and longon-line time are selected as super-nodes of each subnet. All these super-nodes self-organize a small network named top-level network, and thus the layeredstructured overlay network with super-nodes is constructed. Some analysis andexperimental results show the layered overlay network can solve the road-roundproblem and improve the stability of P2P network.
Secondly, this thesis presents a global trust model and its distributedimplementation in P2P networks to help nodes to select services and avoid polluteddata and unreliable services as far as possible. The model computes local trust valuebased on history trade information between nodes and obtains global trust value ofnodes based on the whole network via a distributed iteration algorithm. This modelcan ensure such Markov characteres as nonperiodic and irreducible of the probabilitytransfer matrix constituting the iteration algorithms and thus convergence of theiteration algorithms. The model introduces fuzzy function to process positive andnegative evaluation in the local trust computation. Comparing the existing methodswhich add and subtract the positive and negative evaluation simply, this method notonly improves the rationality of local trust computation, but also takes incentivemechanism into account. Focusing on the issue that the computation andcommunication cost of the global iteration algorithm for P2P networks incease withthe square of the network scale, the model in this thesis adopts the hierarchicalcomputation method to obtain the global trust value and divides the large scalephysical network into some small networks logically by the above-mentioned layeredoverlay network method. Iterations are done in these small networks concurrently andthe global trust values of nodes are obtained through computation layer by layer afteriterations have converged. The method lowered effectively the compution andcommunication cost of the global trust model.
Thirdly, aiming at the deceitful trust evaluation and strategic oscillating behaviorof malice nodes, this thesis proposes two effective suppressing mechanismsrespectively which can enhance the anti-attack ability of the global trust model. Theevaluation management nodes are used to monitor the evaluation behavior of othernodes and compute their evaluation credibility, and the trust management nodes areused to monitor the oscillating behavior of other nodes and compute their oscillatingdegree. The model integrates evaluation credibility and behavior oscillating degreeinto local trust computation via a feedback control mechanism, and influence theglobal trust value of nodes indirectly. These nodes will be subjected to somepunishment of the system that their global trust value will be lowered whether theirevaluation credibility is low or their behavior oscillating degree is large, and vice versa. Simulation results show that the proposed model has the stronger anti-attackability and higher service success rate than the existing models related.
Fourthly, this thesis proposes an incentive mechanism based on the global trustvalue of nodes to deal with the free-riding problem. After analysing the TfT(Tit-for-Tat) strategy of BitTorrent system, this thesis points out that the TfT strategyis practical in the ideal network where repeatable game can been established. In thelarge-scale P2P network with diverse services, however, the randomicity of tradebetween nodes results in the probability of building up a repeated game is very low.Therefore, the feasibility of the incentive mechanism based on direct reciprocity isquestionable. Since the global trust value of nodes can well reflect their contributionand service quality to networks, this thesis establishes service response, queryforward and neighbor selection rules according to the differences of global trust valuebetween nodes to encourage nodes to contribute actively and service dependablywhich reflects the TfT strategy indirectly. Simulations show that the incentivemechanism in this thesis can change the behavior strategy of the free-riders andencourage them to share resources and has good universality.
Finally, a P2P file sharing prototype system integrating trust management andincentive mechanism is developed to verify the findings in this thesis.
首先，提出一种层次型P2P覆盖网络构造方法，以提高逻辑覆盖网络与物理网络的匹配程度，并支持后续的全局信任值分级计算。逻辑覆盖网络与物理网络的不匹配现象会导致严重的路绕问题，造成大量的带宽浪费与系统延时，加重公共悲剧。针对这种现象，本文引入模糊逻辑学中基于密度的减法聚类方法，设计一种基于物理网络中节点间距离邻近度的子网划分算法，确保同一逻辑子网中的节点在物理网络上也是邻近的，每个子网络均基于Chord协议自组织为结构化P2P网络。同时，考虑到P2P网络中节点能力的差异性，设计一种基于DHT的超级节点选举算法，从每个子网络中选举计算能力强且在线时间长的节点作为各子网络的超级节点，所有超级节点又自组织形成一个小网络，这就是上层网络，整个网络被构造成为带有超级节点的层次型覆盖网。分析与实验结果表明这种层次型覆盖网络构造方法既能够解决P2P网络的路绕问题，又能够提高其稳定性。
其次，提出一种P2P网络全局信任模型并给出它的分布式实现，帮助节点进行服务选取，尽量回避污染数据与不可靠服务。该模型基于节点间的历史交易信息计算本地(局部)信任值，并通过分布式迭代算法求解节点基于整个网络的全局信任值，能够确保构成迭代算法的概率转移矩阵具有非周期、不可约的马尔柯夫统计特性，从而使得迭代算法收敛。模型在本地信任值计算方法中引入模糊函数处理正负评价，与将正负评价简单加减的常用方法相比，既提高了本地信任值计算的合理性，又兼顾了激励机制。针对P2P网络中全局迭代算法的计算量与通信开销随着网络规模二次方比率增长的问题，本文模型采用分级计算方法求解节点的全局信任值，利用上述提出的层次型覆盖网络，将大规模物理网络从逻辑上划分成若干小网络，迭代算法在各小网络中并行进行，待迭代收敛后逐层合成计算结果，便得到节点的全局信任值，该方法有效地降低了全局信任模型的计算量与通信开销。
然后，针对恶意节点提供虚假信任评价及策略性动态摇摆行为两种情形，分别提出了有效的遏制机制，以增强全局信任模型的抗攻击能力。利用评价管理节点监视节点的评价行为，并且计算节点的评价可信度；利用信任管理节点监视节点的动态摇摆行为，并且计算节点的动态摇摆度。模型通过反馈控制机制将评价可信度与动态摇摆度反馈到本地信任值求解阶段，间接地影响节点的全局信任值。节点无论评价可信度低还是摇摆度大都将受到系统的惩罚，它的全局信任值就会降低，反之亦然。仿真实验表明，本文模型较已有相关模型具有更强的抗攻击能力和更高的服务成功率。
再次，针对自由骑问题，提出一种基于全局信任值的激励机制。分析了BitTorrent系统中的TfT(Tit-for-Tat)策略，指出该策略在能够建立可重复博弈的理想网络中是实用的。但是，在规模较大且服务形式多样化的P2P网络中，节点间交易的随机性造成建立重复博弈的概率极低，因此，这种直接互惠式激励机制的可行性值得商榷。由于节点全局信任值的高低能够充分反映节点对网络贡献大小与服务质量好坏，据此，本文基于节点间全局信任值的差异设置服务响应规则、查询转发规则以及邻居选择规则，激励节点积极贡献与可靠服务，间接体现TfT策略。仿真实验表明，本文的激励机制能够改变自由骑的行为策略，鼓励他们共享资源，具有较强的普适性。
最后，设计并实现了一个集成信任管理与激励机制的P2P文件共享原型系统，验证了本文的研究成果。
P2P networks are open, dynamic and heterogeneous, and whose nodes are peer topeer and share their resources voluntarily. In recent years, the advantages of P2Pnetworks have been confirmed in some application fields including file sharing,collaborative computation, distributed storage, multicast of application layer, and soon. However, many facts also indicate that large numbers of self-interest rationalusers appear in P2P network and their basic purpose is just to maximize their owninterests while ignoring the whole utility of the network. More seriously, somemalicious nodes adopt cheating behavior to provide deceitful resources and badservices in order to damage the P2P network, and thus this result in data pollution,free riding, common tragedy and usability of incredible services. These problems notonly lower resources utilization, credibility and success rate of services in P2Pnetworks, but also aggravate the load and congestion in physical networks, whichhinder the healthy development of P2P networks seriously. Focusing on theseproblems this thesis tries to propose some theoretic methods and practical techniquefrom construction of overlay network, trust model and incentive mechanism topromote the effective cooperation between nodes and reasonable use of networkresources, and raise the comprehensive performance of P2P network.
Firstly, this thesis proposes a construction method of layered P2P overlaynetwork to raise the matching degree between logical overlay and physical networksand support the subsequent hierarchical computation of global trust value. Themismatching between logical overlay and physical networks can bring about a seriousroad-round problem and result in huge bandwidth waste and system delay, andaggravate the common tragedy. Aiming at the phenomenon, this thesis introduces thesubtractive clustering method based on density in fuzzy logic, and designs analgorithm which divides a large network into some small subnets based on theproximity of distance between nodes in physical network, and can ensure the nodes inthe same logical subnet are close in physical network. Each subnet self-organizes astructured P2P network based on Chord protocol. Considering the ability differencesof nodes in P2P network, at the same time, this thesis designs a super-node electionalgorithm based on DHT where the nodes which have strong compute ability and longon-line time are selected as super-nodes of each subnet. All these super-nodes self-organize a small network named top-level network, and thus the layeredstructured overlay network with super-nodes is constructed. Some analysis andexperimental results show the layered overlay network can solve the road-roundproblem and improve the stability of P2P network.
Secondly, this thesis presents a global trust model and its distributedimplementation in P2P networks to help nodes to select services and avoid polluteddata and unreliable services as far as possible. The model computes local trust valuebased on history trade information between nodes and obtains global trust value ofnodes based on the whole network via a distributed iteration algorithm. This modelcan ensure such Markov characteres as nonperiodic and irreducible of the probabilitytransfer matrix constituting the iteration algorithms and thus convergence of theiteration algorithms. The model introduces fuzzy function to process positive andnegative evaluation in the local trust computation. Comparing the existing methodswhich add and subtract the positive and negative evaluation simply, this method notonly improves the rationality of local trust computation, but also takes incentivemechanism into account. Focusing on the issue that the computation andcommunication cost of the global iteration algorithm for P2P networks incease withthe square of the network scale, the model in this thesis adopts the hierarchicalcomputation method to obtain the global trust value and divides the large scalephysical network into some small networks logically by the above-mentioned layeredoverlay network method. Iterations are done in these small networks concurrently andthe global trust values of nodes are obtained through computation layer by layer afteriterations have converged. The method lowered effectively the compution andcommunication cost of the global trust model.
Thirdly, aiming at the deceitful trust evaluation and strategic oscillating behaviorof malice nodes, this thesis proposes two effective suppressing mechanismsrespectively which can enhance the anti-attack ability of the global trust model. Theevaluation management nodes are used to monitor the evaluation behavior of othernodes and compute their evaluation credibility, and the trust management nodes areused to monitor the oscillating behavior of other nodes and compute their oscillatingdegree. The model integrates evaluation credibility and behavior oscillating degreeinto local trust computation via a feedback control mechanism, and influence theglobal trust value of nodes indirectly. These nodes will be subjected to somepunishment of the system that their global trust value will be lowered whether theirevaluation credibility is low or their behavior oscillating degree is large, and vice versa. Simulation results show that the proposed model has the stronger anti-attackability and higher service success rate than the existing models related.
Fourthly, this thesis proposes an incentive mechanism based on the global trustvalue of nodes to deal with the free-riding problem. After analysing the TfT(Tit-for-Tat) strategy of BitTorrent system, this thesis points out that the TfT strategyis practical in the ideal network where repeatable game can been established. In thelarge-scale P2P network with diverse services, however, the randomicity of tradebetween nodes results in the probability of building up a repeated game is very low.Therefore, the feasibility of the incentive mechanism based on direct reciprocity isquestionable. Since the global trust value of nodes can well reflect their contributionand service quality to networks, this thesis establishes service response, queryforward and neighbor selection rules according to the differences of global trust valuebetween nodes to encourage nodes to contribute actively and service dependablywhich reflects the TfT strategy indirectly. Simulations show that the incentivemechanism in this thesis can change the behavior strategy of the free-riders andencourage them to share resources and has good universality.
Finally, a P2P file sharing prototype system integrating trust management andincentive mechanism is developed to verify the findings in this thesis.
引文
[1]吴增德.异构环境下结构化对等网络路由算法的研究:[博士学位论文].上海：上海交通大学,2003,12-23
[2]窦文.信任敏感的P2P拓扑构造及其相关技术研究:[博士学位论文].长沙：国防科学技术大学,2003,14-70
[3]胡进锋,黎明,郑纬民等.带宽自适应的P2P网络路由协议.软件学报,2005,16(5):991-999
[4] LTD S.N.. KaZaa media desktop. http://www.KaZaa.com/,2006-09-12
[5]陈海涛.对等网络中的内容搜索、定位和下载技术研究:[博士论文].长沙：国防科学技术大学,2005,13-27
[6] Dejan S. M., Vana K., Rajan L., et al. Peer-to-Peer computing. Technical ReportHPL-2002-57(R.1), HP Laboratories Palo Alto. July,2003
[7] DePaoli F., Mariani L.. Dependability in peer-to-peer systems. IEEE InternetComputing. July-Aug.2004,8(4):54-61
[8] Changqiao Xu, Muntean G.-M., Fallon E.. et al. Distributed storage-assisteddata-driven overlay network for P2P VoD services. IEEE Transactions onBroadcasting,2009,55(1):1-10
[9] Lakshmish Ramaswamy, Bugra Gedik, Ling Liu. A distributed approach to nodeclustering in decentralized peer-to-peer networks. IEEE Transactions on Paralleland Distributed Systems,2005,16(9):814-829
[10] Ramasubramanian V., Sirer E.G.. The design and implementation of a nextgeneration name service for the Internet. In: Proceedings of ACMSIGCOMM’04. Portland, Oregon, USA,2004,331-342
[11] Iyer S., Rowstron A., Druschel P.. Squirrel: A decentralized peer-to-peer webcache. In: Proceedings of the21thACM Symposium on Principles of DistributedComputing (PODC2002). Monterey, CA: ACM Press,2002,213-222
[12] P2PWG. Peer-to-Peer Working Group. http://www.peer-to-peerwg.org,2007-04-07
[13] Shirk C. What is P2P and what isn’t. http://www.openp2p.com/pub/a/P2P/2000/11/24/shirky1-whatisp2p.html,2006-10-23
[14] Society T.P. Seti@home project home page http://setiathome.ssl.berkeley. edu/,2005-11-19.
[15] Kant K., Iyer R., Tewari V.. A Framework for classifying peer-to-peertechnologies. In: Proceedings of2ndIEEE/ACM International Symposium onCluster Computing and the Grid (CCGRID2002). Washington: IEEE ComputerSociety,2002,368-376
[16] Androutsellis-Theotokis S., Spinellis D.. A survey of peer-to-peer contentdistribution technologies. ACM Computing Surveys,2004,36(4):335-371
[17] Napster website. http://www.napster.com,2008-05-12
[18] Gnutella Protocol Specification, version0.4. http://www.clip2.com/GnutellaProtocol04.pdf,2005-09-18
[19] eMule website. http://www.emule-project.net/,2006-08-11
[20] BitTorrent website. http://bitconjurer.org/BitTorrent,2007-09-12
[21] Stoica I., Morris R., Liben-Nowell D., et al. Chord: A scable peer-to-peerlookup protocol for Internet application. IEEE/ACM Transactions onNetworking,2003,11(1):17-32
[22] Rowstron A., Druschel P.. Pastry: scalable, decentralized object location androuting for large-scale peer-to-peer systems. In: Proceedings of the IFIP/ACMInternational Conference on Distributed Systems Platforms (Middleware2001).Heidelberg, Germany: Springer-Verlag,2001,329-350
[23] Ratnasamy S., Francis P., Handley M., et al. A scalable content-addressablenetwork. In: Proceedings of ACM SIGCOMM’2001. San Diego, California,USA: ACM Press,2001,161-172
[24] Zhao B. Y., Ling Huang, Stribling J., et al. Tapestry: A resilient global-scaleoverlay for service deployment. IEEE Journal on Selected Areas inCommunications,2004,22(1):41-53
[25] Karger D., Lehman E., Leighton F., et al. Consistent hashing and random trees:Distributed caching protocols for relieving hot spots on the world wide web. In:Proceedings of the29th Annual ACM Symposium on Theory of Computing.Dallas, Texas, U.S., ACM Press,1997,654-663
[26] NextPage Website. http://www.nextpage.com,2007-10-12
[27] Bolosky W. J., Douceur J. R., David Ely, et al. Feasibility of a serverlessdistributed file system deployed on an existing set of desktop PCs. ACMSIGMETRICS Performance Evaluation Review,2000,28(1):34-43
[28] Rhea S., Wells C., Eaton P., et al. Maintenance-Free Global Data Storage. IEEEInternet Computing,2001,5(5):40-49
[29] Dabek F, Kaashoek M. F., Karger D., et al. Wide-area Cooperative Storage withCFS. In: Proceedings of the18th ACM Symposium on Operating SystemsPrinciples(SOSP2001). Banff, Canada, October2001,201-215
[30] Rowstron A., Druschel P.. PAST: A large-scale, persistent P2P storage utility. In:Proceedings of the8thWorkshop on Hot Topic in Operating Systems. SchlossElmau,Germany,2001,75-80
[31] Anderson D. P., Cobb J., Korpela E., et al. SETI@home: An experiment inpublic-resource computing. Communications of the ACM,2002,45(11):56-61
[32] Stanford University. Folding@home project home page. http://folding.stanford.edu/,2005-10-19
[33] Stanford University. Genome@home home page. http://genomeathome.stanford.edu/,2005-09-17
[34] Intel. Nebatch. http://www.intel.com,2005-08-12
[35] Networks G. Groove home page. http://www.groove.net/home/index.cfm,2006-04-12
[36] KISTI, Korea@home home page. http://www.koreaathome.org/,2006-05-16
[37] Zhuang S. Q., Zhao B. Y., Joseph A. D., et al. Bayeux: an architecture forscalable and fault-tolerant wide-area data disemination. In: Proceedings of the11thInternational Workshop on Network and Operating System Support forDigital Audio and Video (NOSSDAV2001). New York,2001,11-20
[38] Castro M., Druschel P., Kermarrec A.-M., et al. Scribe: A large-scale anddecentralized application-level Multicast Infrastructure. IEEE Journal onSelected Areas in Communications (JSAC), October2002,20(8):1489-1499
[39] Tran D. A., Hua K. A., Do T., et al. Zigzag: an efficient peer-to-peer scheme formedia streaming. In: Proceedings of the22ndAnnual Joint Conference of theIEEE Computer and Communications Societies (INFOCOM2003). SanFrancisco,CA,USA,2003, Vol.2,1283-1292
[40] WebRAID. WebRAID home page. http://webraidsoftware.tripod.com,2006-09-17
[41] Konitiki, Inc. Kontiki home page. http://www.kontiki.com/,2005-08-17
[42] Joltid Ltd. Joltid home page. http://www.joltid.com/index.php/peerenabler,2005-08-19
[43] Farhad Manjoo. Gnutella bandwidth bandits. http://www.salon.com/tech/feature/2002/08/08/gnutella developers/,2002-08-08
[44] VBS.Gnutella Worm. http://securityresponse.symantec.com/avcenter/venc/data/vbs.gnutella.html,2004-09-12
[45] Liang J, Kumar R, Xi Y, et al. Pollution in P2P file sharing systems. In:Proceedings of the24thAnnual Joint Conference of the IEEE Computer andCommunications Societies (INFOCOM2005). Miami, FL USA,2005, Vol.2:1174-1185
[46] Leey U., Choi M., Choy J., et al. Understanding Pollution Dynamics in P2P FileSharing. In: Proceedings of the5th International Workshop on Peer-to-PeerSystems(IPTPS’06). Santa Baebara, CA, US. Feb,2006
[47] Hardin G.. The tragedy of the commons. Science,1968,162:1243-1248
[48] Adar E., Huberman B. A.. Free riding on gnutella. First Monday,2000,5(10):32-35
[49] Hughes D., Coulson G., Walkerdine J.. Free riding on Gnutella revisited: thebell tolls?. IEEE Distributed Systems Online,2005,6(6):1-18
[50] Sen S., Wang J.. Analyzing peer-to-peer traffic across large networks. IEEETransactions on Networking,2004,12(2):219-232
[51] Wilson D.. CacheLogic Study-P2P is Changing. http://www.slyck.com/story914_CacheLogic_Study_P2P_is_Changing,2005-9-16
[52] Xia R. L., Muppala J. K.. A survey of BitTorrent performance. IEEECommunications Surveys&Tutorials,2010,12(2):140-158
[53] Fedak G., Germain C., Neri V., et al. Xterm web: a generic global computingsystem. In: Proceedings of the1stIEEE/ACM International Conference onCluster Computing and Grid. Brisbane, Australia,2001,452-460
[54] Saroiu S., Gummadi P. K., Gribble S. D.. A measurement study of peer-to-peerfile sharing systems. In: Proceedings of Multimedia Computing and Networking2002(MMCN’02), San Jose, CA, USA,2002,156-170
[55] Faloutsos M., Faloutsos P., Faloutsos C.. On PowerLaw Relationships of theInternet Topology. In: Proceedings of the ACM SIGCOMM. New York, USA,1999,251-262
[56] Srivatsa M., Gedik B., Ling Liu. Large scaling unstructured peer-to-peernetworks with heterogeneity-aware topology and routing. IEEE Transactions onParallel and Distributed Systems.2006,17(11):1277-1293
[57] Marsh S.. Formalizing Trust as a Computational Concept. Ph.D. Thesis,University of Stirling,1994,3-8
[58] Blaze M., Feigenbaum J., Lacy J.. Decentralized trust management. In:Proceedings of the17th Symposiumon Security and Privacy. Oakland, CA,1996,164-173
[59] Grandison T., Sloman M.. A survey of trust in internet applications. IEEECommunications Surveys&Tutorials,2000,3(4):2-16
[60] Gambetta D. Can we trust trust? In: Gambetta D, ed. Trust: Making and BreakingCooperative Relations. Basil Blackwell: Oxford Press,1990,213~237
[61] Wang Y., Vassileva J.. Bayesian network based trust model. In: Proceedings ofthe IEEE/WIC International Conference on Web Intelligence (WI’03), Halifax,Canada,2003,372-378
[62] Abdul-Rahman A., Hailes S.. Supporting trust in virtual communities. In:Proceedings of the33rdHawaii International Conference on System Sciences.Maui, Hawaii,2000,1-9
[63] Buragohain C., Agrawal D., Suri S.. A game theoretic Framework for incentivesin P2P systems. In: Proceedings of the Third International Conference onPeer-to-Peer Computing (P2P’03). Los Alamitos,2003,48-56
[64] Berket K., Essiari A., Muratas A.. PKI-based security for peer-to-peerinformation sharing. In: Proceedings of the Fourth International Conference onPeer-to-Peer Computing (P2P2004). Zürich, Switzerland,2004,45-52
[65] Altman J.. PKI security for JXTA overlay networks. Technical Report,TR-I2-03-06, Palo Alto: Sun Microsystem. http://www.jxta.org/docs/pki-security-for-jxta.pdf,2007-3-12
[66] Datta A., Hauswirth M., Aberer K.. Beyond “web of trust”: enabling P2Pe-commerce. In: Proceedings of the2003IEEE International Conference onE-Commerce (CEC2003), Newport Beach, California,2003,303-312
[67] Li Xiong, Ling Liu. PeerTrust: supporting reputation-based trust for peer-to-peerelectronic communities. IEEE Transactions on Knowledge and Data Engineering,2004,16(7):843-857
[68] Kamvar S. D., Schlosser M. T., Garcia-Molina H.. The EigenTrust algorithm forreputation management in P2P networks. In: Proceedings of the12thInternational World Wide Web Conference. Budapest, Hungary,2003,640-651
[69] Yanchao Zhang, Yuguang Fang. A fine-grained reputation system for reliableservice selection in peer-to-peer networks. IEEE Transactions on Parallel andDistributed Systems,2007,8(8):1134-1145
[70] Zhengqiang Liang, Weisong Shi. TRECON: A trust-based economic frameworkfor efficient Internet routing. IEEE Transactions on Systems, Man andCybernetics, Part A: Systems and Humans,2010,40(1):52-67
[71]李景涛,荆一楠,肖晓春等.基于相似度加权推荐的P2P环境下的信任模型.软件学报,2007,18(1):157-167
[72] Runfang Zhou, Kai Hwang. PowerTrust: a robust and scalable reputation systemfor trusted peer-to-peer computing. IEEE Transactions on Parallel andDistributed Systems,2007,18(5):460-473
[73] Mao Yang, Yafei Dai, Xiaoming Li. Bring Reputation System to Social Networkin the Maze P2P File-Sharing System. In: Proceedings of the2006InternationalSymposium on Collaborative Technologies and Systems. New York, USA,2006,393-400
[74] eBay website. http://www.ebay.com,2005-09-12
[75] Golle P., Leyton-Brown K., Mironov I., et al. Incentives for sharing inpeer-to-peer networks. In: Proc. of the3rd ACM Conference on ElectronicCommerce. New York, USA,2001,264-267
[76] Tan G., Jarvis S. A.. A payment-based incentive and service differentiationscheme for peer-to-peer streaming broadcast. IEEE Transactions on Parallel andDistributed Systems,2008,19(7):940-953
[77] Mojonation website. http://www.mojonation.net,2006-10-13
[78] Pouwelse J. A., Taal J. R., Lagendijk R. L., et al. Real-time Video Delivery UsingPeer-to-Peer Bartering Networks and Multiple Description Coding. In:Proceedings of the IEEE Conference on Systems, Man and Cybernetics. Hague,Netherlands,2004,4599-4605
[79] Amazon website. http://www.amazon.com,2006-08-12
[80] Phoomvuthisarn S., Yan Liu, Jun Han. An Architectural Approach to ComposingReputation-Based Trustworthy Services. In: Proceedings of21stAustralianSoftware Engineering Conference (ASWEC). Auckland,2010,117-126
[81] J sang A., Haller J.. Dirichlet reputation systems. In: Proceedings of the SecondInternational Conference on Availability, Reliability and Security. Vienna,Austria,2007,112-119
[82] Sabater J., Sierra C.. REGRET: A reputation model for gregarious societies. In:Proceedings of the4thInternational Workshop on Deception, Fraud and Trust inAgent Societies. Bologna, Italy,2001,61-69
[83] Shanshan Song, Runfang Zhou, Kai Hwang, et al. Trusted P2P transactions withfuzzy reputation aggregation. IEEE Internet Computing,2005,9(6):24-34
[84] Bin Yu, Singh M. P., Sycara K.. Developing trust in large scale peer-to-peersystems. In: Proceedings of the1st IEEE Symposium on Multi-Agent Securityand Survivability. Philadelphia,2004,1-10
[85]朱峻茂，杨寿保，樊建平等. Grid与P2P混合计算环境下基于推荐证据推理的信任模型.计算机研究与发展,2005,42(5):797-803
[86] Caronni G. Walking the web of trust. In: Proceedings of IEEE9thInternationalWorkshops on Enabling Technologies: Infrastructure for CollaboratlveEnterprises.2000, Gaithersburg, MD, USA,153-158
[87] Hiroshi Nishida, Thinh Nguyen. A global contribution approach to maintainfairness in P2P networks. IEEE Transactions on Parallel and Distributed Systems,2010,21(6):812-826
[88] Shneidman J., Parkes D. C.. Rationality and self-interest in peer to peer networks.In: Proceedings of Second International Workshop on Peer-to-Peer Systems(IPTPS’03). Berkeley, CA, USA,2003, Springer, LNCS2735,47-52
[89] Michal Feldman, Kevin Lai, John Chuang. quantifying disincentives inpeer-to-peer networks. In: Proceedings of the1stWorkshop on Economics ofPeer-to-Peer Systems. Berkeley, CA,2003,117-122
[90]张维迎.博弈论与信息经济学.上海:上海人民出版社,2004,23-90
[91] Yang B., Molina H. G.. Micorpayments for peer-to-peer systems. In: Proceedingof the10thACM Conference on computer and Communications Security.Washington, DC, USA,2003,300-310
[92] Ioannidis J, Ioannidis S, Keormytis A D, et at. Fileteller: Paying and getting paidfor file storage. In: Proceedings of the Sixth Annual Conference on FinancialCryptography. Bermuda: Springer-Verlag,2002,282-299
[93] Ma R. T. B., Lee S. C. M., Lui J. C. S., et al. Incentive and service differentiationin P2P network: A game theoretic approach. IEEE/ACM Transactions onNetworking,2006,14(5):978-991
[94] Garcia-Martinez A., Feldman M.. Gnushare: Enforcing sharing in Gnutella-stylepeer-to-peer networks. University of California at Berkeley,2002.http://www.sims.berkeley.edu/~mfeldman/research/gnushare.pdf,2009-2-12
[95] Kamvar S. D., Schlosser M. T., Garcia-Molina H.. Incentives for combattingfreeriding on P2P Networks. In: Proceedings of9th International Euro-ParConference on Parallel Processing. Klagenfurt, Austria,2003, Springer,LNCS-2970,1273-1279
[96] Sun Q., Garcia-Molina H.. SLIC: A selfish link-based incentive mechanism forunstructured peer-to-peer networks. In: Proceedings of the24th InternationalConference on Distributed Computing Systems. Hachioji, Tokyo, Japan,2004,506-515
[97] Lin W.S., Zhao H.V., Liu K.J.R.. Incentive Cooperation Strategies forPeer-to-Peer Live Multimedia Streaming Social Networks. IEEE Transactions onMultimedia,2009,11(3):396-412
[98] Huaizhi Li, Mukesh Singhal. Trust Management in Distributed Systems.Computer,2007,40(2):45-53
[99]张蹇,张霞,文学志等. Peer-to-Peer环境下多粒度Trust模型构造.软件学报,2006,17(1):96-107
[100] Aameek Singh, Ling Liu. TrustMe： Anonymous Management of TrustRelatationships in Decentralized P2P Systems. In: Proceedings of thirdInternational Conference on Peer-to-Peer Computing. Linkoping, Sweden,2003,142-149
[101]唐扬斌,王怀民,常俊胜.自组织虚拟计算环境中的组信誉机制.软件学报,2007,18(8):1968-1986
[102] Ma Xin-Xin, Liu Yong, Zhang Feng-Li, et al. The Markov-Based Evaluation onTrust and Reputation in Peer-to-Peer. In: Proceedings of2006InternationalConference on Communications, Circuits and Systems. Guilin, Guangxi, China,2006, Vol.3:1552-1556
[103] Feldman M., Papadimitriou C., Chuang J., et al. Free-riding and whitewashingin peer-to-peer systems. IEEE Journal on Selected Areas in Communications,2006,24(5):1010-1019
[104] Srivatsa M., Xiong L., Liu L.. TrustGuard: Countering vulnerabilities inreputation management for decentralized overlay networks. In: Proceedings ofthe14th World Wide Web Conference (WWW2005). Chiba, IEEE Press,2005,422-431
[105]唐扬斌.虚拟计算环境下的组信誉与激励机制研究：[博士学位论文].长沙：国防科学技术大学,2007,47-65
[106] Freedman M. J., Mazieres D.. Sloppy hashing and self-organizing clusters. In:Proceedings of2nd International Peer-To-Peer Systems Workshop (IPTPS).Berkeley, CA, USA,2003,45-55
[107] Ganesan P., Gummadi K., Garcia-Molina H.. Canon in G major: designingDHTs with hierarchical structure. In:Proc of24th International Conference onDistributed Computing Systems(ICDCS2004). Tokyo, Japan,2004,263-272
[108]李祖鹏，黄建华，唐辉.基于P2P计算模式的自组织网络路由模型.软件学报，2005,16(5):916-930
[109] Zhao B. Y., Duan Y., Huang L., et al. Brocade: landmark routing on overlaynetworks. In: Proc. of the1st Int'l Workshop on Peer-to-Peer Systems (IPTPS2002). LNCS2429, Berlin:Springer-Verlag,2002,34-44
[110] Yingwu Zhu, Yiming Hu. Efficient, proximity-aware load balancing forDHT-based P2P systems. IEEE Transactions on Parallel and DistributedSystems,2005,16(4):349-361
[111] Ratnasamy S., Handley M., Karp R., et al. Topologically-aware overlayconstruction and server selection. In: Proc. of the Twenty-First Annual JointConference of the IEEE Computer and Communications Societies (INFOCOM2002). New York, IEEE Press,2002, Vol.3:1190-1199
[112] Winter R., Zahn T., Schiller J.. Random Landmarking in Mobile,Topology-aware Peer-to-Peer Networks. In: Proceedings of the10thIEEEInternational Workshop on Future Trends of Distributed Computing Systems.Suzhou, China, IEEE Press,2004,319-324
[113] Castro M., Druschel P., Hu Y. C.. Exploiting network proximity in distributedhash tables. In: Proc. of the Int’l Workshop on Future Directions in DistributedComputing (FuDiCo2002). Bertinoro, Italy,2002,52-55
[114] Gribble S. D., Brewer E. A., Hellerstein J. M., et al. Scalable, Distributed DataStructures for Internet Service Construction. In: Proceedings of the4thUSENIXSymposium on Operating Systems Design and Implementation (OSDI2000).Washington, USA,2000,31-44
[115] Chen Jian-Qin, Xi Yu-Geng, Zhang Zhong-Jun. A clustering algorithm for fuzzymodel identification. Fuzzy Sets System,1997,5(4):477-496
[116] Ripeanu M., Foster I., Iamnitchi A.. Mapping the Gnutella network: Propertiesof large-scale P2P systems and implications for system design. IEEE InternetComputing,2002,6(1):50-57
[117] Chu J., Labonte K., Levine B. N.. Availability and locality measurements of peer-to-peer file systems. In: Proc.of ITCom:Scalability and Trafic Control in IPNetworks. Boston: SPIE,2002.310-321.
[118] Gummadi K. P., Dunn R. J., Saroiu S, et al. Measurement, modeling, andanalysis of a peer-to-peer file-sharing workload. In: Proceedings of the19thACM Symposium on Operating Systems Principles (SOSP-19). Bolton Landing,New York, USA,2003,314-329.
[119] Baset S. A., Schulzrinne H. G.. An Analysis of the Skype Peer-to-Peer InternetTelephony Protocol. In: Proceedings of the25th IEEE International Conferenceon Computer Communications (INFOCOM2006). Barcelona, Spain,2006,1-11
[120] Guha S., Daswani N., Jain R.. An Experimental Study of the Skype Peer-to-PeerVoIP System. Proceeding of5th International Workshop on Peer-to-PeerSystems, Santa Barbara, CA,2006,11-16
[121] Virginia Lo, Dayi Zhou, Yuhong Liu, et al. Scalable supernode selection inpeer-to-peer overlay networks. In: Proceedings of the Second InternationalWorkshop on Hot Topics in Peer-to-peer Systems. San Diego: IEEE ComputerPress,2005,18-25
[122] Markatos E. P.. Tracing a Large-Scale Peer to Peer System: An Hour in the Lifeof Gnutella. In: Proceedings of the2ndIEEE/ACM International Symposium onCluster Computing and the Grid.2002. Washington, USA,2002,65-74
[123] BRITE. A network topology generator. http://www.cs.bu.edu/brite/,2007-2-10
[124] Chord simulator. http://PeerSim.Sourceforge.net/Code/Chord.tar.gz,2008-2-10
[125] PeerSim. http://PeerSim.Sourceforge.net/,2008-2-10
[126] Saroiu S., Gummadi K. P., Dunn R. J., et al. An analysis of Internet contentdelivery systems. In: Proceeding of the5th Symposium on Operating SystemsDesign and Implementation. Boston, MA,2002,315-327
[127] Haveliwala T. H., Kamvar S. D.. The second eigenvalue of the google matrix.Technical report, Stanford University, CA,2003, http://dbpubs.stanford.edu/pub/2003-20,2003-02-20
[128] Kamvar S. D., Haveliwail T. H., Manning C. D., et al. Extrapolation methodsfor accelerating PageRank computations. In: Proceeding of the TwelfthInternational World Wide Web Conference. Budapest, Hungary,2003,261-270
[129] Hazel S., Wiley B.. Achord: A variant of the chord lookup service for use incensorship resistant peer-to-peer publishing systems. In: Proceeding of the1stInternational workshop on peer-to-peer systems. Cambridge,2002,113-122
[130] Schlosser M. T., Condie T. E., Kamvar S. D.. Simulating a file-sharing P2Pnetwork. In: Proceeding of the1st Workshop on Semantics in P2P and GridComputing. Budapest, Hungary,2003,69-80
[131] Nielson S. J., Crosby S. A., Wallach D. S.. A Taxonomy of Rational Attacks. In:Proceedings of The4th Annual International Workshop on Peer-to-PeerSystems(IPTPS05). Ithaca, USA,2005,36-46
[132] Kalmey L.. Cheaters Bow to Peer Pressure. http://www.wired.com/science/discoveries/news/2001/02/41838,2009-12-15
[133] Gross B., Acquisti A.. Balances of Power on eBay: Peers or Unequals?, In:Preceedings of the Workshop of Economics of Peer-to-Peer Systems. Berkerly,CA,2003,1-5
[134]胡建理,吴泉源,周斌等.一种基于反馈可信度的分布式P2P信任模型.软件学报,2009,20(10):2885-2898
[135]邓爱林,朱扬勇,施伯乐.基于项目评分预测的协同过滤推荐算法.软件学报,2003,14(9):1621-1628.
[136]苗光胜,冯登国,苏璞睿. P2P信任模型中基于行为相似度的共谋团体识别模型.通信学报,2009,30(8):9-20
[137]常俊胜,王怀民,尹刚. DyTrust:一种P2P系统中基于时间帧的动态信任模型.计算机学报,2006,29(8):1301-1307
[138] Zhao Y., Hou X. X., Yang M., et al. Measurement study and application ofsocial network in the Maze P2P file-shing system. In: Proceedings ofInternational Workshop on Peer-to-Peer Information Management(P2PIM),Hong Kong, China,2006,290-293
[139] Castro M., Druschel P., Ganesh A., et al. Security for structured peer-to-peeroverlay networks. In: Proceeding of5th Symposium on Operating SystemsDesign and Implementation (OSDI2002), Boston, MA,2002,102-115
[140] Friedman E. J., Resnick P.. The social cost of cheap pseudonyms．Journal ofEconomics and Management Strategy,2001,10(2):173-199
[141] Axelrod R., Hamilton W. D.. The evolution of cooperation. New York: BasicBooks,1984,78-97
[142] Cohen B.. Incentives build robustness in BitTorrent. In: Proceeding of the FirstWorkshop on the Economics of Peer-to-Peer Systems (P2P-Econ’03). Berkeley,CA,2003,231-238
[143]杨懋. P2P文件共享系统Maze中激励与信誉机制的研究:[博士学位论文].北京:北京大学,2006,36-47
[144] Hales D, Arteconi S. SLACER: A self-organizing protocol for coordination inpeer-to-peer networks. IEEE Intelligent Systems,2006,21(2):29-35
[145] Ross K. W., Rubenstein D.. Tutorial on P2P systems. http://cis.poly.edu/~ross/papers/P2PtutorialInfocom.pdf,2009-6-2
[146] JXTA.ORG. Project JXTA2.3: Java Programmers Guide. http://www.jxta.org/docs/JxtaProgGuide_v2.3.pdf,2007-01-12
[2]窦文.信任敏感的P2P拓扑构造及其相关技术研究:[博士学位论文].长沙：国防科学技术大学,2003,14-70
[3]胡进锋,黎明,郑纬民等.带宽自适应的P2P网络路由协议.软件学报,2005,16(5):991-999
[4] LTD S.N.. KaZaa media desktop. http://www.KaZaa.com/,2006-09-12
[5]陈海涛.对等网络中的内容搜索、定位和下载技术研究:[博士论文].长沙：国防科学技术大学,2005,13-27
[6] Dejan S. M., Vana K., Rajan L., et al. Peer-to-Peer computing. Technical ReportHPL-2002-57(R.1), HP Laboratories Palo Alto. July,2003
[7] DePaoli F., Mariani L.. Dependability in peer-to-peer systems. IEEE InternetComputing. July-Aug.2004,8(4):54-61
[8] Changqiao Xu, Muntean G.-M., Fallon E.. et al. Distributed storage-assisteddata-driven overlay network for P2P VoD services. IEEE Transactions onBroadcasting,2009,55(1):1-10
[9] Lakshmish Ramaswamy, Bugra Gedik, Ling Liu. A distributed approach to nodeclustering in decentralized peer-to-peer networks. IEEE Transactions on Paralleland Distributed Systems,2005,16(9):814-829
[10] Ramasubramanian V., Sirer E.G.. The design and implementation of a nextgeneration name service for the Internet. In: Proceedings of ACMSIGCOMM’04. Portland, Oregon, USA,2004,331-342
[11] Iyer S., Rowstron A., Druschel P.. Squirrel: A decentralized peer-to-peer webcache. In: Proceedings of the21thACM Symposium on Principles of DistributedComputing (PODC2002). Monterey, CA: ACM Press,2002,213-222
[12] P2PWG. Peer-to-Peer Working Group. http://www.peer-to-peerwg.org,2007-04-07
[13] Shirk C. What is P2P and what isn’t. http://www.openp2p.com/pub/a/P2P/2000/11/24/shirky1-whatisp2p.html,2006-10-23
[14] Society T.P. Seti@home project home page http://setiathome.ssl.berkeley. edu/,2005-11-19.
[15] Kant K., Iyer R., Tewari V.. A Framework for classifying peer-to-peertechnologies. In: Proceedings of2ndIEEE/ACM International Symposium onCluster Computing and the Grid (CCGRID2002). Washington: IEEE ComputerSociety,2002,368-376
[16] Androutsellis-Theotokis S., Spinellis D.. A survey of peer-to-peer contentdistribution technologies. ACM Computing Surveys,2004,36(4):335-371
[17] Napster website. http://www.napster.com,2008-05-12
[18] Gnutella Protocol Specification, version0.4. http://www.clip2.com/GnutellaProtocol04.pdf,2005-09-18
[19] eMule website. http://www.emule-project.net/,2006-08-11
[20] BitTorrent website. http://bitconjurer.org/BitTorrent,2007-09-12
[21] Stoica I., Morris R., Liben-Nowell D., et al. Chord: A scable peer-to-peerlookup protocol for Internet application. IEEE/ACM Transactions onNetworking,2003,11(1):17-32
[22] Rowstron A., Druschel P.. Pastry: scalable, decentralized object location androuting for large-scale peer-to-peer systems. In: Proceedings of the IFIP/ACMInternational Conference on Distributed Systems Platforms (Middleware2001).Heidelberg, Germany: Springer-Verlag,2001,329-350
[23] Ratnasamy S., Francis P., Handley M., et al. A scalable content-addressablenetwork. In: Proceedings of ACM SIGCOMM’2001. San Diego, California,USA: ACM Press,2001,161-172
[24] Zhao B. Y., Ling Huang, Stribling J., et al. Tapestry: A resilient global-scaleoverlay for service deployment. IEEE Journal on Selected Areas inCommunications,2004,22(1):41-53
[25] Karger D., Lehman E., Leighton F., et al. Consistent hashing and random trees:Distributed caching protocols for relieving hot spots on the world wide web. In:Proceedings of the29th Annual ACM Symposium on Theory of Computing.Dallas, Texas, U.S., ACM Press,1997,654-663
[26] NextPage Website. http://www.nextpage.com,2007-10-12
[27] Bolosky W. J., Douceur J. R., David Ely, et al. Feasibility of a serverlessdistributed file system deployed on an existing set of desktop PCs. ACMSIGMETRICS Performance Evaluation Review,2000,28(1):34-43
[28] Rhea S., Wells C., Eaton P., et al. Maintenance-Free Global Data Storage. IEEEInternet Computing,2001,5(5):40-49
[29] Dabek F, Kaashoek M. F., Karger D., et al. Wide-area Cooperative Storage withCFS. In: Proceedings of the18th ACM Symposium on Operating SystemsPrinciples(SOSP2001). Banff, Canada, October2001,201-215
[30] Rowstron A., Druschel P.. PAST: A large-scale, persistent P2P storage utility. In:Proceedings of the8thWorkshop on Hot Topic in Operating Systems. SchlossElmau,Germany,2001,75-80
[31] Anderson D. P., Cobb J., Korpela E., et al. SETI@home: An experiment inpublic-resource computing. Communications of the ACM,2002,45(11):56-61
[32] Stanford University. Folding@home project home page. http://folding.stanford.edu/,2005-10-19
[33] Stanford University. Genome@home home page. http://genomeathome.stanford.edu/,2005-09-17
[34] Intel. Nebatch. http://www.intel.com,2005-08-12
[35] Networks G. Groove home page. http://www.groove.net/home/index.cfm,2006-04-12
[36] KISTI, Korea@home home page. http://www.koreaathome.org/,2006-05-16
[37] Zhuang S. Q., Zhao B. Y., Joseph A. D., et al. Bayeux: an architecture forscalable and fault-tolerant wide-area data disemination. In: Proceedings of the11thInternational Workshop on Network and Operating System Support forDigital Audio and Video (NOSSDAV2001). New York,2001,11-20
[38] Castro M., Druschel P., Kermarrec A.-M., et al. Scribe: A large-scale anddecentralized application-level Multicast Infrastructure. IEEE Journal onSelected Areas in Communications (JSAC), October2002,20(8):1489-1499
[39] Tran D. A., Hua K. A., Do T., et al. Zigzag: an efficient peer-to-peer scheme formedia streaming. In: Proceedings of the22ndAnnual Joint Conference of theIEEE Computer and Communications Societies (INFOCOM2003). SanFrancisco,CA,USA,2003, Vol.2,1283-1292
[40] WebRAID. WebRAID home page. http://webraidsoftware.tripod.com,2006-09-17
[41] Konitiki, Inc. Kontiki home page. http://www.kontiki.com/,2005-08-17
[42] Joltid Ltd. Joltid home page. http://www.joltid.com/index.php/peerenabler,2005-08-19
[43] Farhad Manjoo. Gnutella bandwidth bandits. http://www.salon.com/tech/feature/2002/08/08/gnutella developers/,2002-08-08
[44] VBS.Gnutella Worm. http://securityresponse.symantec.com/avcenter/venc/data/vbs.gnutella.html,2004-09-12
[45] Liang J, Kumar R, Xi Y, et al. Pollution in P2P file sharing systems. In:Proceedings of the24thAnnual Joint Conference of the IEEE Computer andCommunications Societies (INFOCOM2005). Miami, FL USA,2005, Vol.2:1174-1185
[46] Leey U., Choi M., Choy J., et al. Understanding Pollution Dynamics in P2P FileSharing. In: Proceedings of the5th International Workshop on Peer-to-PeerSystems(IPTPS’06). Santa Baebara, CA, US. Feb,2006
[47] Hardin G.. The tragedy of the commons. Science,1968,162:1243-1248
[48] Adar E., Huberman B. A.. Free riding on gnutella. First Monday,2000,5(10):32-35
[49] Hughes D., Coulson G., Walkerdine J.. Free riding on Gnutella revisited: thebell tolls?. IEEE Distributed Systems Online,2005,6(6):1-18
[50] Sen S., Wang J.. Analyzing peer-to-peer traffic across large networks. IEEETransactions on Networking,2004,12(2):219-232
[51] Wilson D.. CacheLogic Study-P2P is Changing. http://www.slyck.com/story914_CacheLogic_Study_P2P_is_Changing,2005-9-16
[52] Xia R. L., Muppala J. K.. A survey of BitTorrent performance. IEEECommunications Surveys&Tutorials,2010,12(2):140-158
[53] Fedak G., Germain C., Neri V., et al. Xterm web: a generic global computingsystem. In: Proceedings of the1stIEEE/ACM International Conference onCluster Computing and Grid. Brisbane, Australia,2001,452-460
[54] Saroiu S., Gummadi P. K., Gribble S. D.. A measurement study of peer-to-peerfile sharing systems. In: Proceedings of Multimedia Computing and Networking2002(MMCN’02), San Jose, CA, USA,2002,156-170
[55] Faloutsos M., Faloutsos P., Faloutsos C.. On PowerLaw Relationships of theInternet Topology. In: Proceedings of the ACM SIGCOMM. New York, USA,1999,251-262
[56] Srivatsa M., Gedik B., Ling Liu. Large scaling unstructured peer-to-peernetworks with heterogeneity-aware topology and routing. IEEE Transactions onParallel and Distributed Systems.2006,17(11):1277-1293
[57] Marsh S.. Formalizing Trust as a Computational Concept. Ph.D. Thesis,University of Stirling,1994,3-8
[58] Blaze M., Feigenbaum J., Lacy J.. Decentralized trust management. In:Proceedings of the17th Symposiumon Security and Privacy. Oakland, CA,1996,164-173
[59] Grandison T., Sloman M.. A survey of trust in internet applications. IEEECommunications Surveys&Tutorials,2000,3(4):2-16
[60] Gambetta D. Can we trust trust? In: Gambetta D, ed. Trust: Making and BreakingCooperative Relations. Basil Blackwell: Oxford Press,1990,213~237
[61] Wang Y., Vassileva J.. Bayesian network based trust model. In: Proceedings ofthe IEEE/WIC International Conference on Web Intelligence (WI’03), Halifax,Canada,2003,372-378
[62] Abdul-Rahman A., Hailes S.. Supporting trust in virtual communities. In:Proceedings of the33rdHawaii International Conference on System Sciences.Maui, Hawaii,2000,1-9
[63] Buragohain C., Agrawal D., Suri S.. A game theoretic Framework for incentivesin P2P systems. In: Proceedings of the Third International Conference onPeer-to-Peer Computing (P2P’03). Los Alamitos,2003,48-56
[64] Berket K., Essiari A., Muratas A.. PKI-based security for peer-to-peerinformation sharing. In: Proceedings of the Fourth International Conference onPeer-to-Peer Computing (P2P2004). Zürich, Switzerland,2004,45-52
[65] Altman J.. PKI security for JXTA overlay networks. Technical Report,TR-I2-03-06, Palo Alto: Sun Microsystem. http://www.jxta.org/docs/pki-security-for-jxta.pdf,2007-3-12
[66] Datta A., Hauswirth M., Aberer K.. Beyond “web of trust”: enabling P2Pe-commerce. In: Proceedings of the2003IEEE International Conference onE-Commerce (CEC2003), Newport Beach, California,2003,303-312
[67] Li Xiong, Ling Liu. PeerTrust: supporting reputation-based trust for peer-to-peerelectronic communities. IEEE Transactions on Knowledge and Data Engineering,2004,16(7):843-857
[68] Kamvar S. D., Schlosser M. T., Garcia-Molina H.. The EigenTrust algorithm forreputation management in P2P networks. In: Proceedings of the12thInternational World Wide Web Conference. Budapest, Hungary,2003,640-651
[69] Yanchao Zhang, Yuguang Fang. A fine-grained reputation system for reliableservice selection in peer-to-peer networks. IEEE Transactions on Parallel andDistributed Systems,2007,8(8):1134-1145
[70] Zhengqiang Liang, Weisong Shi. TRECON: A trust-based economic frameworkfor efficient Internet routing. IEEE Transactions on Systems, Man andCybernetics, Part A: Systems and Humans,2010,40(1):52-67
[71]李景涛,荆一楠,肖晓春等.基于相似度加权推荐的P2P环境下的信任模型.软件学报,2007,18(1):157-167
[72] Runfang Zhou, Kai Hwang. PowerTrust: a robust and scalable reputation systemfor trusted peer-to-peer computing. IEEE Transactions on Parallel andDistributed Systems,2007,18(5):460-473
[73] Mao Yang, Yafei Dai, Xiaoming Li. Bring Reputation System to Social Networkin the Maze P2P File-Sharing System. In: Proceedings of the2006InternationalSymposium on Collaborative Technologies and Systems. New York, USA,2006,393-400
[74] eBay website. http://www.ebay.com,2005-09-12
[75] Golle P., Leyton-Brown K., Mironov I., et al. Incentives for sharing inpeer-to-peer networks. In: Proc. of the3rd ACM Conference on ElectronicCommerce. New York, USA,2001,264-267
[76] Tan G., Jarvis S. A.. A payment-based incentive and service differentiationscheme for peer-to-peer streaming broadcast. IEEE Transactions on Parallel andDistributed Systems,2008,19(7):940-953
[77] Mojonation website. http://www.mojonation.net,2006-10-13
[78] Pouwelse J. A., Taal J. R., Lagendijk R. L., et al. Real-time Video Delivery UsingPeer-to-Peer Bartering Networks and Multiple Description Coding. In:Proceedings of the IEEE Conference on Systems, Man and Cybernetics. Hague,Netherlands,2004,4599-4605
[79] Amazon website. http://www.amazon.com,2006-08-12
[80] Phoomvuthisarn S., Yan Liu, Jun Han. An Architectural Approach to ComposingReputation-Based Trustworthy Services. In: Proceedings of21stAustralianSoftware Engineering Conference (ASWEC). Auckland,2010,117-126
[81] J sang A., Haller J.. Dirichlet reputation systems. In: Proceedings of the SecondInternational Conference on Availability, Reliability and Security. Vienna,Austria,2007,112-119
[82] Sabater J., Sierra C.. REGRET: A reputation model for gregarious societies. In:Proceedings of the4thInternational Workshop on Deception, Fraud and Trust inAgent Societies. Bologna, Italy,2001,61-69
[83] Shanshan Song, Runfang Zhou, Kai Hwang, et al. Trusted P2P transactions withfuzzy reputation aggregation. IEEE Internet Computing,2005,9(6):24-34
[84] Bin Yu, Singh M. P., Sycara K.. Developing trust in large scale peer-to-peersystems. In: Proceedings of the1st IEEE Symposium on Multi-Agent Securityand Survivability. Philadelphia,2004,1-10
[85]朱峻茂，杨寿保，樊建平等. Grid与P2P混合计算环境下基于推荐证据推理的信任模型.计算机研究与发展,2005,42(5):797-803
[86] Caronni G. Walking the web of trust. In: Proceedings of IEEE9thInternationalWorkshops on Enabling Technologies: Infrastructure for CollaboratlveEnterprises.2000, Gaithersburg, MD, USA,153-158
[87] Hiroshi Nishida, Thinh Nguyen. A global contribution approach to maintainfairness in P2P networks. IEEE Transactions on Parallel and Distributed Systems,2010,21(6):812-826
[88] Shneidman J., Parkes D. C.. Rationality and self-interest in peer to peer networks.In: Proceedings of Second International Workshop on Peer-to-Peer Systems(IPTPS’03). Berkeley, CA, USA,2003, Springer, LNCS2735,47-52
[89] Michal Feldman, Kevin Lai, John Chuang. quantifying disincentives inpeer-to-peer networks. In: Proceedings of the1stWorkshop on Economics ofPeer-to-Peer Systems. Berkeley, CA,2003,117-122
[90]张维迎.博弈论与信息经济学.上海:上海人民出版社,2004,23-90
[91] Yang B., Molina H. G.. Micorpayments for peer-to-peer systems. In: Proceedingof the10thACM Conference on computer and Communications Security.Washington, DC, USA,2003,300-310
[92] Ioannidis J, Ioannidis S, Keormytis A D, et at. Fileteller: Paying and getting paidfor file storage. In: Proceedings of the Sixth Annual Conference on FinancialCryptography. Bermuda: Springer-Verlag,2002,282-299
[93] Ma R. T. B., Lee S. C. M., Lui J. C. S., et al. Incentive and service differentiationin P2P network: A game theoretic approach. IEEE/ACM Transactions onNetworking,2006,14(5):978-991
[94] Garcia-Martinez A., Feldman M.. Gnushare: Enforcing sharing in Gnutella-stylepeer-to-peer networks. University of California at Berkeley,2002.http://www.sims.berkeley.edu/~mfeldman/research/gnushare.pdf,2009-2-12
[95] Kamvar S. D., Schlosser M. T., Garcia-Molina H.. Incentives for combattingfreeriding on P2P Networks. In: Proceedings of9th International Euro-ParConference on Parallel Processing. Klagenfurt, Austria,2003, Springer,LNCS-2970,1273-1279
[96] Sun Q., Garcia-Molina H.. SLIC: A selfish link-based incentive mechanism forunstructured peer-to-peer networks. In: Proceedings of the24th InternationalConference on Distributed Computing Systems. Hachioji, Tokyo, Japan,2004,506-515
[97] Lin W.S., Zhao H.V., Liu K.J.R.. Incentive Cooperation Strategies forPeer-to-Peer Live Multimedia Streaming Social Networks. IEEE Transactions onMultimedia,2009,11(3):396-412
[98] Huaizhi Li, Mukesh Singhal. Trust Management in Distributed Systems.Computer,2007,40(2):45-53
[99]张蹇,张霞,文学志等. Peer-to-Peer环境下多粒度Trust模型构造.软件学报,2006,17(1):96-107
[100] Aameek Singh, Ling Liu. TrustMe： Anonymous Management of TrustRelatationships in Decentralized P2P Systems. In: Proceedings of thirdInternational Conference on Peer-to-Peer Computing. Linkoping, Sweden,2003,142-149
[101]唐扬斌,王怀民,常俊胜.自组织虚拟计算环境中的组信誉机制.软件学报,2007,18(8):1968-1986
[102] Ma Xin-Xin, Liu Yong, Zhang Feng-Li, et al. The Markov-Based Evaluation onTrust and Reputation in Peer-to-Peer. In: Proceedings of2006InternationalConference on Communications, Circuits and Systems. Guilin, Guangxi, China,2006, Vol.3:1552-1556
[103] Feldman M., Papadimitriou C., Chuang J., et al. Free-riding and whitewashingin peer-to-peer systems. IEEE Journal on Selected Areas in Communications,2006,24(5):1010-1019
[104] Srivatsa M., Xiong L., Liu L.. TrustGuard: Countering vulnerabilities inreputation management for decentralized overlay networks. In: Proceedings ofthe14th World Wide Web Conference (WWW2005). Chiba, IEEE Press,2005,422-431
[105]唐扬斌.虚拟计算环境下的组信誉与激励机制研究：[博士学位论文].长沙：国防科学技术大学,2007,47-65
[106] Freedman M. J., Mazieres D.. Sloppy hashing and self-organizing clusters. In:Proceedings of2nd International Peer-To-Peer Systems Workshop (IPTPS).Berkeley, CA, USA,2003,45-55
[107] Ganesan P., Gummadi K., Garcia-Molina H.. Canon in G major: designingDHTs with hierarchical structure. In:Proc of24th International Conference onDistributed Computing Systems(ICDCS2004). Tokyo, Japan,2004,263-272
[108]李祖鹏，黄建华，唐辉.基于P2P计算模式的自组织网络路由模型.软件学报，2005,16(5):916-930
[109] Zhao B. Y., Duan Y., Huang L., et al. Brocade: landmark routing on overlaynetworks. In: Proc. of the1st Int'l Workshop on Peer-to-Peer Systems (IPTPS2002). LNCS2429, Berlin:Springer-Verlag,2002,34-44
[110] Yingwu Zhu, Yiming Hu. Efficient, proximity-aware load balancing forDHT-based P2P systems. IEEE Transactions on Parallel and DistributedSystems,2005,16(4):349-361
[111] Ratnasamy S., Handley M., Karp R., et al. Topologically-aware overlayconstruction and server selection. In: Proc. of the Twenty-First Annual JointConference of the IEEE Computer and Communications Societies (INFOCOM2002). New York, IEEE Press,2002, Vol.3:1190-1199
[112] Winter R., Zahn T., Schiller J.. Random Landmarking in Mobile,Topology-aware Peer-to-Peer Networks. In: Proceedings of the10thIEEEInternational Workshop on Future Trends of Distributed Computing Systems.Suzhou, China, IEEE Press,2004,319-324
[113] Castro M., Druschel P., Hu Y. C.. Exploiting network proximity in distributedhash tables. In: Proc. of the Int’l Workshop on Future Directions in DistributedComputing (FuDiCo2002). Bertinoro, Italy,2002,52-55
[114] Gribble S. D., Brewer E. A., Hellerstein J. M., et al. Scalable, Distributed DataStructures for Internet Service Construction. In: Proceedings of the4thUSENIXSymposium on Operating Systems Design and Implementation (OSDI2000).Washington, USA,2000,31-44
[115] Chen Jian-Qin, Xi Yu-Geng, Zhang Zhong-Jun. A clustering algorithm for fuzzymodel identification. Fuzzy Sets System,1997,5(4):477-496
[116] Ripeanu M., Foster I., Iamnitchi A.. Mapping the Gnutella network: Propertiesof large-scale P2P systems and implications for system design. IEEE InternetComputing,2002,6(1):50-57
[117] Chu J., Labonte K., Levine B. N.. Availability and locality measurements of peer-to-peer file systems. In: Proc.of ITCom:Scalability and Trafic Control in IPNetworks. Boston: SPIE,2002.310-321.
[118] Gummadi K. P., Dunn R. J., Saroiu S, et al. Measurement, modeling, andanalysis of a peer-to-peer file-sharing workload. In: Proceedings of the19thACM Symposium on Operating Systems Principles (SOSP-19). Bolton Landing,New York, USA,2003,314-329.
[119] Baset S. A., Schulzrinne H. G.. An Analysis of the Skype Peer-to-Peer InternetTelephony Protocol. In: Proceedings of the25th IEEE International Conferenceon Computer Communications (INFOCOM2006). Barcelona, Spain,2006,1-11
[120] Guha S., Daswani N., Jain R.. An Experimental Study of the Skype Peer-to-PeerVoIP System. Proceeding of5th International Workshop on Peer-to-PeerSystems, Santa Barbara, CA,2006,11-16
[121] Virginia Lo, Dayi Zhou, Yuhong Liu, et al. Scalable supernode selection inpeer-to-peer overlay networks. In: Proceedings of the Second InternationalWorkshop on Hot Topics in Peer-to-peer Systems. San Diego: IEEE ComputerPress,2005,18-25
[122] Markatos E. P.. Tracing a Large-Scale Peer to Peer System: An Hour in the Lifeof Gnutella. In: Proceedings of the2ndIEEE/ACM International Symposium onCluster Computing and the Grid.2002. Washington, USA,2002,65-74
[123] BRITE. A network topology generator. http://www.cs.bu.edu/brite/,2007-2-10
[124] Chord simulator. http://PeerSim.Sourceforge.net/Code/Chord.tar.gz,2008-2-10
[125] PeerSim. http://PeerSim.Sourceforge.net/,2008-2-10
[126] Saroiu S., Gummadi K. P., Dunn R. J., et al. An analysis of Internet contentdelivery systems. In: Proceeding of the5th Symposium on Operating SystemsDesign and Implementation. Boston, MA,2002,315-327
[127] Haveliwala T. H., Kamvar S. D.. The second eigenvalue of the google matrix.Technical report, Stanford University, CA,2003, http://dbpubs.stanford.edu/pub/2003-20,2003-02-20
[128] Kamvar S. D., Haveliwail T. H., Manning C. D., et al. Extrapolation methodsfor accelerating PageRank computations. In: Proceeding of the TwelfthInternational World Wide Web Conference. Budapest, Hungary,2003,261-270
[129] Hazel S., Wiley B.. Achord: A variant of the chord lookup service for use incensorship resistant peer-to-peer publishing systems. In: Proceeding of the1stInternational workshop on peer-to-peer systems. Cambridge,2002,113-122
[130] Schlosser M. T., Condie T. E., Kamvar S. D.. Simulating a file-sharing P2Pnetwork. In: Proceeding of the1st Workshop on Semantics in P2P and GridComputing. Budapest, Hungary,2003,69-80
[131] Nielson S. J., Crosby S. A., Wallach D. S.. A Taxonomy of Rational Attacks. In:Proceedings of The4th Annual International Workshop on Peer-to-PeerSystems(IPTPS05). Ithaca, USA,2005,36-46
[132] Kalmey L.. Cheaters Bow to Peer Pressure. http://www.wired.com/science/discoveries/news/2001/02/41838,2009-12-15
[133] Gross B., Acquisti A.. Balances of Power on eBay: Peers or Unequals?, In:Preceedings of the Workshop of Economics of Peer-to-Peer Systems. Berkerly,CA,2003,1-5
[134]胡建理,吴泉源,周斌等.一种基于反馈可信度的分布式P2P信任模型.软件学报,2009,20(10):2885-2898
[135]邓爱林,朱扬勇,施伯乐.基于项目评分预测的协同过滤推荐算法.软件学报,2003,14(9):1621-1628.
[136]苗光胜,冯登国,苏璞睿. P2P信任模型中基于行为相似度的共谋团体识别模型.通信学报,2009,30(8):9-20
[137]常俊胜,王怀民,尹刚. DyTrust:一种P2P系统中基于时间帧的动态信任模型.计算机学报,2006,29(8):1301-1307
[138] Zhao Y., Hou X. X., Yang M., et al. Measurement study and application ofsocial network in the Maze P2P file-shing system. In: Proceedings ofInternational Workshop on Peer-to-Peer Information Management(P2PIM),Hong Kong, China,2006,290-293
[139] Castro M., Druschel P., Ganesh A., et al. Security for structured peer-to-peeroverlay networks. In: Proceeding of5th Symposium on Operating SystemsDesign and Implementation (OSDI2002), Boston, MA,2002,102-115
[140] Friedman E. J., Resnick P.. The social cost of cheap pseudonyms．Journal ofEconomics and Management Strategy,2001,10(2):173-199
[141] Axelrod R., Hamilton W. D.. The evolution of cooperation. New York: BasicBooks,1984,78-97
[142] Cohen B.. Incentives build robustness in BitTorrent. In: Proceeding of the FirstWorkshop on the Economics of Peer-to-Peer Systems (P2P-Econ’03). Berkeley,CA,2003,231-238
[143]杨懋. P2P文件共享系统Maze中激励与信誉机制的研究:[博士学位论文].北京:北京大学,2006,36-47
[144] Hales D, Arteconi S. SLACER: A self-organizing protocol for coordination inpeer-to-peer networks. IEEE Intelligent Systems,2006,21(2):29-35
[145] Ross K. W., Rubenstein D.. Tutorial on P2P systems. http://cis.poly.edu/~ross/papers/P2PtutorialInfocom.pdf,2009-6-2
[146] JXTA.ORG. Project JXTA2.3: Java Programmers Guide. http://www.jxta.org/docs/JxtaProgGuide_v2.3.pdf,2007-01-12