An Incentive Search Model Based on Utility in CAN Network

Ratnasamy S, Francis P, and Handley M, et al.. A scalablecontent-addressable network[J].ACM SIGCOMM ComputerCommunication Review.2001, 31(4):161-172[2]Damiani E, Vimercati D C, and Paraboschi S, et al.. Areputation- based approach for choosing reliable resources inpeer-to-peer networks. Computer and communicationssecurity, Washingtion, DC USA, 2002: 207-221.[3]Yu B, Singh M P, and Sycara K. Developing trust inlarge-scale peer-to-peer systems. Multi-Agent Security andSurvivability, Philadelphia USA, 2004: 23-34.[4]Ciglaric M. Effective message routing in unstructuredpeer-to-peer overlays[J].IEE Proceedings, Communications.2005, 152(5):673-678[5]Ma R T B, Lee S C M, and Lui J C S, et al.. A game theoreticapproach to provide incentive and service differentiation inP2P networks[J].ACM SIGMETRICS Performance EvaluationReview.2004, 32(1):189-201[6]Kubiatowicz J, Bindel D, and Chen Y, et al.. OceanStore : anarchitecture for global-scale persistent storage[J].ACMSIGPLAN Notices.2000, 35(11):190-201[7]Adar E B A H. Free riding on gnutella. First Monday, 2000,5(10): 176-194.[8]Fudenberg D and Tirole J. Game Theory. Cambridge, Mass.:MIT Press, 1991, 47-72.[9]李庆华, 张阳, 王多强. P2P 网络中基于谣言传播机制的资源搜索算法. 计算机应用, 2005, 25(11): 2465-2471.[10]Chiola G, G Cordasco, and L Gargano, et al.. Optimizing thefinger table in chord-like DHTs. Parallel and DistributedProcessing Symposium, Santa Fe, New Mexico, 2006:143-151.