Eliminating Bottlenecks in Overlay Multicast Min Sik Kim Yi Li - - PowerPoint PPT Presentation

eliminating bottlenecks in overlay multicast
SMART_READER_LITE
LIVE PREVIEW

Eliminating Bottlenecks in Overlay Multicast Min Sik Kim Yi Li - - PowerPoint PPT Presentation

Eliminating Bottlenecks in Overlay Multicast Min Sik Kim Yi Li Simon S. Lam Department of Computer Sciences The University of Texas at Austin Overlay Multicast IP multicast overlay multicast N unicast Bottleneck How to


slide-1
SLIDE 1

Eliminating Bottlenecks in Overlay Multicast

Min Sik Kim Yi Li Simon S. Lam Department of Computer Sciences The University of Texas at Austin

slide-2
SLIDE 2

2

Overlay Multicast

 How to construct an efficient overlay tree?

Bottleneck

IP multicast

  • verlay multicast

N unicast

slide-3
SLIDE 3

3

Eliminating Shared Bottlenecks

 Shared congestion detection  Bottleneck Elimination  Why difficult?

1 2 3 4 5 1 2 3 4 5

slide-4
SLIDE 4

4

Outline

 Introduction  Types of Shared Bottlenecks  Bottleneck Elimination  Performance Evaluation  Summary

slide-5
SLIDE 5

5

Inter-path Shared Bottleneck

u1 v1 u2 v2 u1 u2 v1 v2

slide-6
SLIDE 6

6

Intra-path Shared Bottleneck

u1 v1 u2 v2 u1 u2 v2 v1

slide-7
SLIDE 7

7

Algorithm

 Eliminate both types of shared bottlenecks  No tree oscillation  One-way process  Finite steps

Tree 1 Tree 2 Tree 3 Tree N

… Remove a shared bottleneck

slide-8
SLIDE 8

8

Example

 # of leaves ↓  Height ↑

1 2 3 4 1 2 3 4

slide-9
SLIDE 9

9

Leaf Distance Vector

 Depths of all leaf nodes in descending

  • rder

D = (1,1,1)

  • D = (2,1)

1 2 3 4 1 2 3 4

slide-10
SLIDE 10

10

Total Cost

 Sum of costs of all edges in the tree

u1 u2 v2 v1 u1 u2 v2 v1

1 1 1 1 1 1 1 1 1 1 1 1

C = 3+1+ 3 = 7

  • C = 2 +1+ 2 = 5

u1v1 v1u2 u2v2 u1u2 u2v1 v1v2

>

slide-11
SLIDE 11

11

Proof Sketch

 Bottleneck elimination algorithms

 Remove-Inter-Path-Shared-Bottleneck  Remove-Intra-Path-Shared-Bottleneck

 Applying either algorithm causes

 D ↑  C ↓

 Only a finite # of changes

slide-12
SLIDE 12

12

Protocol

 Measure delay for congested edges  Detect shared congestion  Eliminate shared bottlenecks  Forward remaining bottlenecks

u1 v1 u2 v2

slide-13
SLIDE 13

13

Performance Evaluation

 Comparison

 Delay heuristic  Bandwidth heuristic  Bottleneck-free

 Metrics

 Links stress  Link load  Relative delay penalty  Receiving rate

slide-14
SLIDE 14

14

Link Stress

slide-15
SLIDE 15

15

Link Load

slide-16
SLIDE 16

16

Receiving Rate

slide-17
SLIDE 17

17

Relative Delay Penalty

slide-18
SLIDE 18

18

Summary

 Overlay multicast creates shared bottlenecks  Proposed tree construction algorithm

 Eliminates all shared bottlenecks  Provides full receiving rate  Low link load, low delay