Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

UtilCache: Effectively and Practicably Reducing Link Cost in Information-Centric Network (1811.05864v1)

Published 14 Nov 2018 in cs.NI

Abstract: Minimizing total link cost in Information-Centric Network (ICN) by optimizing content placement is challenging in both effectiveness and practicality. To attain better performance, upstream link cost caused by a cache miss should be considered in addition to content popularity. To make it more practicable, a content placement strategy is supposed to be distributed, adaptive, with low coordination overhead as well as low computational complexity. In this paper, we present such a content placement strategy, UtilCache, that is both effective and practicable. UtilCache is compatible with any cache replacement policy. When the cache replacement policy tends to maintain popular contents, UtilCache attains low link cost. In terms of practicality, UtilCache introduces little coordination overhead because of piggybacked collaborative messages, and its computational complexity depends mainly on content replacement policy, which means it can be O(1) when working with LRU. Evaluations prove the effectiveness of UtilCache, as it saves nearly 40% link cost more than current ICN design.

Citations (2)

Summary

We haven't generated a summary for this paper yet.