Design and Analysis of Single-source and Layer Multicast - - PowerPoint PPT Presentation

design and analysis of single source and
SMART_READER_LITE
LIVE PREVIEW

Design and Analysis of Single-source and Layer Multicast - - PowerPoint PPT Presentation

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Design and Analysis of Single-source and Multisource Application Design and Analysis of Single-source and Layer Multicast Multisource


slide-1
SLIDE 1

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols

Chia-Hui Huang

Department of Computer Science and Information Engineering, National Taipei University of Technology Taiwan, ROC.

1/60

slide-2
SLIDE 2

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Outline

Outline

  • Background
  • Motivation
  • The Proposed Research Plan
  • Work Accomplished
  • Work Remaining
  • Conclusion

2/60

slide-3
SLIDE 3

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Background

Background

  • Multicast Communication
  • Allowing a host or a group of hosts to send data packets

to a group of hosts

  • Entities of Multicast
  • Source, Receiver, and Multicast Group
  • Multicast Routing Architecture
  • IP Multicast, Application Layer Multicast (ALM), and

Multiple Unicast

3/60

slide-4
SLIDE 4

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Background

Background (cont.)

  • IP Multicast, ALM, and Multiple Unicast

A

M

Source

A

R

S

R

1

R

2

R

B

R

C

R

B

M

C

M

1

M

IPM tree link Physical link Multicast group member Network router ALM tree link MU tree link

Source

A

M

1

M

C

M

B

M

1

R

2

R

S

R

A

R

B

R

C

R

(a) (b) (c)

A

M

Source

A

R

S

R

1

R

2

R

B

R

C

R

B

M

C

M

1

M

3 hops 3 hops 4 hops 3 hops 5 hops 5 hops 4 hops 4 hops

4/60

slide-5
SLIDE 5

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Background

Background (cont.)

  • Compontents of a Multicast Routing Protocol
  • Group Management
  • Multicast Routing
  • IP Multicast
  • Group Management - Internet Group Management

Protocol (IGMP)

  • Multicast Routing - DVMPR, PIM-SM/DM, MOSPF,

CBT, etc.

  • ALM
  • Group Management - P2P Overlay Network
  • Multicast Routing - ESM, NICE, TAG, ALMI, HMTP, etc.

5/60

slide-6
SLIDE 6

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Background

Background (cont.)

  • Challenges and Issues
  • IP Multicast
  • Network Management Issues
  • Congestion Control
  • Security Issues
  • ALM
  • Performance Penalty
  • Applications of Multicast
  • Video Conference
  • File Sharing
  • Internet TV
  • ...

6/60

slide-7
SLIDE 7

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Motivation

Motivations

  • Propose a multisource ALM routing with fast route

recovery

  • Analyze routing cost
  • Analyze the performance penalty of ALM routing
  • Derive minimum cost of multisource ALM routing
  • Explore design guidelines for single-source and multisource

ALM routing

  • Improve the cost of the proposed multisource ALM routing

scheme while maintaining the advantage of fast route recovery

7/60

slide-8
SLIDE 8

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols The Proposed Research Plan

Research Plan

Multisource ALM routing design : fast route recovery Multisource ALM routing design : fast route recovery and cost- effective routing Practical Routing Protocol Design Theoretical Routing Cost Analysis Improved Routing Protocol Design Minimum cost for comparing different multisource ALM routing Multisource ALM Routing Protocol Single-source ALM Routing Protocol Design guideline for designing ALM routing Characterize the behavior of ALM performance penalty Design guideline for designing ALM routing

8/60

slide-9
SLIDE 9

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols The Proposed Research Plan

Plan - Practical Routing Design

Multisource ALM Routing Protocol: Fast Route Recovery

design an ALM routing scheme that supports multisource multicast and fast route recovery in a dynamic membership network environment.

9/60

slide-10
SLIDE 10

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols The Proposed Research Plan

Plan - Theoretical Routing Cost Analysis

  • The effects of network size and group size on the

performance penalty of minimum cost of single-source ALM routing

  • Cost analysis of multisource ALM routing: the minimum

cost

  • Design guidelines for providing a reference while designing

an ALM routing protocol.

10/60

slide-11
SLIDE 11

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols The Proposed Research Plan

Plan - Improved Routing Protocol Design

Multisource ALM Routing Protocol: Fast Route Recovery and Cost-effective

design a cost-effective multisource ALM routing based on the one developed in the first topic by adapting the guidelines investigated in the second topic.

11/60

slide-12
SLIDE 12

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Work Accomplished - Practical Routing Design: Fast Route Recovery

  • Methodology

Routing Protocol Design

Mesh-first approach Source-specific tree

Simulation

OMNeT++ & INET Framework

  • Distributed Data Forwarding Table, DDFT.
  • Join/Leave
  • Data Delivery
  • Recovery

12/60

slide-13
SLIDE 13

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

DDFT - Join

  • Neighbor Information Table (NIT)
  • < NeighborAddress : HopCount > tuple
  • Member Join Operation

Group Creator Member1 Member2

  • 1. Join

Request

  • 2. Join

Response

  • 3. Probe / 4. Probe response

( member information )

Neighbor 2 Address : Hop count Neighbor 1 Address : Hop count Neighbor Information Table

(a) (b)

... Neighbor n Address : Hop count

Member 1's Address : Hop count NIT Member 2's Address : Hop count Group Creator’s Address : Hop count NIT Member 2's Address : Hop count Group Creator’s Address : Hop count NIT Member 1's Address : Hop count

  • 3. Probe / 4. Probe response

Requester

13/60

slide-14
SLIDE 14

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

DDFT - Join (cont.)

GC M3 M2 M1 Join Request Join Response ( Member: GC ) (b) M1's Address : 2 GC’s NIT GC’s Address : 2 M1's NIT M4 M5 GC M3 M2 M1 Join Request Join Response ( Members: GC, M1 ) (c) M1's Address : 2 GC’s NIT GC’s Address : 2 M1's NIT M4 M5 GC’s Address : 4 M2's NIT Probe Response M1's Address : 4 M2's Address : 4 M2's Address : 4 R1 R2 R3 R4 (a) GC M1 M4 M5 M2 M3 R5

R1 R2 R3 R4 (d) GC M1 M4 M5 M2 M3 R5 M2's NIT M1's NIT GC’s NIT M1's Address : 2 M2's Address : 4 M3's Address : 5 M4's Address : 3 M5's Address : 4 GC’s Address : 2 M2's Address : 4 M3's Address : 5 M4's Address : 3 M5's Address : 4 GC’s Address : 4 M1's Address : 4 M3's Address : 3 M4's Address : 3 M5's Address : 4 GC’s Address : 5 M1's Address : 5 M2's Address : 3 M4's Address : 4 M5's Address : 5 M3's NIT GC’s Address : 3 M1's Address : 3 M2's Address : 3 M3's Address : 4 M5's Address : 3 M4's NIT GC’s Address : 4 M1's Address : 4 M2's Address : 4 M3's Address : 5 M4's Address : 3 M5's NIT GC M1 M5 M3 M2 M4 (e)

  • Leave
  • Send a leave message to neighbors

14/60

slide-15
SLIDE 15

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

DDFT - Data Delivery

  • The proposed transmission-forwarding procedure
  • Receiver Set
  • Source initiated multicast
  • A multicast source selects the smallest hop count

neighbors from its NIT,

  • Update the Receiver Set(remove the selected neighbors

from Receiver Set),

  • Transmit multicast data to all of these next hop neighbors

Source first hop member(s) hop member(s) . . . RS 0 = {All Receivers} – {the first-hop member(s)} RS 0 RS 1 = RS 0 – {the second-hop member(s)} RS 1 RS (n -1) RS n = RS (n-1) – {the nth-hop member(s)} = NULL RS : Receiver set

th

n

15/60

slide-16
SLIDE 16

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

DDFT - Data Delivery (cont.)

M1 GC M4 M2 M5 M3 { M2, M3, M4, M5 } { M2, M3, M5 } { M3 } prune

(b)

M2

(c)

M3 M4 GC M1 M5 GC M1 M5 prune { GC, M1, M5 }

R1 R2 R3 R4

(a)

GC M1 M4 M5 M2 M3 R5 NIT NIT NIT M1 : 2 M2 : 4 M3 : 5 M4 : 3 M5 : 4 GC : 2 M2 : 4 M3 : 5 M4 : 3 M5 : 4 GC : 4 M1 : 4 M3 : 3 M4 : 3 M5 : 4 GC : 5 M1 : 5 M2 : 3 M4 : 4 M5 : 5 NIT GC : 3 M1 : 3 M2 : 3 M3 : 4 M5 : 3 NIT GC : 4 M1 : 4 M2 : 4 M3 : 5 M4 : 3 NIT

16/60

slide-17
SLIDE 17

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

DDFT - Recovery

  • The recovery is initiated by the parent of the failed/left

node

  • Peroidical heartbeat message
  • Recovery procedure
  • Remove the failed node and select new next hop nodes

from its NIT,

  • rebuild new receiver set, and
  • send multicast data with new receiver set to the new next

hop nodes.

17/60

slide-18
SLIDE 18

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

DDFT - Recovery (cont.)

  • M2 failed

M3 M4 GC M5 M1 { GC, M1, M5 }

(b)

GC M1 M4 M2 M5 M3 { M2, M3, M4, M5 } { M2, M3, M5 } { M3 } enabled

(c)

M1 GC M4 M2 M5 M3 { M2, M3, M5 } { M3 } enabled

(d)

M3 M2 M4 GC M5 M1

(e)

M3 M3 M3 { M3 } enabled prune prune M5 M4 M2 GC M1 M3 M3 M3 { GC, M1, M2, M3 } { M3 }

(f)

enabled prune

R1 R2 R3 R4

(a)

GC M1 M4 M5 M2 M3 R5 NIT NIT NIT M1 : 2 M2 : 4 M3 : 5 M4 : 3 M5 : 4 GC : 2 M2 : 4 M3 : 5 M4 : 3 M5 : 4 GC : 4 M1 : 4 M3 : 3 M4 : 3 M5 : 4 GC : 5 M1 : 5 M2 : 3 M4 : 4 M5 : 5 NIT GC : 3 M1 : 3 M2 : 3 M3 : 4 M5 : 3 NIT GC : 4 M1 : 4 M2 : 4 M3 : 5 M4 : 3 NIT

18/60

slide-19
SLIDE 19

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

DDFT - Simulation Setup

  • Topology Setup
  • Topology Model: Transit-stub topology (GT-ITM topology

generator)

  • Topology Size: 492 routers
  • Link Latency: 10ms - 100ms
  • Multicast Group
  • Member Size: 50 - 200
  • Member Distribution: Uniformly attached to the stub

nodes

  • Number of Sources: 10% of the members are selected as

source nodes

  • Source data rate: 128kbps and 256kbps
  • The leave, failure, and rejoin events are modeled as a

Poisson process with rate λ = 4/minute

  • Topology-Aware Group Communication (TAG) (with

single share tree implementation)

19/60

slide-20
SLIDE 20

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

DDFT - Simulation Result

  • Recovery Time

2 4 6 8 10 12 14 60 80 100 120 140 160 180 200

Recovery Time (ms) Group Size (m)

"DDFT_leave_RT" "TAG_leave_RT"

Figure: Recovery time for nodes leave

1.8 2 2.2 2.4 2.6 2.8 3 3.2 3.4 3.6 60 80 100 120 140 160 180 200

Recovery Time (sec) Group Size (m)

"DDFT_failure_RT_5HB" "TAG_failure_RT_5HB" "DDFT_failure_RT_3HB" "TAG_failure_RT_3HB"

Figure: Recovery time for nodes failure with varing HeartBeat

20/60

slide-21
SLIDE 21

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

DDFT - Simulation Result (cont.)

  • Data Delivery Delay

2 4 6 8 10 12 5 10 15 20 25 30

Delay (sec) Transmission Time (sec)

"DDFT_Delay_50" "TAG_Delay_50" "DDFT_Delay_100" "TAG_Delay_100" "DDFT_Delay_150" "TAG_Delay_150" "DDFT_Delay_200" "TAG_Delay_200"

Figure: Average delay without source selection.

0.5 1 1.5 2 60 80 100 120 140 160 180 200

Delay (sec) Group Size (m)

"DDFT_Delay_128kbps" "DDFT_Delay_256kbps"

Figure: Average delay with source selection probability p = 0.25.

21/60

slide-22
SLIDE 22

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

DDFT - Simulation Result (cont.)

  • Totoal Tree Length

200 400 600 800 1000 1200 1400 1600 1800 2000 100 200 300 400 500

Tree Length (Hops) Group Size (m)

"DDFT_Single-source" "TAG_Single-source"

Figure: The comparison of total tree length.

  • Fast Route Recovery
  • Avoiding the Bottleneck

Problem in the Root of the Tree

  • The delay of DDFT’s

distribution tree still leaves a room to be improved

22/60

slide-23
SLIDE 23

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Practical Routing Design - Summary

Routing Protocol Design

Mesh-first approach Source-specific tree

Simulation

OMNeT++ & INET Framework Result Recovery time Total Tree Length

Simulation result

Delivery Delay Multisource Data Delivery Route Recovery

DDFT

Proposed work

23/60

slide-24
SLIDE 24

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Work Accomplished - Single-source ALM Routing Cost Analysis

  • Methodology

Discussing the influence of network size and multicast group size on the minimum cost of single-source ALM routing

Examining the minimum cost of single -source ALM Comparing the cost of ALM with that of IPM and MU

Deriving the cost of IPM and MU Deriving the expression of performance penalty

Characterizing the behavior of Performance Penalty

24/60

slide-25
SLIDE 25

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Network Model - Self-similar k-ary Multicast Tree

  • Self-similar k-ary tree for deriving the cost of IP multicast,

performance penalty, and multiple unicast

~ Unary node ~ k-ary node

1 ) 1 3 ( ) ( 1

2

× − −

= =

θ i h

k H

1 ) 2 3 ( ) ( 2

2

× − −

= =

θ i h

k H level 0 level 1 level 2 level 3

Figure: A self-similar k-ary multicast tree with k=2, h=3, θ=1.

25/60

slide-26
SLIDE 26

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

The Cost of IP Multicast under Self-similar k-ary Multicast Tree

kpk(1-p) ) , , 1 ( m k h Lapproach −

θ

Router with multicast receivers Router without multicast receivers ) , , 2 ( m k h Lapproach −

θ

kpk(1-p) kp k(1-p)

θ ) 1 ( − h

k

θ ) 1 ( − h

k

θ ) 2 ( − h

k

θ ) 2 ( − h

k

θ ) 3 ( − h

k

θ ) 3 ( − h

k

A B θ ) ( i h

k −

θ ) 1 ( − −i h

k

A B ... kp k(1-p) kp k(1-p) ) , , 1 ( m k i h Lapproach − −

θ

i

θ ) ( i h

k −

IPM routing path

i

B B B B B B B A IPM

Cost Cost Cost Cost i h B

− − − −

+ + + + = − − ... ) 1 (

2 1

) , , ( m k i h Lapproach −

θ

. . . . . . . . . . . .

1

A

j

A

2

B

1

B

j

B

1

A

j

A

1

B

j

B ) , , 3 ( m k h Lapproach −

θ

1 − i 1 + i

i i i

B B B B B B B B B B B A A ALM

Cost Cost Cost Cost i h B

− − − − − − − − −

+ + + + = − −

1 3 2 2 1 1

... ) 1 (

ALM routing path

Source

Router with multicast source ) 1 ( − − i h Bapproach

) , , ( m k h Lapproach

θ

level

Figure: Self-similar k-ary tree for deriving the cost of IP Multicast.

26/60

slide-27
SLIDE 27

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Network Parameter Configurations

  • Target Network Size (TNS)

k h TNS NS 2 8 1000 802 Smaller 5 4 1000 970 network 5 5 5000 4862 sizes 8 4 5000 5423 6 5 10000 11264 4 8 100000 113779 Larger 5 7 100000 121640 network 5 8 500000 588221 sizes 7 7 1000000 1133728 9 7 5000000 5949223

27/60

slide-28
SLIDE 28

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Proposed Measures

  • ALM vs. IP Multicast
  • Relative Cost Penalty (RCP)

RCPMR ≡ Cost(MR) − Cost(IPM) Cost(IPM) × 100%

  • ALM vs. Multiple Unicast
  • Relative Cost Saving (RCS)

RCSMR ≡ Cost(MU) − Cost(MR) Cost(MU) × 100%

where Cost(IPM), Cost(MU), and Cost(MR) represent the cost of IP multicast, multiple unicast, and any other multicast routing (MR) approach (e.g. ALM), respectively.

28/60

slide-29
SLIDE 29

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Evaluation - RCP

50 100 150 200 250 300 350 500 1000 1500 2000 2500 3000

RCP (%) Group Size (m)

"ALM_RCP k=2 h=8(TNS=1000)" "MU_RCP k=2 h=8(TNS=1000)" "ALM_RCP k=5 h=5(TNS=5000)" "MU_RCP k=5 h=5(TNS=5000)" "ALM_RCP k=6 h=5(TNS=10000)" "MU_RCP k=6 h=5(TNS=10000)" "IPM_RCP"

Figure: RCP of ALM and MU over IPM for the smaller size of network.

100 200 300 400 500 600 700 800 900 1000 5000 10000 15000 20000

RCP (%) Group Size (m)

"ALM_RCP k=5 h=7(TNS=100000)" "MU_RCP k=5 h=7(TNS=100000)" "ALM_RCP k=7 h=7(TNS=1000000)" "MU_RCP k=7 h=7(TNS=1000000)" "ALM_RCP k=9 h=7(TNS=5000000)" "MU_RCP k=9 h=7(TNS=5000000)" "IPM_RCP"

Figure: RCP of ALM and MU over IPM for the larger size of network.

29/60

slide-30
SLIDE 30

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Evaluation - RCS

10 20 30 40 50 60 70 80 90 100 5000 10000 15000 20000

RCS (%) Group Size (m)

"ALM_RCS k=2 h=8(TNS=1000)" "IPM_RCS k=2 h=8(TNS=1000)" "ALM_RCS k=5 h=5(TNS=5000)" "IPM_RCS k=5 h=5(TNS=5000)" "ALM_RCS k=6 h=5(TNS=10000)" "IPM_RCS k=6 h=5(TNS=10000)" "MU_RCS"

Figure: RCS of IPM and ALM over MU for the smaller size of network.

10 20 30 40 50 60 70 80 90 5000 10000 15000 20000

RCS (%) Group Size (m)

"ALM_RCS k=5 h=7(TNS=100000)" "IPM_RCS k=5 h=7(TNS=100000)" "ALM_RCS k=7 h=7(TNS=1000000)" "IPM_RCS k=7 h=7(TNS=1000000)" "ALM_RCS k=9 h=7(TNS=5000000)" "IPM_RCS k=9 h=7(TNS=5000000)" "MU_RCS"

Figure: RCS of IPM and ALM over MU for the larger size of network.

30/60

slide-31
SLIDE 31

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Evaluation - Observation

  • The percentage of cost penalty of both ALM and MU is

increasing with the size of network.

  • The percentage of cost saving of both IP multicast and

ALM is decreasing with the size of network. The increasing of network size incurs a negative impact

  • n the minimum cost of single-source ALM routing

31/60

slide-32
SLIDE 32

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

The Effect of Network Size on the Minimum Cost

20000 40000 60000 80000 100000 120000 140000 10000 20000 30000 40000 50000 60000 70000 80000

Cost (hops) Group Size (m)

"IPM k=2 h=8" "IPM k=5 h=4" "IPM k=5 h=5" "IPM k=8 h=4" "IPM k=6 h=5" "IPM k=4 h=8" "IPM k=5 h=7" "IPM k=5 h=8" "IPM k=7 h=7" "IPM k=9 h=7"

Figure: The Cost of IPM.

500 1000 1500 2000 2500 3000 3500 2000 4000 6000 8000 10000 12000 14000 16000 18000

Minimum normalized cost Group Size (m)

m0.632(k=2, h=8) m0.701(k=5, h=4) m0.7607(k=5, h=5) m0.7645(k=8, h=4) m0.7807(k=6, h=5) m0.7982(k=4, h=8) m0.8055(k=5, h=7) m0.8194(k=5, h=8) m0.8296(k=7, h=7) m0.8483(k=9, h=7) "k=2 h=8 TNS=1000" "k=5 h=4 TNS=1000" "k=5 h=5 TNS=5000" "k=8 h=4 TNS=5000" "k=6 h=5 TNS=10000" "k=4 h=8 TNS=100000" "k=5 h=7 TNS=100000" "k=5 h=8 TNS=500000" "k=7 h=7 TNS=1000000" "k=9 h=7 TNS=5000000"

Figure: Minimum normalized cost

  • f ALM routing protocol (θ = 0.1).

32/60

slide-33
SLIDE 33

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

The Effect of Network Size on the Minimum Cost(cont.)

  • The Performance Penalty

N,ALM(h, k, m) − Lθ N,IPM(h, k, m)

500 1000 1500 2000 2500 3000 5000 10000 15000 20000

Performance penalty (hops) Group Size (m)

"k=2 h=8(TNS=1000)" "k=5 h=4(TNS=1000)" "k=5 h=5(TNS=5000)" "k=8 h=4(TNS=5000)" "k=6 h=5(TNS=10000)"

Figure: Performance penalty of ALM over IPM for the larger size of networks.

33/60

slide-34
SLIDE 34

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

The Effect of Network Size on the Minimum Cost(cont.)

  • The cost of IP multicast and ALM not only increasing but

also monotonically increasing,

  • The increasing of ALM routing cost is rapider than that of

IP multicast; that is, the performance penalty is growing, and

  • The performance penalty is growing till a certain size of

multicast group (e.g., the group size with maximum penalty value)

34/60

slide-35
SLIDE 35

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

The Effect of Multicast Group Size

  • n the Minimum Cost
  • The Decreasing Performance Penalty

kp ... ...

ALM routing path Router with multicast members Router without multicast members (a) (b)

kp

hop

1

1 ) 1 ( 2 + − kp

i 1 + i 1 − i

hops

hop

1

hops kp

A

R

B

R

C

R

D

R

E

R

A

M

C

M

D

M

E

M

A

R

B

R

C

R

D

R

E

R

A

M

B

M

C

M

D

M

E

M

A set of multicast members

level

Figure: (a) Cost computation of ALM with no relay member, (b)

35/60

slide-36
SLIDE 36

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

The Effect of Multicast Group Size

  • n the Minimum Cost(cont.)
  • The Zeor Performance Penalty

A

M

Source

A

R

S

R

1

R

2

R

B

R

C

R

B

M

C

M

ALM routing path IPM routing path 10 2 2 2 2

1

M

2

M

Figure: An example of ALM routing with zero performance penalty.

36/60

slide-37
SLIDE 37

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

The Effect of Multicast Group Size

  • n the Minimum Cost(cont.)
  • Relations between Performance Penalty and Multicast

Group Size

Performance Penalty, Pθ p m Minimum Pθ,min 1 ∞ Maximum Pθ,max

(1− khθ−k(h−1)θ

k(h−1)θ+1

) 2 log10(1− p) log10(1−

k−1 kh+1−k )

p is the probability of a router has at least one receiver connected

37/60

slide-38
SLIDE 38

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Single-source ALM Routing Cost Analysis - Summary

  • 1. Monotonically increasing of routing cost

(IPM and ALM) Explored effects on the cost of single-source ALM:

  • 2. Monotonically increasing of performance penalty
  • 3. The group sizes with maximum and minimum performance

penalty RCP RCS

Proposed Measures Derived Cost Expressions Derived Penalty Expression

Result Proposed work ) , , (

,

m k h L

IPM N θ

) , , (

,

m k h L

MU N θ

) , , , ( p m k h Pθ

Comparing the cost of ALM with that of IPM and MU

Deriving the cost of IPM and MU Deriving the expression of performance penalty

Characterizing the behavior of Performance Penalty

m ˆ

Discussing the influence of network size and multicast group size on the minimum cost of single-source ALM routing

Examining the minimum cost of single -source ALM

38/60

slide-39
SLIDE 39

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Work Accomplished - Multisource ALM Routing Cost Analysis

  • Methodology

Simulative verification for the derived minimum cost Deriving the minimum cost for all types Classifying different types of multisource ALM routing tree

39/60

slide-40
SLIDE 40

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Classification of Multisource Routing Trees

  • Source-specific Tree (SST)
  • Builds a source-rooted distribution tree for each source.
  • Group-shared tree approach (GST)
  • Builds a single tree that is shared by every source.
  • Core-based group-shared tree (GST-C)
  • Bidirectional group-shared tree (GST-B)

40/60

slide-41
SLIDE 41

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Group-shared Tree

(a) A B C D E F G (b) A B C D E F G (Core node) (c) A B C D E F G B F C Multicast source Multicast receiver Multicast routing path Core node Source-core path (duplicated path)

Figure: Core-based group shared tree.

(a) A B C D E F G (b) A C F G (Core node) (c) A B C D E G B F D E Multicast source Multicast receiver Multicast routing path Core node

Figure: Bidirectional group-shared tree.

41/60

slide-42
SLIDE 42

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Notations Definition Lθ,(min)

Single (h, k, m)

The (minimum) cost of single-source ALM routing which is equal to the term Lθ,min

N,ALM(h, k, m).

Lθ,(min)

n

(h, k, m) The (minimum) cost of multisource ALM routing, where n is the number of sources. Lθ,(min)

n,SST (h, k, m)

The (minimum) cost of multisource ALM routing with SST type. Lθ,(min)

n,GST−C(h, k, m)

The (minimum) cost of multisource ALM routing with GST-C type Lθ,(min)

n,GST−B(h, k, m)

The (minimum) cost of multisource ALM routing with GST-B type Lθ,(min)

Si,ℓ,GST−B(h, k, m)

The cost of a GST-B routing tree rooted at a source node Si, and the source node is located at level ℓ of the shared tree. Lθ,(min)

core,GST−x(h, k, m)

The (minimum) cost of the core-rooted shared tree with GST-x type, where x could be C (i.e. core-based) or B (i.e. bidirectional).

42/60

slide-43
SLIDE 43

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Multiplicative Property on the Minimum Cost of SST-Type Routing Tree

  • The Cost of SST-type Routing Tree

n,SST(h, k, m) = n

i=1

Si,SST(h, k, m),

  • The Minimum Cost of Single-source ALM Routing

Lθ,min

Si,SST(h, k, m) ≡ Lθ,min Single(h, k, m),

where 1 ≤ i ≤ n.

  • The Minimum Cost of SST-type Multisource ALM Routing Tree

Lθ,min

n,SST(h, k, m) = n × Lθ,min Single(h, k, m).

43/60

slide-44
SLIDE 44

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

) , , 1 (

,

m k h L

C GST n

) , , 3 (

,

m k h L

C GST n

) , , 2 (

,

m k h L

C GST n

) , , 4 (

,

m k h L

C GST n

) , , 5 (

,

m k h L

C GST n

L1 L2 L3 L4 L5 kp ) 1 ( p k −

θ ) 2 ( − h

k

kp

θ ) 3 ( − h

k

kp

) 1 ( p k − θ ) 4 ( − h

k

kp

θ ) 5 ( − h

k

kp

R1 R2 R3 R4 R5

Path to the core

θ ) 1 ( − h

k

θ ) 1 ( − h

k

θ ) 2 ( − h

k

) 1 ( p k − θ ) 3 ( − h

k

) 1 ( p k − θ ) 4 ( − h

k

) 1 ( p k − θ ) 5 ( − h

k

Router with multicast members Router without multicast members

. . . . . . . . . . . .

Path to the receivers Router with core node

Core

Figure: Self-similar k-ary multicast tree for analyzing the cost of GST-C type routing tree.

44/60

slide-45
SLIDE 45

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Multiplicative Property on the Minimum Cost of GST-C Type Routing Tree

  • The Cost of GST-C Type Routing Tree

n,GST−C(h, k, m) = n × Lθ Core,GST−C(h, k, m) + n

i=1

SP(Si, Core), where n is the number of sources, Lθ

Core,GST−C(h, k, m) is the cost of

share tree that rooted at the core node, and SP(Si, Core) is the cost

  • f the shortest path from source node Si to the core node.

45/60

slide-46
SLIDE 46

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Multiplicative Property on the Minimum Cost of GST-C Type Routing Tree (cont.)

cost ratio = ∑n

i=1 SP(Si, Core)

n × Lθ

core,GST−C(h, k, m).

max(

n

i=1

SP(Si, Core)) = n ×

h

j=1

k(h−j)θ. max(cost ratio) = n × ∑h

j=1 k(h−j)θ

n × Lθ,min

core,GST−C(h, k, m)

. By max(cost ratio), the lower value of max(cost ratio), the more clear evidence of multiplicative property.

46/60

slide-47
SLIDE 47

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Multiplicative Property on the Minimum Cost of GST-C Type Routing Tree (cont.)

  • Maximum cost ratio

0.005 0.01 0.015 0.02 0.025 500 1000 1500 2000 2500 3000

Maximum cost ratio Group size (m)

"k=5 h=4(TNS=1000)" "k=8 h=4(TNS=5000)" "k=6 h=5(TNS=10000)" "k=5 h=7(TNS=100000)" "k=5 h=8(TNS=500000)" "k=7 h=7(TNS=1000000)" "k=9 h=7(TNS=5000000)"

Figure: Maximum cost ratio with respect to group member size under different multicast tree sizes.

47/60

slide-48
SLIDE 48

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Multiplicative Property on the Minimum Cost of GST-C Type Routing Tree (cont.)

The minimum cost of multisource ALM routing with the type

  • f GST-C can be well approximated by

Lθ,min

n,GST−C(h, k, m) ≈ n × Lθ,min Core,GST−C(h, k, m).

48/60

slide-49
SLIDE 49

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Multiplicative Property on the Minimum Cost of GST-B Type Routing Tree

) , , 1 (

min , ,

m k h L

B GST Core

− θ

L1 L2 L3 L4 L5

kp ) 1 ( p k −

θ ) 1 ( − h

k

θ ) 1 ( − h

k

θ ) 2 ( − h

k

θ ) 2 ( − h

k kp

) 1 ( p k − θ ) 3 ( − h

k

θ ) 3 ( − h

k

kp ) 1 ( p k − θ ) 4 ( − h

k

θ ) 4 ( − h

k

kp ) 1 ( p k − θ ) 5 ( − h

k

θ ) 5 ( − h

k

kp ) 1 ( p k − R1 R2 R3 R4 R5

... Possible location of source A router with receiver connected A router without receiver connected A router with core node connected Core ) , , 2 (

min , ,

m k h L

B GST Core

− θ

) , , 3 (

min , ,

m k h L

B GST Core

− θ

) , , 4 (

min , ,

m k h L

B GST Core

− θ

) , , 5 (

min , ,

m k h L

B GST Core

− θ

Data delivery path of ALM

) , , (

min , ,

m k h L

B GST Core θ −

Figure: The self-similar k-ary multicast tree for analyzing the cost of multisource ALM routing with GST-B type.

49/60

slide-50
SLIDE 50

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

The Minimum Cost of the Sources at Different Level of the Shared Tree

The minimum cost of the tree rooted at a source node that is located at the level ℓ of the shared tree is equal to the cost of that shared tree, that is, Lθ,min

Si,ℓ,GST−B(h, k, m) = Lθ,min Core,GST−B(h, k, m),

where 1 ≤ ℓ ≤ h.

50/60

slide-51
SLIDE 51

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Minimum Cost of GST-B Type Multisource ALM Routing

The minimum cost of multisource ALM routing with the type

  • f GST-B can be assessed by multiplying the minimum cost of

the core-rooted shared tree and the number of sources, that is, Lθ,min

n,GST−B(h, k, m) = n × Lθ,min Core,GST−B(h, k, m),

The minimum cost of SST and GST types multisource ALM routing can be expressed by Lθ,min

n

(h, k, m) = n × Lθ,min

Single(h, k, m).

51/60

slide-52
SLIDE 52

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

The Minimum Cost of SST and GST Types: Simulative Aspect

  • In order to show the multiplicative property of the of the

cost, we define ϵ as

ϵ = Csimulated − Ctheoretical Ctheoretical × 100%,

  • Simulated Protocols
  • SST - DDFT
  • GST-C - TAG
  • GST-B - ALMI
  • Topology Type
  • GT-ITM Topology Generator
  • Topology Size: 492 Routers
  • Multicast Group Size: 0 - 500, uniform distribution

52/60

slide-53
SLIDE 53

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

The Multiplicative Property: Simulative Aspect

#. of Simulated cost Group size srcs SST GST-B GST-C DDFT (ϵ) ALMI (ϵ) TAG (ϵ) 100 1 489 469 508 5 2590 (5.93%) 2340 (0%) 2533 (0.27%) 10 5273 (7.83%) 4690 (0%) 5050 (0.59%) 300 1 1293 985 1152 5 6721 3.9%) 4925 (0%) 5669 (1.57%) 10 13396 (3.6%) 9850 (0%) 11324 (1.7%) 500 1 1853 1420 1619 5 9532 (2.8%) 7100 (0%) 8011 (1%) 10 19162 (3.4%) 14200 (0%) 15955 (1.45%) Multiplicative Property None Exactly Approximately

53/60

slide-54
SLIDE 54

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

The Minimum Cost: Simulative Aspect

2000 4000 6000 8000 10000 12000 14000 16000 18000 20000 100 200 300 400 500

Cost (Hops) Group Size (m)

"DDFT_1_Source" "Minimum_1_Source" "DDFT_5_Sources" "Minimum_5_Sources" "DDFT_10_Sources" "Minimum_10_Sources"

Figure: The comparison of the DDFT routing cost to minimum cost.

2000 4000 6000 8000 10000 12000 14000 16000 100 200 300 400 500

Cost (Hops) Group Size (m)

"TAG_1_Source" "Minimum_1_Source" "TAG_5_Sources" "Minimum_5_Sources" "TAG_10_Sources" "Minimum_10_Sources"

Figure: The comparison of the TAG routing cost to the minimum cost.

54/60

slide-55
SLIDE 55

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

The Minimum Cost: Simulative Aspect (cont.)

2000 4000 6000 8000 10000 12000 14000 16000 100 200 300 400 500

Cost (Hops) Group Size (m)

"ALMI_1_Source" "Minimum_1_Source" "ALMI_5_Sources" "Minimum_5_Sources" "ALMI_10_Sources" "Minimum_10_Sources"

Figure: The comparison of the ALMI routing cost to the minimum cost.

55/60

slide-56
SLIDE 56

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Accomplished

Multisource Routing Cost Analysis

  • Summary

SST GST-B GST-C Classifying different types of multisource ALM routing tree

  • 2. The comparison of simulated cost to the minimum

cost

Simulation results

  • 1. Numerical cost evaluation for the multiplicative

property Result Proposed work Deriving the minimum cost for all types Multiplicative property :

) , , ( ) , , (

min , sin min ,

m k h L n m k h L

gle n θ θ

× =

Simulative verification for the derived minimum cost Classified types 56/60

slide-57
SLIDE 57

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Remaining

The Progress of the Proposed Work

Multisource ALM routing design : fast route recovery Multisource ALM routing design : fast route recovery and cost- effective routing Practical Routing Protocol Design Theoretical Routing Cost Analysis Improved Routing Protocol Design Accomplished work Minimum cost for comparing different multisource ALM routing Multisource ALM Routing Protocol Single-source ALM Routing Protocol Design guideline for designing ALM routing Characterize the behavior of ALM performance penalty Design guideline for designing ALM routing

57/60

slide-58
SLIDE 58

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Work Remaining

Remaining Works

To explore design guidelines for providing a reference to effectively design an ALM routing protocol. To design a cost-effective multisource ALM routing based on the one developed in the first topic by adapting the guidelines investigated in the second topic.

58/60

slide-59
SLIDE 59

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Conclusion

Conclusion

  • In this proposal, we have addressed
  • Multisource ALM Routing Protocol Design - Practical
  • Routing Cost Analysis - Theoretical
  • The Proposed Research Plan
  • Routing Design → Cost Analysis → Improving Design
  • Where does the performance penalty come
  • The behavior of the performance penalty
  • The multiplicative property

59/60

slide-60
SLIDE 60

Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Chia-Hui Huang Outline Background Motivation The Proposed Research Plan Work Accomplished Work Remaining Conclusion Design and Analysis of Single-source and Multisource Application Layer Multicast Routing Protocols Conclusion

Contribution

  • Provide an efficient multisource ALM routing protocol
  • Fast route recovery
  • Cost-effective in terms of total length of distribution tree
  • Provide design guidelines
  • The Minimum cost of multisource ALM routing protocol
  • SST
  • GST-C
  • GST-B

60/60