Caching Support Research Articles

In-Network Caching for ICN-Based IoT (ICN-IoT): A Comprehensive Survey

The Internet of Things (IoT) has already emerged as one of the most popular directions in today’s information and communication technology (ICT) domain. With its advancement over different application areas, such as smart home, smart healthcare, industry 4.0, etc., a huge amount of data has been generated by billions of IoT devices, which aggravates the shortcomings of IP-based networks, such as limited expressiveness of IP addressing, inefficient support for mobility and in-network caching. Building IoT on top of information-centric networking (ICN) is believed to be a promising solution to tackle the above challenge, especially the in-network caching of ICN can significantly benefit IoT in terms of reducing data and saving IoT devices’ energy. However, caching IoT data is more challenging than caching traditional Internet content, e.g., video, because IoT data are usually valid within a certain period of time, and IoT devices are typically constrained with battery. Hence, in this survey, we first review the current implementation proposals of ICN-IoT. Next, we present the conventional caching decision policies and replacement policies which could be adopted to mitigate the aforementioned challenges, e.g., reducing IoT traffic, saving energy, reducing data retrieval latency. Further, since leveraging machine learning (ML) techniques have the potential to further improve the caching efficiency by dealing with uncertainties, e.g., predicting unknown information, adaptively interacting with the environment, we also demonstrate the recently proposed ML-based caching schemes for ICN-IoT. In addition, we outline the open research issues and point out the future opportunities of caching in ICN-IoT.

Forwarding Strategies for Named Data Networking Based IoT: Requirements, Taxonomy, and Open Research Challenges

The Internet of Things (IoT) aims to efficiently connect various entities, including humans, machines, smart devices, physical environments, and others, so they can communicate and exchange data in real time. However, due to the massive amount of data transferred, the presence of devices with limited resources, heterogeneity, and mobility support would make it difficult to create a robust network with respect to performance in an IoT context. In order to efficiently disseminate the enormous volume of automated data, Named Data Networking (NDN), a viable networking design for the future Internet, has been proposed. NDN has shown great potential for IoT because it has built-in support for naming, caching, mobility, and security. Forwarding strategies play an important role in the successful deployment of NDN-based IoT. In this article, we introduce NDN-based IoT forwarding emphasizing on IoT characteristics and requirements. We classify NDN-based IoT forwarding strategies and then discuss in detail certain exemplary schemes. Additionally, we compare several aspects of current forwarding methods that are now in use, including the types of forwarding strategy, particular issues, and type of solution, assessment metrics, and simulation platform. We wrap up our contribution by outlining the major open research issues that can guide future investigations in this area. We anticipate that this survey will help the community of NDN-based IoT researchers’ understanding of forwarding strategies in IoT environments.

Bandit Learning-Based Edge Caching for 360-Degree Video Streaming With Switching Cost

Virtual Reality (VR) and Augmented Reality (AR) applications are expected to be a key driver for the 5G network. The need of the MEC support for caching and transcoding of omnidirectional content has been identified as a major topic of research. In this paper, we study the optimal caching problem in an MEC-enabled VR system for tile-based viewport-adaptive 360-degree video streaming. For content caching, the replacement of the cached content inevitably incurs content switching cost, which is largely ignored in caching policy design. In this work, we aim to find the optimal caching policy to optimize the long-term transmission quality by considering both transmission latency and content switching cost. We apply the combinatorial multi-armed bandit (CMAB) theory to solve the problem with no a-priori knowledge on content popularity. Moreover, the CUCB with switching cost (CUCBSC) algorithm is adopted in this scenario. A transformation mechanism is designed to transform the generated single period optimization (SPO) problem into a multiple choice knapsack problem (MCKP). Rigorous theoretical analysis on the performance of the proposed algorithm is also provided. Finally, the effectiveness of the proposed learning based caching policy is confirmed by simulation results in terms of learning, hit-ratio, transmission and content switching delay.respondence) papers with a suitable choice of class options.

NyaYa: Blockchain-based electronic law record management scheme for judicial investigations

In digitization, judicial investigations have transitioned towards digital storage of forensic shreds of evidence as electronic law records (ELRs). The shift poses varied challenges of ELR preservation, homogeneity of case formats, chronology in recorded statements by suspects, time-stamping and digital signatures on ELRs, and the chain of transfer of cases to different law enforcement agencies (LEAs) over open channels. Thus, privacy and trust among judicial stakeholders-case appellant (CA), case defendant (CD), the police officer (PO), defence lawyer (DL), prosecutor lawyers (PL), LEAs, and court judge is a prime concern. Motivated from the aforementioned discussions, the paper presents a blockchain (BC)-based ELR management scheme, NyaYa, that operates as a four-phased scheme of judicial stakeholder registration in BC, case registration with meta-hash keys in public BC, that reference an external off-chain interplanetary file storage (IPFS), chronology of investigative updates among LEAs, and case hearing and settlement through smart contracts (SCs). In the simulation, NyaYa is compared to traditional ELR storage schemes for parameters like mining cost, query fetching time, block processing time, obtained IPFS throughput, signing latency, the effect of collusion attacks, ELR processing time, and corrupted indexes in IPFS. We also presented formal verification and proposed functionalities of SCs. In simulation, at 6 USD mining cost, NyaYa can append 22456 transactions, compared to 21497 and 3000 transactions respectively in existing schemes. The achieved query fetching time is 0.852 milli-seconds (ms), at 25 blocks, with cache support of 32 kilobyte (KB). The scheme has an average signing latency of 622.95ms, and achieves a high-trust probability of 0.887 %, compared to 0.765 % in consortium BC, and 0.455 % in private BC, at 500, colluding nodes. An improvement of 6.77 % is achieved in ELR uploading latency, and the scheme has only 21 corrupted IPFS indexes for 350 fetched ELRs. The obtained results indicate the efficacy of the proposed scheme against conventional schemes.

Cooperative Caching Scheme for Machine-to-Machine Information-Centric IoT Networks

Information-centric networks (ICNs), a foreseen future Internet architecture, are focusing on the content itself rather than its hosting location. With this, the existing Internet protocol (IP)-based host-centric communication model can be transformed into a content-centric communication model with the support of in-network caching, name-based routing, and location-independent content domain names. Recently, ICN is proposed to be a potential Internet architecture for Internet-of-Things (IoT) networks due to minimal retrieval delays and reduced load on the data producer. Content retrieval from IoT nodes plays a prominent role in enhancing the performance of the ICN-IoT networks. State-of-the-art cache retrieval mainly focuses on the noncooperative caching mechanism, which is not efficient for constrained IoT networks. As an improvement, this article proposes a cooperative caching scheme for information-centric-IoT networks to optimize the cache hit with the support of a caching network topology model, a content popularity model, and an exogenous request access model. Simulations results reveal that the proposed cooperative caching scheme improves the cache hit rate, resource utilization, and reduce the network delay in IoT networks.

Light in‐network caching enabled IP network: A large‐scale content delivery in MAN

Although the future Internet paradigm especially Information‐Centric Networking (ICN) has been recognized and accepted in recent years, the end‐to‐end IP network structure always shows the overwhelming development tendency due to the deployment difficulty of ICN on the real and large‐scale network environment. However, each coin has two sides, that is to say, ICN also has its own unique value, that is, in‐network caching feature which is not included in the current IP network. In this letter, we propose an In‐network caching enabled IP network paradigm, which is a novel concept different from both ICN and the traditional IP network. Based on such paradigm, we present a light content delivery scheme depending on identity, with the chain‐based fine‐grained caching support. Given the NP‐hardness of delivery scheme in mesh topology, we make a case study in Metropolitan Area Network (MAN) to address the large‐scale content delivery scenario. The experimental results show that the proposal in this letter can effectively relieve the load pressure of origin server, and can also greatly improve the delivery efficiency.

Joint optimization strategy for QoE-aware encrypted video caching and content distributing in multi-edge collaborative computing environment

The video request service of users in 5G network will explode, and adaptive bit rate technology can provide users with reliable video response. Placing video resources on edge servers close to users can overcome the problem of excessive network load similar to traditional centralized cloud platform solutions. Moreover, multiple edge servers can provide caching and transcoding support by collaboration mechanisms, which further improves users’ Quality of Experience (QoE). However, the design difficulty of video caching and content distribution strategies is increased due to the diversity of collaboration mechanisms and the competition between local and collaborative services of edge servers for computing and storage resources. In order to solve this problem, video cache and content distribution problem is modeled as random integer programming problem in the multi-edge server at most two-hop collaboration scenario. In order to improve the security of video data transmission, the video stream is encrypted using an encryption algorithm based on Logistic chaotic-Quantum-dot Cellular Automata (QCA). For improving the efficiency of solving integer programming problems, this paper uses a pyramid intelligent evolution algorithm based on optimal cooperation strategy to solve this problem. Simulation experiments show that our proposed method can obtain higher QoE value compared with several newer methods. In addition, the average access delay of proposed method is shortened by more than 27.98%, which verifies its reliability.

Improving Network Throughput by Hardware Realization of a Dynamic Content Caching Scheme for Information-Centric Networking (ICN)

Caching popular content at storage enabled routers or small-cell base stations (SBSs) is a key technology for future communication systems. Primarily limited to wired backbone systems, content-caching techniques are useful to offload mobile data traffic too. Several protocols have been developed towards realization of content-caching, namely, information-centric networking (ICN), content-centric networking, and named data networking. Studies have revealed that incorporating ICN caching schemes at SBSs could significantly enhance the user level performance, i.e., the lesser download delay and the higher throughput. However, smaller coverage area of a SBS would make the communication prone to high handover probability. Therefore, the implementation of ICN caching schemes at SBS requires extremely low processing delay, i.e., delay to search if the requested content is available at the cache, and accordingly make decision to serve the content request or forward it to the content server. In this article, a configurable hardware add-on has been developed to incorporate content caching features in a traditional SBS that can serve the user with extremely low processing delay while optimizing a combination of various network and hardware metrics. Using extensive results being generated from simulations, the usefulness of content caching has been demonstrated, and the effect of several hardware parameters over the latency performance has been studied too. In addition, the caching hardware accelerator has the ability to adapt dynamically to the optimal caching policy required by the prevailing network conditions as well as hardware requirements. An improvement upto 53% in network delay and 15% in handover probability due to the support of hardware-based caching is observed that incurs a negligible $$0.07\,{\hbox {mm}}^2$$ and up to only 11.1 mW energy overhead while operating in the range of 690–910 MHz.

Deadline Constrained Video Analysis via In-Transit Computational Environments

Combining edge processing (at data capture site) with analysis carried out while data is enroute from the capture site to a data center offers a variety of different processing models. Such in-transit nodes include network data centers that have generally been used to support content distribution (providing support for data multicast and caching), but have recently started to offer user-defined programmability, through Software Defined Networks (SDN) capability, e.g., OpenFlow and Network Function Visualization (NFV). We demonstrate how this multi-site computational capability can be aggregated to support video analytics, with Quality of Service and cost constraints (e.g., latency-bound analysis). The use of SDN technology enables separation of the data path from the control path, enabling in-network processing capabilities to be supported as data is migrated across the network. We propose to leverage SDN capability to gain control over the data transport service with the purpose of dynamically establishing data routes such that we can opportunistically exploit the latent computational capabilities located along the network path. Using a number of scenarios, we demonstrate the benefits and limitations of this approach for video analysis, comparing this with the baseline scenario of undertaking all such analysis at a data center located at the core of the infrastructure.

An Information-Centric Networking Based Registry for Decentralized Identifiers and Verifiable Credentials

Decentralized Identifiers (DIDs) are new self-manageable means of authentication, which is currently under standardization by the World Wide Web Consortium (W3C). Closely related to DIDs, verifiable credentials (VCs) are another ongoing standardization effort (by the same W3C working group) that enables privacy-preserving and cryptographically secure proofs of attribute ownership. Both these approaches assume in their core an immutable decentralized registry (e.g., a blockchain, or a p2p network) in which critical meta-data is recorded. However, W3C’s standards do not specify how this registry is implemented, instead this is left as an open implementation choice. In this paper we design, implement, and evaluate a secure DID/VC registry service using the emerging paradigm of Information Centric Networking (ICN). In order to achieve our goal, we combine the decentralized nature, and the “lookup by name” property of ICN, with a secure mechanism for maintaining synchronized replicas of an item in multiple locations. Due to ICN’s inherent support for multicast and caching, our construction imposes small network overhead, and achieves low lookup times.

A Network-Coded Caching-Based Multicasting Scheme for Information-Centric Networking (ICN)

Information-centric networking (ICN) is gradually becoming an alternative approach to the conventional Internet architecture through the distribution of enlightening information (named as content) on the Internet. Given the growing Internet traffic, the adapted information-centric architecture is expected to more favourably serve the user’s need of accessing data. In this paper, we proposed a novel framework for cache management in ICN that jointly considers the caching strategy and network coding. For the proposed cache management framework, we first evaluated a new Centrality-measures to assess the variation in the behaviour of each node in the network and to identify such behaviour. Subsequently, we developed an efficient random network coding-based cache management algorithm to obtain a support for caching and multicasting in the ICN paradigm. Extensive simulations were made, and related results showed that our proposed scheme has better performance in terms of cache hit ratio, average download time, server hit reduction ratio, and traffic overhead compared with other schemes in our simulated scenarios.

Belle II Conditions Database

The Belle II experiment at KEK is preparing for taking first collision data in early 2018. For the success of the experiment it is essential to have information about varying conditions available to systems worldwide in a fast and efficient manner that is straightforward for both the user and maintainer. The Belle II Conditions Database was designed to make maintenance as easy as possible. To this end, a HTTP REST service was developed with industry-standard tools such as Swagger for the API interface development, Payara for the Java EE application server, and the Hazelcast in-memory data grid for support of scalable caching as well as transparent distribution of the service across multiple sites.On the client side, the online and offline software has to be able to obtain conditions data from the Belle II Conditions Database in a robust and reliable way under very different situations. As such the client side interface to the Belle II Conditions Database has been designed with a variety of access mechanisms which allow the software to be used with and without an internet connection. Different methods to access the payload information are implemented to allow for a high level of customization per site and to simplify testing of new payloads locally. Changes to the conditions data are usually handled transparently but users can actively check whether an object has changed or register callback functions to be called whenever a conditions data object is updated. In addition a command line user interface has been developed to simplify inspection and modification of the database contents.

Analysis of the reconfiguration latency and energy overheads for a Xilinx Virtex‐5 field‐programmable gate array

In this study, the authors have evaluated the overhead and the tradeoffs of a set of components usually included in a system with run-time partial reconfiguration implemented on a Xilinx Virtex-5. The authors’ analysis shows the benefits of including a scratchpad memory inside the reconfiguration controller in order to improve the efficiency of the reconfiguration process. They have designed a simple controller for this scratchpad that includes support for prefetching and caching in order to further reduce both the energy and latency overhead.

ATR4S: toolkit with state-of-the-art automatic terms recognition methods in Scala

Automatically recognized terminology is widely used for various domain-specific texts processing tasks, such as machine translation, information retrieval or ontology construction. However, there is still no agreement on which methods are best suited for particular settings and, moreover, there is no reliable comparison of already developed methods. We believe that one of the main reasons is the lack of state-of-the-art method implementations, which are usually non-trivial to recreate—mostly, in terms of software engineering efforts. In order to address these issues, we present ATR4S, an open-source software written in Scala that comprises 13 state-of-the-art methods for automatic terminology recognition (ATR) and implements the whole pipeline from text document preprocessing, to term candidates collection, term candidate scoring, and finally, term candidate ranking. It is highly scalable, modular and configurable tool with support of automatic caching. We also compare 13 state-of-the-art methods on 7 open datasets by average precision and processing time. Experimental comparison reveals that no single method demonstrates best average precision for all datasets and that other available tools for ATR do not contain the best methods.

Interest-suppression-based NDN live video broadcasting over wireless LAN

Named data networking (NDN) is a new Internet architecture that replaces today’s focus on where – addresses and hosts with what – the content that users and applications care about. One of NDN’s prominent advantages is scalable and efficient content distribution due to its native support of caching and multicast in the network. However, at the last hop to wireless users, often the WiFi link, current NDN implementation still treats the communication as multiple unicast sessions, which will cause duplicate packets and waste of bandwidth when multiple users request for the same popular content. WiFi’s built-in broadcast mechanism can alleviate this problem, but it suffers from packet loss since there is no MAC-layer acknowledgement as in unicast. In this paper, we develop a new NDN-based cross-layer approach called NLB for efficient and scalable live video streaming over wireless LAN. The core ideas are: using WiFi’s broadcast channel to deliver content from the access point to the users, a leader-based mechanism to suppress duplicate requests from users, and receiver-driven rate control and loss recovery. The design is implemented and evaluated in a physical testbed comprised of one software AP and 20 Raspberry Pi-based WiFi clients. While NDN with multiple unicast sessions or plain broadcast can support no more than ten concurrent viewers of a 1Mbps streaming video, NDN plus NLB supports all 20 viewers, and Received December 29, 2015; accepted April 28, 2016 E-mail: zhxp@tsinghua.edu.cn can likely support much more when present.

Enabling Tunneling in CCN

Content-centric networking (CCN) is a new networking architecture that adopts a receiver-driven transport design with pervasive in-network cache support, which precisely meets the present Internet usage pattern. However, present CCN design lacks support for tunneling, which is proved to be an important feature that simplifies the addition of new network functionality to the network and eases the network architecture evolution. In this letter, we propose a mechanism to add tunneling capability to the CCN with full compatibility with CCN’s naming convention and forwarding logic. We show that the proposed tunneling mechanism not only works, but also largely inherits the performance benefits introduced by the CCN architecture.

H-Pastry: An inter-domain topology aware overlay for the support of name-resolution services in the future Internet

Overlay networks are widely used for locating and disseminating information by means of custom routing and forwarding on top of an underlying network. Distributed Hash Table (DHT) based overlays in particular, provide good scalability and load balancing properties. However, these come at the cost of inefficient routing, caused by the lack of adaptation to the underlying network, as DHTs often overlook physical network proximity, administrative boundaries and/or inter-domain routing policies. In this paper we show how to construct a DHT-based overlay network that takes all these aspects into account, so as to ease the global deployment of Future Internet architectures which require large-scale name resolution, such as Information-Centric Networking (ICN) and the Internet of Things (IoT). Based on the Pastry distributed object location and routing substrate and the Canon paradigm for multi-level DHTs, we developed H-Pastry, an overlay DHT scheme that harvests the scalability and load balancing features of DHTs, while also adapting to the underlying network topology, administrative structure and routing policies. We evaluate the performance characteristics of the proposed scheme through an extensive set of detailed simulations over realistic inter-network topologies. Our results show that H-Pastry substantially improves routing by reducing both overlay path stretch (by up to 55%) and routing policy violations (by up to 70%), compared to the Canonical (multi-level) Chord DHT. In addition, the design of H-Pastry keeps traffic within administrative boundaries as far as possible, reducing inter-domain hops by up to 27% compared to Pastry, while also creating excellent opportunities for the support of caching and multicast.

A Novel Vehicular Information Network Architecture Based on Named Data Networking (NDN)

Vehicular information network and Internet of Things (IoT) technologies have been receiving a lot of attention in recent years. As one of the most important and promising IoT areas, a vehicular information network aims to implement a myriad of applications related to vehicles, traffic information, drivers, passengers, and pedestrians. However, intervehicular communication (IVC) in a vehicular information network is still based on the TCP/IP protocol stack which is not efficient and scalable. To address the efficiency and scalability issues of the IVC, we leverage the named data networking (NDN) paradigm where the end user only cares about the needed content and pays no attention to the actual location of the content. The NDN model is highly suitable for the IVC scenario with its hierarchical content naming scheme and flexible content retrieval and caching support. We design a novel vehicular information network architecture based on the basic communication principle of NDN. Our proposed architecture aims to improve content naming, addressing, data aggregation, and mobility for IVC in the vehicular information network. In addition, the key parameter settings of the proposed schemes are analyzed in order to help guide their actual deployment.

IJARCCE - Computer and Communication Engineering

Today, the E-Business faces the many problems in terms of efficiency, reliability because of large data has been placed on the servers and the client are using such data at the same and frequently and it also very difficult to manage the E-Business due to these issues. One solution is middle-Tier Database. For E-Commerce websites there are mainly two issues, cost and time. As the numbers of users increase, performance related issues needs to be solved by using caching concepts. In E-Commerce websites dynamic pages are used to provide wider range of interaction than static HTML pages. At the same time, much performance related issues arises by using dynamic page generation technologies because of load placed on server-side resources. For many web applications system support for caching is insufficient. This Paper provides a new way of Application level caching to improve performance of web applications. Concept of shared and unshared caching has been used in proposed method. This paper has been developed the algorithm for demonstrate the actual working of the proposed work.

Analytical model for Binding Refresh Request to reduce storage and communication overhead in MIPv6 network

SUMMARYHome agent is a key component of MIPv6 functionality that comprises binding cache to hold the mobile nodes current point of attachment to the Internet. This paper is concerned with binding cache support for home agents within MIPv6 network. Existing binding cache of home agent supports weak cache consistency by using fixed contract length for Binding Refresh Request, which functions reasonably well in normal situations. However, maintaining a strong binding cache consistency in home agent as a crucial exceptional handling mechanism has become more demanding for the following objectives: (i) to adapt increasingly frequent change of care‐of address due to mobile nodes movement detection update; (ii) to provide fine‐grain controls to balance the binding cache load distributions for better delivery services; and (iii) to reduce the overhead allowances around the binding cache. In this paper, we have first verified the effectiveness of Binding Refresh Request contract length, and on the basis of that, two dynamic contract algorithms are suggested to reduce the storage and communication overhead allowances in binding cache. We have also compared our technique with the existing fixed Binding Refresh Request contract length, and our simulation results reveals that the proposed approach provides an effective performance to reduce overhead within the network. Copyright © 2014 John Wiley & Sons, Ltd.