2013/11/30 by Liang Wang, Wang, Liang, Suzan Bayhan +3
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
paper · pdf · doi:10.48550/arxiv.1312.0133
openalex publication_date 2013/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We model the cooperation policy with only two parameters -- search radius r and number of copies in the network Ncopy. These two parameters represent the range of cooperation and tolerance of duplicates. We show how cooperation policy impacts content distribution, and further illustrate the relation between content popularity and topological properties. Our work leads many implications on how to take advantage of topological properties in in-network caching strategy design.