Dynamic Multicast Tree Construction in OceanStore

1
Dynamic Multicast Tree Construction in OceanStore

• Puneet Mehra and Satrajit Chatterjee
• Advanced Topics in Computer Systems Final
  Project
• EECS Department, CS Division
• University of California, Berkeley

2
Updates
3
(No Transcript)
4
Adaptation Mechanism

• Ndes m

• Each node periodically probes its siblings and
  grandparent. (B is probing in the picture)
• A node switches parents if it can get a 10
  improvement in a certain metric (eg latency or
  bandwidth). (B has switched parents to C).

5
Exploiting Network Topology

• Model Internet as transit-stub network.
• Data goes through stub nodes into stub domain.
  Transit nodes pass data between domains.
• Placing overhead Replicas at transit or stub
  nodes can decrease network utilization.

6
Naïve Algorithm
T
T
S
S
2
5
4
3
1
7
Tapestry Algorithm
T
T
S
S
2
5
4
3
1
8
Transit-Stub Algorithm
T
T
S
S
2
5
4
3
1
9
(No Transcript)
10
(No Transcript)
11
(No Transcript)
12
(No Transcript)