Please use this identifier to cite or link to this item:
http://hdl.handle.net/10773/41639
Title: | Controller-driven vector autoregression model for predicting content popularity in programmable named data networking devices |
Author: | Qaiser, Firdous Hussain, Mudassar Ahad, Abdul Pires, Ivan Miguel |
Keywords: | Information centric networking (ICN) NDN SDN Content caching Caching placement Vector autoregression (VAR) |
Issue Date: | 8-Feb-2024 |
Publisher: | PeerJ |
Abstract: | Named Data Networking (NDN) has emerged as a promising network architecture for content delivery in edge infrastructures, primarily due to its name-based routing and integrated in-network caching. Despite these advantages, sub-optimal performance often results from the decentralized decision-making processes of caching devices. This article introduces a paradigm shift by implementing a Software Defined Networking (SDN) controller to optimize the placement of highly popular content in NDN nodes. The optimization process considers critical networking factors, including network congestion, security, topology modification, and flowrules alterations, which are essential for shaping content caching strategies. The article presents a novel content caching framework, Popularity-aware Caching in Popular Programmable NDN nodes (PaCPn). Employing a multi-variant vector autoregression (VAR) model driven by an SDN controller, PaCPn periodically updates content popularity based on time-series data, including 'request rates' and 'past popularity'. It also introduces a controller-driven heuristic algorithm that evaluates the proximity of caching points to consumers, considering factors such as 'distance cost,' 'delivery time,' and the specific 'status of the requested content'. PaCPn utilizes customized DATA named packets to ensure the source stores content with a valid residual freshness period while preventing intermediate nodes from caching it. The experimental results demonstrate significant improvements achieved by the proposed technique PaCPn compared to existing schemes. Specifically, the technique enhances cache hit rates by 20% across various metrics, including cache size, Zipf parameter, and exchanged traffic within edge infrastructure. Moreover, it reduces content retrieval delays by 28%, considering metrics such as cache capacity, the number of consumers, and network throughput. This research advances NDN content caching and offers potential optimizations for edge infrastructures. |
Peer review: | yes |
URI: | http://hdl.handle.net/10773/41639 |
DOI: | 10.7717/peerj-cs.1854 |
Appears in Collections: | ESTGA - Artigos IT - Artigos |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
peerj-cs-1854.pdf | 11.93 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.