arXiv subjects

Neminath Hubballi

Publications and source records attributed to Neminath Hubballi.

3 recordsLinked to original sources

arXiv2026

Content Caching Methods in Named Data Networks

Information Centric Networking (ICN) is a new network architecture (Internet) that focuses on content rather than the end-hosts. Named Data Networking (NDN) is a specific implementation of ICN, which relies on the use of named data and a request-response model for content distribution. These Internet architectures are known for their ability to cache content at the network level. Many caching techniques have been designed as part of various ICN/NDN projects. Caching techniques help improve the content delivery performance by storing content in the router to meet future demand. In this survey, we provide a structured review of caching algorithms designed for ICN, with a particular emphasis on NDN. We first present a taxonomy of caching techniques, followed by a detailed discussion of the various methods. Alongside their working principles, we also summarize their advantages and disadvantages. Finally, we discuss the performance metrics commonly used in the literature to evaluate caching methods and outline directions for future research in this area.

cs.NI↗

arXiv2025

CPePC: Cooperative and Predictive Popularity based Caching for Named Data Networks

Caching content is an inherent feature of Named Data Networks. Limited cache capacity of routers warrants that the choice of content being cached is judiciously done. Existing techniques resort to caching popular content to maximize utilization. However, these methods experience significant overhead for coordinating and estimating the popularity of content. To address this issue, in this paper, we present CPePC, which is a cooperative caching technique designed to improve performance. It accomplishes this through a combination of two factors. First, CPePC enhances efficiency by minimizing the overhead of popularity estimation. Second, it forecasts a parameter that governs caching decisions. Efficiency in popularity estimation is achieved by dividing the network into several non-overlapping communities using a community estimation algorithm and selecting a leader node to coordinate this on behalf of all the nodes in the community. CPePC bases its caching decisions by predicting a parameter whose value is estimated using current cache occupancy and the popularity of the content into account. We present algorithms for community detection, leader selection, content popularity estimation, and caching decisions made by the CPePC method. We evaluate and compare it with six other state-of-the-art caching techniques, with simulations performed using a discrete event simulator to show that it outperforms others.

cs.NI↗

arXiv2020

Preventing Time Synchronization in NTP's Broadcast Mode

Network Time Protocol (NTP) is used by millions of hosts in Internet today to synchronize their clocks. Clock synchronization is necessary for many network applications to function correctly. Unsynchronized clock may lead to failure of various core Internet services including DNS and RPKI based interdomain routing and opens path for more sophisticated attacks. In this paper, we describe a new attack which can prevent a client configured in NTP's broadcast mode from synchronizing its clock with the server. We test the attack in real networks and show that it is effective in both authenticated and unauthenticated broadcast/multicast modes of NTP. We also perform experiments to measure the overall attack surface by scanning the entire IPv4 address space and show that NTP broadcast mode is being used in the wild by several low stratum (highly accurate) hosts. We also suggest few countermeasures to mitigate the proposed attack.

cs.CR↗