Professional Documents
Culture Documents
Sem Borst
• Live broadcast TV
• User-generated content
2
Optimal content placement
VHO
IO
CO
DSLAM
STB
3
Greedy content placement strategy
4
Optimal content placement (cont’d)
5
Optimal content placement (cont’d)
VHO
IO
CO
DSLAM
STB
6
Optimal content placement (cont’d)
root node
parent node
leaf nodes
1 2 M
7
Optimal content placement (cont’d)
Some notation
Then
c 0 + ci j =i
c
0 j =0
fij :=
0 j = −1
c0 + ci − cij j 6= −1, 0, i
represents transport cost savings achieved by transferring
data to leaf node i from node j instead of root node
8
Optimal content placement (cont’d)
9
Inter-level cache cooperation
Proposition
10
Intra-level cache collaboration
11
Intra-level cache cooperation (cont’d)
13
Case M c ≥ (M − 1)c0
root node
parent node
leaf nodes
1 2 M
0 =1
• Highly popular (red): replicated in all leafs pn = 1, qn
root node
parent node
leaf nodes
1 2 M
0 =1
• Highly popular (red): replicated in all leafs pn = 1, qn
16
Local-Greedy algorithm (cont’d)
17
Local-Greedy algorithm (cont’d)
18
Numerical experiments
1 1
Performance ratio
No replication No replication
Random Random
0.5 0.5
0 0
0 2500 5000 0 2500 5000
Number of requests received Number of requests received
20
Some observations