可信P2P流媒体关键技术研究
|
摘要
高带宽、时延和抖动敏感、丢包率和时序性等要求严格是流媒体业务的特征。研究具有QoS保障、安全鲁棒、性价比高、可信、可运营的大规模流媒体服务技术已成为业界的一个挑战性课题。P2P网络具有高可扩展性、可靠性、容错性。与传统的集中式客户机/服务器和CDN网络结构模式相比，P2P网络具有更好的网络性能。而且，P2P网络技术能消除信息孤岛和客户端/服务器模式下的服务瓶颈，能很好的适应流媒体业务需求。因此，P2P网络技术被认为是构建大规模可信流媒体分发系统的关键技术之一，成为当前研究的热点。在开放、动态和无约束的P2P网络中，抖动、搭便车、策略和恶意节点的不良行为导致了P2P服务和带宽的不稳定性。
本文围绕可信P2P流媒体展开研究。从节点行为特征分析入手，以节点的行为、信任和性能为约束条件，将激励和抑制策略有机相结合，构建描述节点综合性能评价数学模型，为系统选择协同服务盟员节点构建稳定可信的流媒体数据传输链路提供依据，通过构建P2P-MSFS流媒体协同虚拟服务池系统，为用户提供稳定可信的流媒体服务，以实现可信P2P流媒体系统服务质量优化的目的。主要包含以下几个方面：
(1)节点动态行为导致的抖动对P2P系统的健壮性、可用性、服务响应速度和生命周期等产生了重要的影响。分析节点抖动产生的机理和对P2P流媒体服务系统性能的影响，对描述抖动的时间、频度和连接3个重要指标进行了量化分析和数学建模，给出了应对抖动的规则和策略。仿真实验结果表明，该模型具有很好的抗抖动能力，可维持P2P流媒体系统的服务持续性。
(2)由于P2P网络中存在大量欺诈行为、攻击和不可靠的服务，使服务质量无法得以较好的保证。将节点的信任资信具有时间衰减性引入构建P2P网络的全局信任链中，提出了一种基于历史交易信息和推荐证书的P2P信任模型，根据交易的历史信息和推荐度来计算节点的全局信任度。给出了模型的数学分析和构造信任链的实现方法，同时给出了抑制恶意节点协同攻击的策略。仿真实验结果验证了所提模型的有效性。
(3)由于缺乏有效的激励机制，节点搭便车行为已经严重影响了P2P流媒体分发系统的性能。分析节点搭便车行为产生的机理和P2P流媒体服务系统性能的影响，构建描述节点搭便车行为的数学模型。以P2P可信流媒体网络中节点的信任度、贡献度和收益等为评价指标，提出一种基于博弈论的P2P节点激励策略。该策略可有效的抑制搭便车行为并激励节点进行贡献。仿真实验结果验证了所提策略的有效性。
(4)在大规模动态的P2P网络环境下，为了解决如何动态组织节点进行协同的P2P流媒体分发问题，提出了一种基于盟主的虚拟协同服务组织模型P2P-MSFS。该模型运用节点的服务能力和属性相似性等作为评价指标。基于节点能力和相识度来选择协同的服务节点。仿真实验结果验证了所提模型的有效性。
Services based streaming are characterized with high bandwidth, time delay,churn and time sequence. To find out solution with QoS guarantee, security,robustness, cost-effect and practical value for Streaming service has become achallenging task in technology industry. Compared to the traditional centralizedClient/Server or CDN networking architectures, P2P networking is superior inscalability, reliability, fault-tolerance. Further, P2P networking technology eliminateinformation island and service bottleneck of C/S model. It is envi sioned as a keynetworking paradigm which has the potential to construct large scale reliablemultimedia streaming service systems, and it has gathered much attention recently.In a P2P network, the dynamic joint and quit of nodes lead to churn of the netw ork,and the free-riding and dishonesty of malicious nodes render instability of networkbandwidth and service. This dissertation concentrates on the reliable P2P streaming.
This paper, based on analysis on node behavior, credit and performance asconstraint, combining incentives and disincentives strategies, attempts to constructsa mathmetical model for evaluating of comprehensive performance to improve theservice quality of P2P-MSFS streaming system. Some creative works in thisdissertation are mainly focused on the following aspects:
(1)Dynamic behaviors of peers negatively impact on robustness, applicability,service response time, and lifetime of P2P system. Based on the analysis of impactsof churn on network performance, we investigate the metrics of t ime, frequency, andconnection of churn. Then, we propose efficient strategies to force multimediasystem providing stable and continuous services. The simulation results demonstratethat the propose strategies has good ability to react with churn and can maintaincontinuous service for P2P streaming.
(2)In P2P networks, fraud, attack, and unreliable service are very common,therefore, quality of service cannot be guaranteed. Based on the trust relationshipbetween human individuals, the direct trust recommend ation certificate and decay ofthe global trust credit of a node with time have been introduced into the credit chainof P2P network. A new trust model based on historical transaction andrecommendation is proposed, in which the global trust is computed on the historicaltransaction and recommendation. A model of mathematical analysis and constructionof the realization of the chain of trust is provided, along with strategies forsuppression of collaborative attack by malicious nodes. Simulation resultsdemonstrate the affectivity of the proposed trust model.
(3)Due to the lack of an effective incentive mechanism, free-ride has seriouslyimpacts the performance of P2P streaming. Based on a comprehensive analysis of thefree-ride behavior and the impact of such behavior on the performance of network, a model of the behavior of nodes in the whole network system is constructed. Bytaking credibility, contribution and income of nodes as the evaluation metrics, agame theory based incentive mechanism is proposed. Such a mechanism cancontrol free-ride behavior and encourage nodes to contribute to the system. Thesimulation results demonstrate the affectivity of the proposed model.
(4)In order to solve the dynamically organize node to provide collaborative P2Pstreaming service in large scale p2p networks, this paper propose a leader basedvirtual collaborative service model P2P-MSFS（Modeling of P2P Media Shared FileSystem）. Node capacity and similar attributes are regarded as evaluation parametersfor the P2P-MSFS. P2P-MSFS includes many strategies to select collaborativeserver peer based on node s capacity and similar attributes. Simulation resultsdemonstrate the affectivity of the proposed model.
本文围绕可信P2P流媒体展开研究。从节点行为特征分析入手，以节点的行为、信任和性能为约束条件，将激励和抑制策略有机相结合，构建描述节点综合性能评价数学模型，为系统选择协同服务盟员节点构建稳定可信的流媒体数据传输链路提供依据，通过构建P2P-MSFS流媒体协同虚拟服务池系统，为用户提供稳定可信的流媒体服务，以实现可信P2P流媒体系统服务质量优化的目的。主要包含以下几个方面：
(1)节点动态行为导致的抖动对P2P系统的健壮性、可用性、服务响应速度和生命周期等产生了重要的影响。分析节点抖动产生的机理和对P2P流媒体服务系统性能的影响，对描述抖动的时间、频度和连接3个重要指标进行了量化分析和数学建模，给出了应对抖动的规则和策略。仿真实验结果表明，该模型具有很好的抗抖动能力，可维持P2P流媒体系统的服务持续性。
(2)由于P2P网络中存在大量欺诈行为、攻击和不可靠的服务，使服务质量无法得以较好的保证。将节点的信任资信具有时间衰减性引入构建P2P网络的全局信任链中，提出了一种基于历史交易信息和推荐证书的P2P信任模型，根据交易的历史信息和推荐度来计算节点的全局信任度。给出了模型的数学分析和构造信任链的实现方法，同时给出了抑制恶意节点协同攻击的策略。仿真实验结果验证了所提模型的有效性。
(3)由于缺乏有效的激励机制，节点搭便车行为已经严重影响了P2P流媒体分发系统的性能。分析节点搭便车行为产生的机理和P2P流媒体服务系统性能的影响，构建描述节点搭便车行为的数学模型。以P2P可信流媒体网络中节点的信任度、贡献度和收益等为评价指标，提出一种基于博弈论的P2P节点激励策略。该策略可有效的抑制搭便车行为并激励节点进行贡献。仿真实验结果验证了所提策略的有效性。
(4)在大规模动态的P2P网络环境下，为了解决如何动态组织节点进行协同的P2P流媒体分发问题，提出了一种基于盟主的虚拟协同服务组织模型P2P-MSFS。该模型运用节点的服务能力和属性相似性等作为评价指标。基于节点能力和相识度来选择协同的服务节点。仿真实验结果验证了所提模型的有效性。
Services based streaming are characterized with high bandwidth, time delay,churn and time sequence. To find out solution with QoS guarantee, security,robustness, cost-effect and practical value for Streaming service has become achallenging task in technology industry. Compared to the traditional centralizedClient/Server or CDN networking architectures, P2P networking is superior inscalability, reliability, fault-tolerance. Further, P2P networking technology eliminateinformation island and service bottleneck of C/S model. It is envi sioned as a keynetworking paradigm which has the potential to construct large scale reliablemultimedia streaming service systems, and it has gathered much attention recently.In a P2P network, the dynamic joint and quit of nodes lead to churn of the netw ork,and the free-riding and dishonesty of malicious nodes render instability of networkbandwidth and service. This dissertation concentrates on the reliable P2P streaming.
This paper, based on analysis on node behavior, credit and performance asconstraint, combining incentives and disincentives strategies, attempts to constructsa mathmetical model for evaluating of comprehensive performance to improve theservice quality of P2P-MSFS streaming system. Some creative works in thisdissertation are mainly focused on the following aspects:
(1)Dynamic behaviors of peers negatively impact on robustness, applicability,service response time, and lifetime of P2P system. Based on the analysis of impactsof churn on network performance, we investigate the metrics of t ime, frequency, andconnection of churn. Then, we propose efficient strategies to force multimediasystem providing stable and continuous services. The simulation results demonstratethat the propose strategies has good ability to react with churn and can maintaincontinuous service for P2P streaming.
(2)In P2P networks, fraud, attack, and unreliable service are very common,therefore, quality of service cannot be guaranteed. Based on the trust relationshipbetween human individuals, the direct trust recommend ation certificate and decay ofthe global trust credit of a node with time have been introduced into the credit chainof P2P network. A new trust model based on historical transaction andrecommendation is proposed, in which the global trust is computed on the historicaltransaction and recommendation. A model of mathematical analysis and constructionof the realization of the chain of trust is provided, along with strategies forsuppression of collaborative attack by malicious nodes. Simulation resultsdemonstrate the affectivity of the proposed trust model.
(3)Due to the lack of an effective incentive mechanism, free-ride has seriouslyimpacts the performance of P2P streaming. Based on a comprehensive analysis of thefree-ride behavior and the impact of such behavior on the performance of network, a model of the behavior of nodes in the whole network system is constructed. Bytaking credibility, contribution and income of nodes as the evaluation metrics, agame theory based incentive mechanism is proposed. Such a mechanism cancontrol free-ride behavior and encourage nodes to contribute to the system. Thesimulation results demonstrate the affectivity of the proposed model.
(4)In order to solve the dynamically organize node to provide collaborative P2Pstreaming service in large scale p2p networks, this paper propose a leader basedvirtual collaborative service model P2P-MSFS（Modeling of P2P Media Shared FileSystem）. Node capacity and similar attributes are regarded as evaluation parametersfor the P2P-MSFS. P2P-MSFS includes many strategies to select collaborativeserver peer based on node s capacity and similar attributes. Simulation resultsdemonstrate the affectivity of the proposed model.
引文
[1]尹浩,林闯,文浩等.大规模流媒体应用中关键技术的研究.计算机学报,2008,35(5):755-764．
[2]李靖.流媒体服务系统中接入控制与缓存策略的研究.[博士学位论文].合肥:中国科学技术大学,2009.4．
[3]霍龙社.互联网流媒体传输关键技术研究.[博士学位论文].北京:中国科学院计算技术研究所,2006.6．
[4]中国互联网络信息中心（CNNIC）.第29次中国互联网络发展状况统计报告.http://www.cnnic.net.cn/dtygg/dtgg/201201/t20120116_23667.html．2012-02-24
[5]艾瑞咨询.2011年中国互联网市场年度总结报告. http://www.iresearch.com.cn/Report/1653.html．2012-02-24
[6]艾瑞咨询.2010-2011年中国在线视频行业年度监测报告.http://www.doc88.com/p-293590546796.html．2012-02-24
[7]林柏青.流式媒体的兴起. http://www.avwdoe.cn/stream/lsmt.html．2010-05-20
[8]流媒体.http://baike.baidu.com/view/794.htm．2010-05-20
[9]吴杰. P2P流媒体内容分发与服务关键技术研究.[博士学位论文].上海:复旦大学,2008.4．
[10]范英磊.无线流媒体传输的服务质量关键问题研究.[博士学位论文].北京:北京邮电大学,2007.5．
[11] Quinn B，AJmeroth K. IP multicast applications: Challenges and solutions.http://www.ietf.org/rfc/rfc3170.txt．2010-05-20
[12] Daniel Minoli. IP Multicast with Applications to IPTV and Mobile DVB-H[M].Wiley-IEEEPress,April4,2008. http://www.61ic.com/code/viewthread.php?tid=19648&extra=page%3D1．2010-05-20
[13] Braden R, Clark D, Shenker S. Integrated services in the Internet architectur e:An overview. RFC1633,1994. http://www.ietf.org/rfc/rfc1633.txt．2010-05-20
[14] Shenker S, Partridge C, Guerin R. Specification of guaranteed quality of service.RFC2212,1997. http://www.ietf.org/rfc/rfc2212.txt．2010-05-20
[15] Clark D, Shenker S, Zhang L. Supporting real-time applications in an integratedservices packet network: architecture and mechanisms. http://dspace.mit.edu/handle/1721.1/1543.2010-05-20
[16] Zhang L, Deering S, Estrin D, et al. RSVP: A new resource reservation protocol.IEEE Network Magazine.1993,7(5):116-127．
[17] Blake S, Black D, Carlson M, et al. An Architecture for Differentiated Service.RFC2475,1998. http://www.javvin.com/protocol/rfc2475.pdf．2010-05-20
[18] Nichols K, Jacobson V, Zhang L. A two-bit differentiated services architecturefor the internet.1999. http://www.cord.edu/faculty/zhang/cs345/assignments/researchPapers/draft-nichols-diff-svc-arch-02.pdf,2010-05-20
[19] Nichols K, Blake S, Baker F, et al. Definition of the differentiated services field(DS field) in the IPv4and IPv6headers. RFC2474,1998.http://www.ietf.org/rfc/rfc2474.txt．2010-05-20
[20]冯健. P2P点播流媒体服务质量研究.[博士学位论文].西安:西北大学,2008.6．
[21] Radware:实现CDN内容发布网全局负载均衡与内容请求路由. http://www.360doc.com/content/11/0530/23/7045948_120603635.shtml,2011-02-20
[22]戴汝为,操龙兵. Internet--一个开放的复杂巨系统.中国科学E辑,2003,33(4):289-296.
[23] Farag Ahmed Azzedin. Classifying and Tracking Free Riders in Multimedia-Based Systems. Journal of Universal Computer Science,2010,16(10),1368-1387．
[24]沈时军,李三立.基于P2P的视频点播系统综述.计算机学报,2010,33(4):613-624．
[25] Manoj Parameswaran, Anjana Susarla, Andrew B, et al. P2P networking: aninformation-sharing alternative. Computing Practices,2001,34(7):31-38.http://crec.mccombs.utexas.edu/works/articles/PARA.Cxs2final.pdf．2010-05-20
[26]张宇翔,杨冬,张宏科. P2P网络中Churn问题研究.软件学报.2009,20(5):1362-1376．
[27] Ion Stoica, Robert Morris, David Karger,et al.Chord: A Scalable Peer to peerLookup Service for Internet Applications. http://pdos.csail.mit.edu/papers/chord:sigcomm01/chord_sigcomm.pdf．2010-05-20
[28] Stephanos Androutsellis Theotokis, and Diomidis Spinellis. A sur vey ofpeer-to-peer content distribution technologies. ACM Computing Surveys, Vol.36, No.4, December2004, pp.335–371. http://www.spinellis.gr/pubs/jrnl/2004-ACMCS-p2p/html/AS04.pdf．2010-05-20
[29] Lua EK, Crowcroft J, Pias M, et al. A survey and comparison of peer-to-peeroverlay network schemes. Journal of IEEE Communications Survey and Tutorial,2005,7(2):7293.
[30] Kan Zhang, Nick Antonopoulos. Towards a Cluster Based Incentive Mechanismfor P2P Networks.9th IEEE/ACM International Symposium on ClusterComputing and the Grid,2009,532-537. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5071917,2010-05-20
[31] P. Brighten Godfrey, Scott Shenker, Ion Stoica. Minimizing churn in distributedsystems. http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-25.pdf.2010-12-05
[32] Daniel Stutzbach, Reza Rejaie. Understanding Churn in Peer to Peer Networks.http://conferences.sigcomm.org/imc/2006/papers/p19-stutzbach2.pdf,2010-12-05
[33]余一娇,金海.对等网络中的搭便车行为分析与抑制机制综述.计算机学报,2008,31(1):1-15．
[34]余一娇.基于文件复制的对等网络搭便车抑制技术研究.[博士学位论文].武汉:华中科技大学,2009.4．
[35] Lakshmish Ramaswamy, Ling Liu. Free riding: A new challenge to Peer-to-PeerFile Sharing Systems. http://www.cs.uga.edu/~laks/papers/free-riding.pdf,2011-02-20
[36]杨峰,徐如志.对等资源发现技术研究.北京:清华大学出版社.2011.1,13-99．
[37]邢小良.P2P技术及其应用.北京:人民邮电出版社,2008.02,30-39,108-146
[38]杨天路,刘宏伟,张文等.P2P网络技术原理与系统开发案例.北京:人民邮电出版社,2007.6,37-61．
[39] Eric Cronin, Sugih Jamin, Cheng Jin, et al. Constrained mirror Placement on theinternet. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS,2002,20(7):1369-1382．
[40]黄道颖,黄建华,庄雷,等.基于主动网络的分布式P2P网络模型.软件学报,2004,15(7):1081-1089．
[41]汤大权,贺明科,孟庆崧.基于幂律分布和小世界特性的无结构P2P网络中搜索方法研究.计算机研究与发展.2007,44(9):1566-1571.
[42]杨震.P2P流媒体分发网络中路由热区问题的研究.[博士学位论文].北京:北京邮电大学.2007.8．
[43] John Kubiatowicz,David Bindel,Yan Chen,et al. OceanStore: An architecture forglobal-scale persistent storage. http://www.csd.uwo.ca/courses/CS9843b/papers/OceanStore.pdf,2010-08-20
[44]王向辉.P2P网络拓扑结构研究.[博士学位论文].哈尔滨:哈尔滨工程大学.2008.4．
[45]李泽平.P2P流媒体分发与服务技术研究.[博士学位论文].成都:电子科技大学.2010.6．
[46] M. Ripeanu, I. Foster, A. Iamnitchi. Mapping the Gnutella Networ k: PropertiesLarge-Scale Peer-to-Peer Systems and Implications for System Design. IEEEinternet computing journal,2002,6(1):23-33．
[47] I.Clarke, O. Sandberg, B. Wiley, et al. Freenet: a distributed anonymousinformation storage and retrieval system, International workshop on Designingprivacy enhancing technologies design issues in anonymity and unobservabilitytable of contents,2001,44:46-66．
[48] Sylvia Ratnasamy,Paul Francis,Mark Handley,et al. A Scalable ContentAddressable Network. http://www.icsi.berkeley.edu/pubs/networking/scalablecontent01.pdf,2010-05-20
[49] Antony Rowstron,Peter Druschel. Pastry: Scalable, decentralized object locationand routing for large-scale peer-to-peer systems. http://research.microsoft.com/en-us/um/people/antr/PAST/pastry.pdf.2010-05-20
[50] Ben Y. Zhao, John Kubiatowicz, Anthony D. Joseph. Tapestry: An Infrastructurefor Fault-tolerant Wide-area Location and Routing. http://www.cs.cornell.edu/people/egs/cs6460-spring10/tapestry.pdf.2011-02-20
[51] Kleinberg J. The small-world phenomenon: An algorithmic perspective ACMSymp on Theory of Computing,2000:820828. http://nicomedia.math.upatras.gr/courses/mnets/mat/Kleinberg_SW_algorithmic.pdf,2011-02-20
[52] David Kempe, Jon Kleinberg, Alan Demers. Spatial gossip and resource locationprotocols.http://www.cs.cornell.edu/home/kleinber/stoc01-gossip.pdf,2010-02-20
[53]冯劲潇陈贵海谢俊元.基于分层象限空间的P2P超级节点拓扑构造.计算机学报,2010,33(6):988-1003．
[54] Yang Guo, Kyoungwon Suh, Jim Kurose,et al. A peer-to-peer on-demandstreaming service and its performance evaluation. In: Proc. of the IEEE ICME2003. Maryland: IEEE Computer Society,2003.649-652. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1221700,2010-02-20
[55] Yang Guo, Kyoungwon Suh, Jim Kurose,et al. Directstream: A Direetory-basedPeer-to-Peer video Streaming Serviee， ACM ComPuter Communications,2008,31(3):520-536．
[56] Yang Guo,Kyoungwon Suh,Jim Kurose,et al. P2Cast: Peer-to-peer patchingscheme for VoD service. Springer, Multimed Tools Application,2007,33:109-129．
[57] Tai T. Do, Kien A. Hua, Mounir Tantaoui. P2VoD: Providing Fault TolerantVideo-on-Demand Streaming in Peer-to-Peer Environment. In Proceedings of theIEEE International Conference on Communications (ICC04), June20-24,2004,Paris, France, Volume3, pages1467-1472. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1312755.2010-02-20
[58] Bram Cohen. Incentives build robustness in bittorrent. In Proc. of the FirstWorkshop on Economics of Peer-to-Peer Systems, May2003:251-260.http://www.ittc.ku.edu/~niehaus/classes/750-s06/documents/BT-description.pdf.2010-02-20
[59] Miguel Castro, Peter Druschel, Anne-Marie Kermarrec,et al. Splitstream:High-bandwidth Content Distribution in CooPerative Environments. In Proc. ofACM SOSP2003:292-303. http://dl.acm.org/citation.cfm?id=945474.2010-02-20
[60] Venkata N. Padmanabhan, Helen J. Wang, Philip A. Chou. DistributingStreaming Media Content Using Cooperative Networking. http://research.microsoft.com/apps/pubs/default.aspx?id=75966.2010-02-20
[61] Mohamed Hefeeda, Ahsan Habib, Dongyan Xu. CollectCast: A peer-to-peerservice for media streaming. Springer, Multimedia Systems,2005,11(1):68-81
[62] Xuxian Jiang,Yu Dong,Dongyan Xu,et al. GnuStream: A P2P media streamingsystem Prototype. http://www.pdfio.com/k-437241.html．2010-02-20
[63]龚海刚,刘明,毛莺池等. P2P流媒体关键技术的研究进展.计算机研究与发展,2005,42(12):2033-2040.
[64] F.Banaci-Kashani, C.Chien Chen, C.Shahabi. WSPDS: Web Services peer-to-peer Discovery Service. In: Proceedings of International Symposium on WebServices and Applications(ISWS04)[C].LasVgas,USA,2004. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.2679,2010-02-20
[65] Mohamed Hefeeda, Ahsan Habib, Boyan Botev, et al.PROMISE: Peer-to-PeerMedia Streaming Using CollectCast. http://www.doc88.com/p-41595153773.html,2011-02-20
[66] Nazanin Magharei, Reza Rejaie, Yang Guo. Mesh or Mult iple-Tree: AComparative Study of Live P2P Streaming Approaches. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?reload=true&arnumber=4215750,2011-02-20
[67]刘琼,徐鹏,杨海涛,彭芸.Peer-to-Peer文件共享系统的测量研究.软件学报,2006,17(10):2131-2140．
[68] Liao XF, Jin H, Liu YH, et al. AnySee: Peer-to-Peer Live Streaming. Proc. of theIEEE INFOCOM,2006. New York: IEEE Computer Society.1-10.http://wenku.baidu.com/view/f56b6d6648d7c1c708a14515.html.2011-02-20
[69] Magharei N, Rejaie R. Prime: peer-to-peer receiver-driven mesh-based streaming.Proc. of IEEE INFOCOM, Anchorage, Alaska, USA,2007:1052-1065.http://wenku.baidu.com/view/bedba1eb81c758f5f61f670a.html.2011-02-20
[70] Li Chunxi, Chen Changjia. On Gnutella topology dynamics by studying leaf andultra connection jointly in phase space. Computer Networks.2008,52(3):695-719.
[71] Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal. Building low-diameterpeer-to-peer network. IEEE Journal on Selected Areas in Communications,2003,21(6):995-1002．
[72] Dmitri Loguinov, Anuj Kumar, Vivek Rai,et al. Graph-Theoretic analysis ofstructured peer-to-peer systems: Routing distances and fault resilience.IEEE/ACM Transactions on Networking,2005,13(5):1107-1120．
[73] Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell,et al. An analytical studyof a structured overlay in the presence of dynamic membership. IEEE/ACMTransactions. on Networking,2008,16(4):814825.
[74]黄庆凤,李之棠,陆垂伟等. DHT抖动处理代价的分析.计算机研究与发展，2008，45（S1）:409-414.
[75] Derek Leonard, Vivek Rai, Dmitri Loguinov. On Life time Based Node Failureand Stochastic Resilience of Decentralized Peer to Peer Networks.http://wenku.baidu.com/view/eea1f33d0912a216147929cd.html,2009-12-20
[76] Di Wu,Ye Tian, Kam Wing Ng,et al. Stochastic analysis of the interplay betweenobject maintenance and churn. Computer Communications,2008,31(2):220-239．
[77] Sean Rhea, Dennis Geels, Timothy Roscoe,et al. Handling Churn in a DHT.http://www.eecs.berkeley.edu/Pubs/TechRpts/2003/CSD-03-1299.pdf．2009-12-20
[78]陈建忠,徐天音,李文中等.一种基于衍生树的交互式P2P流媒体系统.软件学报,2010,21(5):1138-1152．
[79]邱菡,李玉峰,邬江兴.保障连续媒体流用户层QoS的缓存控制.软件学报，2009,20(7):19211930．
[80] Zhao BY, Huang L, Stribling J, et al. Tapestry: A resilient global-scale overlayfor service deployment. IEEE Journal on Selected Areas in Communications,2004,22(1):41-53．
[81] Eytan Adar, Bernardo A. Huberman. Free riding on Gnutella.http://wenku.baidu.com/view/36f24be49b89680203d8256b.html．2009-12-15
[82] Subhabrata Sen, Jia Wang. Analyzing Peer-to-Peer traffic across large networks.IEEE/ACM Transactions on Networking,2004,12(2):219-232．
[83]韦东,对等网络文件共享系统中的信誉机制研究.[博士学位论文].合肥:中国科学技术大学,2009.4．
[84] Yunfei Zhang, Lianhong Lei, and Changjia Chen. Characterizing peer-to-peertraffic across Intenet. LNCS3032.Heidelberg:Springer-Verlag,2004:388-395.
[85]黄庆凤.结构化P2P网络性能分析与搜索算法研究.[博士学位论文].武汉:华中科技大学,2008．
[86]周丽娟. P2P流媒体识别方法的研究.[博士学位论文].武汉:华中科技大学,2008.11．
[87]卫星.流媒体集群系统复制存储策略研究.[博士学位论文].合肥：中国科学技术大学．
[88] Ge Zihui, Daniel R. Figueiredo, Sharad Jaiswal, et al. Modeling peer-peer filesharing systems. http://citeseerx.ist.psu.deu/viewdoc/download?doi=10.1.1.12.3320&rep=repl&type=pdf,2011-02-20
[89] Zhongmei Yao, Derek Leonard, Xiaoming Wang, et al. Modeling heterogeneoususer churn and local resilience of unstructured P2P networks. http://www.cs.tamu.edu/academics/tr/tamu-cs-tr-2006-8-1,2010-02-20
[90] Derek Leonard, Vivek Rai, Dmitri Loguinov,et al. On lifetime-based node failureand stochastic resilience of decentralized peer-to-peer networks. IEEE/ACMTrans on Networking,2007,15(3):644-656.
[91]谢振,毕经平,李晔.基于连续行为观察的P2P网络中邻居评价模型.计算机研究与发展,2010,47(6):1098-1106．
[92] Kumar P, Sridhar G, Sridhar V. Bandwidth and latency model for DHT basedpeer-to-peer networks under variable churn. In: Proc. of the IEEE SystemsCommunications (ICW2005). Piscataway: IEEE Press,2005.320325.http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1515544&userType=inst.2010-10-15.
[93] Watts D J, Strogatz S H. Collective dynamics of small world networks.Nature,1998,393(6):440-442.
[94] Barabasi A-L,R Albert. Emergence of scaling in random networks. Science,1999,286(10):509-512.
[95] Zhong M, Shen K, Seiferas J. Non-Uniform random membership management inpeer-to-peer networks. http://www.cs.rochester.edu/~kshen/papers/infocom2005b.pdf,2010-02-20
[96] Urs Fischbacher,Simon G chter. Social Preferences, Beliefs, and the Dynamicsof Free Riding in Public Goods Experiments. American Economic Review,2010,100(1):541-556．
[97]田慧蓉. P2P网络信任模型及激励机制的研究.[博士学位论文].北京：北京邮电大学,2006．
[98] Kamvar SD, Schlosser MT. EigenRep: Reputation management in P2P networks.In: Lawrence S, ed. Proc. of the12th Int l World Wide Web Conf.(WWW2003).Budapest: ACM Press,2003.123-134. http://www.comp.nus.edu.sg/~ooibc/courses/cs6203/eigen.pdf．2010-08-20
[99]窦文,王怀民,贾焰,等.构造基于推荐的Peer-to-Peer环境下的Trust模型.软件学报,2004,15(04):571-538．
[100] Huu Tran, Hitchens M, Varadharajan V, Watters P. A Trust Based Access ControlFramework for P2P File-Sharing Systems. http://csdl2.computer.org/comp/proceedings/hicss/2005/2268/09/22680302c.pdf,2010-08-20
[101]田春岐,邹仕洪,文东等.一种基于推荐证据的有效抗攻击P2P网络信任模型.计算机学报,2008,31(2):270-281．
[102]孙玉星,黄松华,陈力军,谢立等.贝叶斯决策的自组网推荐信任度修正模型[J].软件学报.2009,20(9):25742586.
[103]李景涛,荆一楠,肖晓春等.基于相似度加权推荐的P2P环境下的信任模型.软件学报.2007,18(1):157167．
[104]李治军,廖明宏基于信任的P2P真实性查询及副本管理算法.软件学报.2006,17(4):939948．
[105]王黎明,黄厚宽,柴玉梅.基于信任和K臂赌博机问题选择多问题协商对象.软件学报.2006,17(12):25372546．
[106]姜守旭,李建中.一种P2P电子商务系统中基于声誉的信任机制.软件学报.2007,18(10):25512563．
[107]黄国伟.对等网络中服务可用性问题研究.[博士学位论文].天津:南开大学，2009.4．
[108]路卫娜.开放网络环境中的激励机制研究.[博士学位论文].合肥:中国科学技术大学，2009.3．
[109]王小峰.信任管理的策略表示与量化模型研究.[博士学位论文].长沙:国防科学技术大学，2009.10．
[110]蒋兴浩.基于PKI机制的对等网信任管理问题研究.[博士学位论文].杭州:浙江大学,2002,11．
[111] Wang Y, Vassileva J. Trust and Reputation Model in Peer-to-Peer Networks.Peer-to-Peer Computin. Proceedings of the3th international Conference,2003.Page(s):150-157.http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1231515.2009-04-10
[112]田敬,代亚非. P2P持久存储研究.软件学报,2007,18(6):1379-1399．
[113] P Resnick, R Zeckhauser. Trust Among Strangers in Internet Transactions:Empirical Analysis of eBay s Reputation System. NBER Workshop on EmpiricalStudies of Electronic Commerce,2000. http://citeseerx.ist.psu.edu/showciting?cid=43139,2009-08-10
[114] Cornelli. Choosing reputable servents in a P2P network. In Proc. of the EleventhInternational World Wide Web Conference, Honolulu, Hawaii, ACM1-58113-449-5/02/0005, http://citeseerx.ist.psu.edu/showciting?cid=3826726.2009-10-20
[115]林作铨,牟克典,韩庆.基于未知扰动的冲突证据合成方法[J].软件学报,2004,15(08):1150-1156.
[116] Damien Magoni. nem: A Software for Network Topology Analysis and Modeling.In: Proceedings.10th IEEE International Symposium on11-16Oct.2002Page(s):364-371.http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1167097.2010-05-20
[117] Christopher R. Palmer, J. Gregory Steffan. Generating Network Topologies ThatObey Power Laws. Global Telecommunications Conference,2000. GLOBECOM'00. IEEE Volume1, Page(s):434-438vol.1. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=892042.2010-05-10
[118] Albert Laszlo Barabasi, Eric Bonabeau. Scale-Free Networks. http://www.swarmagents.com/complex/models/network.htm,2010-052-20
[119] MICHAL FELDMAN,JOHN CHUANG. Overcoming Free-Riding Behavior inPeer-to-Peer Systems. ACM SIGecom Exchanges,2005,5(4):41-50.
[120] Mao Yang, Zheng Zhang, Xiaoming Li, te al. An Empirical Study of Free-RidingBehaviorin the Maze P2P File-Sharing System. http://research.microsoft.com/pubs/69161/maze_freeride.pdf,2011-05-20
[121] Muntasir Raihan Rahman. A Survey of Incentive Mechanisms in Peer-to-PeerSystems. http://www.cs.uwaterloo.ca/research/tr/2009/CS-2009-22.pdf,2010-05-20
[122] Richard T.B. Ma, C.M. Lee, John C.S. Lui, te al. Incentive P2P Networks: AProtocol to Encourage Information Sharing and Contribution. http://www.cse.cuhk.edu.hk/~cslui/PUBLICATION/mama_incentive.pdf．2010-2-20
[123] Richard T.B. Ma, C.M. Lee, John C.S. Lui, te al. An incentive mechanism forP2P networks. http://www.ee.columbia.edu/~tbma/StudyArea/Publications/ICDCS04.pdf．2010-02-20
[124] Emmanuelle Anceaume, Maria Gradinariu, Aina Ravoaja. Incentive for P2P FairResource Sharing. http://hal.archives-ouvertes.fr/docs/00/03/67/86/PDF/game_p2p1.pdf．2010-02-20
[125] Rohit Gupta, Arun K. Somani. Game Theory As A Tool To Strategize As Well AsPredict Nodes Behavior In Peer-to-Peer Networks. http://ecpe.ee.iastate.edu/dcnl/Publications/docs/Conf-Pub/DCNL-CN-2004-401.pdf．2010-02-20
[126] M. Meulpolder, J. A. Pouwelse, D. H. J. Epema, H. J. Sips. BarterCas t: APractical Approach to Prevent Lazy Freeriding in P2P Networks. http://www.computer.org/portal/web/csdl/doi/10.1109/IPDPS.2009.5160954．2010-02-20
[127] Murat Karakaya,Ibrahim Ko¨rpeog lu, O¨zgu¨r Ulusoy. Counteracting free ridingin Peer-to-Peer networks. Computer Networks,2008,52:675–694.
[128]彭长生.农村公共品合作供给的影响因数研究.[博士学位论文].南京:南京农业大学,2007.12．
[129] Kunzmann G, Binzenh fer A, Henjes R. Analyzing and modifying chordsstabilization algorithm to handle high churn rates Proc of the MICC&ICON2005. Piscataway: IEEE Press,2005:885-890.
[130]贾兆庆,薛广涛,唐新怀,等.非结构化P2P中的一种信任机制.计算机研究与发展,2010,47(4):645-652．
[131]杨雅辉,钮振瑛,徐恪. P2P流媒体系统服务器部署的优化设计.计算机研究与发展,2010,47(7):1219-1224．
[132]田春岐,江建慧,胡治国,等.一种基于聚集超级节点的P2P网络信任模.计算机学报,2010,33(2):345-355．
[133]李勇军,代亚非.对等网络信任机制研究.计算机学报,2010,33(3):390-405．
[134] Daniel Hughes, Geoff Coulson, James Walkerdine. Free riding on Gnutellarevisited: The bell tolls? IEEE Distributed Systems Online,2005.6(6):1-18.http://www.comp.lancs. ac.uk/~geoff/Publications/DSO05.pdf,2011-02-20．
[135] Albert Laszlo Barabasi, Eric Bonabeau. Scale-Free Networks. http://www.swarmagents.com/complex/models/network.htm．2011-02-20
[136]廖貅武,唐焕文.动态联盟中伙伴选择的证据推理方法.计算机集成制造系统-CIMS,2003,9(1):57-62．
[137] Jian-Bo Yang; Singh, M.G. An evidential reasoning approach for multipleattribute decision-making with uncertainty. IEEE Transactions on Systems,Man, and Cybernetics,1994,24(1):1-18. http://ieeexplore.ieee.org/Xplore/login.jsp?url=/iel1/21/6561/00259681.pdf.2011-02-20．
[138] YANG Jianbo. Rule and utility based evidential reasoning approach for multi-attribute decision analysis under uncertainties. European Journal of OperationalResearcT,2001,131(1):31-61. http://www.sciencedirect.com/science/article/B6VCT-42JYVGY-3/2/d7741aa8d5e62ec3c50bd44eb95b650f.2011-02-20．
[139]单保华,杨冬菊,张利永,等.一种有盟主的服务虚拟组织模型及其在电子政务中的应用.计算机学报,2006,29(7):1241-1251.
[140] STUART M. ALLEN, GUALTIERO COLOMBO, ROGER M. WHITAKER.Cooperation through Self-Similar Social Networks. ACM Transactions onAutonomous and Adaptive Systems,2010,5(1):1-29．
[141]汪小凡,李翔,陈关荣.复杂网络理论及其应用.北京：清华大学出版社2006.04,131-188.
[2]李靖.流媒体服务系统中接入控制与缓存策略的研究.[博士学位论文].合肥:中国科学技术大学,2009.4．
[3]霍龙社.互联网流媒体传输关键技术研究.[博士学位论文].北京:中国科学院计算技术研究所,2006.6．
[4]中国互联网络信息中心（CNNIC）.第29次中国互联网络发展状况统计报告.http://www.cnnic.net.cn/dtygg/dtgg/201201/t20120116_23667.html．2012-02-24
[5]艾瑞咨询.2011年中国互联网市场年度总结报告. http://www.iresearch.com.cn/Report/1653.html．2012-02-24
[6]艾瑞咨询.2010-2011年中国在线视频行业年度监测报告.http://www.doc88.com/p-293590546796.html．2012-02-24
[7]林柏青.流式媒体的兴起. http://www.avwdoe.cn/stream/lsmt.html．2010-05-20
[8]流媒体.http://baike.baidu.com/view/794.htm．2010-05-20
[9]吴杰. P2P流媒体内容分发与服务关键技术研究.[博士学位论文].上海:复旦大学,2008.4．
[10]范英磊.无线流媒体传输的服务质量关键问题研究.[博士学位论文].北京:北京邮电大学,2007.5．
[11] Quinn B，AJmeroth K. IP multicast applications: Challenges and solutions.http://www.ietf.org/rfc/rfc3170.txt．2010-05-20
[12] Daniel Minoli. IP Multicast with Applications to IPTV and Mobile DVB-H[M].Wiley-IEEEPress,April4,2008. http://www.61ic.com/code/viewthread.php?tid=19648&extra=page%3D1．2010-05-20
[13] Braden R, Clark D, Shenker S. Integrated services in the Internet architectur e:An overview. RFC1633,1994. http://www.ietf.org/rfc/rfc1633.txt．2010-05-20
[14] Shenker S, Partridge C, Guerin R. Specification of guaranteed quality of service.RFC2212,1997. http://www.ietf.org/rfc/rfc2212.txt．2010-05-20
[15] Clark D, Shenker S, Zhang L. Supporting real-time applications in an integratedservices packet network: architecture and mechanisms. http://dspace.mit.edu/handle/1721.1/1543.2010-05-20
[16] Zhang L, Deering S, Estrin D, et al. RSVP: A new resource reservation protocol.IEEE Network Magazine.1993,7(5):116-127．
[17] Blake S, Black D, Carlson M, et al. An Architecture for Differentiated Service.RFC2475,1998. http://www.javvin.com/protocol/rfc2475.pdf．2010-05-20
[18] Nichols K, Jacobson V, Zhang L. A two-bit differentiated services architecturefor the internet.1999. http://www.cord.edu/faculty/zhang/cs345/assignments/researchPapers/draft-nichols-diff-svc-arch-02.pdf,2010-05-20
[19] Nichols K, Blake S, Baker F, et al. Definition of the differentiated services field(DS field) in the IPv4and IPv6headers. RFC2474,1998.http://www.ietf.org/rfc/rfc2474.txt．2010-05-20
[20]冯健. P2P点播流媒体服务质量研究.[博士学位论文].西安:西北大学,2008.6．
[21] Radware:实现CDN内容发布网全局负载均衡与内容请求路由. http://www.360doc.com/content/11/0530/23/7045948_120603635.shtml,2011-02-20
[22]戴汝为,操龙兵. Internet--一个开放的复杂巨系统.中国科学E辑,2003,33(4):289-296.
[23] Farag Ahmed Azzedin. Classifying and Tracking Free Riders in Multimedia-Based Systems. Journal of Universal Computer Science,2010,16(10),1368-1387．
[24]沈时军,李三立.基于P2P的视频点播系统综述.计算机学报,2010,33(4):613-624．
[25] Manoj Parameswaran, Anjana Susarla, Andrew B, et al. P2P networking: aninformation-sharing alternative. Computing Practices,2001,34(7):31-38.http://crec.mccombs.utexas.edu/works/articles/PARA.Cxs2final.pdf．2010-05-20
[26]张宇翔,杨冬,张宏科. P2P网络中Churn问题研究.软件学报.2009,20(5):1362-1376．
[27] Ion Stoica, Robert Morris, David Karger,et al.Chord: A Scalable Peer to peerLookup Service for Internet Applications. http://pdos.csail.mit.edu/papers/chord:sigcomm01/chord_sigcomm.pdf．2010-05-20
[28] Stephanos Androutsellis Theotokis, and Diomidis Spinellis. A sur vey ofpeer-to-peer content distribution technologies. ACM Computing Surveys, Vol.36, No.4, December2004, pp.335–371. http://www.spinellis.gr/pubs/jrnl/2004-ACMCS-p2p/html/AS04.pdf．2010-05-20
[29] Lua EK, Crowcroft J, Pias M, et al. A survey and comparison of peer-to-peeroverlay network schemes. Journal of IEEE Communications Survey and Tutorial,2005,7(2):7293.
[30] Kan Zhang, Nick Antonopoulos. Towards a Cluster Based Incentive Mechanismfor P2P Networks.9th IEEE/ACM International Symposium on ClusterComputing and the Grid,2009,532-537. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5071917,2010-05-20
[31] P. Brighten Godfrey, Scott Shenker, Ion Stoica. Minimizing churn in distributedsystems. http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-25.pdf.2010-12-05
[32] Daniel Stutzbach, Reza Rejaie. Understanding Churn in Peer to Peer Networks.http://conferences.sigcomm.org/imc/2006/papers/p19-stutzbach2.pdf,2010-12-05
[33]余一娇,金海.对等网络中的搭便车行为分析与抑制机制综述.计算机学报,2008,31(1):1-15．
[34]余一娇.基于文件复制的对等网络搭便车抑制技术研究.[博士学位论文].武汉:华中科技大学,2009.4．
[35] Lakshmish Ramaswamy, Ling Liu. Free riding: A new challenge to Peer-to-PeerFile Sharing Systems. http://www.cs.uga.edu/~laks/papers/free-riding.pdf,2011-02-20
[36]杨峰,徐如志.对等资源发现技术研究.北京:清华大学出版社.2011.1,13-99．
[37]邢小良.P2P技术及其应用.北京:人民邮电出版社,2008.02,30-39,108-146
[38]杨天路,刘宏伟,张文等.P2P网络技术原理与系统开发案例.北京:人民邮电出版社,2007.6,37-61．
[39] Eric Cronin, Sugih Jamin, Cheng Jin, et al. Constrained mirror Placement on theinternet. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS,2002,20(7):1369-1382．
[40]黄道颖,黄建华,庄雷,等.基于主动网络的分布式P2P网络模型.软件学报,2004,15(7):1081-1089．
[41]汤大权,贺明科,孟庆崧.基于幂律分布和小世界特性的无结构P2P网络中搜索方法研究.计算机研究与发展.2007,44(9):1566-1571.
[42]杨震.P2P流媒体分发网络中路由热区问题的研究.[博士学位论文].北京:北京邮电大学.2007.8．
[43] John Kubiatowicz,David Bindel,Yan Chen,et al. OceanStore: An architecture forglobal-scale persistent storage. http://www.csd.uwo.ca/courses/CS9843b/papers/OceanStore.pdf,2010-08-20
[44]王向辉.P2P网络拓扑结构研究.[博士学位论文].哈尔滨:哈尔滨工程大学.2008.4．
[45]李泽平.P2P流媒体分发与服务技术研究.[博士学位论文].成都:电子科技大学.2010.6．
[46] M. Ripeanu, I. Foster, A. Iamnitchi. Mapping the Gnutella Networ k: PropertiesLarge-Scale Peer-to-Peer Systems and Implications for System Design. IEEEinternet computing journal,2002,6(1):23-33．
[47] I.Clarke, O. Sandberg, B. Wiley, et al. Freenet: a distributed anonymousinformation storage and retrieval system, International workshop on Designingprivacy enhancing technologies design issues in anonymity and unobservabilitytable of contents,2001,44:46-66．
[48] Sylvia Ratnasamy,Paul Francis,Mark Handley,et al. A Scalable ContentAddressable Network. http://www.icsi.berkeley.edu/pubs/networking/scalablecontent01.pdf,2010-05-20
[49] Antony Rowstron,Peter Druschel. Pastry: Scalable, decentralized object locationand routing for large-scale peer-to-peer systems. http://research.microsoft.com/en-us/um/people/antr/PAST/pastry.pdf.2010-05-20
[50] Ben Y. Zhao, John Kubiatowicz, Anthony D. Joseph. Tapestry: An Infrastructurefor Fault-tolerant Wide-area Location and Routing. http://www.cs.cornell.edu/people/egs/cs6460-spring10/tapestry.pdf.2011-02-20
[51] Kleinberg J. The small-world phenomenon: An algorithmic perspective ACMSymp on Theory of Computing,2000:820828. http://nicomedia.math.upatras.gr/courses/mnets/mat/Kleinberg_SW_algorithmic.pdf,2011-02-20
[52] David Kempe, Jon Kleinberg, Alan Demers. Spatial gossip and resource locationprotocols.http://www.cs.cornell.edu/home/kleinber/stoc01-gossip.pdf,2010-02-20
[53]冯劲潇陈贵海谢俊元.基于分层象限空间的P2P超级节点拓扑构造.计算机学报,2010,33(6):988-1003．
[54] Yang Guo, Kyoungwon Suh, Jim Kurose,et al. A peer-to-peer on-demandstreaming service and its performance evaluation. In: Proc. of the IEEE ICME2003. Maryland: IEEE Computer Society,2003.649-652. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1221700,2010-02-20
[55] Yang Guo, Kyoungwon Suh, Jim Kurose,et al. Directstream: A Direetory-basedPeer-to-Peer video Streaming Serviee， ACM ComPuter Communications,2008,31(3):520-536．
[56] Yang Guo,Kyoungwon Suh,Jim Kurose,et al. P2Cast: Peer-to-peer patchingscheme for VoD service. Springer, Multimed Tools Application,2007,33:109-129．
[57] Tai T. Do, Kien A. Hua, Mounir Tantaoui. P2VoD: Providing Fault TolerantVideo-on-Demand Streaming in Peer-to-Peer Environment. In Proceedings of theIEEE International Conference on Communications (ICC04), June20-24,2004,Paris, France, Volume3, pages1467-1472. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1312755.2010-02-20
[58] Bram Cohen. Incentives build robustness in bittorrent. In Proc. of the FirstWorkshop on Economics of Peer-to-Peer Systems, May2003:251-260.http://www.ittc.ku.edu/~niehaus/classes/750-s06/documents/BT-description.pdf.2010-02-20
[59] Miguel Castro, Peter Druschel, Anne-Marie Kermarrec,et al. Splitstream:High-bandwidth Content Distribution in CooPerative Environments. In Proc. ofACM SOSP2003:292-303. http://dl.acm.org/citation.cfm?id=945474.2010-02-20
[60] Venkata N. Padmanabhan, Helen J. Wang, Philip A. Chou. DistributingStreaming Media Content Using Cooperative Networking. http://research.microsoft.com/apps/pubs/default.aspx?id=75966.2010-02-20
[61] Mohamed Hefeeda, Ahsan Habib, Dongyan Xu. CollectCast: A peer-to-peerservice for media streaming. Springer, Multimedia Systems,2005,11(1):68-81
[62] Xuxian Jiang,Yu Dong,Dongyan Xu,et al. GnuStream: A P2P media streamingsystem Prototype. http://www.pdfio.com/k-437241.html．2010-02-20
[63]龚海刚,刘明,毛莺池等. P2P流媒体关键技术的研究进展.计算机研究与发展,2005,42(12):2033-2040.
[64] F.Banaci-Kashani, C.Chien Chen, C.Shahabi. WSPDS: Web Services peer-to-peer Discovery Service. In: Proceedings of International Symposium on WebServices and Applications(ISWS04)[C].LasVgas,USA,2004. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.2679,2010-02-20
[65] Mohamed Hefeeda, Ahsan Habib, Boyan Botev, et al.PROMISE: Peer-to-PeerMedia Streaming Using CollectCast. http://www.doc88.com/p-41595153773.html,2011-02-20
[66] Nazanin Magharei, Reza Rejaie, Yang Guo. Mesh or Mult iple-Tree: AComparative Study of Live P2P Streaming Approaches. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?reload=true&arnumber=4215750,2011-02-20
[67]刘琼,徐鹏,杨海涛,彭芸.Peer-to-Peer文件共享系统的测量研究.软件学报,2006,17(10):2131-2140．
[68] Liao XF, Jin H, Liu YH, et al. AnySee: Peer-to-Peer Live Streaming. Proc. of theIEEE INFOCOM,2006. New York: IEEE Computer Society.1-10.http://wenku.baidu.com/view/f56b6d6648d7c1c708a14515.html.2011-02-20
[69] Magharei N, Rejaie R. Prime: peer-to-peer receiver-driven mesh-based streaming.Proc. of IEEE INFOCOM, Anchorage, Alaska, USA,2007:1052-1065.http://wenku.baidu.com/view/bedba1eb81c758f5f61f670a.html.2011-02-20
[70] Li Chunxi, Chen Changjia. On Gnutella topology dynamics by studying leaf andultra connection jointly in phase space. Computer Networks.2008,52(3):695-719.
[71] Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal. Building low-diameterpeer-to-peer network. IEEE Journal on Selected Areas in Communications,2003,21(6):995-1002．
[72] Dmitri Loguinov, Anuj Kumar, Vivek Rai,et al. Graph-Theoretic analysis ofstructured peer-to-peer systems: Routing distances and fault resilience.IEEE/ACM Transactions on Networking,2005,13(5):1107-1120．
[73] Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell,et al. An analytical studyof a structured overlay in the presence of dynamic membership. IEEE/ACMTransactions. on Networking,2008,16(4):814825.
[74]黄庆凤,李之棠,陆垂伟等. DHT抖动处理代价的分析.计算机研究与发展，2008，45（S1）:409-414.
[75] Derek Leonard, Vivek Rai, Dmitri Loguinov. On Life time Based Node Failureand Stochastic Resilience of Decentralized Peer to Peer Networks.http://wenku.baidu.com/view/eea1f33d0912a216147929cd.html,2009-12-20
[76] Di Wu,Ye Tian, Kam Wing Ng,et al. Stochastic analysis of the interplay betweenobject maintenance and churn. Computer Communications,2008,31(2):220-239．
[77] Sean Rhea, Dennis Geels, Timothy Roscoe,et al. Handling Churn in a DHT.http://www.eecs.berkeley.edu/Pubs/TechRpts/2003/CSD-03-1299.pdf．2009-12-20
[78]陈建忠,徐天音,李文中等.一种基于衍生树的交互式P2P流媒体系统.软件学报,2010,21(5):1138-1152．
[79]邱菡,李玉峰,邬江兴.保障连续媒体流用户层QoS的缓存控制.软件学报，2009,20(7):19211930．
[80] Zhao BY, Huang L, Stribling J, et al. Tapestry: A resilient global-scale overlayfor service deployment. IEEE Journal on Selected Areas in Communications,2004,22(1):41-53．
[81] Eytan Adar, Bernardo A. Huberman. Free riding on Gnutella.http://wenku.baidu.com/view/36f24be49b89680203d8256b.html．2009-12-15
[82] Subhabrata Sen, Jia Wang. Analyzing Peer-to-Peer traffic across large networks.IEEE/ACM Transactions on Networking,2004,12(2):219-232．
[83]韦东,对等网络文件共享系统中的信誉机制研究.[博士学位论文].合肥:中国科学技术大学,2009.4．
[84] Yunfei Zhang, Lianhong Lei, and Changjia Chen. Characterizing peer-to-peertraffic across Intenet. LNCS3032.Heidelberg:Springer-Verlag,2004:388-395.
[85]黄庆凤.结构化P2P网络性能分析与搜索算法研究.[博士学位论文].武汉:华中科技大学,2008．
[86]周丽娟. P2P流媒体识别方法的研究.[博士学位论文].武汉:华中科技大学,2008.11．
[87]卫星.流媒体集群系统复制存储策略研究.[博士学位论文].合肥：中国科学技术大学．
[88] Ge Zihui, Daniel R. Figueiredo, Sharad Jaiswal, et al. Modeling peer-peer filesharing systems. http://citeseerx.ist.psu.deu/viewdoc/download?doi=10.1.1.12.3320&rep=repl&type=pdf,2011-02-20
[89] Zhongmei Yao, Derek Leonard, Xiaoming Wang, et al. Modeling heterogeneoususer churn and local resilience of unstructured P2P networks. http://www.cs.tamu.edu/academics/tr/tamu-cs-tr-2006-8-1,2010-02-20
[90] Derek Leonard, Vivek Rai, Dmitri Loguinov,et al. On lifetime-based node failureand stochastic resilience of decentralized peer-to-peer networks. IEEE/ACMTrans on Networking,2007,15(3):644-656.
[91]谢振,毕经平,李晔.基于连续行为观察的P2P网络中邻居评价模型.计算机研究与发展,2010,47(6):1098-1106．
[92] Kumar P, Sridhar G, Sridhar V. Bandwidth and latency model for DHT basedpeer-to-peer networks under variable churn. In: Proc. of the IEEE SystemsCommunications (ICW2005). Piscataway: IEEE Press,2005.320325.http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1515544&userType=inst.2010-10-15.
[93] Watts D J, Strogatz S H. Collective dynamics of small world networks.Nature,1998,393(6):440-442.
[94] Barabasi A-L,R Albert. Emergence of scaling in random networks. Science,1999,286(10):509-512.
[95] Zhong M, Shen K, Seiferas J. Non-Uniform random membership management inpeer-to-peer networks. http://www.cs.rochester.edu/~kshen/papers/infocom2005b.pdf,2010-02-20
[96] Urs Fischbacher,Simon G chter. Social Preferences, Beliefs, and the Dynamicsof Free Riding in Public Goods Experiments. American Economic Review,2010,100(1):541-556．
[97]田慧蓉. P2P网络信任模型及激励机制的研究.[博士学位论文].北京：北京邮电大学,2006．
[98] Kamvar SD, Schlosser MT. EigenRep: Reputation management in P2P networks.In: Lawrence S, ed. Proc. of the12th Int l World Wide Web Conf.(WWW2003).Budapest: ACM Press,2003.123-134. http://www.comp.nus.edu.sg/~ooibc/courses/cs6203/eigen.pdf．2010-08-20
[99]窦文,王怀民,贾焰,等.构造基于推荐的Peer-to-Peer环境下的Trust模型.软件学报,2004,15(04):571-538．
[100] Huu Tran, Hitchens M, Varadharajan V, Watters P. A Trust Based Access ControlFramework for P2P File-Sharing Systems. http://csdl2.computer.org/comp/proceedings/hicss/2005/2268/09/22680302c.pdf,2010-08-20
[101]田春岐,邹仕洪,文东等.一种基于推荐证据的有效抗攻击P2P网络信任模型.计算机学报,2008,31(2):270-281．
[102]孙玉星,黄松华,陈力军,谢立等.贝叶斯决策的自组网推荐信任度修正模型[J].软件学报.2009,20(9):25742586.
[103]李景涛,荆一楠,肖晓春等.基于相似度加权推荐的P2P环境下的信任模型.软件学报.2007,18(1):157167．
[104]李治军,廖明宏基于信任的P2P真实性查询及副本管理算法.软件学报.2006,17(4):939948．
[105]王黎明,黄厚宽,柴玉梅.基于信任和K臂赌博机问题选择多问题协商对象.软件学报.2006,17(12):25372546．
[106]姜守旭,李建中.一种P2P电子商务系统中基于声誉的信任机制.软件学报.2007,18(10):25512563．
[107]黄国伟.对等网络中服务可用性问题研究.[博士学位论文].天津:南开大学，2009.4．
[108]路卫娜.开放网络环境中的激励机制研究.[博士学位论文].合肥:中国科学技术大学，2009.3．
[109]王小峰.信任管理的策略表示与量化模型研究.[博士学位论文].长沙:国防科学技术大学，2009.10．
[110]蒋兴浩.基于PKI机制的对等网信任管理问题研究.[博士学位论文].杭州:浙江大学,2002,11．
[111] Wang Y, Vassileva J. Trust and Reputation Model in Peer-to-Peer Networks.Peer-to-Peer Computin. Proceedings of the3th international Conference,2003.Page(s):150-157.http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1231515.2009-04-10
[112]田敬,代亚非. P2P持久存储研究.软件学报,2007,18(6):1379-1399．
[113] P Resnick, R Zeckhauser. Trust Among Strangers in Internet Transactions:Empirical Analysis of eBay s Reputation System. NBER Workshop on EmpiricalStudies of Electronic Commerce,2000. http://citeseerx.ist.psu.edu/showciting?cid=43139,2009-08-10
[114] Cornelli. Choosing reputable servents in a P2P network. In Proc. of the EleventhInternational World Wide Web Conference, Honolulu, Hawaii, ACM1-58113-449-5/02/0005, http://citeseerx.ist.psu.edu/showciting?cid=3826726.2009-10-20
[115]林作铨,牟克典,韩庆.基于未知扰动的冲突证据合成方法[J].软件学报,2004,15(08):1150-1156.
[116] Damien Magoni. nem: A Software for Network Topology Analysis and Modeling.In: Proceedings.10th IEEE International Symposium on11-16Oct.2002Page(s):364-371.http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1167097.2010-05-20
[117] Christopher R. Palmer, J. Gregory Steffan. Generating Network Topologies ThatObey Power Laws. Global Telecommunications Conference,2000. GLOBECOM'00. IEEE Volume1, Page(s):434-438vol.1. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=892042.2010-05-10
[118] Albert Laszlo Barabasi, Eric Bonabeau. Scale-Free Networks. http://www.swarmagents.com/complex/models/network.htm,2010-052-20
[119] MICHAL FELDMAN,JOHN CHUANG. Overcoming Free-Riding Behavior inPeer-to-Peer Systems. ACM SIGecom Exchanges,2005,5(4):41-50.
[120] Mao Yang, Zheng Zhang, Xiaoming Li, te al. An Empirical Study of Free-RidingBehaviorin the Maze P2P File-Sharing System. http://research.microsoft.com/pubs/69161/maze_freeride.pdf,2011-05-20
[121] Muntasir Raihan Rahman. A Survey of Incentive Mechanisms in Peer-to-PeerSystems. http://www.cs.uwaterloo.ca/research/tr/2009/CS-2009-22.pdf,2010-05-20
[122] Richard T.B. Ma, C.M. Lee, John C.S. Lui, te al. Incentive P2P Networks: AProtocol to Encourage Information Sharing and Contribution. http://www.cse.cuhk.edu.hk/~cslui/PUBLICATION/mama_incentive.pdf．2010-2-20
[123] Richard T.B. Ma, C.M. Lee, John C.S. Lui, te al. An incentive mechanism forP2P networks. http://www.ee.columbia.edu/~tbma/StudyArea/Publications/ICDCS04.pdf．2010-02-20
[124] Emmanuelle Anceaume, Maria Gradinariu, Aina Ravoaja. Incentive for P2P FairResource Sharing. http://hal.archives-ouvertes.fr/docs/00/03/67/86/PDF/game_p2p1.pdf．2010-02-20
[125] Rohit Gupta, Arun K. Somani. Game Theory As A Tool To Strategize As Well AsPredict Nodes Behavior In Peer-to-Peer Networks. http://ecpe.ee.iastate.edu/dcnl/Publications/docs/Conf-Pub/DCNL-CN-2004-401.pdf．2010-02-20
[126] M. Meulpolder, J. A. Pouwelse, D. H. J. Epema, H. J. Sips. BarterCas t: APractical Approach to Prevent Lazy Freeriding in P2P Networks. http://www.computer.org/portal/web/csdl/doi/10.1109/IPDPS.2009.5160954．2010-02-20
[127] Murat Karakaya,Ibrahim Ko¨rpeog lu, O¨zgu¨r Ulusoy. Counteracting free ridingin Peer-to-Peer networks. Computer Networks,2008,52:675–694.
[128]彭长生.农村公共品合作供给的影响因数研究.[博士学位论文].南京:南京农业大学,2007.12．
[129] Kunzmann G, Binzenh fer A, Henjes R. Analyzing and modifying chordsstabilization algorithm to handle high churn rates Proc of the MICC&ICON2005. Piscataway: IEEE Press,2005:885-890.
[130]贾兆庆,薛广涛,唐新怀,等.非结构化P2P中的一种信任机制.计算机研究与发展,2010,47(4):645-652．
[131]杨雅辉,钮振瑛,徐恪. P2P流媒体系统服务器部署的优化设计.计算机研究与发展,2010,47(7):1219-1224．
[132]田春岐,江建慧,胡治国,等.一种基于聚集超级节点的P2P网络信任模.计算机学报,2010,33(2):345-355．
[133]李勇军,代亚非.对等网络信任机制研究.计算机学报,2010,33(3):390-405．
[134] Daniel Hughes, Geoff Coulson, James Walkerdine. Free riding on Gnutellarevisited: The bell tolls? IEEE Distributed Systems Online,2005.6(6):1-18.http://www.comp.lancs. ac.uk/~geoff/Publications/DSO05.pdf,2011-02-20．
[135] Albert Laszlo Barabasi, Eric Bonabeau. Scale-Free Networks. http://www.swarmagents.com/complex/models/network.htm．2011-02-20
[136]廖貅武,唐焕文.动态联盟中伙伴选择的证据推理方法.计算机集成制造系统-CIMS,2003,9(1):57-62．
[137] Jian-Bo Yang; Singh, M.G. An evidential reasoning approach for multipleattribute decision-making with uncertainty. IEEE Transactions on Systems,Man, and Cybernetics,1994,24(1):1-18. http://ieeexplore.ieee.org/Xplore/login.jsp?url=/iel1/21/6561/00259681.pdf.2011-02-20．
[138] YANG Jianbo. Rule and utility based evidential reasoning approach for multi-attribute decision analysis under uncertainties. European Journal of OperationalResearcT,2001,131(1):31-61. http://www.sciencedirect.com/science/article/B6VCT-42JYVGY-3/2/d7741aa8d5e62ec3c50bd44eb95b650f.2011-02-20．
[139]单保华,杨冬菊,张利永,等.一种有盟主的服务虚拟组织模型及其在电子政务中的应用.计算机学报,2006,29(7):1241-1251.
[140] STUART M. ALLEN, GUALTIERO COLOMBO, ROGER M. WHITAKER.Cooperation through Self-Similar Social Networks. ACM Transactions onAutonomous and Adaptive Systems,2010,5(1):1-29．
[141]汪小凡,李翔,陈关荣.复杂网络理论及其应用.北京：清华大学出版社2006.04,131-188.