Download pdf - Time-Shifted TV in Content Centric Networks: the Case for Cooperative In-Network Caching

Time-Shifted TV inContent CentricNetworksthe Case for CooperativeIn-Network CachingZhe LI and Gwendal SIMON

Context

Routers with cache (or Content Routers or CR)an opportunity to revisit content deliverya key element of content centric network

Motivations for ISP :minimize incoming video trafficenter the Content Delivery Network gamereduce overall traffic on intra-ISP links

2 / 11 Z. Li and G. Simon Time-shifted TV in content-centric networks

Context

Routers with cache (or Content Routers or CR)an opportunity to revisit content deliverya key element of content centric network

Motivations for ISP :minimize incoming video trafficenter the Content Delivery Network gamereduce overall traffic on intra-ISP links


Our Focus : Time-shifted TV

Principles :a show broadcasted at t is available at any t + xlet’s surf the TV channelthe killer app of connected TV

A nightmare for TV broadcastersclients skip adsthe cost of servers that both ingest and delivera service that is (yet) not well mastered by CDN


Our Focus : Time-shifted TV

Principles :a show broadcasted at t is available at any t + xlet’s surf the TV channelthe killer app of connected TV

A nightmare for TV broadcastersclients skip adsthe cost of servers that both ingest and delivera service that is (yet) not well mastered by CDN


Objective : maximize in-network hit-ratio

Inputs (or hypothesis) :TV channel : a series of chunks (e.g. 1 min video)each CR reserves storage for time-shifted serviceCCN implemented !

Constraints on in-network caching policiesdistributed and based on local informationdeployed (but not managed) by network operatorsdealing with many small storage capacitiesnot affecting the simplicity of CCN routing


Objective : maximize in-network hit-ratio

Inputs (or hypothesis) :TV channel : a series of chunks (e.g. 1 min video)each CR reserves storage for time-shifted serviceCCN implemented !

Constraints on in-network caching policiesdistributed and based on local informationdeployed (but not managed) by network operatorsdealing with many small storage capacitiesnot affecting the simplicity of CCN routing


Our idea

Least Recently Used (LRU) → collaborative LRUevery CR manages one chunk every k chunkscooperation among linked CRs

CCN with LRU CCN with collaborative cache


Our contributions

A distributed algorithm : assigning “labels” to CRsa NP-complete problema 3

2k −52 approximate algorithm

A set of simulations from an augmented CCNthe description of the new CCN protocolthe evaluation of performances


Our contributions

A distributed algorithm : assigning “labels” to CRsa NP-complete problema 3

2k −52 approximate algorithm

A set of simulations from an augmented CCNthe description of the new CCN protocolthe evaluation of performances


Initialization phase : assign labels to CR

1

2

3

4

5

67

8

9

10

11

12

13

14

15

16

17

18

2

1

4

5

optimized2

1

4

5

3816

optimized

2

1

4

5

3816

conflict

saved but colored

2

1

4

5

3816

11

12

13

9

15

7

conflict

saved and uncolored

2

1

4

5

3816

11

12

13

9

15

10

67

colored by node 10

2

1

4

5

3816

11

12

13

9

15

10

6

1417

7

only node uncolored

2

1

4

5

3816

11

12

13

9

15

10

6

1417

7

18

choose farthest color

sorted list nearest neighbors2 1,4,53 1,8,161 2,3,168 3,11,125 1,2,411 8,12,134 2,5,716 1,3,512 8,9,1115 1,10,1110 2,6,1514 3,16,1717 5,14,1613 11,12,157 2,4,66 2,7,109 8,12,1418 4,5,17



1

2

3

4

5

67

8

9

10

11

12

13

14

15

16

17

18

2

1

4

5

optimized

2

1

4

5

3816

optimized

2

1

4

5

3816

conflict

saved but colored

2

1

4

5

3816

11

12

13

9

15

7

conflict

saved and uncolored

2

1

4

5

3816

11

12

13

9

15

10

67

colored by node 10

2

1

4

5

3816

11

12

13

9

15

10

6

1417

7

only node uncolored

2

1

4

5

3816

11

12

13

9

15

10

6

1417

7

18





1

2

3

4

5

67

8

9

10

11

12

13

14

15

16

17

18

2

1

4

5

optimized

2

1

4

5

3816

optimized

2

1

4

5

3816

conflict

saved but colored

2

1

4

5

3816

11

12

13

9

15

7

conflict

saved and uncolored

2

1

4

5

3816

11

12

13

9

15

10

67

colored by node 10

2

1

4

5

3816

11

12

13

9

15

10

6

1417

7

only node uncolored

2

1

4

5

3816

11

12

13

9

15

10

6

1417

7

18





1

2

3

4

5

67

8

9

10

11

12

13

14

15

16

17

18

2

1

4

5

optimized2

1

4

5

3816

optimized

2

1

4

5

3816

conflict

saved but colored

2

1

4

5

3816

11

12

13

9

15

7

conflict

saved and uncolored

2

1

4

5

3816

11

12

13

9

15

10

67

colored by node 10

2

1

4

5

3816

11

12

13

9

15

10

6

1417

7

only node uncolored

2

1

4

5

3816

11

12

13

9

15

10

6

1417

7

18





1

2

3

4

5

67

8

9

10

11

12

13

14

15

16

17

18

2

1

4

5

optimized2

1

4

5

3816

optimized

2

1

4

5

3816

conflict

saved but colored

2

1

4

5

3816

11

12

13

9

15

7

conflict

saved and uncolored

2

1

4

5

3816

11

12

13

9

15

10

67

colored by node 10

2

1

4

5

3816

11

12

13

9

15

10

6

1417

7

only node uncolored

2

1

4

5

3816

11

12

13

9

15

10

6

1417

7

18





1

2

3

4

5

67

8

9

10

11

12

13

14

15

16

17

18

2

1

4

5

optimized2

1

4

5

3816

optimized

2

1

4

5

3816

conflict

saved but colored

2

1

4

5

3816

11

12

13

9

15

7

conflict

saved and uncolored

2

1

4

5

3816

11

12

13

9

15

10

67

colored by node 10

2

1

4

5

3816

11

12

13

9

15

10

6

1417

7

only node uncolored

2

1

4

5

3816

11

12

13

9

15

10

6

1417

7

18





1

2

3

4

5

67

8

9

10

11

12

13

14

15

16

17

18

2

1

4

5

optimized2

1

4

5

3816

optimized

2

1

4

5

3816

conflict

saved but colored

2

1

4

5

3816

11

12

13

9

15

7

conflict

saved and uncolored

2

1

4

5

3816

11

12

13

9

15

10

67

colored by node 10

2

1

4

5

3816

11

12

13

9

15

10

6

1417

7

only node uncolored

2

1

4

5

3816

11

12

13

9

15

10

6

1417

7

18





1

2

3

4

5

67

8

9

10

11

12

13

14

15

16

17

18

2

1

4

5

optimized2

1

4

5

3816

optimized

2

1

4

5

3816

conflict

saved but colored

2

1

4

5

3816

11

12

13

9

15

7

conflict

saved and uncolored

2

1

4

5

3816

11

12

13

9

15

10

67

colored by node 10

2

1

4

5

3816

11

12

13

9

15

10

6

1417

7

only node uncolored

2

1

4

5

3816

11

12

13

9

15

10

6

1417

7

18




Simulation environment

ISP network configuration :rocketfuel E-bone topology with 87 CR5 servers located near Point of Presence routers130 chunks in every CRaugmented CCN protocol

Time-shifted TV streaming :200 clients and 6 channelsusage extracted from Nielsen measurements 1

1. Three Screen Report Q1, Nielsen Company, June 2010.8 / 11 Z. Li and G. Simon Time-shifted TV in content-centric networks

Diversity of chunks into the whole network

With k = 6, the system caches 60% more different chunks than basic LRU.


ISP Friendliness

The overall cross-domain traffic is reduced by 60%.


Future Works

Improve the evaluationdeploy the augmented CCN on network platformsuse real traces of time-shifters

Toward new in-network caching policiestheoretical framework for policy analysisplay with CR : behavior and capacity


Future Works

Improve the evaluationdeploy the augmented CCN on network platformsuse real traces of time-shifters

Toward new in-network caching policiestheoretical framework for policy analysisplay with CR : behavior and capacity
