On the Delay Scaling Laws of Cache Networks

2013/10/02 by Boram Jin, Se-Young Yun, Jin, Boram +11
Computer Science · #Caching and Content Delivery #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #Opportunistic and Delay-Tolerant Networks #Peer-to-Peer Network Technologies #cs.NI

paper · pdf · doi:10.48550/arxiv.1310.0572

10 pages, 7 figures

openalex publication_date 2013/10/02 · arxiv created 2013/10/04 · arxiv updated 2013/10/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The Internet is becoming more and more content-oriented, where one of main components in content-oriented Internet architectures is network caching. Despite a surge of extensive use of network cashing in the current and future Internet architectures, analysis on the performance of general cache networks are still quite limited due to complex inter-plays among various components and thus analytical intractability. We study asymptotic delay performance of cache networks, in particular, focusing on the impact of heterogeneous content popularities and nodes' geometric `importances' in caching policies. Our theoretical findings provide useful engineering implications such as when and how various factors have impact on caching performance, and we provide extensive simulation results on the real Internet topology.

Related

• You Really Need A Good Ruler to Measure Caching Performance in Information-Centric Networks
• On the Delay of Geographical Caching Methods in Two-Tiered Heterogeneous\n Networks
• Scaling Laws of the Throughput Capacity and Latency in Information-Centric Networks
• Impact of traffic mix on caching performance in a content-centric network
• Throughput and Delay Scaling of Content-Centric Ad Hoc and Heterogeneous\n Wireless Networks