The Caching and Pricing Strategy for Information-Centric Networking with Advertisers’Participation

As users’access to the network has evolved into the acquisition of mass contents instead of IP addresses,the IP network architecture based on end-to-end communication cannot meet users’needs.Therefore,the Information-Centric Networking(ICN)came into being.From a technical point of view,ICN is a promising future network architecture.Researching and customizing a reasonable pricing mechanism plays a positive role in promoting the deployment of ICN.The current research on ICN pricing mechanism is focused on paid content.Therefore,we study an ICN pricing model for free content,which uses game theory based on Nash equilibrium to analysis.In this work,advertisers are considered,and an advertiser model is established to describe the economic interaction between advertisers and ICN entities.This solution can formulate the best pricing strategy for all ICN entities and maximize the benefits of each entity.Our extensive analysis and numerical results show that the proposed pricing framework is significantly better than existing solutions when it comes to free content.

基于FPGA的ICN名字解析缓存加速系统

名字解析服务是ICN网络中获取信息内容的关键。为提升名字解析服务的效率,降低名字解析系统的负载,设计并提出一种基于FPGA的ICN名字解析缓存加速系统。该系统在网络节点的数据面上利用FPGA卸载名字解析功能,实现标识到网络地址的映射存储,处理需要查找网络地址的转发数据包,同时,该系统支持控制面动态配置映射关系,保证映射存储的更新。实验测试结果表明,该系统在10 Gb/s的测试流量下,对小包的转发率达到4.6 Mpps,并且请求延时低于1.5μs,相较于传统软件实现的键值存储系统处理速度提高了27倍,与使用DPDK内核旁路进行优化的软件相比处理速度提高了4倍。

一种基于ICN的网内协同存储机制

随着科学大数据的快速发展,海量科学数据对存储系统的高速持久化存储读写速率提出了新的挑战。信息中心网络(Information-Centric Networking,ICN)因其网内节点的存储能力,可支持数据的高速持久化存储。但现有的网内存储方法并没有联合考虑传输链路状态和节点负载,无法解决高通量应用场景下的存储IO峰值过载问题。针对上述问题,文中提出了一种基于ICN的协同存储机制,通过该机制中的节点选择和流量分割方法,充分利用转发路径上的多个存储节点分担存储任务。实验结果表明,相比较ECMP等流量分割机制,该方法能够更有效地提高系统整体的写入性能,实现存储负载均衡。

基于聚类的ICN缓存空间规划方法

为合理分配信息中心网络(ICN)中每个节点的缓存空间,提出一种基于聚类的ICN缓存空间规划方法。根据节点属性数据集对ICN节点聚类后,以得到的聚类中心属性数据集为每一类分配缓存空间,后根据欧氏距离评估聚类效果为类内每个节点分配缓存空间,来提高缓存系统性能。在实际应用中,也可以为互联网服务提供商(ISP)提供一定的指导意义。仿真结果表明,该方法与均分分配部署方法、基于度数部署方法、基于介数部署方法相比,缓存命中率有明显提高,响应时延明显降低。

一种基于5G-ICN的缓存容量分配方法

随着第五代移动通信网络(5G)与以信息为中心的网络(ICN)的发展,业内提出的5G-ICN架构备受关注,其异构性更加突出,现有的ICN同质缓存容量分配方法已不适用。为了满足该架构异构缓存的容量分配需求,该文提出了一种基于节点重要性的5G-ICN混合组网缓存容量分配方法。采用量化节点位置属性与流量属性的方法计算节点的重要性,结合实际存储容量设置缓存部署单元进行仿真试验,结果表明,与现有方案相比,该文容量分配方法提升了19%的内容命中率与30%的时延。

基于哈希边界的ICN多路径数据调度方法

在信息中心网络(ICN)中采用多路径通信可以提高网络的带宽利用率和数据传输的可靠性,而保障ICN多路径传输性能的一个关键因素是有效地调度可用网络路径上的流量。但不同的路径具有不同的链路状态,而且这些路径的链路状态会因流量波动而快速变化。因此,本文提出了一种基于哈希边界的ICN多路径数据调度方案,以在较小的时间尺度上实现高效的路径权重分布更新和精确的流量分割。该方案通过将哈希边界与每条路径相关联来实现流量的不均匀分割,并降低了路径权重分布更新的开销。实验结果表明,在路径链路状态动态变化的场景下,与ECMP等多路径数据调度方案相比,所提方案的数据块平均传输完成时间缩短12%以上。

ICN网络基于智能合约的节点贡献度计量方法

闲置带宽资源广泛分布于不同互联网用户间,利用闲置带宽可以提高网络资源利用率,改善服务质量,有利于构建双赢的局面。用户贡献了自己的闲置资源,需要根据用户的实际贡献进行奖励分发,因此需要对用户的网络贡献度进行准确计量。目前一些网络贡献计量方法难以对节点的实际转发工作量生成可验证的证明,而生成相应证明的方法开销过于巨大。本文提出在信息中心网络(ICN)和区块链的融合架构下利用用户的闲置带宽进行报文转发,并基于协同验证的思想设计一种分布式网络贡献度计量方法。具体而言,通过网内可信设备建立/释放“计量会话”,基于传输路径元数据生成会话标签,区块链上运行的智能合约负责会话管理和贡献度计量。实验结果表明,相比于现有方法,该方法生成流量转发证明的同时显著降低了方法所需的加解密次数,额外的证明信息开销减少了33%。

An SDN-Based Algorithm for Caching,Routing,and Load Balancing in ICN

One of the challenges of Informationcentric Networking(ICN)is finding the optimal location for caching content and processing users’requests.In this paper,we address this challenge by leveraging Software-defined Networking(SDN)for efficient ICN management.To achieve this,we formulate the problem as a mixed-integer nonlinear programming(MINLP)model,incorporating caching,routing,and load balancing decisions.We explore two distinct scenarios to tackle the problem.Firstly,we solve the problem in an offline mode using the GAMS environment,assuming a stable network state to demonstrate the superior performance of the cacheenabled network compared to non-cache networks.Subsequently,we investigate the problem in an online mode where the network state dynamically changes over time.Given the computational complexity associated with MINLP,we propose the software-defined caching,routing,and load balancing(SDCRL)algorithm as an efficient and scalable solution.Our evaluation demonstrates that the SDCRL algorithm significantly reduces computational time while maintaining results that closely resemble those achieved by GAMS.

A Survey on Information-Centric Networking: Rationales, Designs and Debates

The basic function of the Internet is to delivery data(what) to serve the needs of all applications. IP names the attachment points(where) to facilitate ubiquitous interconnectivity as the current way to deliver data. The fundamental mismatch between data delivery and naming attachment points leads to a lot of challenges, e.g., mapping from data name to IP address, handling dynamics of underlying topology, scaling up the data distribution, and securing communication, etc. Informationcentric networking(ICN) is proposed to shift the focus of communication paradigm from where to what, by making the named data the first-class citizen in the network, The basic consensus of ICN is to name the data independent from its container(space dimension) and session(time dimension), which breaks the limitation of point-to-point IP semantic. It scales up data distribution by utilizing available resources, and facilitates communication to fit diverse connectivity and heterogeneous networks. However, there are only a few consensuses on the detailed design of ICN, and quite a few different ICN architectures are proposed. This paper reveals the rationales of ICN from the perspective of the Internet evolution, surveys different design choices, and discusses on two debatable topics in ICN, i.e.,self-certifying versus hierarchical names, and edge versus pervasive caching. We hope this survey helps clarify some mis-understandings on ICN and achieve more consensuses.

What to Cache：Differentiated Caching Resource Allocation and Management in Information-Centric Networking

Information-centric networking(ICN) aims to improve the efficiency of content delivery and reduce the redundancy of data transmission by caching contents in network nodes. An important issue is to design caching methods with better cache hit rate and achieve allocating on-demand. Therefore, an in-network caching scheduling scheme for ICN was designed, distinguishing different kinds of contents and dynamically allocating the cache size on-demand. First discussing what was appropriated to be cached in nodes, and then a classification about the contents could be cached was proposed. Furthermore, we used AHP to weight different contents classes through analyzing users' behavior. And a distributed control process was built, to achieve differentiated caching resource allocation and management. The designed scheme not only avoids the waste of caching resource, but also further enhances the cache availability. Finally, the simulation results are illustrated to show that our method has the superior performance in the aspects of server hit rate and convergence.

A comparative study of name resolution and routing mechanisms in 网 information-centric networks

Information-Centric Networking (ICN) is an innovative paradigm for the future internet architecture, which addresses IP network limitations in supporting content distribution and information access by decoupling content from hosts and providing the ability to retrieve a content object by its name (identifier), rather than its storage location (IP address). Name resolution and routing is critical for content retrieval in ICN networks. In this research, we perform a comparative study of two widely used classes of ICN name resolution and routing schemes, namely flooding and Distributed Hash Table (DHT). We consider the flooding-based routing in Content-Centric Networks due to its wide acceptance. For the DHT scheme, we design a multi-level DHT that takes into account the underlying network topology and uses name aggregation to further reduce control overhead and improve network efficiency. Then, we compare the characteristics and performance of these two classes of name resolution and routing through extensive simulations. The evaluation results show that the performances of these two approaches are reliant on several factors, including network size, content location dynamics, and content popularity. Our study reveals insights into the design tradeoffs and offers guidelines for design strategies.

Status-Aware Resource Adaptation in Information-Centric and Software-Defined Network

In recent years, realising a ＂clean- state＂ design for the future Internet has become an important research focus. An architecture com- bining an Information-Centric Network （ICN） and Sottware-Defmed Network （SDN） （IC-SDN） has gradually attracted more attention. How- ever, the existing studies regarding IC-SDN still lack support in terms of the ＂network status awareness＂ function, resulting in unreasonable resource allocation. In this paper, we propose a new status-aware resource adaptation sche- me, i.e. a status-aware module is embedded into basic elements （Forwarding Node （FN） and Resource adaption Manager （RM））. The FNs collect the network status dynamically for the controller to reallocate network resources accor- ding to the fluctuations in environmental con- ditions. Simulation results show that, compared with the existing IC-SDN mechanism, the pro- posed scheme reduced the link bandwidth var- iance by 56% and the content delivery latency by 40%. The proof-of-concept implementation demonstrates the feasibility of our proposed sc- heme for small-scale deployment.

Exploring Content Popularity in Information-Centric Networks

Information-Centric Networking(ICN), an alternative architecture to the current Internet infrastructure, focuses on the distribution and retrieval of content by employing caches in a network to reduce network traffic. The employment of caches may be accomplished using graph-based and content-based criteria such as the position of a node in a network and content popularity. The contribution of this paper lies on the characterization of content popularity for on-path in-network caching. To this end, four dynamic approaches for identifying content popularity are evaluated via simulations. Content popularity may be determined per chunk or per object, calculated by the number of requests for a content against the sum of requests or the maximum number of requests. Based on the results, chunk-based approaches provide 23% more accurate content popularity calculations than object-based approaches. In addition, approaches that are based on the comparison of a content against the maximum number of requests have been shown to be more accurate than the alternatives.

基于负载状态的ICN缓存替换算法研究

针对ICN缓存节点因数据转发与缓存交付流量对端口带宽产生竞争导致网络拥塞的问题,在LRU算法的基础上提出了一种基于节点负载状态的缓存替换算法。该算法通过判断ICN节点是否长期处于带宽竞争,采用自适应的替换窗口将某些较为流行的内容主动替换,避免节点因高缓存命中率引发严重带宽竞争。仿真实验结果表明,与LRU算法相比,所提替换算法能使节点缓存命中率提高14.3%,报文重传概率降低34.9%,内容下载时延降低11.3%。进而提升整体网络性能,使缓存实现更高效的内容分发。

HHR:Hierarchical Hybrid Routing Scheme for Information-Centric Network

Publish/subscribe(pub/sub) paradigm is the main communication model for Information-Centric Network(ICN) proposals.A key issue for pub/sub system is how to route the content objects to the correct subscribers,and ICN is no exception.ICN network would be divided into core domain and many edge domains as today's internet does.HHR(Hierarchy Hybrid Routing scheme) is presented for ICN:A Chord-like routing scheme is used in core domain,while edge domains routing structure can be classified into three categories,Local Routing(LR),Delivery of Local Publication to Core domain(DLPC),and Remote Publication Routing into edge domain(RPR).LR can be decided by each edge domain,which determined by many factors,such as locality characteristic for pub/sub information and local policies.A hierarchical routing algorithm is proposed to solve DLPC and RPR simultaneously.Simulation results demonstrate that HHR can be fast deployed,and can be applied in large scale network or dynamic subscription environment.

CMLP: Exploiting Caches at Multiple Levels of Proxies to Enhance Seamless Mobility Support in Information-Centric Networks

The recent evolution of the Internet towards "Information-centric" transfer modes has renewed the interest in exploiting proxies to enhance seamless mobility. In this work, we focus on the case of multiple levels of proxies in ICN architectures, in which content requests from mobile subscribers and the corresponding items are proactively cached to these proxies at different levels. Specifically, we present a multiple-level proactive caching model that selects the appropriate subset of proxies at different levels and supports distributed online decision procedures in terms of the tradeoff between delay and cache cost. We show via extensive simulations the reduction of up to 31.63% in the total cost relative to Full Caching, in which caching in all 1-level neighbor proxies is performed, and up to 84.21% relative to No Caching, in which no caching is used. Moreover, the proposed model outperforms other approaches with a flat cache structure in terms of the total cost.

A Lightweight Anonymous Device Authentication Scheme for Information-Centric Distribution Feeder Microgrid

Distribution feeder microgrid(DFM)built based on existing distributed feeder(DF),is a promising solution for modern microgrid.DFM contains a large number of heterogeneous devices that generate heavy network traffice and require a low data delivery latency.The information-centric networking(ICN)paradigm has shown a great potential to address the communication requirements of smart grid.However,the integration of advanced information and communication technologies with DFM make it vulnerable to cyber attacks.Adequate authentication of grid devices is essential for preventing unauthorized accesses to the grid network and defending against cyber attacks.In this paper,we propose a new lightweight anonymous device authentication scheme for DFM supported by named data networking(NDN),a representative implementation of ICN.We perform a security analysis to show that the proposed scheme can provide security features such as mutual authentication,session key agreement,defending against various cyber attacks,anonymity,and resilience against device capture attack.The security of the proposed scheme is also formally verified using the popular AVISPA(Automated Validation of Internet Security Protocols and Applications)tool.The computational and communication costs of the proposed scheme are evaluated.Our results demonstrate that the proposed scheme achieves significantly lower computational,communication and energy costs than other state-of-the-art schemes.

Neighborhood-Based In-Network Caching for Information-Centric Networks

The current Internet is based on host-centric networking, and a user needs to know the host address before reaching a data target in the network. The new architecture of information-centric networking (ICN) facilitates users to locate data targets by giving their data names without any information about host addresses. In-network caching is one of the prominent features in ICN, which allows network routers to cache data contents. In this paper, we emphasize the management of in-network cache storage, and this includes the mechanisms of cache replacement and cache replication. A new cost function is then proposed to evaluate each cache content and the least valuable content is evicted when cache is full. To increase cache utilization, a cooperative caching policy among neighboring routers is proposed. The proper network locations to cache data contents are also discussed in the paper. Experimental results show the superiority of the proposed caching policy than some traditional caching polices.

INFORMATION-CENTRIC NETWORKING

Information-Centric Networking(ICN)is an emerging direction in Future Internet architecture research,gaining significant tractions among academia and industry.Aiming to replace the conventional host-to-host communication model by a data-centric model,ICN treats data content as the first class entity in network architecture.

基于ICN的IPTV传输和监测技术分析

为了保证交互式网络电视(Internet Protocol Television,IPTV)业务传输及相关网络功能的正常实现和稳定可靠运行,需要对网络运行状况进行监测.基于此,采用理论分析的方式,首先介绍了IP承载网及相关通信协议,其次针对IPTV业务传输过程中出现的各种问题提出解决方案,最后针对相应方案提出了完善策略.