Demand-Aware Content Distribution Srinivas Shakkottai Texas A&M - - PowerPoint PPT Presentation

demand aware content distribution
SMART_READER_LITE
LIVE PREVIEW

Demand-Aware Content Distribution Srinivas Shakkottai Texas A&M - - PowerPoint PPT Presentation

Demand-Aware Content Distribution Srinivas Shakkottai Texas A&M University Hybrid content distribution High level idea: Use P2P dissemination to assist traditional client- server methods, e.g., content delivery network (CDN). Key


slide-1
SLIDE 1

Demand-Aware Content Distribution

Srinivas Shakkottai

Texas A&M University

slide-2
SLIDE 2

Hybrid content distribution

High level idea: Use P2P dissemination to “assist” traditional client- server methods, e.g., content delivery network (CDN). Key question: How should the two methods be combined?

slide-3
SLIDE 3

Outline

  • Demand Evolution
  • Service models: CDN, P2P, and hybrid
  • Comparison
  • File arrivals: heavy traffic and multiplexing
  • Future work
slide-4
SLIDE 4

Demand Evolution

slide-5
SLIDE 5

Bass model (1969)

1 2 3 N

  • Total user population of size N.
  • Exponentially distributed transition rates.
  • Effect of advertising captured by K.
  • “Word-of-mouth” propagation of interest adds to

transition rate.

  • K + 1

N

  • (N − 1)
  • K + 2

N

  • (N − 2)
  • K + N−1

N

slide-6
SLIDE 6

Fluid model

  • Total user population of size N (infinitely divisible)
  • I(0) : initial number of interested users
  • Effect of advertising captured by K.
  • Interested users select other users at random

Fraction of interested users Random user is not interested Advertising

dI(t) dt =

  • K + I(t)

N

  • (N − I(t))
slide-7
SLIDE 7

Single file demand model

  • This demand model is a version of the Bass model with
  • nly word of mouth propagation.
  • Solution:

t I(t)

I(t) =

NI(0)et N−I(0)+I(0)et

slide-8
SLIDE 8

Propagation in Power Law Graphs

  • Thresholds for virus spread on networks, Draief et al.
  • The Effect of Network Topology on the Spread of

Epidemics, Ganesh et al.

  • Interested users never leave, so demand is not

modulated by supply.

slide-9
SLIDE 9

Data from CoralCDN

  • CoralCDN is a distributed

network running on PlanetLab.

  • Duplicates popular files,

http://www.cnn.com.nyud.net

  • Data on multiple popular

video files on the Asian Tsunami courtesy M.Freedman.

5 10 15 20 25 200 400 600 800 1000 1200 1400 Day Cumulative Views

slide-10
SLIDE 10

Supplying Demand

slide-11
SLIDE 11

Service models

  • CDN: Use a bank of servers
  • P2P: Use peer-to-peer

dissemination

  • Hybrid: Use both

Which has the best delay performance as N scales?

!"#$%&'($#'$( )*)+ ,-./0'1$ 2$03$'34 )*)+ ,-./0'1$ ,'3%54$#4 ,'3%54$#4 !"'($'( !"'($'(

  • P (t) denotes cumulative service up to t.
  • Work conserving service assumed:

 total delay = area between I(t) and P(t).

slide-12
SLIDE 12

Service model I: C-D

Installed server capacity: C users per unit time I(t) P(t) t Service follows interest as long as dI/dt < C, i.e., until t1 … t1 t2

slide-13
SLIDE 13

Service model I: CDN

Installed server capacity: C users per unit time I(t) P(t) t … after which interested users have to wait (until t2). t1 t2

slide-14
SLIDE 14

Service model I: CDN

Proposition: P(t) = I(t) for t [ 0, t1], and t [t2, ), and P(t) < I(t) for t (t1,t2), where t1 Θ(ln(C/I(0)); I(t1) Θ(C), and t2 Θ(N/C); I(t2) Θ(N) Further, the area between I(t) and P(t) scales as Θ(N2/C). ∈ ∞ ∈ ∈ ∈ ∈ ∈ ∈

slide-15
SLIDE 15

Service model II: P2P

  • Model motivated by Bass diffusion
  • Assume that “efficiency of sharing” given by

parameter ν

  • Random peer selection
  • Can be solved explicitly

dP (t) dt

= ν(I(t) − P(t)) P (t)

N

slide-16
SLIDE 16

Service model II: P2P

Comparison of interest and service curves: I(t) t At time t = ln N, I(t) ~ N while P(t) ~ 0 … P(t)

slide-17
SLIDE 17

Service model II: P2P

Comparison of interest and service curves: I(t) P(t) t … but by time t = 2 ln N, I(t) ~ N and P(t) ~ N.

slide-18
SLIDE 18

Service model II: P2P

Proposition: P(t) ≈ I(t) for t ≥ 2 ln N. Further, the area between the interest and service curves scales as Θ(N ln(N/P(0)) ).

slide-19
SLIDE 19

Service model III: Hybrid

  • CDN does well until interest overloads servers
  • P2P does well once installed user base is large
  • Consider a hybrid scheme where:
  • CDN used until t1 = Θ( ln (C / I(0)) )
  • P2P used thereafter
slide-20
SLIDE 20

Service model III: Hybrid

Proposition: For the hybrid scheme, the area between the interest and service curves scales as O( N ln(N/C) ) if C = o(N).

slide-21
SLIDE 21

Comparison

Per user delay is: Θ(N/C) for CDN; Θ( ln(N/P(0)) ) for P2P; O( ln(N/C) ) for hybrid. Choice of dissemination method will depend on cost structure of capacity. We now develop an example to study this.

slide-22
SLIDE 22

Example

Per user delay using C = N / ln N: Θ(ln N) for CDN; Θ(ln N) for P2P; O( ln ln N ) for hybrid. Capacity gain of ln N or equivalently, delay gain of the same order.

slide-23
SLIDE 23

C-D versus P2P

Centralized Distribution P2P Distribution

slide-24
SLIDE 24

Hybrid Scheme

  • Combines initial

centralized distribution with later use of P2P.

  • Central server is used
  • nly to “boost”.
  • Early estimate of total

population allows us to determine “switching point” to guarantee an average delay.

slide-25
SLIDE 25

Simultaneous use of C-D and P2P

5 10 15 20 25 30 35 1 2 3 4 5 6 7 8 9 10 x 10

4

Time Cumulative Demand and Service

  • Why have a distinct

threshold?

  • Use both C-D ad P2P

initially  P2P has no effect.

  • Use C-D to “boost” if

required in the latter phase  C-D has no effect.

slide-26
SLIDE 26

Dynamic File Arrivals

slide-27
SLIDE 27

Data from CoralCDN

  • CDN has to handle

multiple files.

  • Load binned using per

minute binning.

  • Traffic is bursty.
slide-28
SLIDE 28

File Arrivals

Suppose now that a content distributor uses a CDN to simultaneously handle dynamic file arrivals. Consider a flow level fluid limit where λ = arrival rate of files per unit time. N = Number of potentially interested users in each file. What is the minimum capacity required in order to give an average per user delay guarantee d ?

slide-29
SLIDE 29

Multiple files: Hybrid Approach

  • The available capacity is

multiplexed among different files.

  • Say we serve mN users for

each file using centralized distribution.

  • Minimum required

capacity is CN = λ mN.

slide-30
SLIDE 30

Multiple files: Hybrid Approach

Proposition: (heavy traffic or not?) Use a diffusion approximation of an M/D/1 process. Example: If d = ln ln N, then the heavy traffic regime applies. In case of small desired delay, the P2P phase delay dominates, and “ideal” multiplexing of available capacity may be achieved.

slide-31
SLIDE 31

Conclusions and ongoing work

  • Key insight:

It is possible to quantify the benefit of CDN-assisted P2P dissemination for large system scalings.

  • Ongoing work:

Incentivise users to stay. Handling varied topology effects. Use the QoS expressions as input to algorithm design.

slide-32
SLIDE 32

Long Links and Incentives

  • Each ISP has an incentive to keep traffic within its

infrastructure.

  • Exist P2P algorithms that reveal only a subset of

content instances to peers.

  • Need to create long-links to other ISPs on a need basis.
  • In other words, the navigability of the network needs to

change based on demand.

slide-33
SLIDE 33

Thank you!