开放网络环境中的激励机制研究
|
摘要
随着计算机技术和通信技术的不断发展,网络环境已经从早期相对静态的、面向特定组织和用户群体的封闭网络,转变为可公共访问的、面向大量动态用户的开放网络。在国内外,作为开放网络的典型代表,网格和对等网络成为分布式系统方向最活跃的研究领域之一。
开放网络具有开放、动态、异质、实体对等自治、资源共享自愿等特性,网络的理性用户更多地表现出自兴趣和自主性,其根本目的就是最大化自身利益,而并不考虑网络的整体效用。每个节点都希望尽可能多地使用其他节点的资源,而尽可能少地贡献自己的资源,或者即使贡献自己的资源,也不保证资源的可靠性,网络中存在大量的不合作现象和欺诈行为。随着网络系统规模越来越大,资源的公平共享问题正在变得棘手,开放网络中的激励机制已经成为分布式系统研究领域的一个重要课题。
本论文围绕开放网络中节点自主行为造成的不可靠的服务可用性和搭便车问题进行了研究,以期有效合理的激励理性自私的节点诚实共享自有资源,有效利用好网络已拥有的资源,提高网络综合能力。
本文首先分析了开放网络的特点,对开放网络的典型代表Grid和P2P进行了概述和比较,并深入讨论了其中存在的问题,引出本文的研究内容。随后在第二章,介绍了开放网络中存在的公平共享问题,由公平性维护扩展到信誉度维护,并总结了目前存在的信誉度评价方法及信任模型;本章还分析了把市场机制应用到开放网络资源管理中的优势以及市场激励中需要考虑的关键问题。
其次,针对信息不对称问题,将信誉机制引入网格市场的资源交易中,提出了基于信誉感知的资源交易机制。给资源提供者赋予一定的信誉值,以反映资源的可靠性,资源使用者可以根据信誉值判断是否交易。基于信誉感知的集合竞价机制和基于信誉感知的连续双向拍卖机制均能使资源使用者由于不可靠的服务可用性造成的损失明显减少,有效解决了信息不对称问题,两种机制各有优势。
然后,为了调整自私节点的行为,提出了基于信誉的市场激励模型。假设不同的服务水平可以兑换成不同的价格,服务使用者可以根据信誉系统的推荐购买服务,最小化自己的购买风险;服务提供者模型化为具有学习能力的Agent,通过学习逐渐适应本地市场,获得优化的服务质量调整决策,最终系统将达到一个平衡。该模型能够同时保证服务双方的利益,因而能够激励节点积极地贡献和使用资源。
再次,提出了P2P文件共享系统中基于惩罚的信誉模型。针对现有信誉模型存在的不足,从经济理论受到启发,将惩罚的概念引入到信誉机制的研究中,对节点的不协作行为进行惩罚,建立一种基于惩罚的信誉模型。该模型能够有效抑制节点不协作行为的发生,达到激励节点协作的目的。
最后,论文第六章提出了P2P流媒体系统中积分检测相结合的激励机制。节点通过自身或子节点共享数据流获得贡献积分,贡献积分越高,节点获得数据流的优先权就越高;为了贡献积分最大化,节点有选择地对它的子节点进行检测来促进子节点数据的共享。使用该机制能解决长期历史积分问题,提高合作者比例,并维护了较高的系统性能。
本文从网络动态性、节点异构性和资源的不可信性等开放网络应用呈现出的问题出发,紧紧围绕节点不可靠的服务可用性和Free-riding搭便车问题进行了深入研究,提出了网格环境中基于信誉的资源交易机制和市场激励模型,并提出了P2P文件共享系统中基于惩罚的信誉模型和P2P流媒体系统中积分检测相结合的激励机制,为解决开放网络资源共享难题展示了全新的视角和美好的前景。
With the development of computer and communication technologies,network environment has changed from a close network,which is comparatively static and faced with special organizations or user groups,to an open one that can be publicly accessed and faced with many dynamic users.As the representatives of open networks, Grid and P2P have become one of the most popular research fields all over the world.
Open network is open,dynamic,heterogeneous,autonomic,equal and voluntary for resource sharing.Therefore,the rational peers in the network are self-interest and try to maximize their own benefit without considering the whole utility of network. Every peer hopes to use others' resources as many as possible,but contribute their own resources as few as possible,which leads to non-collaborative and dishonest behaviors in the network.As the network enlarges,fair sharing of the resources turns to be more intractable.Thus,incentive mechanism becomes an important issue of distributed system research area in such an open network.
This dissertation discusses unreliable service usability and Free-riding problems in open networks resulting from peers' selfishness.It focuses on the researches that can stimulate rational and selfish nodes to share resources honestly,so that the network's integrated ability can be improved.
Firstly,the dissertation summarizes the characters of open networks,describes and compares Grid and P2P which are the representatives of open networks,and presents the existing problems to elicit the research content of the dissertation. Subsequently,Chapter 2 introduces the fair sharing problem in open networks and summarizes reputation evaluation methods and trust models.This chapter also analyzes the advantages of using market mechanisms to manage open network resources,and bring forward the key of market incentive.
Secondly,aiming at the severe information asymmetry problem,the dissertation introduces reputation to grid-based market resource trades and proposes reputation-aware transaction mechanisms.A reputation value is used to reflect the reliability of a resource;the users decide whether to use the resource in terms of the value.The reputation-aware aggregate market mechanism and double auction mechanism can both reduce the loss of the users resulting from unreliable service usability and resolve the information asymmetry problem.They can be applied in different situations.
Then,in order to regulate the behaviors of selfish nodes,the dissertation proposes a reputation-based market incentive model.Different service levels can be traded for different prices.Service consumers buy service according to the system's recommendation derived from reputation mechanism.Service providers are modeled as learning agents.They learn from the environment and arrive at optimal dynamic service level policies that optimize their benefit in the long run.The proposed model can simultaneously guarantee the interests of both the providers and consumers,thus, it can stimulate the selfish nodes actively contribute and consume resources.
Afterwards,the dissertation proposes a reputation model in P2P file-sharing system based on punishment.Aiming at the disadvantages of the recent reputation models,enlightened by economic theory,the dissertation introduces the concept of punishment to the research on reputation mechanism and gives a punishment-based reputation model.The model can restrict non-collaborative behavior efficiently and stimulate sharing.
Finally,the dissertation proposes a scorc and monitoring based incentive mechanism in P2P media streaming system.Each peer obtains a contribution score in two ways:uploading data to others by itself and by its child peers.The peers with higher scores have better chances to download data,To maximize the score,a peer can choose to monitor its child peers to stimulate sharing.The proposed incentive mechanism can solve the long-term history score problem,increase the cooperative proportion and maintain higher system performance.
From the present problems in open networks that the characteristics of network dynamicity,heterogeneity between peers and unreliable resources,this dissertation deeply studies the unreliable service usability and Free-riding problems,proposes reputation-based resource transaction mechanisms and a market incentive model, provides a reputation model based on punishment in P2P file-sharing system and a score and monitoring based incentive mechanism in P2P media streaming system.It gives the brand new view and fine perspective for solving the problem of open network resource sharing issues.
开放网络具有开放、动态、异质、实体对等自治、资源共享自愿等特性,网络的理性用户更多地表现出自兴趣和自主性,其根本目的就是最大化自身利益,而并不考虑网络的整体效用。每个节点都希望尽可能多地使用其他节点的资源,而尽可能少地贡献自己的资源,或者即使贡献自己的资源,也不保证资源的可靠性,网络中存在大量的不合作现象和欺诈行为。随着网络系统规模越来越大,资源的公平共享问题正在变得棘手,开放网络中的激励机制已经成为分布式系统研究领域的一个重要课题。
本论文围绕开放网络中节点自主行为造成的不可靠的服务可用性和搭便车问题进行了研究,以期有效合理的激励理性自私的节点诚实共享自有资源,有效利用好网络已拥有的资源,提高网络综合能力。
本文首先分析了开放网络的特点,对开放网络的典型代表Grid和P2P进行了概述和比较,并深入讨论了其中存在的问题,引出本文的研究内容。随后在第二章,介绍了开放网络中存在的公平共享问题,由公平性维护扩展到信誉度维护,并总结了目前存在的信誉度评价方法及信任模型;本章还分析了把市场机制应用到开放网络资源管理中的优势以及市场激励中需要考虑的关键问题。
其次,针对信息不对称问题,将信誉机制引入网格市场的资源交易中,提出了基于信誉感知的资源交易机制。给资源提供者赋予一定的信誉值,以反映资源的可靠性,资源使用者可以根据信誉值判断是否交易。基于信誉感知的集合竞价机制和基于信誉感知的连续双向拍卖机制均能使资源使用者由于不可靠的服务可用性造成的损失明显减少,有效解决了信息不对称问题,两种机制各有优势。
然后,为了调整自私节点的行为,提出了基于信誉的市场激励模型。假设不同的服务水平可以兑换成不同的价格,服务使用者可以根据信誉系统的推荐购买服务,最小化自己的购买风险;服务提供者模型化为具有学习能力的Agent,通过学习逐渐适应本地市场,获得优化的服务质量调整决策,最终系统将达到一个平衡。该模型能够同时保证服务双方的利益,因而能够激励节点积极地贡献和使用资源。
再次,提出了P2P文件共享系统中基于惩罚的信誉模型。针对现有信誉模型存在的不足,从经济理论受到启发,将惩罚的概念引入到信誉机制的研究中,对节点的不协作行为进行惩罚,建立一种基于惩罚的信誉模型。该模型能够有效抑制节点不协作行为的发生,达到激励节点协作的目的。
最后,论文第六章提出了P2P流媒体系统中积分检测相结合的激励机制。节点通过自身或子节点共享数据流获得贡献积分,贡献积分越高,节点获得数据流的优先权就越高;为了贡献积分最大化,节点有选择地对它的子节点进行检测来促进子节点数据的共享。使用该机制能解决长期历史积分问题,提高合作者比例,并维护了较高的系统性能。
本文从网络动态性、节点异构性和资源的不可信性等开放网络应用呈现出的问题出发,紧紧围绕节点不可靠的服务可用性和Free-riding搭便车问题进行了深入研究,提出了网格环境中基于信誉的资源交易机制和市场激励模型,并提出了P2P文件共享系统中基于惩罚的信誉模型和P2P流媒体系统中积分检测相结合的激励机制,为解决开放网络资源共享难题展示了全新的视角和美好的前景。
With the development of computer and communication technologies,network environment has changed from a close network,which is comparatively static and faced with special organizations or user groups,to an open one that can be publicly accessed and faced with many dynamic users.As the representatives of open networks, Grid and P2P have become one of the most popular research fields all over the world.
Open network is open,dynamic,heterogeneous,autonomic,equal and voluntary for resource sharing.Therefore,the rational peers in the network are self-interest and try to maximize their own benefit without considering the whole utility of network. Every peer hopes to use others' resources as many as possible,but contribute their own resources as few as possible,which leads to non-collaborative and dishonest behaviors in the network.As the network enlarges,fair sharing of the resources turns to be more intractable.Thus,incentive mechanism becomes an important issue of distributed system research area in such an open network.
This dissertation discusses unreliable service usability and Free-riding problems in open networks resulting from peers' selfishness.It focuses on the researches that can stimulate rational and selfish nodes to share resources honestly,so that the network's integrated ability can be improved.
Firstly,the dissertation summarizes the characters of open networks,describes and compares Grid and P2P which are the representatives of open networks,and presents the existing problems to elicit the research content of the dissertation. Subsequently,Chapter 2 introduces the fair sharing problem in open networks and summarizes reputation evaluation methods and trust models.This chapter also analyzes the advantages of using market mechanisms to manage open network resources,and bring forward the key of market incentive.
Secondly,aiming at the severe information asymmetry problem,the dissertation introduces reputation to grid-based market resource trades and proposes reputation-aware transaction mechanisms.A reputation value is used to reflect the reliability of a resource;the users decide whether to use the resource in terms of the value.The reputation-aware aggregate market mechanism and double auction mechanism can both reduce the loss of the users resulting from unreliable service usability and resolve the information asymmetry problem.They can be applied in different situations.
Then,in order to regulate the behaviors of selfish nodes,the dissertation proposes a reputation-based market incentive model.Different service levels can be traded for different prices.Service consumers buy service according to the system's recommendation derived from reputation mechanism.Service providers are modeled as learning agents.They learn from the environment and arrive at optimal dynamic service level policies that optimize their benefit in the long run.The proposed model can simultaneously guarantee the interests of both the providers and consumers,thus, it can stimulate the selfish nodes actively contribute and consume resources.
Afterwards,the dissertation proposes a reputation model in P2P file-sharing system based on punishment.Aiming at the disadvantages of the recent reputation models,enlightened by economic theory,the dissertation introduces the concept of punishment to the research on reputation mechanism and gives a punishment-based reputation model.The model can restrict non-collaborative behavior efficiently and stimulate sharing.
Finally,the dissertation proposes a scorc and monitoring based incentive mechanism in P2P media streaming system.Each peer obtains a contribution score in two ways:uploading data to others by itself and by its child peers.The peers with higher scores have better chances to download data,To maximize the score,a peer can choose to monitor its child peers to stimulate sharing.The proposed incentive mechanism can solve the long-term history score problem,increase the cooperative proportion and maintain higher system performance.
From the present problems in open networks that the characteristics of network dynamicity,heterogeneity between peers and unreliable resources,this dissertation deeply studies the unreliable service usability and Free-riding problems,proposes reputation-based resource transaction mechanisms and a market incentive model, provides a reputation model based on punishment in P2P file-sharing system and a score and monitoring based incentive mechanism in P2P media streaming system.It gives the brand new view and fine perspective for solving the problem of open network resource sharing issues.
引文
曹鸿强,肖侬,卢锡城,刘艳.2002.一种基于市场机制的计算网格资源分配方法[J].计算机研究与发展,2002年8月网格专辑.
都志辉,陈渝,刘鹏.2002.网格计算[M].清华大学出版社,2002年11月.
桂琴.2007.诚信与惩戒双重管理机制的博弈分析[J].青海社会科学,2007年06期.
李茂胜,杨寿保,付前飞,杨锦.2006.一个基于赔偿的网格资源交易模型[J].软件学报,17(3).
陆音,石进,谢立.2008.基于重复博弈的无线自组网络协作增强模型[J].软件学报,19(3).
马满福,吴健,胡正国,陈丁剑.2005.网格计算资源管理中的信誉值模型[J].计算机应用,25(1).
平新乔.2001.平新乔讲义系列:微观经济学十八讲[M].北京:北京大学出版社,ISBN 7-301-04880-7.
王嫚,徐惠民.2005.一种基于市场竞拍机制的网格资源管理分配方法[J].计算机应用研究,Vol.22 No.5.
徐志伟,冯百明,李伟.2004.网格计算技术[M].北京:电子工业出版社.
谢识予.经济博弈论[M].上海:复旦大学出版社,363-381.
余一娇,金海.2008.对等网络中的搭便车行为分析与抑制机制综述[M].计算机学报.
Abdul A,Rahman S,Hailes.2000.Supporting Trust in Virtual Communities[C].In Proceedings Hawaii International Conference on System Sciences 33,Maui,Hawaii.
Adar Eytan and BernaSDo A Huberman.2000.Free riding on gnutella.Technical report,Xerox PARC,10 Aug.2000.
Azzedin Farag and Maheswaran Muthucumar.2002.Toword trust-aware resource management in grid system[C].CCGrid02.
Beth T,BorcheSDing M,Klein B.1994.Valuation of trust in open networks[C].In Proceedings of the European Symposium on Research in Security(ESORICS).Brighton:Springer-Verlag.
Bin Yu,Munindar P Singh.2000.A Social Mechanism of Reputation Management in Electronic Communities[M].Proceedings of the4th International Workshop on Cooperative Information Agents.
Bittorrent.2001.URL http://www.bittorrent.com
Bogan N.R.1994.Economic Allocation of Computation Time with Computation Markets[M].MIT Laboratory for Computer Science Technical Report 633,August 1994.
Brent N.Chun,Philip Buonadonna,Alvin AuYoung,et al.2005.A Microeconomic Resource Allocation System for SensorNet Testbeds[C].In Proceedings of the 2nd IEEE Workshop on Embedded Networked Sensors,May 2005.
Buyya R.2002.Economic-based Distributed Resource Management and Scheduling for Grid ComputingfD].Ph.D Thesis,School of Computer Science and Software Engineering,Monash University,Australia,April 2002.
Buyya R and Vazhkudai S.2001.Compute Power Market:TowaSDs a Market-Oriented Grid[C].In Proc.of the 1st Int.Conf.on Cluster Computing and the Grid,CCGrid2001.IEEE.
Cahill V,Gray E,Seigneur J M,et al.2003.Using trust for secure collaboration in uncertain environments[C].IEEE Pervasive Computing,2(3):52~61.
Castro M,Druschel P,Kermarrec A,et al.2003.Splitstream:High-Bandwidth Multicast in Cooperative Environments[C].In:SOSP.
Clip2com.The Gnutella protocol specification v0.4,2001 URL:http://rfc-gnutella.sourceforge.net/Development
Cornelli F,Damiani E,S.D.C.di Vimercati,et al.2002.Choosing reputable servents in a p2p network[C].In:Proce of the 11th World Wide Web Conference.Honolulu,Hawaii,USA.
Daras P,Palaka D,Giagourta V.2003.A Novel Peer-to-Peer Payment Protocol[C].In:Proc.of the IEEE EUROCON '2003.
Damiani E,diVimercati D C,and Paraboschi S,et al.2002.A reputation-based approach for choosing reliable nodes [C].ACM Press,2002:441-449.
Dou W,Wang H M,and Jia Y,et al.2007.A recommendation-based peer-to-peer trust model[C].Journal of Software,2007,15(4):571-583.
eDonkey.eDonkey home page.2002.URL http://www.edonkey.com
Feldman M,Lai K,Stoica I.2006.Robust incentive techniques for peer-to-peer networks[C].In:Breese JS,ed.Proc.of the 5th ACM Conf.on Electronic Commerce (EC).New York:ACM Press,2006.pp 102-111.
Ferguson D,Nikolaou C,Sairamesh J,et al.1996.Economic models for allocating resources in computer systems,in:Market-Based Control:A Paradigm for Distributed Resource Allocation[C].World Scientific,Singapore.
Ferrari D,Gupta A and Ventre G.1995.Distributed Advance Reservation of Real-Time Connections[C].Proceedings of NOSSDAV95,Durhum,USA,Springer LNCS 1018,April 1995.
Frank Dabek,M.Frans Kaashoek,David Karger,et al.2001.Wide-area cooperative storage with CFS[C],ACM SOSP 2001,Banff,October 2001
Friedman A.2007.Good neighbors can make good fences:a peer-to-peer user security system[J]. IEEE Technology and Society Magazine,26(1):17-24.
Fu Qianfei,Yang Shoubao,Li Maosheng,et al.2005.Transaction Mechanism Design in Decentralized Computational Market [C].International Conference on Information Technology:Coding and Computing.
Golle P,Leyton-Brown K.2001.Incentives for sharing in peer-to-peer networks[C].In Proc.Of 3SD ACM Conference on Electronic Commerce,Tampa,Florida,Springer-Verlag,LNCS 2232,2001.10,pp.75-82.
Gomoluch Jacek and Schroeder Michael.2003.Market-based Resource Allocation for Grid Computing:A Model and Simulation[C].Proceedings of the 1st Workshop on Middleware for Grid Computing (MGC '03).
Habib A,Chuang J.2005.Incentive Mechanism for Peer-to-Peer Media Streaming[C].International Workshop on Quality of Service (IWQoS)June,2005,171-180.
Habib A,Chuang J.2006.Service Differentiated Peer Selection:An Incentive Mechanism for Peer-to-Peer Media Streaming[C].IEEE Transactions on Multimedia.
HaSDin G.1968.The Tragedy of the Commons.Science[J],162:1243-1248,1968.
Huhns MN and Singh MP.2005.Service-Oriented Computing:Key Concepts and Principles[J].IEEE Internet Computing,9(1):75-81,2005.
Ian Foster,Carl Kesselman.2004.The Grid2:Blueprint for a New Computing Infrastructure[J].published by Elsevier Inc.2004.
iMesh.imesh home page.2002.URL http://www.imesh.com
J(?)sang A.1999.Trust-Based Decision Making for Electronic Transactions[C].Proceedings of the Fourth NoSDic workshop on Secure Computer Systems (NOSDSEC99).Stockholm University,Sweden.1999.
J(?)sang A and Pope S.2005.Semantic Constraints for Trust Transitivity[C].In Proceedings of the Asia-Pacific Conference of Conceptual Modeling (APCCM),Newcastle,Australia,February 2005.
Jannotti J,Gifford DK,Johnson KL,et al.2004.Overcast:Reliable multicasting with an overlay network[C].In:OSDI2004.
John Chuang.2004.Economics of Peer-to-Peer Systems[C].Academia Sinica 2004 Summer Institute on Peer-to-Peer Computing,August 2004.
Lai K,Feldman M,Stoica I,et al.2003.Incentives for cooperation in peer-to-peer networks[C]in Proc.Workshop on Economics of Peer-to-Peer System,Jun.2003.
Lee S,Sherwood R,Bhattacharjee B.2007.Cooperative peer groups in NICE[C].Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies,IEEE Volume 2,30 March-3 April 2007:1272-1282.
LLC LW.LimeWire website.2000.URL http://www.limewire.com
LTD S N.KaZaA media desktopn.2002.URL http://www.kazaa.com
Kamvar S.2002.EigenRep:reputation management in P2P networks[C].Technical Report:SCCM-02-16,StanfoSD University.
Kamvar SD,Schlosser MT,Garcia-Molina H,2003.The Eigentrust algorithm for reputation management in P2P networks[C].In:the Proceedings of the 12th International World Wide Web Conference.Budapest:ACM Press:640-651.
Karl Aberer.2003.P-Grid:a self-organizing structured P2P system[C].2003(3).
Kostic D,Rodriguez A,Albrecht J,et al.2003.Bullet:high bandwidth data dissemination using an overlay mesh[C].In:SOSP,2003.
Kubiatowicz J,Bindei D,Chen Y,et al.2003.OceanStore:An Architecture for Global-Scale Persistent Storage[C].Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems,pp.190-201.
Kung H T,Wu Chun-hsin.2003.Differentiated admission for Peer-to-Peer systems:incentivizing peers to contribute their resources[C].Working paper Harvard University.
L iang Jian,Kumar Rakesh,Ross Keith,2007.The KaZaA Overlay:A Measurement Study,Computer NetworksfC].(Special Issue on Overlays).
Ma Richard T B,Lee Sam C M,Lui John C S.2004.A game theoretic approach to provide incentive and service differentiation in P2P networksfC].In ACM Sigmetrics Performance Evaluation Review,June 2004.
Ma RTB,Lee SCM,Lui JCS,et al.2004.A game theoretic approach to provide incentive service differentiation in P2P networks[C].Proceedings ACM SIGMETRICS,New York,June 2004.
McKnight D H,Chervany N L.1996.The meanings of trust[C].In Working Paper 96-04,Carlson School of Management,University of Minnesota.
Mekouar L,Iraqi Y,and Boutaba R.2004.A reputation management and selection advisor schemes for peer-to-peer systems [M].15th IFIP/IEEE International Workshop on Distributed Systems:Operations&Management.
Mohtashem M and Ang C.2001.A Probabilistic Rating Framework for Pervasive Computing Environments[C].In Proceedings of the MIT Student Oxygen Workshop (SOW'2001).
Morpheus.Morpheus file sharing network.2002.URL http://www.musiccity.com
Mui L,Mohtashemi M,Halberstadt A.2003.Notions of reputation in multi-agents systems:a review[C].In:AAMAS 2000 and AAMAS 2002.LNCS (LNAI),vol.2636,pp.280-287.Springer,Heidelberg (2003)
Mui L,Mohtashemi M,Halberstadt A.2002.A Computational Model for Trust and Reputation [C].Proc of 35th Hawaii Int Conf on System Sciences.Hawaii,2002:2431-2439.
Napster website.1999.URL http://www.napster.com
Ngan Tsuen-Wan J,Wallach D S,Druschel P.2003.Enforcing fair sharing of peer-to-peer resources[C].In:Proceedings of 2nd International Workshop on Peer-to-Peer Systems.Berkeley:Springer-Verlag,2003.
Page L,Brin S,et al.1998.The pagerank citation ranking:bringing order to the Web [J].Stanford Digital Libraries Working Paper,1998,(6):102-107.
Plissonneau L,Costeux JL,Brown P.2005.Analysis of Peer-to-Peer Traffic on ADSL[C].In:Dovrolis C,ed.Proc.of PAM 2005,LNCS 3431,Heidelberg:Springer-Verlag,2005.69-82.
Radu Jurca and Boi Faltings.2005.Reputation-based pricing of P2P services.SIGCOMM05,Philadelphia,PA,USA,2005.
Ramaswamy L and Liu L.2003.Free riding:A new challenge to Peer to Peer file sharing systems[C].Proceedings of the 36th Hawaii International Conference on System Sciences.
Ranganathan K,Ripeanu M,Sarin A,et al.2003.To share or not to share:An analysis of incentives to contribute in collaborative file sharing environmentsfC].In:Workshop on Economics of Peer-to-Peer Systems,Berkeley,California,June 2003.
Rapport A.1953.Spread of information through a population with socio-structural basis[C].Pp535-546 1953.
Regev O and Nisan N.1998.The popcorn market:An online market for computational resources[C].In Proceedings of the 1st International Conference on Information and Computational Economies,pages 148—157,Charleston,SC,October 1998.
Resnick P Zechhauser P,Friedman E,et al.2000.Reputation Systems:Facilitating Trust in Internet Interactions [J].Communications of The ACM,43(12),pp.45-48.
Robert Gibbons.1999.A Primer in Game Theory [M].Beijing:China Social Sciences Press.1999:69-80
Roughgarden T and Tardos E.2002.How bad is selfish routing? [J].ACM,vol.49,no.2,pp.236-259,2002.
Rowstron A,Druschel P.2001.Storage management and caching in PAST,a large-scale,persistent peer-to-peer storage utility[C].In Proceedings of the 18th ACM Symposium on Operating Systems Principles (Oct.2001).
Sabater J,Sierra C.2002.Reputation and Social Network Analysis in Multi-agent Systems[C].Proc of the 1st Int Joint Conf on Autonomous Agents and Multi-agent Systems.Bologna,2002.
Sabater J and Sierra C,Social ReGreT.20 02.A reputation model based on social relations SIGecom Exchanges[C].PP44-56.
Sergio Marti,Hector Garcia-Molina.2004.Limited reputation sharing in p2p systems[C].In Proceedings of the 5th ACM Conference on Electronic Commerce.New York,NY,USA,2004:91-101.
Stephan Eidenbenz,V.S.Anil Kumar,Sibylle Zust.2003.Equilibrium in topology control games for ad hoc networks[C].Proceedings of the 2003 joint workshop on Foundations of mobile computing,ACM Press,San Diego,CA,2003.6.
Stoica I,Morris R,Karger D,Kaashoek F,et al.2001.Chord:A Scalable Peer-to-Peer Lookup Service for Internet Applications[C].In Proceedings ACM Sigcom2001,San Diego,CA,Aug.2001.
Sun Qixiang and Garcia-Molina Hector.2004.SLIC:A selfish Link-Based Incentive Mechanism for Unstructured Peer-to-Peer Networks[C].In ICDCS,2004.
Sutherland I.E.1968.A futures market in computer time[C].Communications of the ACM,11 (6),449-451.1968
Tadelis S.2003.Firm Reputation with Hidden information [J].Economic Theory.21(2):PP635-651.
Vishnumurthy V,Chandrakumar S,Sirer EG.2003.KARMA:A Secure Economic Framework,for Peer-to-Peer Resource[C].Workshop on Economics of Peer-to-Peer Systems,Berkeley,2003.
Waldspurger C,Hogg T,Huberman B,et al.1992.Spawn:A distributed computational economy[C].IEEE Transactions on Software Engineering.Vol.18,No.2,IEEE CS Press,USA,February,1992.
Wang Yao,Julita Vassileva.2003.Trust and Reputation Model in Peer-to-Peer Networks[C].International Conference on Peer-to-Peer Computing (P2P'03).
Wang Weihong,Li Baochun.2005.Market-based Self Optimization for Autonomic Service Overlay Networks [J],in IEEE Journal on Selected Areas in Communications,Special Issue on Autonomic Communication Systems,Vol.23,No.12,pp.2320-2332,December 2005.ISSN:0733-8716.
Wang W,Li X,Suny Z,Wang Y.2006.Design multicast protocols for non-cooperative networks [A].http://www.cs.iit.edu/~xli/paper/Conf/multicast-INFO05.pdf
Xiong L,Liu L.2003.A reputation-based trust model for peer-to-peer ecommerce communities[C].In:IEEE Conference on E-Commerce (CEC'03),Newport Beach,California,USA.2003.
Yamamot D,Asahara T,et al.2004.Distributed Pagerank:A distributed reputation model for open P2P networks[C].Proceedings of the 2004 International Symposium on Applications and the Internet workshops (SAINTW'04).
Zhang Xinyan,Liu Jiangchuan,Li Bo,et al.2005.CoolStreaming/DONet:A data-driven overlay network for efficient live media streaming[C].Proceedings of IEEE INFOCOM,March,2005
Zhong LX,Zheng DF,Zheng B,et al.2006.Networking Effects on Cooperation in Evolutionary Snowdrift Game [J].Europhys.Lett.76 (2006),724-730.
都志辉,陈渝,刘鹏.2002.网格计算[M].清华大学出版社,2002年11月.
桂琴.2007.诚信与惩戒双重管理机制的博弈分析[J].青海社会科学,2007年06期.
李茂胜,杨寿保,付前飞,杨锦.2006.一个基于赔偿的网格资源交易模型[J].软件学报,17(3).
陆音,石进,谢立.2008.基于重复博弈的无线自组网络协作增强模型[J].软件学报,19(3).
马满福,吴健,胡正国,陈丁剑.2005.网格计算资源管理中的信誉值模型[J].计算机应用,25(1).
平新乔.2001.平新乔讲义系列:微观经济学十八讲[M].北京:北京大学出版社,ISBN 7-301-04880-7.
王嫚,徐惠民.2005.一种基于市场竞拍机制的网格资源管理分配方法[J].计算机应用研究,Vol.22 No.5.
徐志伟,冯百明,李伟.2004.网格计算技术[M].北京:电子工业出版社.
谢识予.经济博弈论[M].上海:复旦大学出版社,363-381.
余一娇,金海.2008.对等网络中的搭便车行为分析与抑制机制综述[M].计算机学报.
Abdul A,Rahman S,Hailes.2000.Supporting Trust in Virtual Communities[C].In Proceedings Hawaii International Conference on System Sciences 33,Maui,Hawaii.
Adar Eytan and BernaSDo A Huberman.2000.Free riding on gnutella.Technical report,Xerox PARC,10 Aug.2000.
Azzedin Farag and Maheswaran Muthucumar.2002.Toword trust-aware resource management in grid system[C].CCGrid02.
Beth T,BorcheSDing M,Klein B.1994.Valuation of trust in open networks[C].In Proceedings of the European Symposium on Research in Security(ESORICS).Brighton:Springer-Verlag.
Bin Yu,Munindar P Singh.2000.A Social Mechanism of Reputation Management in Electronic Communities[M].Proceedings of the4th International Workshop on Cooperative Information Agents.
Bittorrent.2001.URL http://www.bittorrent.com
Bogan N.R.1994.Economic Allocation of Computation Time with Computation Markets[M].MIT Laboratory for Computer Science Technical Report 633,August 1994.
Brent N.Chun,Philip Buonadonna,Alvin AuYoung,et al.2005.A Microeconomic Resource Allocation System for SensorNet Testbeds[C].In Proceedings of the 2nd IEEE Workshop on Embedded Networked Sensors,May 2005.
Buyya R.2002.Economic-based Distributed Resource Management and Scheduling for Grid ComputingfD].Ph.D Thesis,School of Computer Science and Software Engineering,Monash University,Australia,April 2002.
Buyya R and Vazhkudai S.2001.Compute Power Market:TowaSDs a Market-Oriented Grid[C].In Proc.of the 1st Int.Conf.on Cluster Computing and the Grid,CCGrid2001.IEEE.
Cahill V,Gray E,Seigneur J M,et al.2003.Using trust for secure collaboration in uncertain environments[C].IEEE Pervasive Computing,2(3):52~61.
Castro M,Druschel P,Kermarrec A,et al.2003.Splitstream:High-Bandwidth Multicast in Cooperative Environments[C].In:SOSP.
Clip2com.The Gnutella protocol specification v0.4,2001 URL:http://rfc-gnutella.sourceforge.net/Development
Cornelli F,Damiani E,S.D.C.di Vimercati,et al.2002.Choosing reputable servents in a p2p network[C].In:Proce of the 11th World Wide Web Conference.Honolulu,Hawaii,USA.
Daras P,Palaka D,Giagourta V.2003.A Novel Peer-to-Peer Payment Protocol[C].In:Proc.of the IEEE EUROCON '2003.
Damiani E,diVimercati D C,and Paraboschi S,et al.2002.A reputation-based approach for choosing reliable nodes [C].ACM Press,2002:441-449.
Dou W,Wang H M,and Jia Y,et al.2007.A recommendation-based peer-to-peer trust model[C].Journal of Software,2007,15(4):571-583.
eDonkey.eDonkey home page.2002.URL http://www.edonkey.com
Feldman M,Lai K,Stoica I.2006.Robust incentive techniques for peer-to-peer networks[C].In:Breese JS,ed.Proc.of the 5th ACM Conf.on Electronic Commerce (EC).New York:ACM Press,2006.pp 102-111.
Ferguson D,Nikolaou C,Sairamesh J,et al.1996.Economic models for allocating resources in computer systems,in:Market-Based Control:A Paradigm for Distributed Resource Allocation[C].World Scientific,Singapore.
Ferrari D,Gupta A and Ventre G.1995.Distributed Advance Reservation of Real-Time Connections[C].Proceedings of NOSSDAV95,Durhum,USA,Springer LNCS 1018,April 1995.
Frank Dabek,M.Frans Kaashoek,David Karger,et al.2001.Wide-area cooperative storage with CFS[C],ACM SOSP 2001,Banff,October 2001
Friedman A.2007.Good neighbors can make good fences:a peer-to-peer user security system[J]. IEEE Technology and Society Magazine,26(1):17-24.
Fu Qianfei,Yang Shoubao,Li Maosheng,et al.2005.Transaction Mechanism Design in Decentralized Computational Market [C].International Conference on Information Technology:Coding and Computing.
Golle P,Leyton-Brown K.2001.Incentives for sharing in peer-to-peer networks[C].In Proc.Of 3SD ACM Conference on Electronic Commerce,Tampa,Florida,Springer-Verlag,LNCS 2232,2001.10,pp.75-82.
Gomoluch Jacek and Schroeder Michael.2003.Market-based Resource Allocation for Grid Computing:A Model and Simulation[C].Proceedings of the 1st Workshop on Middleware for Grid Computing (MGC '03).
Habib A,Chuang J.2005.Incentive Mechanism for Peer-to-Peer Media Streaming[C].International Workshop on Quality of Service (IWQoS)June,2005,171-180.
Habib A,Chuang J.2006.Service Differentiated Peer Selection:An Incentive Mechanism for Peer-to-Peer Media Streaming[C].IEEE Transactions on Multimedia.
HaSDin G.1968.The Tragedy of the Commons.Science[J],162:1243-1248,1968.
Huhns MN and Singh MP.2005.Service-Oriented Computing:Key Concepts and Principles[J].IEEE Internet Computing,9(1):75-81,2005.
Ian Foster,Carl Kesselman.2004.The Grid2:Blueprint for a New Computing Infrastructure[J].published by Elsevier Inc.2004.
iMesh.imesh home page.2002.URL http://www.imesh.com
J(?)sang A.1999.Trust-Based Decision Making for Electronic Transactions[C].Proceedings of the Fourth NoSDic workshop on Secure Computer Systems (NOSDSEC99).Stockholm University,Sweden.1999.
J(?)sang A and Pope S.2005.Semantic Constraints for Trust Transitivity[C].In Proceedings of the Asia-Pacific Conference of Conceptual Modeling (APCCM),Newcastle,Australia,February 2005.
Jannotti J,Gifford DK,Johnson KL,et al.2004.Overcast:Reliable multicasting with an overlay network[C].In:OSDI2004.
John Chuang.2004.Economics of Peer-to-Peer Systems[C].Academia Sinica 2004 Summer Institute on Peer-to-Peer Computing,August 2004.
Lai K,Feldman M,Stoica I,et al.2003.Incentives for cooperation in peer-to-peer networks[C]in Proc.Workshop on Economics of Peer-to-Peer System,Jun.2003.
Lee S,Sherwood R,Bhattacharjee B.2007.Cooperative peer groups in NICE[C].Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies,IEEE Volume 2,30 March-3 April 2007:1272-1282.
LLC LW.LimeWire website.2000.URL http://www.limewire.com
LTD S N.KaZaA media desktopn.2002.URL http://www.kazaa.com
Kamvar S.2002.EigenRep:reputation management in P2P networks[C].Technical Report:SCCM-02-16,StanfoSD University.
Kamvar SD,Schlosser MT,Garcia-Molina H,2003.The Eigentrust algorithm for reputation management in P2P networks[C].In:the Proceedings of the 12th International World Wide Web Conference.Budapest:ACM Press:640-651.
Karl Aberer.2003.P-Grid:a self-organizing structured P2P system[C].2003(3).
Kostic D,Rodriguez A,Albrecht J,et al.2003.Bullet:high bandwidth data dissemination using an overlay mesh[C].In:SOSP,2003.
Kubiatowicz J,Bindei D,Chen Y,et al.2003.OceanStore:An Architecture for Global-Scale Persistent Storage[C].Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems,pp.190-201.
Kung H T,Wu Chun-hsin.2003.Differentiated admission for Peer-to-Peer systems:incentivizing peers to contribute their resources[C].Working paper Harvard University.
L iang Jian,Kumar Rakesh,Ross Keith,2007.The KaZaA Overlay:A Measurement Study,Computer NetworksfC].(Special Issue on Overlays).
Ma Richard T B,Lee Sam C M,Lui John C S.2004.A game theoretic approach to provide incentive and service differentiation in P2P networksfC].In ACM Sigmetrics Performance Evaluation Review,June 2004.
Ma RTB,Lee SCM,Lui JCS,et al.2004.A game theoretic approach to provide incentive service differentiation in P2P networks[C].Proceedings ACM SIGMETRICS,New York,June 2004.
McKnight D H,Chervany N L.1996.The meanings of trust[C].In Working Paper 96-04,Carlson School of Management,University of Minnesota.
Mekouar L,Iraqi Y,and Boutaba R.2004.A reputation management and selection advisor schemes for peer-to-peer systems [M].15th IFIP/IEEE International Workshop on Distributed Systems:Operations&Management.
Mohtashem M and Ang C.2001.A Probabilistic Rating Framework for Pervasive Computing Environments[C].In Proceedings of the MIT Student Oxygen Workshop (SOW'2001).
Morpheus.Morpheus file sharing network.2002.URL http://www.musiccity.com
Mui L,Mohtashemi M,Halberstadt A.2003.Notions of reputation in multi-agents systems:a review[C].In:AAMAS 2000 and AAMAS 2002.LNCS (LNAI),vol.2636,pp.280-287.Springer,Heidelberg (2003)
Mui L,Mohtashemi M,Halberstadt A.2002.A Computational Model for Trust and Reputation [C].Proc of 35th Hawaii Int Conf on System Sciences.Hawaii,2002:2431-2439.
Napster website.1999.URL http://www.napster.com
Ngan Tsuen-Wan J,Wallach D S,Druschel P.2003.Enforcing fair sharing of peer-to-peer resources[C].In:Proceedings of 2nd International Workshop on Peer-to-Peer Systems.Berkeley:Springer-Verlag,2003.
Page L,Brin S,et al.1998.The pagerank citation ranking:bringing order to the Web [J].Stanford Digital Libraries Working Paper,1998,(6):102-107.
Plissonneau L,Costeux JL,Brown P.2005.Analysis of Peer-to-Peer Traffic on ADSL[C].In:Dovrolis C,ed.Proc.of PAM 2005,LNCS 3431,Heidelberg:Springer-Verlag,2005.69-82.
Radu Jurca and Boi Faltings.2005.Reputation-based pricing of P2P services.SIGCOMM05,Philadelphia,PA,USA,2005.
Ramaswamy L and Liu L.2003.Free riding:A new challenge to Peer to Peer file sharing systems[C].Proceedings of the 36th Hawaii International Conference on System Sciences.
Ranganathan K,Ripeanu M,Sarin A,et al.2003.To share or not to share:An analysis of incentives to contribute in collaborative file sharing environmentsfC].In:Workshop on Economics of Peer-to-Peer Systems,Berkeley,California,June 2003.
Rapport A.1953.Spread of information through a population with socio-structural basis[C].Pp535-546 1953.
Regev O and Nisan N.1998.The popcorn market:An online market for computational resources[C].In Proceedings of the 1st International Conference on Information and Computational Economies,pages 148—157,Charleston,SC,October 1998.
Resnick P Zechhauser P,Friedman E,et al.2000.Reputation Systems:Facilitating Trust in Internet Interactions [J].Communications of The ACM,43(12),pp.45-48.
Robert Gibbons.1999.A Primer in Game Theory [M].Beijing:China Social Sciences Press.1999:69-80
Roughgarden T and Tardos E.2002.How bad is selfish routing? [J].ACM,vol.49,no.2,pp.236-259,2002.
Rowstron A,Druschel P.2001.Storage management and caching in PAST,a large-scale,persistent peer-to-peer storage utility[C].In Proceedings of the 18th ACM Symposium on Operating Systems Principles (Oct.2001).
Sabater J,Sierra C.2002.Reputation and Social Network Analysis in Multi-agent Systems[C].Proc of the 1st Int Joint Conf on Autonomous Agents and Multi-agent Systems.Bologna,2002.
Sabater J and Sierra C,Social ReGreT.20 02.A reputation model based on social relations SIGecom Exchanges[C].PP44-56.
Sergio Marti,Hector Garcia-Molina.2004.Limited reputation sharing in p2p systems[C].In Proceedings of the 5th ACM Conference on Electronic Commerce.New York,NY,USA,2004:91-101.
Stephan Eidenbenz,V.S.Anil Kumar,Sibylle Zust.2003.Equilibrium in topology control games for ad hoc networks[C].Proceedings of the 2003 joint workshop on Foundations of mobile computing,ACM Press,San Diego,CA,2003.6.
Stoica I,Morris R,Karger D,Kaashoek F,et al.2001.Chord:A Scalable Peer-to-Peer Lookup Service for Internet Applications[C].In Proceedings ACM Sigcom2001,San Diego,CA,Aug.2001.
Sun Qixiang and Garcia-Molina Hector.2004.SLIC:A selfish Link-Based Incentive Mechanism for Unstructured Peer-to-Peer Networks[C].In ICDCS,2004.
Sutherland I.E.1968.A futures market in computer time[C].Communications of the ACM,11 (6),449-451.1968
Tadelis S.2003.Firm Reputation with Hidden information [J].Economic Theory.21(2):PP635-651.
Vishnumurthy V,Chandrakumar S,Sirer EG.2003.KARMA:A Secure Economic Framework,for Peer-to-Peer Resource[C].Workshop on Economics of Peer-to-Peer Systems,Berkeley,2003.
Waldspurger C,Hogg T,Huberman B,et al.1992.Spawn:A distributed computational economy[C].IEEE Transactions on Software Engineering.Vol.18,No.2,IEEE CS Press,USA,February,1992.
Wang Yao,Julita Vassileva.2003.Trust and Reputation Model in Peer-to-Peer Networks[C].International Conference on Peer-to-Peer Computing (P2P'03).
Wang Weihong,Li Baochun.2005.Market-based Self Optimization for Autonomic Service Overlay Networks [J],in IEEE Journal on Selected Areas in Communications,Special Issue on Autonomic Communication Systems,Vol.23,No.12,pp.2320-2332,December 2005.ISSN:0733-8716.
Wang W,Li X,Suny Z,Wang Y.2006.Design multicast protocols for non-cooperative networks [A].http://www.cs.iit.edu/~xli/paper/Conf/multicast-INFO05.pdf
Xiong L,Liu L.2003.A reputation-based trust model for peer-to-peer ecommerce communities[C].In:IEEE Conference on E-Commerce (CEC'03),Newport Beach,California,USA.2003.
Yamamot D,Asahara T,et al.2004.Distributed Pagerank:A distributed reputation model for open P2P networks[C].Proceedings of the 2004 International Symposium on Applications and the Internet workshops (SAINTW'04).
Zhang Xinyan,Liu Jiangchuan,Li Bo,et al.2005.CoolStreaming/DONet:A data-driven overlay network for efficient live media streaming[C].Proceedings of IEEE INFOCOM,March,2005
Zhong LX,Zheng DF,Zheng B,et al.2006.Networking Effects on Cooperation in Evolutionary Snowdrift Game [J].Europhys.Lett.76 (2006),724-730.