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

4. Adaptation Mechanism Ndes m 1.Each node periodically probes its siblings and grandparent. (B is probing in the picture) 2.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. R TT 5 4 S 2 S 3 1 Naïve Algorithm

7. R TT 5 4 S 2 S 3 1 Tapestry Algorithm

8. R TT 5 4 S 2 S 3 1 Transit-Stub Algorithm