Proceedings of the 1st ACM Conference on Information-Centric Networking 2014
DOI: 10.1145/2660129.2660145
|View full text |Cite
|
Sign up to set email alerts
|

Congestion-aware caching and search in information-centric networks

Abstract: The performance of in-network caching in informationcentric networks, and of cache networks more generally, is typically characterized by network-centric performance metrics such as hit rate and hop count, with approaches to locating and caching content evaluated and optimized for these metrics. We believe that user-centric performance metrics, in particular the delay from when a content request is made by the user to the time at which the requested content has been completely downloaded, are also important. F… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
43
0
1

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 76 publications
(44 citation statements)
references
References 14 publications
0
43
0
1
Order By: Relevance
“…A probabilistic storage based heuristic caching method, the content with higher popularity and greater placement earnings can have a greater caching probability have been proposed [19]. Badov et al [20] proposed a congestion perception and lookup mechanism, which caches the more helpful content to alleviate congestion and considers low bandwidth load of links preferentially when forwarding request messages. These schemes have a better performance in the cache hit ratio and bandwidth saving, however, most of them, assuming content popularity is a known parameter, besides, there is no clear description information that how to obtain and maintain content popularity by the router.…”
Section: 2caching Scheme Based On Content Popularitymentioning
confidence: 99%
“…A probabilistic storage based heuristic caching method, the content with higher popularity and greater placement earnings can have a greater caching probability have been proposed [19]. Badov et al [20] proposed a congestion perception and lookup mechanism, which caches the more helpful content to alleviate congestion and considers low bandwidth load of links preferentially when forwarding request messages. These schemes have a better performance in the cache hit ratio and bandwidth saving, however, most of them, assuming content popularity is a known parameter, besides, there is no clear description information that how to obtain and maintain content popularity by the router.…”
Section: 2caching Scheme Based On Content Popularitymentioning
confidence: 99%
“…The methods Refs. [14] and [15] are the promising methods in the congestion aware approach. In these methods, each router caches the high congestion-cost content in order to alleviate congestion.…”
Section: Cache Management In Ccnmentioning
confidence: 99%
“…The method Ref. [14] considers the situation multiple content flows share one bottleneck link. The method Ref.…”
Section: Cache Management In Ccnmentioning
confidence: 99%
See 1 more Smart Citation
“…[15], [8]) while others deal with caching mechanisms based on selective insertion and replacement in cache (e.g. [11], [1], [6], [10]). The first class of approaches is appropriate for small-scale controlled environments like a CDN (Content Delivery Network), where topology and content catalog are known a priori.…”
Section: Related Workmentioning
confidence: 99%