MICN: a network coding protocol for ICN with multiple distinct interests per generation

07/02/2020
by   H. Malik, et al.
0

In Information-Centric Networking (ICN), consumers send interest packets to the network and receive data packets as a response to their request without taking care of the producers, which have provided the content, contrary to conventional IP networks. ICN supports the use of multiple paths; however, with multiple consumers and producers, coordination among the nodes is required to efficiently use the network resources. Network coding (NC) is a promising tool to address this issue. The challenge in the case of NC is to be able to get independent coded content in response to multiple parallel interests by one or several consumers. In this work, we propose a novel construction called MILIC (Multiple Interests for Linearly Independent Contents) that impose constraints on how the replies to interests are coded, intending to get linearly independent contents in response to multiple interests. Several protocol variants, called MICN (MILIC-ICN), built on top of NDN (Named Data Networking), are proposed to integrate these interest constraints and NC of data packets. Numerical analysis and simulations illustrate that the MILIC construction performs well and that the MICN protocols are close to optimal throughput on some scenarios. MICN protocols compare favorably to existing protocols and show significant benefits when considering the total number of transmitted packets in the network, and in the case of high link loss rate.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/04/2021

BLEnD: Improving NDN Performance Over Wireless Links Using Interest Bundling

Named Data Networking (NDN) employs small-sized Interest packets to retr...
research
08/01/2018

Network-Coding Approach for Information-Centric Networking

The current internet architecture is inefficient in fulfilling the deman...
research
01/22/2019

Probabilistic Forwarding of Coded Packets on Networks

We consider a scenario of broadcasting information over a network of nod...
research
05/18/2021

An Analysis of Probabilistic Forwarding of Coded Packets on Random Geometric Graphs

We consider the problem of energy-efficient broadcasting on dense ad-hoc...
research
01/07/2019

The Effect of Introducing Redundancy in a Probabilistic Forwarding Protocol

This paper is concerned with the problem of broadcasting information fro...
research
09/30/2021

An Efficient Probe-based Routing for Content-Centric Networking

With the development of new technologies and applications, such as Inter...
research
06/20/2020

Packet Completion Time Minimization via Joint D2D and Cellular Communication: A Unified Network Coding Approach

This paper tackles the problem of transmitting a common content to a num...

Please sign up or login with your details

Forgot password? Click here to reset