一种基于层次路由推送的CCN移动性支持方案

随着互联网的快速发展,用户对内容信息的需求日趋明显,当前网络架构的设计已经不能满足时下服务的要求,因此,以信息为中心的未来网络的研究得以迅速发展.内容中心网络（CCN）是未来网络的研究热点之一,然而现阶段CCN的设计未深入考虑用户移动性问题.本文针对CCN网络中的移动性管理问题,提出一种基于层次路由推送的解决方案.仿真结果表明,本文所提出的方法能有效降低用户获取内容的时间及网络中消息重传数目.     

Energy‐delay‐aware caching strategy in green CCN using markov approximation

One of the basic challenges in content‐centric networking (CCN) is how to optimize the overall energy consumption of content transmission and caching. Furthermore, designing an appropriate caching policy that considers both energy consumption and quality of service (QoS) is a major goal in green CCN. In this paper, the problem of minimizing the total CCN energy consumption while being aware of the end‐to‐end delay is formulated as an integer linear programming model. Since it is an Non‐deterministic Polynomial‐time (NP)‐hard problem, the Markov approximation method for an energy‐delay aware caching strategy (MAEDC) is proposed through a log‐sum‐exp function to find a near‐optimal solution in a distributed manner. The numerical results show that the MAEDC achieves near‐optimal energy consumption with better delay profile compared with the optimal solution. Moreover, due to the possibility of distributed and parallel processing, the proposed method is proper for the online situation where the delay is a crucial issue.     

Fast convergence caching replacement algorithm based on dynamic classification for content-centric networks

One of the key research fields of content-centric networking （CCN） is to develop more efficient cache replacement policies to improve the hit ratio of CCN in-network caching. However, most of existing cache strategies designed mainly based on the time or frequency of content access, can not properly deal with the problem of the dynamicity of content popularity in the network. In this paper, we propose a fast convergence caching replacement algorithm based on dynamic classification method for CCN, named as FCDC. It develops a dynamic classification method to reduce the time complexity of cache inquiry, which achieves a higher caching hit rate in comparison to random classification method under dynamic change of content popularity. Meanwhile, in order to relieve the influence brought about by dynamic content popularity, it designs a weighting function to speed up cache hit rate convergence in the CCN router. Experimental results show that the proposed scheme outperforms the replacement policies related to least recently used （LRU） and recent usage frequency （RUF） in cache hit rate and resiliency when content popularity in the network varies.     

内容中心网络中面向隐私保护的协作缓存策略

针对内容中心网络节点普遍缓存带来的隐私泄露问题,在兼顾内容分发性能的基础上,该文提出一种面向隐私保护的协作缓存策略。该策略从信息熵的角度提出隐私度量指标,以增大攻击者的不确定度为目标,首先对于缓存策略的合理性给予证明;其次,通过构建空间匿名区域,扩大用户匿名集合,增大缓存内容的归属不确定性。缓存决策时,针对垂直请求路径和水平匿名区域,分别提出沿途热点缓存和局域hash协同的存储策略,减小缓存冗余和隐私信息泄露。仿真结果表明,该策略可减小内容请求时延,提高缓存命中率,在提升内容分发效率的同时增强了用户隐私保护水平。     

CCN基于内容的缓存策略

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

一般网络拓扑结构的CCN数据传输近似模型(英文)

Recently,Content-Centric Networking(CCN) has been paid more and more attention.The modeling of CCN as an important research point is the foundation of the architecture.The past work of cache network modeling always assumes the virtual round trip time(VRTT) is zero for simplicity.However,this assumption isn't practical and results in model error especially in CCN.CCN's router can aggregate the content requests during the VRTT to avoid content delivery repeatedly.Thus,to modeling CCN data transfer,as well as understanding how it should be managed,the VRTT shouldn't be ignored.In this paper,we model the data transfer in CCN,and propose a multi-cache with aggregation approximation(MCAA)algorithm to get the content miss rate and VRTT at each router.Simulation results show the validity of our MCAA algorithm.     

Reverse-trace routing scheme in content centric networking

Content center networking （CCN） is one of the most promising future network architectures. Current researches on CCN routing scheme mainly focus on finding the best single routing path, which may induce to low usage of the in-network caches. In order to overcome this problem, a reverse trace routing （RTR） scheme is proposed in this paper, in which Interest packet is sent to the edge-cache along with the reverse trace of the corresponding former Data packet. By doing this, the Interest packets will have better chances to be routed to the promising in-network caches before reaching the source server, which could increase the in-network hit rate, while decrease the server stress. The simulation results show clearly that the RTR scheme decreases the source server load, while reducing the mean hops of entire data retrieval process under certain circumstances.     

内容中心网络中一种基于内容等级及流行度的缓存策略

网内缓存作为内容中心网络(CCN)的核心技术,越来越受到关注。为了提高网络的缓存性能以及用户对数据请求的满意度,该文提出一种基于内容等级及流行度的缓存策略(CLPC)。CLPC策略通过设置不同用户对内容的访问等级以及统计内容的访问频率,决定数据的缓存位置,并且设计了数据替换方法,在一定程度上保证了不同用户对不同数据的最优请求,同时提高了网络的性能。实验证明该策略与CEE+LRU, Prob(0.7)+LRU, Betw+LRU相比,能更好地提高缓存命中率、平均时延及源端命中率等网络缓存性能指标。     

基于节点介数和替换率的内容中心网络网内缓存策略

网内缓存技术是内容中心网络(CCN)的关键技术之一,CCN采用传统的ALWAYS缓存策略,会造成较大冗余。改进的Betw方案仅考虑了节点介数,容易造成高介数节点缓存更替频繁,内容可用性下降。为了解决这个问题,该文提出一种综合使用网络节点介数和节点缓存内容更替速率作为缓存决策度量的新型网内缓存策略BetwRep,通过权衡节点位置重要性和缓存内容时效性实现回传内容的最佳放置。最后,基于ndnSIM平台进行的网络仿真表明,该文提出的BetwRep缓存策略取得了比Betw方案和ALWAYS方案更低的源端请求负载和更少的平均跳数。     

Reaction mechanism of the CCN radical with nitric oxide

To investigate the possibility of the carbyne radical CCN in removal of nitric oxide, a detailed computational study is performed at the Gaussian-3//B3LYP/6-31G(d) level on the CCN + NO reaction by constructing the singlet and triplet electronic state [C(2)N(2)O] potential energy surfaces (PESs). The barrierless formation of the chain-like isomers NCCNO (singlet at -106.5, triplet cis at -48.2 and triplet trans at -47.6 kcal/mol) is the most favorable entrance attack on both singlet and triplet PESs. Subsequently, the singlet NCCNO takes an O-transfer to form the branched intermediate singlet NCC(O)N (-85.6), which can lead to the fragments CN + NCO (-51.2) via the intermediate singlet NCOCN (-120.3). The simpler evolution of the triplet NCCNO is the direct N-O rupture to form the weakly bound complex triplet NCCN...O (-56.2) before the final fragmentation to NCCN + (3)O (-53.5). However, the lower lying products (3)NCN + CO (-105.6) and (3)CNN + CO (-74.6) are kinetically much less competitive. All the involved transition states for generation of CN + NCO and NCCN + (3)O lie much lower than the reactants. Thus, the novel reaction CCN + NO can proceed effectively even at low temperatures and is expected to play a role in both combustion and interstellar processes. Significant differences are found on the singlet PES between the CCN + NO and CH + NO reaction mechanisms.