融合型内容分发网络关键技术研究
|
摘要
Internet流量指数性增长以及用户对网络速度的需求已促使网络资源分发的可用性、可靠性等成为互联网技术的关键问题。内容分发网络作为运行于整个互联网上的覆盖网，主要致力于互联网中的服务质量优化。随着云计算、移动互联网及动态网络内容技术的推进，内容分发技术逐步趋向于专业化、定制化，在内容路由、管理、推送以及安全性都面临新的挑战。本文从运营商角度出发，考虑流量结算成本、提升数据传输服务质量以及安全性三个方面对融合型CDN（Content Delivery Networks）进行研究。
首先，考虑ISP（Internet Service Provider）的域内用户访问域外网络资源所产生的大量可存储数据由于被大量多次访问从而造成域间流量成本骤增，同时由于域内链路重复流量也导致传输服务的下降。针对该问题，本文首先提出针对ISP-CDN的内容节点两层部署机制，该部署机制分为两层，外层部署于域间出入口以降低域间流量，内层的部署策略采用基于贪心的网络流量代价算法对核心节点进行选取。并在此基础上设计基于RCBF（Record Counter Bloom Filter）的索引结构与同步机制，从而改进CDN的内容路由策略，提升融合型CDN的服务性能。
第二，本文进一步研究内容数据的管理问题。由于内容节点位置固定后，如何对所存储内容进行管理是内容分发技术中的重要问题。内容管理主要分为两个方面：缓存管理与内容推送。本文首先提出基于访问间隔的替换策略，提高热度高的缓存对象在缓存空间中的生命周期；其次考虑到这些被访问的数据均依赖于用户自身的行为，在协议层对数据进行深入分析，提出多维度的缓存对象热度评价算法，进一步提升缓存命中率；最后提出一种基于价值度的热点数据推送策略，在所部署的节点间进行有效的内容预分发，降低用户的访问延时，改善网络性能。
第三，融合型CDN主要面对ISP域内用户，为了提升服务质量，降低CDN所面对的潜在网络威胁，如何结合ISP所拥有的拓扑和用户的数据优势，建立域内用户的可信机制是融合型CDN所面临的全新问题。本文提出基于信任的网络群体分类模型，结合对ISP所获取的用户行为数据，实现对用户的自动化分类，并采用传统检测方法设置用户类别可信度，以此构建可信融合型CDN。该模型首先使用网络交互拓扑信息建立网络节点间的信任矩阵；进而结合直接信任度和相关信任度计算网络节点间的相似度，进行用户分类；最后根据可信度对不同类别的用户进行差异化服务，提升低可信度的攻击代价，从而降低CDN所面临的网络风险。
最后，本文提出了一种ISP融合的内容分发系统，该系统与传统的CDN系统有一定的区别：1、被动解析存储与层次化部署；2、安全预警。整个系统主要分为四个模块：信息采集、缓存管理、节点通信与离线审计。通过在实际系统中对本文提出的内容部署、管理及用户分类进行具体测试，实现了本文最初的研究目标。
The availability, reliability have become the key issue of Internet technology because of the growth of Internet traffic and the demand of access speed. Content delivery networks focus on optimizing Internet quality of service. With the progress of cloud computing, mobile Internet and dynamic Web content technology, content delivery technology becomes specialization, customization. The content routing, management, and security of content delivery networks face new challenges. Based on above reasons, in this dissertation, we investigate performance and security of CDN to deal with the traffic cost, quality of service and data transmission network security. First, the content outside which may cause large number of traffic and decrease
the quality of service should be stored in order to decrease the inter-domain traffic. To solve this problem, we first propose hierachy deployment mechanism, which is divided into two layers. The purpose of the first level, which deploy content nodes at the inter-domain entrances, is reducing the inter-domain traffic. The inner deployment strategy based on greedy algorithm selects the content node from core routers. Then we design RCBF (Record Counter Bloom Filter) index structure and synchronization mechanisms to enhance the content routing performance by improving the environment under the CDN. Second, we investigate the content management problem when the location of
surragate servers has been fixed. Content management includes local cache management and remote cache pushing. In order to extend the life cycle of popular cache object, we propose cache replacement policy based on access density and object size. Then considering the cache data are depended on user behaviors, we analyze the application layer data in order to evaluate the object popularity. Cache data pushing scheme based on the value of popular object is further proposed to deal with the access delay and network performance. Third, in order to improve the quality of service and decrease the network risk
is a key task for ISP merged CDN. The previous network monitoring and detection mechanisms neglect the potential of social relations in these malicious network behaviors. This paper proposes a novel network group behavior clustering model based on trust through exploring the behavior similarity to construct trusted CDN. This model establishes the trust relationship between the nodes of the network using the network communication topology. Then we use relevant trust concept which is used to increase the trust value between two weak correlation nodes. Based on the clustering method, we reduce the network risk for CDN.
Finally, we design and implement a content delivery system for ISP. The system is different from trandistional CDN system in two parts:1. Parsing the network data passively and hierachy deployment;2. Security monitoring for ISP. The system includes three parts: information collection, cache management and auditing offline. Under the practical evaluations, our deployment machanism, cache management and security monitoring method achieve our initial research objectives.
首先，考虑ISP（Internet Service Provider）的域内用户访问域外网络资源所产生的大量可存储数据由于被大量多次访问从而造成域间流量成本骤增，同时由于域内链路重复流量也导致传输服务的下降。针对该问题，本文首先提出针对ISP-CDN的内容节点两层部署机制，该部署机制分为两层，外层部署于域间出入口以降低域间流量，内层的部署策略采用基于贪心的网络流量代价算法对核心节点进行选取。并在此基础上设计基于RCBF（Record Counter Bloom Filter）的索引结构与同步机制，从而改进CDN的内容路由策略，提升融合型CDN的服务性能。
第二，本文进一步研究内容数据的管理问题。由于内容节点位置固定后，如何对所存储内容进行管理是内容分发技术中的重要问题。内容管理主要分为两个方面：缓存管理与内容推送。本文首先提出基于访问间隔的替换策略，提高热度高的缓存对象在缓存空间中的生命周期；其次考虑到这些被访问的数据均依赖于用户自身的行为，在协议层对数据进行深入分析，提出多维度的缓存对象热度评价算法，进一步提升缓存命中率；最后提出一种基于价值度的热点数据推送策略，在所部署的节点间进行有效的内容预分发，降低用户的访问延时，改善网络性能。
第三，融合型CDN主要面对ISP域内用户，为了提升服务质量，降低CDN所面对的潜在网络威胁，如何结合ISP所拥有的拓扑和用户的数据优势，建立域内用户的可信机制是融合型CDN所面临的全新问题。本文提出基于信任的网络群体分类模型，结合对ISP所获取的用户行为数据，实现对用户的自动化分类，并采用传统检测方法设置用户类别可信度，以此构建可信融合型CDN。该模型首先使用网络交互拓扑信息建立网络节点间的信任矩阵；进而结合直接信任度和相关信任度计算网络节点间的相似度，进行用户分类；最后根据可信度对不同类别的用户进行差异化服务，提升低可信度的攻击代价，从而降低CDN所面临的网络风险。
最后，本文提出了一种ISP融合的内容分发系统，该系统与传统的CDN系统有一定的区别：1、被动解析存储与层次化部署；2、安全预警。整个系统主要分为四个模块：信息采集、缓存管理、节点通信与离线审计。通过在实际系统中对本文提出的内容部署、管理及用户分类进行具体测试，实现了本文最初的研究目标。
The availability, reliability have become the key issue of Internet technology because of the growth of Internet traffic and the demand of access speed. Content delivery networks focus on optimizing Internet quality of service. With the progress of cloud computing, mobile Internet and dynamic Web content technology, content delivery technology becomes specialization, customization. The content routing, management, and security of content delivery networks face new challenges. Based on above reasons, in this dissertation, we investigate performance and security of CDN to deal with the traffic cost, quality of service and data transmission network security. First, the content outside which may cause large number of traffic and decrease
the quality of service should be stored in order to decrease the inter-domain traffic. To solve this problem, we first propose hierachy deployment mechanism, which is divided into two layers. The purpose of the first level, which deploy content nodes at the inter-domain entrances, is reducing the inter-domain traffic. The inner deployment strategy based on greedy algorithm selects the content node from core routers. Then we design RCBF (Record Counter Bloom Filter) index structure and synchronization mechanisms to enhance the content routing performance by improving the environment under the CDN. Second, we investigate the content management problem when the location of
surragate servers has been fixed. Content management includes local cache management and remote cache pushing. In order to extend the life cycle of popular cache object, we propose cache replacement policy based on access density and object size. Then considering the cache data are depended on user behaviors, we analyze the application layer data in order to evaluate the object popularity. Cache data pushing scheme based on the value of popular object is further proposed to deal with the access delay and network performance. Third, in order to improve the quality of service and decrease the network risk
is a key task for ISP merged CDN. The previous network monitoring and detection mechanisms neglect the potential of social relations in these malicious network behaviors. This paper proposes a novel network group behavior clustering model based on trust through exploring the behavior similarity to construct trusted CDN. This model establishes the trust relationship between the nodes of the network using the network communication topology. Then we use relevant trust concept which is used to increase the trust value between two weak correlation nodes. Based on the clustering method, we reduce the network risk for CDN.
Finally, we design and implement a content delivery system for ISP. The system is different from trandistional CDN system in two parts:1. Parsing the network data passively and hierachy deployment;2. Security monitoring for ISP. The system includes three parts: information collection, cache management and auditing offline. Under the practical evaluations, our deployment machanism, cache management and security monitoring method achieve our initial research objectives.
引文
[1] Pallis G and Vakali A. Insight and Perspectives for Content DeliveryNetworks[J]. Communications of the ACM,2006,49(1):101-106.
[2] Informa Telecom&Media. Content delivery networks: Market dynamics andgrowth perspectives.[M/OL].[2013-10-24]. http://www.informatandm.com/wp-content/uploads/2012/10/CDN-whitepaper.pdf.
[3] Karagiannis T, Rodriguez P, Papagiannaki K. Should Internet Service ProvidersFear Peer-Assisted Content Distribution[C]. Proceedings of the5th ACMSIGCOMM conference on Internet Measurement. Berkeley, USA,2005Oct.6-6.
[4] Byers J, Considine J, Mitzenmacher M and Rost S. Informed content deliveryacross adaptive overlay networks[C]. Proceedings of the2002ACMSIGCOMM conference, Pittsburgh, PA, USA,2002.47-60.
[5] Rodriguez P, Tan S M, Gkantsidis C. On The Feasibility Of Commercial, LegalP2P Content Distribution[J]. ACM SIGCOMM Computer CommunicationReview,2006,36(1):75-78.
[6] Bavier A, Feamster N, Huang M, et al. In VINI Veritas: Realistic and ControlledNetwork Experimentation[C]. Proceedings of ACM SIGCOMM. Pisa, Italy,2006.3-14.
[7] Wang L, Park K S, Pang R, et al. Reliability and Security in the CoDeeN ContentDistribution Network[C]. Proceedings of the USENIX Annual TechnicalConference. Boston, USA,2004.14-14.
[8] Alzoubi H A, Lee S, Rabinovich M, et al. Anycast CDNS revisited[C].Proceeding of the17th International Conference on WWW. Beijing, China,2008.277-286.
[9] Frank B, Poese I, Lin Y, et. al. Pushing CDN-ISP Collaboration to the Limit[J].ACM SIGCOMM Computer Communication Review,2013,43(3):35-44.
[10] Liu H H, Wang Y, Yang Y, et. al. Optimizing Cost and Performance for ContentMultihoming[C]. Proceedings of ACM SIGCOMM. Helsinki, Finland,2012.371-382.
[11] Craig L, Scott I, Danny M, et. al. Internet Inter-Domain Traffic[C]. Proceedingsof ACM SIGCOMM. New Delhi, India,2010.76-86.
[12] Otto J S, Sanchez M A, Rula J P, et. al. Content Delivery and the NaturalEvolution of DNS-Remote DNS Trends, Performance Issues and AlternativeSolutions[C]. Proceedings of the12th ACM SIGCOMM conference on Internetmeasurement conference. Boston, USA,2012.523-536.
[13] Poese I, Frank B, Ager B, et. al. Improving Content Delivery using Provider-Aided Distance Information[C]. Proceedings of the10th ACM SIGCOMMconference on Internet measurement conference. Melbourne, USA,2010.22-34.
[14] Poese I, Frank B, Georgios S, et. al. Enabling Content-aware TrafficEngineering[J]. ACM SIGCOMM Computer Communication Review,2012,42(5):21-28.
[15] Krishnan R, Madhyastha H, Srinivasan S, et. al. Moving Beyond End-to-endPath Information to Optimize CDN Performance[C]. Proceedings of the9thACM SIGCOMM conference on Internet measurement conference. Chicago,USA,2009.190-201.
[16] Jiang W, Rui Z S, Rexford J and Chiang M. Cooperative Content Distributionand Traffic Engineering in an ISP Network[J]. ACM SIGMETRICSPerformance Evaluation Review,2009,37(1):239-250.
[17] Aditya P, Zhao M, Lin Y, et. al. Reliable Client Accounting for Hybrid Content-Distribution Networks[C]. Proceedings of the9th USENIX Symposium onNetworked Systems Design and Implementation, San Jose, CA, USA,2012.34-45.
[18] Jones S T. IPTV Delivery Architecture[C]. ITU-T IPTV Global TechnicalWorkshop. Seoul, Korea,2006.1-1.
[19] Day M, Cain B, Tomlinson G, et al. RFC3466(A Model for Content Internetworking)[S/OL]. Internet Engineering Task Force, February2003.[2013-10-24].www.ietf.org/rfc/rfc3466.txt
[20] Barbir A, Penno R, Chen R, et al. RFC3835(An Architecture for OpenPluggable Edge Services (OPES))[S/OL]. Internet Engineering Task Force,August2004.[2013-10-24]. www.ietf.org/rfc/rfc3835.txt
[21] Cooper I, Melve I, Tomlinson G. RFC3040(Internet Web Replication andCaching Taxonomy)[S/OL]. Internet Engineering Task Force RFC3040,January2001.[2013-10-24]. http://www.ietf.org/rfc/rfc3040.txt
[22] Barbir A, Batuner O, Beck A, et al. RFC3838(Policy, Authorization, andEnforcement Requirements of the Open Pluggable Edge Services(OPES))[S/OL]. Internet Engineering Task Force RFC3838, August2004.
[2013-10-24]. www.ietf.org/rfc/rfc3838.txt
[23] Yin H, Lin C, Zhang Q, et al. TrustStream: A Secure and Scalable Architecturefor Large-scale Internet Media Streaming[J]. IEEE Transaction on Circuits andSystems for Video Technology,2008,18(12):1692-1702.
[24] Yin H, Lin C, Qiu F, et al. CASM: A Content-Aware Protocol for Secure VideoMulticast[J]. IEEE Transaction on Multimedia, April2006,8(2):270-277.
[25]尹浩,詹同宇,林闯.多媒体网络：从内容分发网络到未来互联网[J].计算机学报.2012,35(6):1120-1131.
[26]中国国务院.“宽带中国”战略及实施方案[EB/OL].[2013-10-24].http://www.gov.cn/zwgk/2013-08/17/content_2468348.htm.
[27] Gadde S, Rabinovich M, Chase J. Reduce, reuse, recycle: an approach tobuilding large Internet caches[C]. Proceedings of6th Workshop on Hot Topicsin Operating Systems. Cape Cod, Massachusetts, USA.1997.93–98.
[28] Gao L, Dahlin M, Nayate A, et al. Improving availability and performance withapplication-specific data replication[J]. IEEE Transactions on Knowledge andData Engineering,2005,17(1):106-120.
[29] Davison B D. Web caching and content delivery resources[EB/OL].[2013-10-24]. http://www.Web-caching.com
[30] Day M, Cisco, Cain B, et al. RFC3466(A Model for Content Internetworking(CDI))[S/OL]. Internet Engineering Task Force RFC,2003.[2013-10-24].http://tools.ietf.org/html/rfc3466
[31] Jung Y, Krishnamurthy B, and Rabinovich M. Flash Crowds and Denial ofService Attacks: Characterization and Implications for CDNs and Web Sites[C].Proceedings of the11th International World Wide Web Conference. Hawaii,USA,2002.293–304.
[32] Lampe C, Resnick P. Slash(dot) and Burn: Distributed Moderation in a LargeOnline Conversation Space[C]. Proceedings of the SIGCHI Conference onHuman Factors in Computing Systems. Vienna, Austria,2004.543-550.
[33] Krishnamurthy B, Wills C and Zhang Y. On the Use and Performance of ContentDistribution Networks[C]. Proceedings of the1st ACM SIGCOMM Workshopon Internet Measurement. San Francisco, USA,2001.169–182.
[34] Lazar I and Terill W. Exploring Content Delivery Network[J]. IEEE ITProfessional,2001,3(4):47-49.
[35] AT&T. Effectively Manage Content Distribution with a CDN [EB/OL].[2013-10-24]. http://www.business.att.com/enterprise/Service/hosting-services/content-delivery/distribution/.
[36] ICT. Evolution of the CDN market [EB/OL].[2013-10-24]. http://www. ict-ocean.eu/public-folders/dissemination-1/cdnworldsummit-2010-cdnmarketevolution.
[37]中国工信部电信研究院. CDN发展现状与趋势[R].2009.
[38] Vakali A and Pallis G. Content Delivery Networks: Status and Trends[J]. IEEEInternet Computing,2003,7(6):68-74.
[39] Plagemann T, Goebela V, Mauthe A, et al. From Content distribution networksto content networks: issues and challenges[J]. Computer Communications,2006,29(5):551–562.
[40] Yin H, Liu X N, Min G Y, et al. Content Delivery Networks: A Bridge betweenEmerging Applications and Future IP Networks[J]. IEEE Network,2010,24(4):52-56.
[41] Pathan A M K and Buyya R. A Taxonomy and Survey of Content DeliveryNetworks[R]. Technical Report, GRIDS-TR-2007-4, The University ofMelbourne, Australia, Feb2007.
[42] Saroiu S, Gummadi K P, Dunn R J, et al. An Analysis of Internet ContentDelivery Systems[J]. ACM SIGOPS Operating Systems Review,2002,36(SI):315-328.
[43] Garey M R, and Johnson D S. Computers and Intractability: A Guide to theTheory of NP-Completeness[M]. W. H. Freeman and Co., New York, USA,1979.
[44] Li B, Golin M J, Italiano G F, et al. On The Optimal Placement Of Web Proxiesin The Internet [C]. Proceedings of IEEE INFOCOM. New York, USA,1999.1282–1290.
[45] Qiu L L, Padmanabhan V N, Voelker G M. On the Placement of Web ServerReplicas[C]. Proceeding of IEEE INFOCOM. Anchorage, USA,2001.1587-1596.
[46] Chen Y, Katz R.H, and Kubiatowicz J D. Dynamic Replica Placement forScalable Content Delivery[C]. Proceedings of International Workshop on Peer-to-Peer Systems. Cambridge, MA, USA,2002.306–318.
[47] Ni J, Tsang D H K. Large-Scale Cooperative Caching And Application-LevelMulticast in Multimedia Content Delivery Networks[J]. IEEE CommunicationsMagazine,2005,43(5):98-105.
[48] Jiang H, Wang Z, Wong A K, et al. A Replica Placement Algorithm for HybridCDN-P2P Architecture[C]. Proceedings of15th International Conference onParallel and Distributed Systems (ICPADS). Shenzhen, China,2009.758-763.
[49] Pai V S, Aron M, Banga G, et al. Locality-Aware Request Distribution inCluster-Based Network Servers[J]. ACM SIGOPS Operating Systems Review,1998,32(5):205-216.
[50] Sivasubramanian S, Szymaniak M, Pierre G, et al. Replication of Web HostingSystems[J]. ACM Computing Surveys,2004,36(3):291-334.
[51] Pierre G and Vansteen M. Globule: A Collaborative Content DeliveryNetwork[J]. IEEE Communications,2006,44(8):127-133.
[52] Andrews M, Shepherd B, Srinivasan A, et al. Clustering and Server SelectionUsing Passive Monitoring[C]. Proceedings of IEEE INFOCOM. New York,USA,2002.1717-1725.
[53] Ardaiz O, Freitag F, and Navarro L. Improving the Service Time of Web ClientsUsing Server Redirection[J]. ACM SIGMETRICS Performance EvaluationReview,2001,29(2):39-44.
[54] Jung H, Lee M, Ko D, et. al. How can an ISP merge with a CDN [J]. IEEECommunications Magazine,49(10):156-162,2011.
[55] Varun K, Zhang B C. Making CDN and ISP Routings Symbiotic[C].Proceedings of ICDCS2011. Minneapolis, Minnesota, USA,2011.869-878.
[56] Jin S and Bestavros A. Greedy Dual*Web caching algorithm: exploiting thetwo sources of temporal locality in Web request streams[J]. ComputerCommunications,2001,24(2):174-183.
[57] Cherkasova L and Ciardo G. Role of Aging, Frequency And Size In WebCaching Replacement Strategies. Proceedings of the9th InternationalConference on High-Performance Computing and Networking[C], Amsterdam,The Netherlands,2001.114-123.
[58] Patil J B, Pawar B V. Trace driven simulation of GDSF#and existing cachingalgorithms for web proxy servers[A]. Proceedings of the9th WSEASInternational Conference on Data Networks, Communications, Computers[C],Faro, Portugal,2009.378-384
[59] Podlipnig S, B sz rmenyi L. A survey of Web cache replacement strategies[J].ACM Computing Surveys,2003,35(4):374–398.
[60] Chejara U, Chai H K And Cho H. Performance Comparison of Different Cache-Replacement Policies for Video Distribution in CDN[J]. Lecture Notes inComputer Science,2004,3079:921-931.
[61] Wessels D and Claffy K. RFC2186(Internet Cache Protocol (ICP) version2)[S/OL]. Internet Engineering Task Force RFC2186, September1997.[2013-10-24]. http://www.ietf.org/rfc/rfc2186.txt
[62] Rousskov A and Wessels D. Cache Digests[J]. Computer Networks and ISDNSystems,1998,30(22-3):2155-2168.
[63] Karger D, Lehman E., Leighton T, et al. Consistent hashing and random trees:distributed cachine protocols for relieving hot spots on the WWW[C].Proceedings of the twenty-ninth annual ACM symposium on Theory ofcomputing, El Paso, TX, USA,1997.654–663.
[64] Karger D, Sherman A, Berkheimer A, et al. Web caching with consistenthashing[J]. Computer Networks,1999,31(11-16):1203–1213
[65] Ni J, Tsang D H K. Large Scale Cooperative Caching and Application-levelMulticast in Multimedia Content Delivery Networks[J]. IEEE Communications,2005,43(5):98-105.
[66] Ni J, Tsang D H K, Yeung I S H, et al. Hierarchical Content Routing in Large-Scale Multimedia Content Delivery Network[C]. Proceedings of IEEE ICC,Anchorage, Alaska, USA,2003.854-859.
[67] Kihong P and Heejo L. On the Effectiveness of Route-Based Packet Filteringfor Distributed DoS Attack Prevention in Power-Law Internets[C]. Proceedingsof ACM SIGCOMM, UC San Diego, CA, USA,2001,15-26.
[68] Alex C. Snoeren, Craig Partridge, Luis A, et al. Hashbased IP Traceback[C].Proceedings of ACM SIGCOMM, UC San Diego, CA, USA,2001,3-14.
[69] Stefan Savage, David Wetherall, Anna Karlin, et al. Practical Network Supportfor IP Traceback[C]. Proceedings of ACM SIGCOMM, Stockholm Sweden,2000,295-306.
[70] Song L P, Jin Z, Sun G Q. Modeling and analyzing of botnet interactions [J].Physica A: Statistical Mechanics and its Applications,2011,390(2):347-358.
[71] Schutte J, Rieke R, Winkelvos T. Model-based security event management[J].Computer Network Security,2012,7531:181-190.
[72] Yan G, Lee R, Kent A, et al. Towards a bayesian network game framework forevaluating DDoS attacks and defense[C]. Proceedings of ACM CCS, Raleigh,NC, USA,2012.553-566.
[73]臧天宁,云晓春,张永铮,门朝光,孙建亮.网络设备协同联动模型[J].计算机学报,2011,33(9):216-228.
[74]李幼平.双结构互补网络的研究[J].西南科技大学学报(自然科学版),2006,21(1):1-5.
[75] Kamiyama N, Mori T, Kawahara R, et al. ISP-Operated CDN. Procedings ofIEEE INFOCOM, Rio de Janeiro, Brazil,2009.1-6.
[76] Lu Z H, Gao X H, Huang S J, et al. Scalable and Reliable Live StreamingService through Coordinating CDN and P2P[C]. Proceedings of IEEE17thInternational Conference on Parallel and Distributed Systems, Tainan, Taiwan,2011,581-588.
[77] Mori T, Kamiyama N, Harada S, et al. Improving Deployability Of Peer-Assisted CDN Platform With Incentive[C]. Proceedings of IEEE GLOBECOM,Hawaii, USA,2009.1-7.
[78] Dominguez-Sal D, Larriba-Pey J, Surdean M. A Multi-Layer CollaborativeCache for Question Answering[C]. Proceedings of International Euro-Parconference on Parallel Processing, Rennes, Brittany, France,2007.295-306.
[79] Dominguez-Sal D, Aguilar-Saborit J, Surdeanu M, and Larriba-Pey J L. UsingEvolutive Summary Counters for Efficient Cooperative Caching in SearchEngines[J]. IEEE Trans. on Parallel and Distributed Systems,2012,23(4):776-784.
[80] Varga A. OMNeT++Discrete Event Simulation System[M/OL].[2013-10-24].http://www.omnetpp.org/.
[81] Kang S and Yin H. A Hybrid CDN-P2P System for Video-on-Demand[C].Proceedings of the2010Second International Conference on Future Networks,Sanya, Hainan, China,2010.309-313
[82] Wu T and Starobinski D. A Comparative Analysis Of Server Selection InContent Replication Networks[J]. IEEE/ACM Trans. on Networking,2008,16(6):1461-1474
[83] Zaman S, Grosu D. A Distributed Algorithm for the Replica PlacementProblem[J]. IEEE Trans. on Parallel and Distributed Systems,2011,22(9):1455-1468
[84][84] Laoutaris N, Smaragdakis G, Bestavros A, et al. Distributed SelfishCaching[J]. IEEE Trans. on Parallel and Distributed Systems,2007,18(10):1361-1376
[85][85] Abrams M, Standridge C R, et al. Caching Proxies: Limitations andPotentials[C]. Proceedings of4th WWW Conference, Boston, MA, USA,1995.119–133
[86] Niclausse N, Liu Z, Nain P. A New Efficient Caching Policy for The WorldWide Web[C]. Proceedings of the Workshop on Internet Server Performance,Madison, WI, USA,1998.119-128.
[87] Sathiyamoorthi V, Bhaskaran V M. Web Caching Through Modified CacheReplacement Algorithm[C]. Proceedings of2012International Conference onRecent Trends In Information Technology (ICRTIT), Chennai, Tamil Nadu,India,2012.483-487
[88] Ponnusamy S P and Kathikeyan E. Cache Optimization on Hot-Point Proxy(HPProxy) Using Dual Cache Replacement Policy[C]. Proceedings ofInternational Conference on Communications and Signal Processing (ICCSP),Bangalore, India,2012.108-113
[89] Cao P and Irani S. Cost-Aware WWW Proxy Caching Algorithms[C].Proceedings of the USENIX Symposium on Internet Technologies and Systems,Monterey, California, USA,1997.193-206.
[90] Jin Y, Wen Y, Shi G, et al. CODAAS: An Experimental Cloud-Centric ContentDelivery Platform For User-Generated Contents[C]. Proceedings of2012International Conference on Computing, Networking and Communications,Maui, Hawaii, USA,2012,934-938.
[91] Tan B, Massoulie L. Optimal Content Placement For Peer-To-Peer Video-On-Demand Systems[J]. IEEE/ACM Trans. on Networking,2013,21(2):566-579
[92] Wu W and Lui J C. Exploring the Optimal Replication Strategy In P2p-VodSystems: Characterization and Evaluation[C]. Proceedings of IEEE INFOCOM,ShangHai, China,2011,1206-1214.
[93]李春洪,冯国富,顾铁成,陆桑璐,陈道蓄.一种无“热点”的覆盖网协同缓存策略[J].软件学报,2008,19(3):744754
[94] Ming Z, Xu M, Wang D. Age-Based Cooperative Caching in InformationCentric Networks[C]. Proceedings of IEEE INFOCOM Workshop on EmergingDesign Choices in Name-Oriented Networking. Orlando, FL, USA,2012.268273.
[95]刘外喜,余顺争,蔡君,等. ICN中的一种协作缓存机制[J].软件学报,2013,24(8):1947-1962
[96] Arlitt M F, Cherkasova L, Dilley J, et.al. Evaluating Content ManagementTechniques for Web Proxy Caches[J]. ACM SIGMETRICS PerformanceEvaluation Review,2000,27(4):3-11
[97] Dong L J, Zhang Y, Raychaudhuri D. Enhance Content Broadcast Efficiency InRouters With Integrated Caching[C]. Proceedings of16th IEEE ISCC, Kerkyra,Corfu, Greece,2011.320322.
[98]孙践知,张迎新,陈丹,韩忠明.泛洪攻击对Epidemic机制下机会网络生命期的影响[J].通信学报,2012,33(9):185-190)
[99] Jiang H B, Ge Z H, Jin S D, and Wang J. Network Prefix-level Traffic Profiling:Characterizing, Modeling, and Evaluation[J]. Computer Networks.2010,54(18):3327-3340.
[100] Wang Z W, Xia Q, Lu K and Zhang J. An Approach on Detecting Attack Basedon Causality in Network Behavior[C]. Proceedings of the InternationalConference on Computer Science and Software Engineering. Wuhan, China,2008.947-950.
[101]李小勇,桂小林.大规模分布式环境下动态信任模型研究[J].软件学报,2007,18(6):1510-1521
[102] Pai, S, Roosta, T, Wicker S, et al. Using Social Network Theory TowardsDevelopment of Wireless Ad Hoc Network Trust[C]. Proceedings of21stInternational Conference on Advanced Information Networking andApplications Workshops, Niagara Falls, Canada.2007,443-450
[103] Vassileva J, Breban S and Horsch M. Peer Reasoning Mechanism for Long-Term Coalitions Based on Decision Making and Trust[J]. ComputationalIntelligence,2002,18(4):
[104] Wang Y, Vassileva J. Bayesian Network Trust Model in Peer-to-PeerNetworks[C]. Proceedings of Second International Workshop Peers and Peer-to-Peer Computing, Melbourne, Australia.2003,23-34
[105] Yu B and Singh P M. A Social Mechanism of Reputation Management InElectronic Communities[C]. Proceedings of4th International Workshop onCooperative Information Peers, Boston, MA, USA,2000.154–165
[106] Wang Y, Vassileva J. Trust and Reputation Model in Peer-to-Peer Networks[C].Proceedings of Peer-to-Peer Computing, Linkoping, Sweden,2003,150-157
[107] Stefano B, Francesco S. Propagating Multitrust Within Trust Networks[C]. Proceedings of the2008ACM Symposium on Applied Computing, Ceara,Brazil,2008,1990-1994
[108] Stefano B and Francesco S. SCLP for Trust Propagation in Small-WorldNetworks[J]. Recent Advances in Constraints,2008,5129:32-46.
[109] Stefano B, Fabio M and Francesco S. Formal Framework for Trust PolicyNegotiation in Autonomic Systems[J]. Abduction with Soft Constraints.Autonomic and Trusted Computing,2010,6407:268-282.
[110] Mogens N, Karl K, Vladimiro S. A Bayesian Model for Event-based Trust[J].Electronic Notes in Theoretical Computer Science,2007,172:499–521
[111] Sun Y L,Yu W, Han Z, et al. Information Theoretic Framework Of TrustModeling And Evaluation For Ad Hoc Networks[J]. IEEE Journal on SelectedAreas in Communications,2006,2(24):305–317.
[112] Buchegger S. Coping With Misbehavior In Mobile Ad-Hoc Networks[D].Thesis, France: Ecole Polytechnique Federale de Lausanne,2004.
[113] Kyle C, Simon C, Omer R, et al. Social Cloud: Cloud Computing in SocialNetworks[C]. Proceedings of IEEE3rd International Conference on CloudComputing, Miami, FL, USA.2010,99-106
[114] Mohammed A, Tharam D, Elizabeth C. SLA-Based Trust Model for CloudComputing[C]. Proceedings of13th International Conference on Network-Based Information Systems, Takayama, Japan,2010,321-324
[115] Sheikh M H, Sebastian R, Max M. Cloud Computing Landscape and ResearchChallenges regarding Trust and Reputation[C]. Proceedings of7th InternationalConference on Ubiquitous Intelligence&Computing and7th InternationalConference on Autonomic&Trusted Computing (UIC/ATC), Xi’an, China,2010,410-415
[116] Tian L Q, Lin C, Ni Y. Evaluation of User Behavior Trust in CloudComputing[C]. Proceedings of2010International Conference on ComputerApplication and System Modeling, Taiyuan, China,2010,567-572.
[117] Huang J, David M N. A Formal-Semantics-Based Calculus of Trust[J]. IEEEInternet Computing,2010,14(5):38-46
[118] Zhou R, Hwang K, Cai M. GossipTrust for Fast Reputation Aggregation in Peer-to-Peer Networks[J]. IEEE Trans. on Knowledge and Data Engineering,2008,20(9):1282-1295
[119] Li X, Zhou F, Yang X. Scalable Feedback Aggregating (SFA) Overlay for Large-Scale P2P Trust Management[J]. IEEE Transactions on Parallel and DistributedSystems,2012,23(10):1944-1957
[120] Erman A, Faramarz F. Iterative Trust and Reputation Management Using BeliefPropagation[J]. IEEE Transactions on Dependable and Secure Computing,2012,9(3):375-386
[121] Bao F, Chen I R, Chang M J, et. al. Hierarchical Trust Management for WirelessSensor Networks and its Applications to Trust-Based Routing and IntrusionDetection[J]. IEEE Trans. on Network and Service Management,2012,9(2):169-183
[122] Cai L, Roberto R C. Three-Dimensional Based Trust Management Scheme forVirus Control in P2P Networks[C]. Proceedings of IEEE ICC, Cape Town,South Africa,2010,1-5.
[123] Carol J F, Zhang J, Issam A, Raouf B. Dirichlet-Based Trust Management forEffective Collaborative Intrusion Detection Networks[J]. IEEE Trans onNetwork and Service Management,2011,8(2):79-91
[124] Abedelaziz M, Nicholas H, and Yongdae K. Keep Your Friends Close:Incorporating Trust into Social Network-Based Sybil Defenses[C]. Proceedingsof IEEE INFOCOM, Shanghai, China,2011,1943-1951
[125] Jin Y, Sharafuddin E, and Zhang Z L. Unveiling Core Network WideCommunication Patterns Through Application Traffic Activity GraphDecomposition[C]. Proceedings of ACM SIGMETRICS, Seattle, WA, USA,2009,49-60
[126] Iliofotou M, Pappu P, Faloutsos M, et al. Network monitoring using trafficdispersion graphs[C]. Proceedings of ACM SIGCOMM, San Diego, CA, USA,2007:315-320
[127] Xu K, Wang F, Gu L. Network-Aware Behavior Clustering of Internet endHosts[C]. Proceedings of IEEE INFOCOM, Shanghai, China,2011,2078-2086.
[128]李小勇,桂小林.可信网络中基于多维决策属性的信任量化模型[J].计算机学报,2009,32(3):405-416.
[129] Guillaume J L, Latapy M. Bipartite Graphs As Models Of Complex Networks[J].Physica A: Statistical and Theoretical Physics,2006,371(2):795-813.
[130] Sabrina D C, Sara F, Sushil J, et. al. Integrating Trust Management and AccessControl in Data-Intensive Web Applications[J]. ACM Trans. on the Web,2012,6(2):1-43.
[131] Xu K, Wang F. Behavioral Graph Analysis of Internet Applications[C].Proceedings of IEEE GLOBECOM, Houston, TX, USA,2011,1-5.
[2] Informa Telecom&Media. Content delivery networks: Market dynamics andgrowth perspectives.[M/OL].[2013-10-24]. http://www.informatandm.com/wp-content/uploads/2012/10/CDN-whitepaper.pdf.
[3] Karagiannis T, Rodriguez P, Papagiannaki K. Should Internet Service ProvidersFear Peer-Assisted Content Distribution[C]. Proceedings of the5th ACMSIGCOMM conference on Internet Measurement. Berkeley, USA,2005Oct.6-6.
[4] Byers J, Considine J, Mitzenmacher M and Rost S. Informed content deliveryacross adaptive overlay networks[C]. Proceedings of the2002ACMSIGCOMM conference, Pittsburgh, PA, USA,2002.47-60.
[5] Rodriguez P, Tan S M, Gkantsidis C. On The Feasibility Of Commercial, LegalP2P Content Distribution[J]. ACM SIGCOMM Computer CommunicationReview,2006,36(1):75-78.
[6] Bavier A, Feamster N, Huang M, et al. In VINI Veritas: Realistic and ControlledNetwork Experimentation[C]. Proceedings of ACM SIGCOMM. Pisa, Italy,2006.3-14.
[7] Wang L, Park K S, Pang R, et al. Reliability and Security in the CoDeeN ContentDistribution Network[C]. Proceedings of the USENIX Annual TechnicalConference. Boston, USA,2004.14-14.
[8] Alzoubi H A, Lee S, Rabinovich M, et al. Anycast CDNS revisited[C].Proceeding of the17th International Conference on WWW. Beijing, China,2008.277-286.
[9] Frank B, Poese I, Lin Y, et. al. Pushing CDN-ISP Collaboration to the Limit[J].ACM SIGCOMM Computer Communication Review,2013,43(3):35-44.
[10] Liu H H, Wang Y, Yang Y, et. al. Optimizing Cost and Performance for ContentMultihoming[C]. Proceedings of ACM SIGCOMM. Helsinki, Finland,2012.371-382.
[11] Craig L, Scott I, Danny M, et. al. Internet Inter-Domain Traffic[C]. Proceedingsof ACM SIGCOMM. New Delhi, India,2010.76-86.
[12] Otto J S, Sanchez M A, Rula J P, et. al. Content Delivery and the NaturalEvolution of DNS-Remote DNS Trends, Performance Issues and AlternativeSolutions[C]. Proceedings of the12th ACM SIGCOMM conference on Internetmeasurement conference. Boston, USA,2012.523-536.
[13] Poese I, Frank B, Ager B, et. al. Improving Content Delivery using Provider-Aided Distance Information[C]. Proceedings of the10th ACM SIGCOMMconference on Internet measurement conference. Melbourne, USA,2010.22-34.
[14] Poese I, Frank B, Georgios S, et. al. Enabling Content-aware TrafficEngineering[J]. ACM SIGCOMM Computer Communication Review,2012,42(5):21-28.
[15] Krishnan R, Madhyastha H, Srinivasan S, et. al. Moving Beyond End-to-endPath Information to Optimize CDN Performance[C]. Proceedings of the9thACM SIGCOMM conference on Internet measurement conference. Chicago,USA,2009.190-201.
[16] Jiang W, Rui Z S, Rexford J and Chiang M. Cooperative Content Distributionand Traffic Engineering in an ISP Network[J]. ACM SIGMETRICSPerformance Evaluation Review,2009,37(1):239-250.
[17] Aditya P, Zhao M, Lin Y, et. al. Reliable Client Accounting for Hybrid Content-Distribution Networks[C]. Proceedings of the9th USENIX Symposium onNetworked Systems Design and Implementation, San Jose, CA, USA,2012.34-45.
[18] Jones S T. IPTV Delivery Architecture[C]. ITU-T IPTV Global TechnicalWorkshop. Seoul, Korea,2006.1-1.
[19] Day M, Cain B, Tomlinson G, et al. RFC3466(A Model for Content Internetworking)[S/OL]. Internet Engineering Task Force, February2003.[2013-10-24].www.ietf.org/rfc/rfc3466.txt
[20] Barbir A, Penno R, Chen R, et al. RFC3835(An Architecture for OpenPluggable Edge Services (OPES))[S/OL]. Internet Engineering Task Force,August2004.[2013-10-24]. www.ietf.org/rfc/rfc3835.txt
[21] Cooper I, Melve I, Tomlinson G. RFC3040(Internet Web Replication andCaching Taxonomy)[S/OL]. Internet Engineering Task Force RFC3040,January2001.[2013-10-24]. http://www.ietf.org/rfc/rfc3040.txt
[22] Barbir A, Batuner O, Beck A, et al. RFC3838(Policy, Authorization, andEnforcement Requirements of the Open Pluggable Edge Services(OPES))[S/OL]. Internet Engineering Task Force RFC3838, August2004.
[2013-10-24]. www.ietf.org/rfc/rfc3838.txt
[23] Yin H, Lin C, Zhang Q, et al. TrustStream: A Secure and Scalable Architecturefor Large-scale Internet Media Streaming[J]. IEEE Transaction on Circuits andSystems for Video Technology,2008,18(12):1692-1702.
[24] Yin H, Lin C, Qiu F, et al. CASM: A Content-Aware Protocol for Secure VideoMulticast[J]. IEEE Transaction on Multimedia, April2006,8(2):270-277.
[25]尹浩,詹同宇,林闯.多媒体网络：从内容分发网络到未来互联网[J].计算机学报.2012,35(6):1120-1131.
[26]中国国务院.“宽带中国”战略及实施方案[EB/OL].[2013-10-24].http://www.gov.cn/zwgk/2013-08/17/content_2468348.htm.
[27] Gadde S, Rabinovich M, Chase J. Reduce, reuse, recycle: an approach tobuilding large Internet caches[C]. Proceedings of6th Workshop on Hot Topicsin Operating Systems. Cape Cod, Massachusetts, USA.1997.93–98.
[28] Gao L, Dahlin M, Nayate A, et al. Improving availability and performance withapplication-specific data replication[J]. IEEE Transactions on Knowledge andData Engineering,2005,17(1):106-120.
[29] Davison B D. Web caching and content delivery resources[EB/OL].[2013-10-24]. http://www.Web-caching.com
[30] Day M, Cisco, Cain B, et al. RFC3466(A Model for Content Internetworking(CDI))[S/OL]. Internet Engineering Task Force RFC,2003.[2013-10-24].http://tools.ietf.org/html/rfc3466
[31] Jung Y, Krishnamurthy B, and Rabinovich M. Flash Crowds and Denial ofService Attacks: Characterization and Implications for CDNs and Web Sites[C].Proceedings of the11th International World Wide Web Conference. Hawaii,USA,2002.293–304.
[32] Lampe C, Resnick P. Slash(dot) and Burn: Distributed Moderation in a LargeOnline Conversation Space[C]. Proceedings of the SIGCHI Conference onHuman Factors in Computing Systems. Vienna, Austria,2004.543-550.
[33] Krishnamurthy B, Wills C and Zhang Y. On the Use and Performance of ContentDistribution Networks[C]. Proceedings of the1st ACM SIGCOMM Workshopon Internet Measurement. San Francisco, USA,2001.169–182.
[34] Lazar I and Terill W. Exploring Content Delivery Network[J]. IEEE ITProfessional,2001,3(4):47-49.
[35] AT&T. Effectively Manage Content Distribution with a CDN [EB/OL].[2013-10-24]. http://www.business.att.com/enterprise/Service/hosting-services/content-delivery/distribution/.
[36] ICT. Evolution of the CDN market [EB/OL].[2013-10-24]. http://www. ict-ocean.eu/public-folders/dissemination-1/cdnworldsummit-2010-cdnmarketevolution.
[37]中国工信部电信研究院. CDN发展现状与趋势[R].2009.
[38] Vakali A and Pallis G. Content Delivery Networks: Status and Trends[J]. IEEEInternet Computing,2003,7(6):68-74.
[39] Plagemann T, Goebela V, Mauthe A, et al. From Content distribution networksto content networks: issues and challenges[J]. Computer Communications,2006,29(5):551–562.
[40] Yin H, Liu X N, Min G Y, et al. Content Delivery Networks: A Bridge betweenEmerging Applications and Future IP Networks[J]. IEEE Network,2010,24(4):52-56.
[41] Pathan A M K and Buyya R. A Taxonomy and Survey of Content DeliveryNetworks[R]. Technical Report, GRIDS-TR-2007-4, The University ofMelbourne, Australia, Feb2007.
[42] Saroiu S, Gummadi K P, Dunn R J, et al. An Analysis of Internet ContentDelivery Systems[J]. ACM SIGOPS Operating Systems Review,2002,36(SI):315-328.
[43] Garey M R, and Johnson D S. Computers and Intractability: A Guide to theTheory of NP-Completeness[M]. W. H. Freeman and Co., New York, USA,1979.
[44] Li B, Golin M J, Italiano G F, et al. On The Optimal Placement Of Web Proxiesin The Internet [C]. Proceedings of IEEE INFOCOM. New York, USA,1999.1282–1290.
[45] Qiu L L, Padmanabhan V N, Voelker G M. On the Placement of Web ServerReplicas[C]. Proceeding of IEEE INFOCOM. Anchorage, USA,2001.1587-1596.
[46] Chen Y, Katz R.H, and Kubiatowicz J D. Dynamic Replica Placement forScalable Content Delivery[C]. Proceedings of International Workshop on Peer-to-Peer Systems. Cambridge, MA, USA,2002.306–318.
[47] Ni J, Tsang D H K. Large-Scale Cooperative Caching And Application-LevelMulticast in Multimedia Content Delivery Networks[J]. IEEE CommunicationsMagazine,2005,43(5):98-105.
[48] Jiang H, Wang Z, Wong A K, et al. A Replica Placement Algorithm for HybridCDN-P2P Architecture[C]. Proceedings of15th International Conference onParallel and Distributed Systems (ICPADS). Shenzhen, China,2009.758-763.
[49] Pai V S, Aron M, Banga G, et al. Locality-Aware Request Distribution inCluster-Based Network Servers[J]. ACM SIGOPS Operating Systems Review,1998,32(5):205-216.
[50] Sivasubramanian S, Szymaniak M, Pierre G, et al. Replication of Web HostingSystems[J]. ACM Computing Surveys,2004,36(3):291-334.
[51] Pierre G and Vansteen M. Globule: A Collaborative Content DeliveryNetwork[J]. IEEE Communications,2006,44(8):127-133.
[52] Andrews M, Shepherd B, Srinivasan A, et al. Clustering and Server SelectionUsing Passive Monitoring[C]. Proceedings of IEEE INFOCOM. New York,USA,2002.1717-1725.
[53] Ardaiz O, Freitag F, and Navarro L. Improving the Service Time of Web ClientsUsing Server Redirection[J]. ACM SIGMETRICS Performance EvaluationReview,2001,29(2):39-44.
[54] Jung H, Lee M, Ko D, et. al. How can an ISP merge with a CDN [J]. IEEECommunications Magazine,49(10):156-162,2011.
[55] Varun K, Zhang B C. Making CDN and ISP Routings Symbiotic[C].Proceedings of ICDCS2011. Minneapolis, Minnesota, USA,2011.869-878.
[56] Jin S and Bestavros A. Greedy Dual*Web caching algorithm: exploiting thetwo sources of temporal locality in Web request streams[J]. ComputerCommunications,2001,24(2):174-183.
[57] Cherkasova L and Ciardo G. Role of Aging, Frequency And Size In WebCaching Replacement Strategies. Proceedings of the9th InternationalConference on High-Performance Computing and Networking[C], Amsterdam,The Netherlands,2001.114-123.
[58] Patil J B, Pawar B V. Trace driven simulation of GDSF#and existing cachingalgorithms for web proxy servers[A]. Proceedings of the9th WSEASInternational Conference on Data Networks, Communications, Computers[C],Faro, Portugal,2009.378-384
[59] Podlipnig S, B sz rmenyi L. A survey of Web cache replacement strategies[J].ACM Computing Surveys,2003,35(4):374–398.
[60] Chejara U, Chai H K And Cho H. Performance Comparison of Different Cache-Replacement Policies for Video Distribution in CDN[J]. Lecture Notes inComputer Science,2004,3079:921-931.
[61] Wessels D and Claffy K. RFC2186(Internet Cache Protocol (ICP) version2)[S/OL]. Internet Engineering Task Force RFC2186, September1997.[2013-10-24]. http://www.ietf.org/rfc/rfc2186.txt
[62] Rousskov A and Wessels D. Cache Digests[J]. Computer Networks and ISDNSystems,1998,30(22-3):2155-2168.
[63] Karger D, Lehman E., Leighton T, et al. Consistent hashing and random trees:distributed cachine protocols for relieving hot spots on the WWW[C].Proceedings of the twenty-ninth annual ACM symposium on Theory ofcomputing, El Paso, TX, USA,1997.654–663.
[64] Karger D, Sherman A, Berkheimer A, et al. Web caching with consistenthashing[J]. Computer Networks,1999,31(11-16):1203–1213
[65] Ni J, Tsang D H K. Large Scale Cooperative Caching and Application-levelMulticast in Multimedia Content Delivery Networks[J]. IEEE Communications,2005,43(5):98-105.
[66] Ni J, Tsang D H K, Yeung I S H, et al. Hierarchical Content Routing in Large-Scale Multimedia Content Delivery Network[C]. Proceedings of IEEE ICC,Anchorage, Alaska, USA,2003.854-859.
[67] Kihong P and Heejo L. On the Effectiveness of Route-Based Packet Filteringfor Distributed DoS Attack Prevention in Power-Law Internets[C]. Proceedingsof ACM SIGCOMM, UC San Diego, CA, USA,2001,15-26.
[68] Alex C. Snoeren, Craig Partridge, Luis A, et al. Hashbased IP Traceback[C].Proceedings of ACM SIGCOMM, UC San Diego, CA, USA,2001,3-14.
[69] Stefan Savage, David Wetherall, Anna Karlin, et al. Practical Network Supportfor IP Traceback[C]. Proceedings of ACM SIGCOMM, Stockholm Sweden,2000,295-306.
[70] Song L P, Jin Z, Sun G Q. Modeling and analyzing of botnet interactions [J].Physica A: Statistical Mechanics and its Applications,2011,390(2):347-358.
[71] Schutte J, Rieke R, Winkelvos T. Model-based security event management[J].Computer Network Security,2012,7531:181-190.
[72] Yan G, Lee R, Kent A, et al. Towards a bayesian network game framework forevaluating DDoS attacks and defense[C]. Proceedings of ACM CCS, Raleigh,NC, USA,2012.553-566.
[73]臧天宁,云晓春,张永铮,门朝光,孙建亮.网络设备协同联动模型[J].计算机学报,2011,33(9):216-228.
[74]李幼平.双结构互补网络的研究[J].西南科技大学学报(自然科学版),2006,21(1):1-5.
[75] Kamiyama N, Mori T, Kawahara R, et al. ISP-Operated CDN. Procedings ofIEEE INFOCOM, Rio de Janeiro, Brazil,2009.1-6.
[76] Lu Z H, Gao X H, Huang S J, et al. Scalable and Reliable Live StreamingService through Coordinating CDN and P2P[C]. Proceedings of IEEE17thInternational Conference on Parallel and Distributed Systems, Tainan, Taiwan,2011,581-588.
[77] Mori T, Kamiyama N, Harada S, et al. Improving Deployability Of Peer-Assisted CDN Platform With Incentive[C]. Proceedings of IEEE GLOBECOM,Hawaii, USA,2009.1-7.
[78] Dominguez-Sal D, Larriba-Pey J, Surdean M. A Multi-Layer CollaborativeCache for Question Answering[C]. Proceedings of International Euro-Parconference on Parallel Processing, Rennes, Brittany, France,2007.295-306.
[79] Dominguez-Sal D, Aguilar-Saborit J, Surdeanu M, and Larriba-Pey J L. UsingEvolutive Summary Counters for Efficient Cooperative Caching in SearchEngines[J]. IEEE Trans. on Parallel and Distributed Systems,2012,23(4):776-784.
[80] Varga A. OMNeT++Discrete Event Simulation System[M/OL].[2013-10-24].http://www.omnetpp.org/.
[81] Kang S and Yin H. A Hybrid CDN-P2P System for Video-on-Demand[C].Proceedings of the2010Second International Conference on Future Networks,Sanya, Hainan, China,2010.309-313
[82] Wu T and Starobinski D. A Comparative Analysis Of Server Selection InContent Replication Networks[J]. IEEE/ACM Trans. on Networking,2008,16(6):1461-1474
[83] Zaman S, Grosu D. A Distributed Algorithm for the Replica PlacementProblem[J]. IEEE Trans. on Parallel and Distributed Systems,2011,22(9):1455-1468
[84][84] Laoutaris N, Smaragdakis G, Bestavros A, et al. Distributed SelfishCaching[J]. IEEE Trans. on Parallel and Distributed Systems,2007,18(10):1361-1376
[85][85] Abrams M, Standridge C R, et al. Caching Proxies: Limitations andPotentials[C]. Proceedings of4th WWW Conference, Boston, MA, USA,1995.119–133
[86] Niclausse N, Liu Z, Nain P. A New Efficient Caching Policy for The WorldWide Web[C]. Proceedings of the Workshop on Internet Server Performance,Madison, WI, USA,1998.119-128.
[87] Sathiyamoorthi V, Bhaskaran V M. Web Caching Through Modified CacheReplacement Algorithm[C]. Proceedings of2012International Conference onRecent Trends In Information Technology (ICRTIT), Chennai, Tamil Nadu,India,2012.483-487
[88] Ponnusamy S P and Kathikeyan E. Cache Optimization on Hot-Point Proxy(HPProxy) Using Dual Cache Replacement Policy[C]. Proceedings ofInternational Conference on Communications and Signal Processing (ICCSP),Bangalore, India,2012.108-113
[89] Cao P and Irani S. Cost-Aware WWW Proxy Caching Algorithms[C].Proceedings of the USENIX Symposium on Internet Technologies and Systems,Monterey, California, USA,1997.193-206.
[90] Jin Y, Wen Y, Shi G, et al. CODAAS: An Experimental Cloud-Centric ContentDelivery Platform For User-Generated Contents[C]. Proceedings of2012International Conference on Computing, Networking and Communications,Maui, Hawaii, USA,2012,934-938.
[91] Tan B, Massoulie L. Optimal Content Placement For Peer-To-Peer Video-On-Demand Systems[J]. IEEE/ACM Trans. on Networking,2013,21(2):566-579
[92] Wu W and Lui J C. Exploring the Optimal Replication Strategy In P2p-VodSystems: Characterization and Evaluation[C]. Proceedings of IEEE INFOCOM,ShangHai, China,2011,1206-1214.
[93]李春洪,冯国富,顾铁成,陆桑璐,陈道蓄.一种无“热点”的覆盖网协同缓存策略[J].软件学报,2008,19(3):744754
[94] Ming Z, Xu M, Wang D. Age-Based Cooperative Caching in InformationCentric Networks[C]. Proceedings of IEEE INFOCOM Workshop on EmergingDesign Choices in Name-Oriented Networking. Orlando, FL, USA,2012.268273.
[95]刘外喜,余顺争,蔡君,等. ICN中的一种协作缓存机制[J].软件学报,2013,24(8):1947-1962
[96] Arlitt M F, Cherkasova L, Dilley J, et.al. Evaluating Content ManagementTechniques for Web Proxy Caches[J]. ACM SIGMETRICS PerformanceEvaluation Review,2000,27(4):3-11
[97] Dong L J, Zhang Y, Raychaudhuri D. Enhance Content Broadcast Efficiency InRouters With Integrated Caching[C]. Proceedings of16th IEEE ISCC, Kerkyra,Corfu, Greece,2011.320322.
[98]孙践知,张迎新,陈丹,韩忠明.泛洪攻击对Epidemic机制下机会网络生命期的影响[J].通信学报,2012,33(9):185-190)
[99] Jiang H B, Ge Z H, Jin S D, and Wang J. Network Prefix-level Traffic Profiling:Characterizing, Modeling, and Evaluation[J]. Computer Networks.2010,54(18):3327-3340.
[100] Wang Z W, Xia Q, Lu K and Zhang J. An Approach on Detecting Attack Basedon Causality in Network Behavior[C]. Proceedings of the InternationalConference on Computer Science and Software Engineering. Wuhan, China,2008.947-950.
[101]李小勇,桂小林.大规模分布式环境下动态信任模型研究[J].软件学报,2007,18(6):1510-1521
[102] Pai, S, Roosta, T, Wicker S, et al. Using Social Network Theory TowardsDevelopment of Wireless Ad Hoc Network Trust[C]. Proceedings of21stInternational Conference on Advanced Information Networking andApplications Workshops, Niagara Falls, Canada.2007,443-450
[103] Vassileva J, Breban S and Horsch M. Peer Reasoning Mechanism for Long-Term Coalitions Based on Decision Making and Trust[J]. ComputationalIntelligence,2002,18(4):
[104] Wang Y, Vassileva J. Bayesian Network Trust Model in Peer-to-PeerNetworks[C]. Proceedings of Second International Workshop Peers and Peer-to-Peer Computing, Melbourne, Australia.2003,23-34
[105] Yu B and Singh P M. A Social Mechanism of Reputation Management InElectronic Communities[C]. Proceedings of4th International Workshop onCooperative Information Peers, Boston, MA, USA,2000.154–165
[106] Wang Y, Vassileva J. Trust and Reputation Model in Peer-to-Peer Networks[C].Proceedings of Peer-to-Peer Computing, Linkoping, Sweden,2003,150-157
[107] Stefano B, Francesco S. Propagating Multitrust Within Trust Networks[C]. Proceedings of the2008ACM Symposium on Applied Computing, Ceara,Brazil,2008,1990-1994
[108] Stefano B and Francesco S. SCLP for Trust Propagation in Small-WorldNetworks[J]. Recent Advances in Constraints,2008,5129:32-46.
[109] Stefano B, Fabio M and Francesco S. Formal Framework for Trust PolicyNegotiation in Autonomic Systems[J]. Abduction with Soft Constraints.Autonomic and Trusted Computing,2010,6407:268-282.
[110] Mogens N, Karl K, Vladimiro S. A Bayesian Model for Event-based Trust[J].Electronic Notes in Theoretical Computer Science,2007,172:499–521
[111] Sun Y L,Yu W, Han Z, et al. Information Theoretic Framework Of TrustModeling And Evaluation For Ad Hoc Networks[J]. IEEE Journal on SelectedAreas in Communications,2006,2(24):305–317.
[112] Buchegger S. Coping With Misbehavior In Mobile Ad-Hoc Networks[D].Thesis, France: Ecole Polytechnique Federale de Lausanne,2004.
[113] Kyle C, Simon C, Omer R, et al. Social Cloud: Cloud Computing in SocialNetworks[C]. Proceedings of IEEE3rd International Conference on CloudComputing, Miami, FL, USA.2010,99-106
[114] Mohammed A, Tharam D, Elizabeth C. SLA-Based Trust Model for CloudComputing[C]. Proceedings of13th International Conference on Network-Based Information Systems, Takayama, Japan,2010,321-324
[115] Sheikh M H, Sebastian R, Max M. Cloud Computing Landscape and ResearchChallenges regarding Trust and Reputation[C]. Proceedings of7th InternationalConference on Ubiquitous Intelligence&Computing and7th InternationalConference on Autonomic&Trusted Computing (UIC/ATC), Xi’an, China,2010,410-415
[116] Tian L Q, Lin C, Ni Y. Evaluation of User Behavior Trust in CloudComputing[C]. Proceedings of2010International Conference on ComputerApplication and System Modeling, Taiyuan, China,2010,567-572.
[117] Huang J, David M N. A Formal-Semantics-Based Calculus of Trust[J]. IEEEInternet Computing,2010,14(5):38-46
[118] Zhou R, Hwang K, Cai M. GossipTrust for Fast Reputation Aggregation in Peer-to-Peer Networks[J]. IEEE Trans. on Knowledge and Data Engineering,2008,20(9):1282-1295
[119] Li X, Zhou F, Yang X. Scalable Feedback Aggregating (SFA) Overlay for Large-Scale P2P Trust Management[J]. IEEE Transactions on Parallel and DistributedSystems,2012,23(10):1944-1957
[120] Erman A, Faramarz F. Iterative Trust and Reputation Management Using BeliefPropagation[J]. IEEE Transactions on Dependable and Secure Computing,2012,9(3):375-386
[121] Bao F, Chen I R, Chang M J, et. al. Hierarchical Trust Management for WirelessSensor Networks and its Applications to Trust-Based Routing and IntrusionDetection[J]. IEEE Trans. on Network and Service Management,2012,9(2):169-183
[122] Cai L, Roberto R C. Three-Dimensional Based Trust Management Scheme forVirus Control in P2P Networks[C]. Proceedings of IEEE ICC, Cape Town,South Africa,2010,1-5.
[123] Carol J F, Zhang J, Issam A, Raouf B. Dirichlet-Based Trust Management forEffective Collaborative Intrusion Detection Networks[J]. IEEE Trans onNetwork and Service Management,2011,8(2):79-91
[124] Abedelaziz M, Nicholas H, and Yongdae K. Keep Your Friends Close:Incorporating Trust into Social Network-Based Sybil Defenses[C]. Proceedingsof IEEE INFOCOM, Shanghai, China,2011,1943-1951
[125] Jin Y, Sharafuddin E, and Zhang Z L. Unveiling Core Network WideCommunication Patterns Through Application Traffic Activity GraphDecomposition[C]. Proceedings of ACM SIGMETRICS, Seattle, WA, USA,2009,49-60
[126] Iliofotou M, Pappu P, Faloutsos M, et al. Network monitoring using trafficdispersion graphs[C]. Proceedings of ACM SIGCOMM, San Diego, CA, USA,2007:315-320
[127] Xu K, Wang F, Gu L. Network-Aware Behavior Clustering of Internet endHosts[C]. Proceedings of IEEE INFOCOM, Shanghai, China,2011,2078-2086.
[128]李小勇,桂小林.可信网络中基于多维决策属性的信任量化模型[J].计算机学报,2009,32(3):405-416.
[129] Guillaume J L, Latapy M. Bipartite Graphs As Models Of Complex Networks[J].Physica A: Statistical and Theoretical Physics,2006,371(2):795-813.
[130] Sabrina D C, Sara F, Sushil J, et. al. Integrating Trust Management and AccessControl in Data-Intensive Web Applications[J]. ACM Trans. on the Web,2012,6(2):1-43.
[131] Xu K, Wang F. Behavioral Graph Analysis of Internet Applications[C].Proceedings of IEEE GLOBECOM, Houston, TX, USA,2011,1-5.