Delayed Packet Forwarding for Information-Centric Networking

Cache‐enabled heterogeneous cellular networks (HCNs) have been investigated extensively to alleviate backhaul congestion and reduce content delivery delay. In this paper, we jointly optimize content placement and user association to minimize the average content delivery delay in cache‐enabled HCNs based on flow‐level models. This formulation considers (1) different timescales of content placement and content delivery, (2) locality of content popularity, and (3) the heterogeneity of spatial traffic distribution, which are often neglected in existing researches. The joint optimization problem is formulated as a mixed integer nonlinear programming problem in load‐non‐coupled and load‐coupled models, respectively. We decouple this problem into two interrelated subproblems and resolve them individually. For the user association problem under a given content placement situation, we propose a content‐level selective association algorithm, which allows the requests for different contents at the same location to connect to different base stations (BSs). In addition, we propose a greedy content caching algorithm to add contents to the caches of BSs in an iterative manner. These two algorithms are alternately executed until the caches of all the BSs are filled to capacity. Simulation results show that the proposed algorithm achieves better performance in terms of average delay and backhaul usage compared with traditional content placement and user association approaches.

Information-Centric Networking (ICN) is a communication paradigm for the future Internet that matches the pattern of information-oriented applications and provides in-network caching. Thanks to such properties, ICN has been recently considered as a solution for the IoT. However, IoT shows challenging features: many devices are resource-constrained and applications usually originate transient information. As a consequence, ICN-IoT solutions requires new design choices. Among them, it is crucial understanding if constrained devices can successfully implement ICN caching and forwarding functionalities, and what are the delivery performance.

Information-Centric Networking (ICN) is attracting attention as a content distribution method against increasing network traffic. ICN router has the cache function. However, when a large amount of the interest packets for the same content that is not present in the cache occurs during a short time, there is a problem of redundant interest packet, and data packet flows to the upstream link. Such contents expect to happen in case of social affairs, like featured sports. To solve this problem, we propose a method that the server pushes the predicted content to the neighboring nodes before a large amount of interest to the content will occur. As the simulation results, it is confirmed that the possibility of reduction for the number of packets flowing in the upstream link and the number of routing table states required for push distribution.

Vehicular Content-Centric Networks (VCCN) has been proposed and emerged as an upcoming Internet technology for the Vehicular Ad-hoc Networks (VANETs). However, VCCN architecture faces many challenges including Consumer/Provider mobility, Flooding, Interest/Data packet forwarding, Forwarding selection and Congestion control. Consumer vehicle broadcasts (i.e., requests) the interest packet. Relay nodes vehicles receiving this interest packet and performs search (Content Storage, Pending Interest Table and Forward Interest Base) operations on it and then rebroadcasts the interest message in case of no content match. These search (Content Storage, Pending Interest Table, and Forward Interest Base) operations cause delay and duplication's of interest packets. In our paper, we propose a routing protocol scheme named Intersection Based Forwarder Selection (IBFS) to mitigate the interest broadcast storm and disconnected link within the network. In IBFS, each vehicle shares its trajectory information with its neighboring vehicles. All vehicles store/save trajectory information in its Neighbor Table (NT), which helps to select the best interest relay/forwarder vehicle on the basis of matching trajectory information with the consumer vehicle. We have also considered the other metrics i.e. velocity and hop count. IBFS protocol overcomes the end-to-end delay (low latency), ISD (Interest Satisfaction Delay), communication overheads and minimum number of interest forwarded with the reliable interest and data packet transmission.

It is a paradigm shift in internet architecture from receiver centric model to the information centric networking (ICN) model to improve the end-users' latency experience. With exponential increment in number of users and data volume, efficient usage of the nodes (caches) and content forwarding methodology are key issues in an ICN architecture. In ICN intra-domain routers have storage capacity and they can act as temporary content provider, therefore it reduces average hop count and correspondingly average delay for content download. In this article, we formulate the content management issues in a cache having finite storage capability and propose an efficient content management policy that metamorphoses a node to a self-sustained cache. We address how content packets are stored in buffer of the cache before processing and how they suffer from several finite propagation delays during the processing in a cache. We simulate our proposition with deploying real-life network environment and calculate user experience metrics like average latency, throughput and good-put. From simulation results we observe that our proposed model outperforms the existing state-of-the-art on-path caching policies.

Information-centric networking (ICN) can bring many benefits to network operators, e.g., in-network request resolution via router's cache, and name-based forwarding. However, creating a smooth migration path from the current IP network to the ICN is a challenging task that must be investigated. Network function virtualization (NFV) is one of the key technologies to achieve this migration because of its flexibility in supporting new network services as software. Nevertheless, when we consider the deployment of ICN services over NFV, two performance issues are found: processing delay of name look-up and computational overhead of the virtual machine. In this paper we propose NFV infrastructure-assisted name-based forwarding by integrating the name look-up into the Open vSwitch. The contributions are twofold: 1) First, we provide a novel look-up scheme that can forward ICN packets without costly longest prefix match searching. 2) Second, we integrate this forwarding scheme into the virtualization infrastructure to mitigate computational overhead.

In order to overcome the phenomenon that the existence of end-to-end path is no longer guaranteed because of intermittent connection in the opportunistic network, it is desirable to employ a special node called ferry, which moves in a specific trace and forwards data for disconnected nodes, to provide communication opportunities. In this paper, Global Ferry Scheme (GFS), which exploits multiple local ferries and a global ferry to deliver messages, is proposed to minimize the average message delivery delay. The performance of GFS is evaluated and compared to the existing ferry-based routing method by analysis and simulation. The results show that GFS can improve the performance of opportunistic networks in terms of average delay and delivery ratio.

Information-Centric Network (ICN) emerged as a new Internet paradigm to address the problems arising from the mismatch between the TCP/IP host-to-host transmission pattern and content-oriented access mode. However, the current network infrastructure does not support ICN. ICN needs to be deployed incrementally on existing networks, and its coexistence with IP is inevitable. Software-Defined Network (SDN) is an effective solution for achieving flexible and controlled deployment. In this paper, we design a compatible format for IP packets and NDN (Named Data Networking, Typical representatives of ICN) packets based on MPLS. On this basis, a network architecture for IP and NDN coexistence, called SDNDN (Software-Defined Named Data Network), is designed in combination with SDN. With data plane programmable capabilities, functionally extended switches enable parsing, processing, and forwarding of NDN packets; algorithms such as route optimization and cache management are implemented based on a global view. Experimental results indicate that SDNDN can realize the coexistence of ICN and IP networks and has performance advantages such as reduced content retrieval time. Besides, IP and NDN in the coexistence network are suited to different traffic models, which facilitates flexible network slicing.

Wireless distributed cache system (WDCS) is a promising technique to offload traffic and improve energy efficiency in content-centric networks. In this paper, the content sharing problem is considered by minimizing the average energy consumption for content caching and delivering in device-to-device (D2D) enabled cellular networks. The problem is formulated as a joint optimization problem of multiple interactive variables, which is NP-hard. In order to solve this problem, we first decompose the original problem into three subproblems, which are content helper (CH) selection, content caching, and content delivering. Specifically, in CH selection, we propose a PageRank based distributed algorithm to estimate the centrality of mobile users (MUs) by jointly analyzing their social relationships and channel conditions. Based on the selected CHs, the content caching and content delivering are formulated into two weighted matching problems. Two belief propagation (BP) based distributed algorithms are then proposed by considering content popularity and channel states to solve the aforementioned problems. Furthermore, based on the correlation of the three subproblems, a heuristic-based alternating iterative optimization method (HAIOM) is proposed to improve the average energy consumption performance of the content delivering of the WDCS. Simulation results show that by jointly optimizing the CH selection, content caching, and content delivering, the proposed scheme is capable of reducing the average energy consumption and the average content delivery delay, as well as of increasing the caching hit ratio.

To resolve inefficient content delivery mechanism in conventional internet-based networks, Content-Centric Networks (CCN) has been proposed for wired and wireless networks. One of issues in wireless CCN-based networks is overhead to achieve reliability on content delivery because CCN uses end-to-end two-way handshake with Interest/content packets. In this paper, a novel protocol to reduce overhead and achieve reliability is proposed. The protocol allows Interest packet to request multiple data packets and multiple data packets to be sent in a row without a Interest packets. The protocol is evaluated through the simulations and the performance improvement is proved.

Information-Centric Networking (ICN) is a paradigm shift from host-to-host Internet Protocol (IP)-based communication to content-based communication. In ICN, the content-retrieval process employs names that are given through different naming schemes such as hierarchical, flat, attribute, and hybrid. Among different ICN architectures, Named-Data Networking (NDN) has gained much interest in the research community and is actively being explored for the Internet of Things (IoT) and sensor networks, and follows a hierarchical naming format. NDN protocol follows a pull-based communication model where the content consumer gets content irrespective of the location of the content provider. The content provider in NDN and sensor networks can be considered to be a distributed database that monitors or controls the environment and caches the sensed data or controls information into their memory. The proposed Name-INtegrated Query (NINQ) framework for NDN-based IoT provides a flexible, expressive, and secure query mechanism that supports content retrieval as well as control and configuration command exchange among various nodes in a smart building. Different use cases are presented in this paper that expand on the behavior of proposed query framework in different scenarios. Simulation results of data collection and exchange of control commands show that proposed query framework significantly improves Interest Satisfaction Rate (ISR), Command Satisfaction Rate (CSR), energy efficiency, and average delay. Moreover, it is evident from the simulation results that proposed query framework significantly reduces the number of transmissions in the network in both data collection and exchange of control command scenarios, which improves the network performance.

The Internet of Things (IoT) has become an integral part of our daily lives and this is possible due to the billions of connected devices. Thanks to the small and cheap sensors with the ubiquity of wireless networks, which form any kind and size of IoT. A huge number of sensors that can exchange various data among themselves make it a basic building block of IoT. Sensor nodes play a major role in IoT but the major issue is resource constraints. As sensor nodes are resource constraints devices, energy conservation is the main objective in most of the networks. This paper proposes an energy-efficient data collection mechanism using dynamic clustering routing. The soft computing technique (Fuzzy Inference System) is used for dynamic clustering with three important network parameters: residual energy, node density, and packet generated. A Wi-Fi enabled mobile coordinator router (MCR) is used to collect data from the cluster head (CH) directly. After gathering data from any CH, it transmits that received data to the gateway using the IEEE803.11 protocol instantly for further processing and applications. The extensive simulations for the proposed scheme show a better performance on different parameters mainly with reference to network life, average data delivery, energy depletion, and average delay.

SummaryThe Vehicular Ad‐hoc Network (VANET) is one of the emerging research areas in recent days, in which accomplishing the robustness and security are the demanding tasks. To obtain these objectives, various offloading‐based techniques are developed in the traditional works. Still, it remains with the limitations of high mobility, no assurance for data acceptance, and limited applicability for multiple data exchange units. Thus, this paper aims to develop a Data Centric Dispatcher Selection (DCDS) algorithm based on data offloading for a secure information exchange in VANET. It aims to enable the cellular‐based VANET connection by using the application layer protocol without taking the Pending Interest (PI)‐based information. Also, the Content Centric Network (CCN) concept is utilized to exchange the data between for upcoming internet. In this environment, the position of own vehicle and neighboring vehicle are known to each vehicle by using the Global Positioning System (GPS) and security messages. Moreover, the communication does not depend on the device's name, but it depends on the content name in CCN. Because of the availability of multiple interfaces in CCN, there is no content loss in the network. During simulation, various performance measures are used to evaluate the performance of the proposed technique, which includes throughput, packet loss rate, average end‐to‐end delay, total Satisfied Interest Packet (SIP), Forwarded Interest Packet (FIP), and average Interest Satisfactory Delay (ISD). Also, the superiority of this paper is proved by comparing it with some existing techniques such as Internet Protocol Television Quality of Service (IPTV‐QoS), Michael Oche (MO), and RobUst Forwarder Selection (RUFs).

On-path caching based on content relevance in Information-Centric Networking

Despite the abundance of studies on signal progression for arterial roads, most existing models for bandwidth maximization cannot concurrently ensure that the resulting delays will be at a desirable level, especially for urban arterials accommodating high turning volume at some major intersections or constrained by limited turning bay length. Extending from those models that aim to address delay minimization in the progression design, this study provides two enhanced progression maximization models for arterials with high turning volumes. The first model aims to select the signal plan that can produce the lowest total signal delays for all movements from the set of non-inferior offsets produced by MAXBAND. Failing to address the impact of potential turning bay spillback at some critical intersections under such a design may significantly degrade the quality of through progression and increase the overall delay. For this reason, the second model proposed in this study offers the flexibility to trade the progression bandwidths within a pre-specified level for the target delay reduction, especially for turning traffic. The evaluation results from both numerical analyses and simulation experiments have shown that both proposed models can produce the desirable level of performance when compared with the two benchmark models, MAXBAND and TRANSYT 16. The second model yielded the lowest average network delay of 117.2 seconds per vehicle (s/veh), compared with 121.7 s/veh with TRANSYT. Moreover, even its average delay of 141.8 s/veh for through vehicles is comparable with that of 141.2 s/veh by MAXBAND, which is designed mainly to benefit through-traffic flows.