CCN基于内容的缓存策略

内容中心网络（Content Centric Networking,CCN）以内容为中心进行数据通讯,改变了当前互联网host-host通讯模型,并且具有网内缓存功能。为了解决网内数据协同缓存的难题,借鉴通讯模式的改革,建议以内容为中心缓存数据,提出以内容和缓存为中心的网络（Content＆Caching Centric Networking,CCCN）概念。经过大量理论分析和仿真实验,结果表明,在数据缓存和内容转发上CCCN是非常高效和可行的。     

命名数据网络中可追溯且轻量级的细粒度访问控制机制

由于命名数据网络(NDN)具有网内缓存特点,任意用户可直接从中间路由节点获取数据,同时,内容提供商也无法得知用户的访问信息。针对这些问题,该文结合基于身份的组合公钥和Schnorr签名方法,提出了“三次握手”匿名安全认证协议,同时,采用改进的秘密共享方法来高效分发内容密钥,实现了一种可追溯且轻量级的细粒度访问控制机制(TLAC),最后,通过实验验证了TLAC机制的高效性。     

CCN中基于业务类型的多样化内容分发机制

针对内容中心网络(Content Centric Networking,CCN)如何提供差异化的业务需求服务的问题,采用区分服务的思想,从内容传输和缓存决策的角度出发,提出了一种基于业务类型的多样化内容分发机制.该机制依据不同的业务请求特征,分别设计了持久推送、并行预测和逐包请求的数据分发模式,对应提出了透明转发、边缘概率缓存和渐进式推进的沿途存储策略,实现了内容传递对于业务类型的感知和匹配.仿真结果表明,该机制减小了内容请求时延,提高了缓存命中率,以少量额外的控制开销提升了CCN网络整体的内容分发性能.     

Application‐Level Traffic Monitoring and an Analysis on IP Networks

Traditional traffic identification methods based on well‐known port numbers are not appropriate for the identification of new types of Internet applications. This paper proposes a new method to identify current Internet traffic, which is a preliminary but essential step toward traffic characterization. We categorized most current network‐based applications into several classes according to their traffic patterns. Then, using this categorization, we developed a flow grouping method that determines the application name of traffic flows. We have incorporated our method into NG‐MON, a traffic analysis system, to analyze Internet traffic between our enterprise network and the Internet, and characterized all the traffic according to their application types.     

命名数据网络中基于内容请求相关性的协作缓存算法

针对命名数据网络(Named Data Networking, NDN)存储空间的有效利用和应答内容的高效缓存问题,该文采用差异化缓存的方式,提出一种依据内容请求序列相关性的协作缓存算法。在内容请求中,预先发送对于后续相关数据单元的并行预测请求,增大内容请求的就近响应概率;缓存决策时,提出联合空间存储位置与缓存驻留时间的2维差异化缓存策略。根据内容活跃度的变化趋势,空间维度上逐跳推进内容存储位置,时间维度上动态调整内容缓存时间,以渐进式的方式将真正流行的请求内容推送至网络边缘存储。该算法减小了内容请求时延和缓存冗余,提高了缓存命中率,仿真结果验证了其有效性。     

基于概率的启发式ICN缓存内容放置方法

提出一种基于概率存储的启发式住处中心网络内容缓存方法（PCP）。主要思想是请求消息和数据消息在传输过程中统计必要信息,当数据消息返回时,沿途各缓存节点按照一定概率决策是否在本地缓存该内容。设计缓存概率时综合考虑内容热度和缓存放置收益,即内容热度越高,放置收益越大的内容被缓存的概率越高。实验结果表明,PCP在缓存服务率、缓存命中率、平均访问延迟率等方面,与现有方法相比具有显著优势,同时PCP开销较小。     

宽带云内容聚合系统建设和应用

应对三网融合,增强市场竞争力,更好地支撑和拓展广电宽带业务的发展,从互联网的应用发展变化入手,研究部署新一代互联网内容聚合平台,通过海量内容聚合应用,实现互联网全业务代理;同时通过智能引导、用户空间等应用进一步锁定用户流量,并为三屏互动提供技术支持。系统投入使用显著提升了宽带服务质量,降低了运营成本,适应和支撑了三网融合的发展需求。     

“疏堵结合”——P2P内容缓存方案

目前P2P技术已经使互联网发生了质的改变。如何合理的利用和管理P2P技术,已经摆了网路运营商面前。本文详细描述了基于"疏堵结合"思想的P2P内容缓存方案。该方案利用智能缓存技术,使P2P流量本地化,解决P2P应用的管理问题。     

基于内容价值的缓存替换策略

缓存替换机制是内容中心网络的重要研究问题之一,考虑到缓存空间的有限性,合理地对缓存内容进行置换,成为影响网络整体性能的关键因素。因此,设计了一种基于内容价值的缓存替换方案。该方案综合考虑了内容的动态流行度、缓存代价以及最近被请求的时间,构建了更实际的内容价值函数,并依据该内容价值函数,设计了有效的内容存储与置换方案。具体地,当缓存空间不足时,对已有缓存内容按照价值从小到大进行置换。仿真结果表明,相比于传统替换算法 LRU、LFU 和 FIFO,本文提出的方案有效地提升了网络节点的内容缓存命中率,降低了用户获取内容的平均跳数。     

基于深度报文检测和深度流检测的骨干网流量特征分析

Based on the massive data collected with a passive network monitoring equipment placed in China's backbone, we present a deep insight into the network backbone traffic and evaluate various ways for improving traffic classifying efficiency in this paper. In particular, the study has scrutinized the network traffic in terms of protocol types and signatures, flow length, and port distribution, from which meaningful and interesting insights on the current Internet of China from the perspective of both the packet and flow levels are derived. We show that the classification efficiency can be greatly improved by using the information of preferred ports of the network applications. Quantitatively, we find two traffic duration thresholds, with which 40% of TCP flows and 70% of UDP flows can be excluded from classification processing while the impact on classification accuracy is trivial, i.e., the classification accuracy can still reach a high level by saving 85% of the resources.     

异步光分组交换网的流量建模

研究了异步光分组交换网的流量特性，提出了网络流量的解析模型和近似模型。研究表明，在采用计时门限光分组组装算法的情况下，如输入IP流具有短程相关特性(ShortRangeDependent)，则光分组的到达间隔时间呈负指数分布，光分组的长度趋于高斯分布。     

Bringing the Web to the Network Edge: Large Caches and Satellite Distribution

In this paper we discuss the performance of a document distribution model that interconnects Web caches through a satellite channel. During recent years Web caching has emerged as an important way to reduce client-perceived latency and network resource requirements in the Internet. Also a satellite distribution is being rapidly deployed to offer Internet services while avoiding highly congested terrestrial links. When Web caches are interconnected through a satellite distribution, caches end up containing all documents requested by a huge community of clients. Having a large community of clients connected to a cache, the probability that a client is the first one to request a document is very small, and the number of requests that are hit in the cache increases. In this paper we develop analytical models to study the performance of a cache-satellite distribution. We derive simple expressions for the hit rate of the caches, the bandwidth in the satellite channel, the latency experienced by the clients, and the required capacity of the caches. Additionally, we use trace driven simulations to validate our model and evaluate the performance of a real cache-satellite distribution.     

Efficient complementary caching for ISP-aware networks

Internet service providers(ISPs) have taken some measures to reduce intolerable inter-ISP peer-to-peer(P2P) traffic costs,therefore user experiences of various P2P applications have been affected.The recently emerging offline downloading service seeks to improve user experience by using dedicate servers to cache requested files and provide high-speed uploading.However,with rapid increase in user population,the server-side bandwidth resource of offline downloading system is expected to be insufficient in the near future.We propose a novel complementary caching scheme with the goal of mitigating inter-ISP traffic,alleviating the load on servers of Internet applications and enhancing user experience.Both architecture and caching algorithm are presented in this paper.On the one hand,with full knowledge of P2P file sharing system and offline downloading service,the infrastructure of complementary caching is designed to conveniently be deployed and work together with existing platforms.The co-operational mechanisms among different major components are also included.On the other hand,with in-depth understanding of traffic characteristics that are relevant to caching,we develop complementary caching algorithm with respect to the density of requests,the redundancy of file and file size.Since such relevant information can be real-time captured in our design,the proposed policy can be implemented to guide the storage and replacement of caching unities.Based on real-world traces over 3 months,we demonstrate that the complementary caching scheme is capable to achieve the ’three-win’ objective.That is,for P2P downloading,over 50% of traffic is redirected to cache;for offline downloading,the average server-dependence of tasks drops from 0.71 to 0.32;for user experience,the average P2P transfer rate is increased by more than 50 KB/s.     

光码标签交换网络边缘节点FEC的研究

构建了光码标签交换网边缘节点的结构,结合光码分复用技术提出了转发等价类(FEC)分组结构的设计方案。分组结构适合变长数据分组的传输,在核心节点能够实现对标签信息的可并行处理,提高了处理效率。在此基础上,针对开销比对网络传输性能的影响,对FEC结构中的各参量与开销比的关系进行了仿真研究;采用了固定时隙算法对数据分组进行封装,对到达率和封装时延与分组丢失率的关系进行仿真分析。