Hyperbolic Routing for Cache Privacy in Information Centric Networking
Sean Cannan, Andrew Jones, Robert Paul Simon · 2023
Information Centric Networking (ICN) represents an emerging paradigm for information distribution, whereby data is identified by its name rather than its network location. ICNs are expected to increase system scalability and throughput through schemes such as in-network caching. Due to dramatic overhead reduction, novel Hyperbolic Routing (HR) methods are being considered to support ICN networks. This paper considers the use of HR to support ICN caching in relationship to consumer privacy and routing performance. We first describe general cache privacy policies, and then outline a procedure for assigning hyperbolic coordinates. Next, we present an algorithm to construct cache clusters using hyperbolic Voronoi diagrams. Finally, we compare the performance of HR to traditional Link State (LS) routing protocols under a number of caching scenarios. Our results show that for applications such as content retrieval HR has competitive performance with LS with the advantage of reduced overhead.