检索结果-内蒙古大学图书馆

in-network caching for the Green Internet of Things

IEEE ACCESS 2021年 9卷 76413-76422页

作者： Ren, Yuan Zhang, Xuewei Wu, Ting Tan, Yixuan Xian Univ Posts & Telecommun Shaanxi Key Lab Informat Commun Network & Secur Xian 710121 Peoples R China Xian Univ Posts & Telecommun Sch Commun & Informat Engn Xian 710121 Peoples R China

By caching multiple copies of the sensed data and suppressing repeated content deliveries from the sensor nodes, the in-network caching exhibits strong potentials to reduce energy consumption and avoid service loss in the Internet of Things (IoT). In this paper, we review the fundamentals of the in-network caching in IoT, especially the deployment principles of the cache-enabled brokers. Since in-network caching is not the optimal choice in some cases, we propose the dynamic in-network caching scheme to decide whether the sensed data should be cached in brokers or not, where the location and delay requirement of the clients, traffic load of the brokers as well as the energy level of the sensor nodes are encapsulated in the proposed scheme. Next, we give a practical case study to demonstrate the effectiveness of the proposed in-network caching scheme in the IoT scenario. It shows that the proposed caching scheme is superior to the traditional sensor-to-client scheme in terms of energy saving. Finally, we conclude this paper, and summarize the future research directions to achieve the in-network caching for implementing the green IoT.

关键词： Internet of Things Energy consumption Green products Protocols Monitoring Licenses Delays in-network caching green Internet of Things (IoT) sensing service broker energy consumption

来源：评论

学校读者我要写书评

暂无评论

in-network caching based live broadcasting for short track speed skating

引用

INTERNET TECHNOLOGY LETTERS 2021年第5期4卷

作者： Wu, Di Ji, Jingsheng Qiqihar Univ 42 Wenhua Rd Qiqihar 161006 Peoples R China

High-Definition 360 panoramic network live broadcasting is more and more popular with its rich expressiveness. However, for the short track speed skating which has ultra-high bit rate requirements, High-Definition 360 panoramic network live broadcasting needs a lot of computation and network bandwidth resources. In this paper, we propose a Software-Defined networking (SDN)-based Information Centric networking (ICN)-assisted edge network live broadcast architecture to realize the allocation of transcoding tasks and transmission of massive streaming data. The experimental results show that by combining scheduling and transcoding resource allocation, the users' Quality of Experience (QoE) can be optimized and the delay requirements can be met.

关键词： ICN in-network caching SDN short track speed skating

来源：评论

学校读者我要写书评

暂无评论

in-network caching and Content Placement in Cooperative Small Cell networks 1

In-Network Caching and Content Placement in Cooperative Smal...

引用

1st International Conference on 5G for Ubiquitous Connectivity (5GU)

作者： Pantisano, Francesco Bennis, Mehdi Saad, Walid Debbah, Merouane European Commiss Joint Res Ctr Ispra Italy CWC Oulu Finland Wireless VT Bradley Dept Elect & Comp Engn Blacksburg VA USA Huawei France R&D Math & Algorithm Sci Lab Paris France

ISBN: (纸本)9781631900556

Anticipating multimedia file requests via caching at the small cell base stations ( SBSs) has emerged as a promising technique for enhancing the quality-of-service ( QoS) of cellular user equipments ( UEs). Nevertheless, in traditional caching approaches, files are retrieved from evolved packet core ( EPC) of the network, and without coordination among SBSs, which introduces new challenges of content duplication and unbalanced traffic load on the backhaul. In this paper, we propose a collaborative framework in which the SBSs can access files from the caches of other SBSs within the same network domain ( i.e., connected to the same service gateway). We design a cost model for the content retrieval of contents across SBSs and from the EPC, and we propose a cost-aware decentralized algorithm, based on which the SBSs devise individual caching strategies ( i.e., which files to cache, and from where). Simulation results show that the proposed cooperative caching scheme yields significant gains in terms of in-network content availability, reaching up to 21% improvement compared to a traditional approaches based on geographical distribution of the UEs.

关键词： cache storage cellular radio cooperative communication information retrieval internetworking multimedia communication quality of service telecommunication traffic QoS SBS cellular user equipments collaborative framework content duplication content placement content retrieval cooperative small cell networks cost model cost-aware decentralized algorithm evolved packet core file retrieval in-network caching in-network content availability multimedia file requests network domain quality-of-service enhancement service gateway small cell base stations unbalanced traffic load Bismuth Frequency modulation Logic gates Scattering service gateway Quality of service Content retrieval Cache memory internetworking cache storage cooperative communication cellular radio Multimedia communications Frequency modulation telecommunication traffic Logic gates file retrieval information retrieval STYRENE-BUTADIENE-STYRENE BLOCK COPOLYMER

来源：评论

学校读者我要写书评

暂无评论

How Much to Coordinate? Optimizing in-network caching in Content-Centric networks

引用

IEEE TRANSACTIONS ON network AND SERVICE MANAGEMENT 2015年第3期12卷 420-434页

作者： Li, Yanhua Xie, Haiyong Wen, Yonggang Chow, Chi-Yin Zhang, Zhi-Li Worcester Polytech Inst Dept Comp Sci Worcester MA 01609 USA China Acad Elect & Informat Technol Beijing 100041 Peoples R China Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China Univ Minnesota Fac Comp Sci & Engn Minneapolis MN 55455 USA

In content-centric networks, it is challenging how to optimally provision in-network storage to cache contents, to balance the tradeoffs between the network performance and the provisioning cost. To address this problem, we first propose a holistic model for intradomain networks to characterize the network performance of routing contents to clients and the network cost incurred by globally coordinating the in-network storage capability. We then derive the optimal strategy for provisioning the storage capability that optimizes the overall network performance and cost, and analyze the performance gains via numerical evaluations on real network topologies. Our results reveal interesting phenomena;for instance, different ranges of the Zipf exponent can lead to opposite optimal strategies, and the tradeoffs between the network performance and the provisioning cost have great impacts on the stability of the optimal strategy. We also demonstrate that the optimal strategy can achieve significant gain on both the load reduction at origin servers and the improvement on the routing performance. Moreover, given an optimal coordination level l*, we design a routing-aware content placement (RACP) algorithm that runs on a centralized server. The algorithm computes and assigns contents to each CCN router to store, which can minimize the overall routing cost, e.g., transmission delay or hop counts, to deliver contents to clients. By conducting extensive simulations using a large-scale trace dataset collected from a commercial 3G network in China, our results demonstrate that our caching scheme can achieve 4% to 22% latency reduction on average over the state-of-the-art caching mechanisms.

关键词： in-network caching content-centric networks coordinated caching

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of in-network caching for content-centric networking

引用

COMPUTER networkS 2013年第13期57卷 2465-2482页

作者： Kim, Yusung Yeom, Ikjun Sungkyunkwan Univ Dept Comp Engn Suwon South Korea

With the explosion of multimedia content, Internet bandwidth is wasted by repeated downloads of popular content. Recently, Content-Centric networking (CCN), or the so-called Information-Centric networking (ICN), has been proposed for efficient content delivery. In this paper, we investigate the performance of in-network caching for Named Data networking (NDN), which is a promising CCN proposal. First, we examine the inefficiency of LRU (Least Recently Used) which is a basic cache replacement policy in NDN. Then we formulate the optimal content assignment for two in-network caching policies. One is Single-Path caching, which allows a request to be served from routers only along the path between a requester and a content source. The other is network-Wide caching, which enables a request to be served from any router holding the requested content in a network. For both policies, we use a Mixed Integer Program to optimize the content assignment models by considering the link cost, cache size, and content popularity. We also consider the impact of link capacity and routing issues on the optimal content assignment. Our evaluation and analysis present the performance bounds of in-network caching on NDN in terms of the practical constraints, such as the link cost, link capacity, and cache size. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Content centric networking in-network caching Optimal content assignment Information-centric networking

来源：评论

学校读者我要写书评

暂无评论

CPHR: in-network caching for Information-Centric networking With Partitioning and Hash-Routing

引用

IEEE-ACM TRANSACTIONS ON networkING 2016年第5期24卷 2774-2787页

作者： Wang, Sen Bi, Jun Wu, Jianping Vasilakos, Athanasios V. Chongqing Univ Sch Software Engn Chongqing 400044 Peoples R China Minist Educ Key Lab Dependable Serv Comp Cyber Phys Soc Chongqing 400044 Peoples R China Tsinghua Univ Inst Network Sci & Cyberspace Beijing 100084 Peoples R China Tsinghua Univ Tsinghua Natl Lab Informat Sci & Technol TNList Beijing 100084 Peoples R China Lulea Univ Technol Dept Comp Sci Elect & Space Engn S-97187 Lulea Sweden

Recently, research on Information-Centric networking (ICN) has flourished, which attempts to shift from the current host-oriented Internet architecture to an information-oriented one. The built-in caching capability is a typical feature of ICN. In this paper, in order to fully exploit the built-in caching capability of ICN, we propose a collaborative in-network caching scheme with Content-space Partitioning and Hash-Routing, which is named as CPHR. By intelligently partitioning the content space and assigning partitions to caches, CPHR is able to constrain the path stretch incurred by hash-routing. We formulate the problem of assigning partitions to caches into an optimization problem of maximizing the overall hit ratio and propose a heuristic algorithm to solve it. We also formulate the partitioning proportion problem into a min-max linear optimization problem to balance cache workloads. By simulations with both the characteristics of real Internet traffic and traces of peer-to-peer (P2P) traffic, we show the necessity of collaborative caching since the en-route caching mode cannot yield a considerable overall hit ratio with practical cache size. It is shown as well that CPHR can significantly increase the overall hit ratio by up to about 100% with the practical cache policy Least Recently Used (LRU) while the overhead incurred is acceptable in terms of propagation latency and load on links.

关键词： Collaborative caching hash-routing information-centric networking in-network caching

来源：评论

学校读者我要写书评

暂无评论

FASE: Fine-Grained Accountable and Space-Efficient Access Control for Multimedia Content With in-network caching

引用

IEEE TRANSACTIONS ON network AND SERVICE MANAGEMENT 2021年第4期18卷 4462-4475页

作者： He, Peixuan Xue, Kaiping Yang, Jiayu Xia, Qiudong Liu, Jianqing Wei, David S. L. Univ Sci & Technol China Dept Elect Engn & Informat Sci Hefei 230027 Peoples R China Bytedance Corp Secur Res Dept Beijing 100098 Peoples R China Univ Sci & Technol China Sch Cyber Secur Hefei 230027 Peoples R China Pengcheng Lab Cyberspace Secur Res Ctr Shenzhen 518055 Peoples R China Univ Alabama Dept Elect & Comp Engn Huntsville AL 35899 USA Fordham Univ Dept Comp & Informat Sci Bronx NY 10458 USA

To reduce the duplicated traffic and improve the performance of distributing massive volumes of multimedia contents, in-network caching has been proposed recently. However, as in-network content caching can be directly utilized to respond users' requests, multimedia content retrieval is beyond content providers' control and makes it hard for them to implement access control and service accounting. In this paper, we propose a Fine-grained Accountable and Space-Efficient access control scheme, called FASE, for multimedia content distribution. FASE allows content providers to be fully offline while making the best of in-network caching. In FASE, the attribute-based encryption at multimedia content provider side and access policy based authentication at the edge router side jointly ensure secure fine-grained access control. Our scheme is efficient in both space and time. By designing one time chameleon signature (OTCS), users can keep anonymous during the authentication, and their privileges can be conveniently revoked when needed. Besides, secure service accounting is implemented by letting edge routers collect service credentials generated during users' request process. Through formal security analysis, we prove the security of our scheme. Simulation results demonstrate that our scheme is efficient with acceptable overhead.

关键词： Authentication Access control Privacy Encryption Delays IP networks Cloud computing Multimedia content security access control in-network caching attribute-based encryption access policy

来源：评论

学校读者我要写书评

暂无评论

An in-network caching Scheme Based on Energy Efficiency for Content-Centric networks

引用

IEEE ACCESS 2018年 6卷 20184-20194页

作者： An, Ying Luo, Xi Cent S Univ Inst Informat Secur & Big Data Changsha 410083 Hunan Peoples R China Hunan Police Acad Dept Informat Technol Changsha 410000 Hunan Peoples R China

Content-centric networking (CCN) has emerged as a promising architecture for future Internet due to its in-network caching capability and the receiver-driven content retrieval paradigm. Recently, the growing energy consumption driven by explosive increase of network traffic has become a key issue in CCN and caused widespread academic concern. In this paper, we construct a model to analyze the energy consumption of content distribution in CCN, and propose an energy efficiency based in-network caching scheme. In this scheme, a judging condition is designed to reduce the total energy consumption of content dissemination, and then in combination with content popularity and node importance, a cache placement strategy is proposed to optimize the selection of caching nodes. Furthermore, a neighbor cooperation-based cache replacement strategy is also proposed, which uses the cache resource of neighbor nodes to increase the chances of content being cached and improve the quality of caching service and resource utilization. Simulation results demonstrate that our scheme can outperform the existing schemes in terms of the high cache hit rate, the low average response hops, and the low whole energy consumption.

关键词： Content-centric networking energy efficiency in-network caching neighbor cooperation

来源：评论

学校读者我要写书评

暂无评论

A distributed in-network caching scheme for P2P-like content chunk delivery

引用

COMPUTER networkS 2015年 91卷 577-592页

作者： Zhang, Xu Wang, Ning Vassilakis, Vassilios G. Howarth, Michael P. Univ Surrey Fac Engn & Phys Sci Guildford GU2 7XH Surrey England

In-network content caching has recently emerged in the context of information-centric networking (ICN), which allows content objects to be cached at the intermediate router side. In this paper, we specifically focus on in-network caching of peer-to-peer (P2P)-like content objects for improving both service and operation efficiencies. We propose a fully distributed in-network caching protocol for P2P-like content chunks, aiming to reduce P2P based content traffic load and also to achieve improved content distribution performances. Toward this end, the proposed holistic decision-making logic takes into account context information of both the underlying network and the P2P characteristics, such as chunk availability, popularity and peer distances. In addition, we also analyse the benefit of coordination between neighbouring content routers when making caching decisions in order to avoid duplicated P2P chunk caching nearby. An analytical modelling framework is developed to quantitatively evaluate the efficiency of the proposed in-network caching scheme. Extensive experiments are also conducted to validate the analytical results. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Information-centric networking in-network caching Peer-to-peer (P2P) systems

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient distributed in-network caching scheme for green content-centric networks

引用

COMPUTER networkS 2015年 78卷 119-129页

作者： Fang, Chao Yu, F. Richard Huang, Tao Liu, Jiang Liu, Yunjie Beijing Univ Posts & Telecommun Key Lab Universal Wireless Commun Minist Educ Beijing 100088 Peoples R China Carleton Univ Dept Syst & Comp Engn Ottawa ON K1S 5B6 Canada

Due to the in-network caching capability, Content-Centric networking (CCN) has emerged as one of the most promising architectures for the diffusion of contents over the Internet. Most existing works on CCN focus on network resource utilization, and the energy consumption aspect is largely ignored. Moreover, the existing centralized schemes for CCN may not be practical to be implemented in realistic networks due to the distributed architecture of the Internet. In this paper, we propose an energy-efficient distributed in-network caching scheme for CCN. In the proposed scheme, each content router only needs locally available information to make caching decisions considering both caching energy consumption and transport energy consumption. We formulate the energy-efficient distributed in-network caching problem as a non-cooperative game. Through rigorous mathematical analysis, we prove that pure strategy Nash equilibria exist in the distributed solution, and it always has a strategy profile that implements the socially optimal configuration, even if the routers are self-interested in nature. Simulation results reveal that the proposed scheme is competitive to the centralized scheme, and has superior performance compared to the other widely used schemes in CCN. Besides, it exhibits a fast convergence speed when the capacity of content routers varies. (C) 2014 Elsevier B.V. All rights reserved.

关键词： in-network caching Content-centric networking Energy efficiency Non-cooperative game

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：