A dense memory representation using bitmap data structure for improving NDN push-traffic model

Abstract

The exponential growth of the Internet demands in return new technologies and protocols that can handle the new requirements of such growth efficiently. Such developments have enabled and offered many new services with sophisticated requirements that go beyond the TCP/IP host-centric model capabilities and increase its complexity. Researchers have proposed new architecture called Named-Data Networking (NDN) for Information-Centric Networking (ICN) based on a strict pull-based model as an alternative option to TCP/IP. This model has gained significant attention in the research field. However, this model still suffers from the looped data redundancy problem, which may lead to frequent link failures when dealing with real-time streaming due to the persistent interest packets. In this paper, a push-based model along with a bitmap algorithm has been proposed for improving the ICN efficiency by eliminating such problems. The presented model involved extensive experimental simulations. The experimental results demonstrate the model feasibility by preventing most of the data redundancy and improving the harmonic rein of frequent link failures respectively.