BEAD: Best Effort Autonomous Deletion in Content-Centric Networking

TL;DR

This paper introduces BEAD, a protocol for content producers to delete cached content in Content-Centric Networking, addressing a key challenge of content management in in-network caches.

Contribution

It proposes a secure, lightweight protocol for autonomous content deletion in CCN, with multiple routing strategies and performance analysis.

Findings

BEAD effectively enables content deletion in simulations.

Different routing methods balance overhead and success rate.

BEAD maintains security and efficiency in content removal.

Abstract

A core feature of Content-Centric Networking (CCN) is opportunistic content caching in routers. It enables routers to satisfy content requests with in-network cached copies, thereby reducing bandwidth utilization, decreasing congestion, and improving overall content retrieval latency. One major drawback of in-network caching is that content producers have no knowledge about where their content is stored. This is problematic if a producer wishes to delete its content. In this paper, we show how to address this problem with a protocol called BEAD (Best-Effort Autonomous Deletion). BEAD achieves content deletion via small and secure packets that resemble current CCN messages. We discuss several methods of routing BEAD messages from producers to caching routers with varying levels of network overhead and efficacy. We assess BEAD performance via simulations and provide a detailed analysis of its properties.