Visible to the public Biblio

Filters: Keyword is forwarding  [Clear All Filters]
2022-05-24
Raza, Khuhawar Arif, Asheralieva, Alia, Karim, Md Monjurul, Sharif, Kashif, Gheisari, Mehdi, Khan, Salabat.  2021.  A Novel Forwarding and Caching Scheme for Information-Centric Software-Defined Networks. 2021 International Symposium on Networks, Computers and Communications (ISNCC). :1–8.

This paper integrates Software-Defined Networking (SDN) and Information -Centric Networking (ICN) framework to enable low latency-based stateful routing and caching management by leveraging a novel forwarding and caching strategy. The framework is implemented in a clean- slate environment that does not rely on the TCP/IP principle. It utilizes Pending Interest Tables (PIT) instead of Forwarding Information Base (FIB) to perform data dissemination among peers in the proposed IC-SDN framework. As a result, all data exchanged and cached in the system are organized in chunks with the same interest resulting in reduced packet overhead costs. Additionally, we propose an efficient caching strategy that leverages in- network caching and naming of contents through an IC-SDN controller to support off- path caching. The testbed evaluation shows that the proposed IC-SDN implementation achieves an increased throughput and reduced latency compared to the traditional information-centric environment, especially in the high load scenarios.

2021-09-07
Gameiro, Luís, Senna, Carlos, Luís, Miguel.  2020.  Context-Based Forwarding for Mobile ICNs. 2020 IEEE International Conference on Communications Workshops (ICC Workshops). :1–6.
Over the last couple of decades, mobile ad-hoc networks (MANETs) have been at the forefront of research, yet still are afflicted by high network fragmentation, due to their continuous node mobility and geographical dispersion. To address these concerns, a new paradigm was proposed, Information-Centric Networks (ICN), whose focus is the delivery of Content based on names. This article aims to use ICN concepts towards the delivery of both urgent and non-urgent information in urban mobile environments. In order to do so, a context-based forwarding strategy was proposed, with a very clear goal: to take advantage of both packet Names and Data, and node's neighborhood analysis in order to successfully deliver content into the network in the shortest period of time, and without worsening network congestion. The design, implementation and validation of the proposed strategy was performed using the ndnSIM platform along with real mobility traces from communication infrastructure of the Porto city. The results show that the proposed context-based forwarding strategy presents a clear improvement regarding the Data resolution, while maintaining network overhead at a constant.
2020-05-26
Chatterjee, Tanusree, Ruj, Sushmita, DasBit, Sipra.  2018.  Data forwarding and update propagation in grid network for NDN: A low-overhead approach. 2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS). :1–6.
Now-a-days Internet has become mostly content centric. Named Data Network (NDN) has emerged as a promising candidate to cope with the use of today's Internet. Several NDN features such as in-network caching, easier data forwarding, etc. in the routing method bring potential advantages over conventional networks. Despite the advantages, there are many challenges in NDN which are yet to be addressed. In this paper, we address two of such challenges in NDN routing: (1) Huge storage overhead in NDN router (2) High communication over-heads in the network during propagation of routing information updates. We propose changes in existing NDN routing with the aim to provide a low-overhead solution to these problems. Here instead of storing the Link State Data Base (LSDB) in all the routers, it is kept in selected special nodes only. The use of special nodes lowers down the overall storage and update overheads. We also provide supporting algorithms for data forwarding and update for grid network. The performance of the proposed method is evaluated in terms of storage and communication overheads. The results show the overheads are reduced by almost one third as compared to the existing routing method in NDN.