2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) 2017
DOI: 10.1109/icdcs.2017.306
|View full text |Cite
|
Sign up to set email alerts
|

BIG Cache Abstraction for Cache Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 11 publications
0
5
0
Order By: Relevance
“…1 Fig. 1 illustrates an example of such a network, which is consistent with the YouTube video delivery system [4]. We use C to denote the set of network caches, S to denote the set of users, and L to denote the set of communication links that connect the network caches, routers, and users.…”
Section: System Modelmentioning
confidence: 99%
See 3 more Smart Citations
“…1 Fig. 1 illustrates an example of such a network, which is consistent with the YouTube video delivery system [4]. We use C to denote the set of network caches, S to denote the set of users, and L to denote the set of communication links that connect the network caches, routers, and users.…”
Section: System Modelmentioning
confidence: 99%
“…We now discuss the content placement (CoP) problem, which entails deciding p c,v , the indicator function that network cache c stores video version v, for all c and v. As discussed in Section II, a major challenge to our optimization problem (1a)-(1f) is that the vector p needs to be updated much less frequently than the vector z. To address this challenge, we introduce pseudo-variables z := [z s,c,v ] and p := [p s,c,v ], which can be updated much more frequently than p, to replace z and p. 4 We only update p, the real content placement, after p converges. Also, we relax (1f) by allowing p c,v and z s,c,v to be any real number between 0 and 1.…”
Section: The Content Placement Problem (Cop)mentioning
confidence: 99%
See 2 more Smart Citations
“…Furthermore, caches can be cooperative or non-cooperative, where cooperative caching requires state exchange (and traffic if necessary) between caches. "Big Cache" [28], for example, abstracts the multiple caches into one single big storage and caches work collaboratively to improve system performance. Finally, it is worthy to note that other factors from real world such as delay, bandwidth constraints also play important roles in designing a practical caching system, which makes the problem even more complicated.…”
Section: A Design Space Of In-network Caching Systemsmentioning
confidence: 99%