Dynamic Multicast Tree Construction in OceanStore Puneet Mehra and Satrajit Chatterjee Advanced Topics in Computer Systems Final Project EECS Department,

Slides:

Advertisements

Similar presentations

Brocade: Landmark Routing on Peer to Peer Networks Ben Y. Zhao Yitao Duan, Ling Huang, Anthony Joseph, John Kubiatowicz IPTPS, March 2002.

Advertisements

Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.

Tapestry: Decentralized Routing and Location SPAM Summer 2001 Ben Y. Zhao CS Division, U. C. Berkeley.

Communication-Avoiding Algorithms Jim Demmel EECS & Math Departments UC Berkeley.

Optimizations for Locality-Aware Structured Peer-to-Peer Overlays Jeremy Stribling Collaborators: Kris Hildrum John D. Kubiatowicz The First.

Topologically-Aware Overlay Construction and Server Selection Sylvia Ratnasamy, Mark Handly, Richard Karp and Scott Shenker Presented by Shreeram Sahasrabudhe.

SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy,

A Comparison of Layering and Stream Replication Video Multicast Schemes Taehyun Kim and Mostafa H. Ammar.

Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints 晏廷.

Brocade Landmark Routing on Structured P2P Overlays Ben Zhao, Yitao Duan, Ling Huang Anthony Joseph and John Kubiatowicz (IPTPS 2002) Goals Improve routing.

Quantitative Characterization of Denial of Service Attacks: A Case Study of Location Services Adam Bargteil David Bindel Yan Chen.

Scalable Adaptive Data Dissemination Under Heterogeneous Environment Yan Chen, John Kubiatowicz and Ben Zhao UC Berkeley.

Application Layer Multicast

Spring Routing & Switching Umar Kalim Dept. of Communication Systems Engineering 17/04/2007.

CS218 – Final Project A “Small-Scale” Application- Level Multicast Tree Protocol Jason Lee, Lih Chen & Prabash Nanayakkara Tutor: Li Lao.

1 CS 194: Distributed Systems Distributed Hash Tables Scott Shenker and Ion Stoica Computer Science Division Department of Electrical Engineering and Computer.

Slide 1 ISTORE: System Support for Introspective Storage Appliances Aaron Brown, David Oppenheimer, and David Patterson Computer Science Division University.

1 Characterizing Selfishly Constructed Overlay Routing Networks March 11, 2004 Byung-Gon Chun, Rodrigo Fonseca, Ion Stoica, and John Kubiatowicz University.

OceanStore/Tapestry Toward Global-Scale, Self-Repairing, Secure and Persistent Storage Anthony D. Joseph John Kubiatowicz Sahara Retreat, January 2003.

Or, Providing High Availability and Adaptability in a Decentralized System Tapestry: Fault-resilient Wide-area Location and Routing Issues Facing Wide-area.

CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 21 Introduction to Computer Networks.

ICTTA'04Arwa zabian1 On The Latency of BFS Interval Cooperation Web Caching Arwa Zabian Maurizio Bonuccelli Department of Computer Science University of.

Long Term Durability with Seagull Hakim Weatherspoon (Joint work with Jeremy Stribling and OceanStore group) University of California, Berkeley ROC/Sahara/OceanStore.

ROUTING ON THE INTERNET COSC Aug-15. Routing Protocols  routers receive and forward packets  make decisions based on knowledge of topology.

Cluster and Grid Computing Lab, Huazhong University of Science and Technology, Wuhan, China Supporting VCR Functions in P2P VoD Services Using Ring-Assisted.

Popularity-Awareness in Temporal DHT for P2P-based Media Streaming Applications Abhishek Bhattacharya, Zhenyu Yang & Deng Pan IEEE International Symposium.

Modeling Internet Topology Kenneth L. Calvert Matthew B. Doar Ellen W. Zegura Presented by Kiran Komaravolu.

Overcast: Reliable Multicasting with an Overlay Network CS294 Paul Burstein 9/15/2003.

Application-Layer Multicast -presented by William Wong.

Brocade Landmark Routing on P2P Networks Gisik Kwon April 9, 2002.

1 Setting Up Routing Vectors in a Network of Bridged 1394 buses PHILIPS Research Subrata Banerjee PHILIPS Research Briarcliff, New York P WG Meeting,

Scalable Reconfigurable Interconnects Ali Pinar Lawrence Berkeley National Laboratory joint work with Shoaib Kamil, Lenny Oliker, and John Shalf CSCAPES.

The Internet Trisha Cummings ITE115. What is the Internet? The Internet is a world-wide network of computer networks that use a common communications.

TOMA: A Viable Solution for Large- Scale Multicast Service Support Li Lao, Jun-Hong Cui, and Mario Gerla UCLA and University of Connecticut Networking.

Static versus Dynamic Routes Static Route Uses a protocol route that a network administrators enters into the router Static Route Uses a protocol route.

The Network Layer.

DDR-based Multicast routing Protocol with Dynamic Core (DMPDC) Shiyi WU, Navid Nikaein, Christian BONNET Mobile Communications Department EURECOM Institute,

Paper # – 2009 A Comparison of Heterogeneous Video Multicast schemes: Layered encoding or Stream Replication Authors: Taehyun Kim and Mostafa H.

1 Admission Control and Interference-Aware Scheduling in Multi-hop WiMAX Networks Debalina Ghosh, Ashima Gupta, Prasant Mohapatra Department of Computer.

4/25/2013 CS152, Spring 2013 CS 152 Computer Architecture and Engineering Lecture 22: Putting it All Together Krste Asanovic Electrical Engineering and.

Network Computing Laboratory 1 Vivaldi: A Decentralized Network Coordinate System Authors: Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris MIT Published.

Peer-to-Peer Result Dissemination in High-Volume Data Filtering Shariq Rizvi and Paul Burstein CS 294-4: Peer-to-Peer Systems.

A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks H. Yang, F. Ye, and B. Sikdar Department of Electrical, Computer and systems Engineering.

Chapter 7: Consistency & Replication IV - REPLICATION MANAGEMENT By Jyothsna Natarajan Instructor: Prof. Yanqing Zhang Course: Advanced Operating Systems.

Tapestry : An Infrastructure for Fault-tolerant Wide-area Location and Routing Presenter : Lee Youn Do Oct 5, 2005 Ben Y.Zhao, John Kubiatowicz, and Anthony.

Self-stabilizing energy-efficient multicast for MANETs.

A Simulation-Based Study of Overlay Routing Performance CS 268 Course Project Andrey Ermolinskiy, Hovig Bayandorian, Daniel Chen.

Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.

On the Placement of Web Server Replicas Yu Cai. Paper On the Placement of Web Server Replicas Lili Qiu, Venkata N. Padmanabhan, Geoffrey M. Voelker Infocom.

Querying the Internet with PIER CS294-4 Paul Burstein 11/10/2003.

A Place-based Model for the Internet Topology Xiaotao Cai Victor T.-S. Shi William Perrizo NDSU {Xiaotao.cai, Victor.shi,

Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)

Instructor Materials Chapter 5: Dynamic Routing

Networking & Communications Prof. Javad Ghaderi

Network Layer Goals: Overview:

Managing Online Services

(How the routers’ tables are filled in)

Topological Ordering Algorithm: Example

John D. Kubiatowicz UC Berkeley

Switch controller: Routing

Data-Centric Networking

Resource Allocation in a Middleware for Streaming Data

Dynamic Replica Placement for Scalable Content Delivery

Topological Ordering Algorithm: Example

Topological Ordering Algorithm: Example

DNSR: Domain Name Suffix-based Routing in Overlay Networks

Exploiting Routing Redundancy via Structured Peer-to-Peer Overlays

Routing Metrics Neil Tang 11/03/2009

Topological Ordering Algorithm: Example

Presentation transcript:

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

Updates

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).

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.

R TT 5 4 S 2 S 3 1 Naïve Algorithm

R TT 5 4 S 2 S 3 1 Tapestry Algorithm

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