Point to Multipoint Streaming Media Delivery Problem Statement - - PowerPoint PPT Presentation

point to multipoint streaming media delivery problem
SMART_READER_LITE
LIVE PREVIEW

Point to Multipoint Streaming Media Delivery Problem Statement - - PowerPoint PPT Presentation

Point to Multipoint Streaming Media Delivery Problem Statement Draft-litao-p2mpsmd-sam-problem-statement-01.txt Tao Li Zhigang Sun Hui Wang Chunbo Jia Taoli.nudt@gmail.com National University of Defense Technology, P.R China SAMRG @


slide-1
SLIDE 1

Point to Multipoint Streaming Media Delivery Problem Statement

Tao Li Zhigang Sun Hui Wang Chunbo Jia

Taoli.nudt@gmail.com National University of Defense Technology, P.R China

Draft-litao-p2mpsmd-sam-problem-statement-01.txt SAMRG @ IRTF Quebec City, July. 28, 2011

slide-2
SLIDE 2

Recall

  • Challenges Facing P2MP Streaming Media

Delivery

  • High QoE (end-users)
  • Optimized resource utilization (ISPs)
  • Efficient and low-cost deployment, maintenance and

management (ISPs/ICPs)

  • Major Problems
  • Network state information (NSI) acquisition
  • Policy-based control (Separation between mechanism and

policy)

slide-3
SLIDE 3

Changes from last version

  • Several editorial improvements
  • More discussion on the existing technologies
  • Ongoing work and preliminary experimental

results (in this presentation)

slide-4
SLIDE 4

Existing Technologies for P2MP Streaming Media Delivery

  • IP multicast (SSM)
  • RTP/RTCP extensions + SSM
  • Application-level overlay (P2P, CDN)
slide-5
SLIDE 5

IP Multicast (SSM)

  • Network resource (Bandwidth ) efficiency
  • Complete Standard protocol architecture

Problems:

Scalability for maintaining state information Commercial implementation support (Accounting, group management, Security)

slide-6
SLIDE 6

RTP/RTCP extensions + SSM

  • Error resilience
  • Monitor and fault isolation
  • More delicate control

Problems:

Real-time Accuracy

slide-7
SLIDE 7

P2P

  • Robustness and resilience
  • Scalability
  • Easy Deployment

Problems:

Profit of ISP Management and resource optimization

slide-8
SLIDE 8

CDN

  • Reliability
  • Manageability
  • Safety

Problems:

Cost Scalability

slide-9
SLIDE 9

Experiments

  • Exp-1: Network state information (NSI)

acquisition

– Real-time monitoring – Accuracy locating

  • Exp-2: Policy-based Control

– Flexibility – Adaptive

slide-10
SLIDE 10

Experimental Setup (Exp-1)

Labelcast Router Stream 1 Stream 2

slide-11
SLIDE 11

DF Value: Delay factor (Normally 5~20)

Experimental Results (Exp-1)

  • Real-time and accurate information of network impairments
  • Labelcast provides data-plane NSI
  • Independent of control plane or upper layer protocol

(b) R3: DF and VBR (Virtual Buffer Rate) (a) R3: DF and MLR

slide-12
SLIDE 12

EXP-2: Parameterized Gradient Based Multicast Routing (PGBMR)

  • Objective
  • An adaptive multicast routing mechanism supporting

parameterized policy-based p2mp streaming media delivery

  • Motivated by
  • PGBR [“An Evaluation of Parameterized Gradient Based Routing With QoE Monitoring

for Multiple IPTV Providers”, ITOB 2010]

slide-13
SLIDE 13

EXP-2: Parameterized Gradient Based Multicast Routing (PGBMR)

PGBR [“An Evaluation of Parameterized Gradient Based Routing With QoE Monitoring for Multiple IPTV

Providers”, ITOB 2010]

slide-14
SLIDE 14

EXP-2: PGBMR Experimental Setup

, , , ,

( ) ( ) ( )

i i

u v s d v u v v s d

G t t l t h αϕ β γ

→ →

= + +

(a) n=100 (a) n=200

Different parameters allow for the different polices

slide-15
SLIDE 15

Group size

10 20 30 40 50

Average total tree cost

200 400 600 800 1000 1200 1400 1600 KPP Jia Our algorithm,α=0.3,β=0.3,γ=0.4 Our algorithm,α=0.2,β=0.2,γ=0.6

Group size

10 20 30 40 50

Average total tree cost

300 400 500 600 700 800 900 1000 1100 KPP Jia Our algorithm,α=0.3,β=0.3,γ=0.4 Our algorithm,α=0.2,β=0.2,γ=0.6

Group size

10 20 30 40 50

Request blocking probability

0.0 .1 .2 .3 .4 .5 KPP Jia Our algorithm,α=0.3,β=0.3,γ=0.4 Our algorithm,α=0.2,β=0.2,γ=0.6

Group size

10 20 30 40 50

Request blocking probability

0.0 .1 .2 .3 .4 .5 KPP Jia Our algorithm,α=0.3,β=0.3,γ=0.4 Our algorithm,α=0.2,β=0.2,γ=0.6

EXP-2: PGBMR Experimental Results

Comparison of Request blocking probability Comparison of total cost of multicast tree From “Greedy Gradient Based Multicast Routing Policy for Dynamic Network, ICMT2011”

slide-16
SLIDE 16

Remarks

  • NSI is essential for real-time monitoring and

accurately locating the impairment of the network.

  • Policy-based control for flexibility is feasible to

be implemented by separating the policies from the mechanism.

slide-17
SLIDE 17

Comments or questions?