Eyal Blum Alex Honda. FaReCast Fast Reliable Application Layer Multicast for Flash Dissemination Application Layer Flash Dissemination Authors Kyungbaek.

Slides:



Advertisements
Similar presentations
Chapter 5: Tree Constructions
Advertisements

Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.
Distributed Systems Major Design Issues Presented by: Christopher Hector CS8320 – Advanced Operating Systems Spring 2007 – Section 2.6 Presentation Dr.
CS542 Topics in Distributed Systems Diganta Goswami.
Junction Trees And Belief Propagation. Junction Trees: Motivation What if we want to compute all marginals, not just one? Doing variable elimination for.
Serverless Network File Systems. Network File Systems Allow sharing among independent file systems in a transparent manner Mounting a remote directory.
Page 1 Mutual Exclusion* Distributed Systems *referred to slides by Prof. Paul Krzyzanowski at Rutgers University and Prof. Mary Ellen Weisskopf at University.
Small-world Overlay P2P Network
Scribe: A Large-Scale and Decentralized Application-Level Multicast Infrastructure Miguel Castro, Peter Druschel, Anne-Marie Kermarrec, and Antony L. T.
CS 582 / CMPE 481 Distributed Systems
ZIGZAG A Peer-to-Peer Architecture for Media Streaming By Duc A. Tran, Kien A. Hua and Tai T. Do Appear on “Journal On Selected Areas in Communications,
Internet Networking Spring 2006 Tutorial 12 Web Caching Protocols ICP, CARP.
DNA Research Group 1 CountTorrent: Ubiquitous Access to Query Aggregates in Dynamic and Mobile Sensor Networks Abhinav Kamra, Vishal Misra and Dan Rubenstein.
Group Communications Group communication: one source process sending a message to a group of processes: Destination is a group rather than a single process.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #13 Web Caching Protocols ICP, CARP.
Scalable Adaptive Data Dissemination Under Heterogeneous Environment Yan Chen, John Kubiatowicz and Ben Zhao UC Berkeley.
Self Healing Wide Area Network Services Bhavjit S Walha Ganesh Venkatesh.
Internet Networking Spring 2002 Tutorial 13 Web Caching Protocols ICP, CARP.
Coordination in Distributed Systems Lecture # 8. Coordination Anecdotes  Decentralized, no coordination  Aloha ~ 18%  Some coordinating Master  Slotted.
P2P Course, Structured systems 1 Introduction (26/10/05)
Computer Science Lecture 12, page 1 CS677: Distributed OS Last Class Vector timestamps Global state –Distributed Snapshot Election algorithms.
Multicast Transport Protocols: A Survey and Taxonomy Author: Katia Obraczka University of Southern California Presenter: Venkatesh Prabhakar.
 Structured peer to peer overlay networks are resilient – but not secure.  Even a small fraction of malicious nodes may result in failure of correct.
Election Algorithms and Distributed Processing Section 6.5.
Multicast Communication Multicast is the delivery of a message to a group of receivers simultaneously in a single transmission from the source – The source.
Efficient and Reliable Broadcast in ZigBee Networks Purdue University, Mitsubishi Electric Lab. To appear in SECON 2005.
Communication (II) Chapter 4
Steady and Fair Rate Allocation for Rechargeable Sensors in Perpetual Sensor Networks Zizhan Zheng Authors: Kai-Wei Fan, Zizhan Zheng and Prasun Sinha.
Fault Tolerance via the State Machine Replication Approach Favian Contreras.
ON DESIGING END-USER MULTICAST FOR MULTIPLE VIDEO SOURCES Y.Nakamura, H.Yamaguchi, A.Hiromori, K.Yasumoto †, T.Higashino and K.Taniguchi Osaka University.
1 A Mutual Exclusion Algorithm for Ad Hoc Mobile networks Presentation by Sanjeev Verma For COEN th Nov, 2003 J. E. Walter, J. L. Welch and N. Vaidya.
Overcast: Reliable Multicasting with an Overlay Network CS294 Paul Burstein 9/15/2003.
Leader Election Algorithms for Mobile Ad Hoc Networks Presented by: Joseph Gunawan.
Andreas Larsson, Philippas Tsigas SIROCCO Self-stabilizing (k,r)-Clustering in Clock Rate-limited Systems.
4.5 DISTRIBUTED MUTUAL EXCLUSION MOSES RENTAPALLI.
Resilient Peer-to-Peer Streaming Presented by: Yun Teng.
CS4231 Parallel and Distributed Algorithms AY 2006/2007 Semester 2 Lecture 10 Instructor: Haifeng YU.
Lab 2 Group Communication Farnaz Moradi Based on slides by Andreas Larsson 2012.
Computer Science Lecture 12, page 1 CS677: Distributed OS Last Class Vector timestamps Global state –Distributed Snapshot Election algorithms –Bully algorithm.
Overcast: Reliable Multicasting with an Overlay Network Paper authors: Jannotti, Gifford, Johnson, Kaashoek, O’Toole Jr. Slides by Chris Johnstone.
Coordination and Agreement. Topics Distributed Mutual Exclusion Leader Election.
Chapter 21 Topologies Chapter 2. 2 Chapter Objectives Explain the different topologies Explain the structure of various topologies Compare different topologies.
Presenter: Long Ma Advisor: Dr. Zhang 4.5 DISTRIBUTED MUTUAL EXCLUSION.
Farnaz Moradi Based on slides by Andreas Larsson 2013.
A secure re-keying scheme Introduction Background Re-keying scheme User revocation User join Conclusion.
Toward Fault-tolerant P2P Systems: Constructing a Stable Virtual Peer from Multiple Unstable Peers Kota Abe, Tatsuya Ueda (Presenter), Masanori Shikano,
PMIT-6101 Advanced Database Systems By- Jesmin Akhter Assistant Professor, IIT, Jahangirnagar University.
CountTorrent: Ubiquitous Access to Query Aggregates in Dynamic and Mobile Sensor Networks Abhinav Kamra, Vishal Misra and Dan Rubenstein - Columbia University.
Multiuser Receiver Aware Multicast in CDMA-based Multihop Wireless Ad-hoc Networks Parmesh Ramanathan Department of ECE University of Wisconsin-Madison.
Introduction to ZooKeeper. Agenda  What is ZooKeeper (ZK)  What ZK can do  How ZK works  ZK interface  What ZK ensures.
Information-Centric Networks10b-1 Week 10 / Paper 2 Hermes: a distributed event-based middleware architecture –P.R. Pietzuch, J.M. Bacon –ICDCS 2002 Workshops.
CCNP 3: Chapter 3 Implementing Spanning Tree. Overview Basics of implementing STP Election of Root Bridge and Backup Enhancing STP RSTP MSTP EtherChannels.
Peer to Peer Network Design Discovery and Routing algorithms
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
Introduction to Active Directory
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
Self-stabilizing energy-efficient multicast for MANETs.
1 Review Questions Define n variables, types of shared variables, message-passing, shared-memory system, system topology n program-counter/guarded command.
PeerNet: Pushing Peer-to-Peer Down the Stack Jakob Eriksson, Michalis Faloutsos, Srikanth Krishnamurthy University of California, Riverside.
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
Lecture 7- 1 CS 425/ECE 428/CSE424 Distributed Systems (Fall 2009) Lecture 7 Distributed Mutual Exclusion Section 12.2 Klara Nahrstedt.
CIS 825 Review session. P1: Assume that processes are arranged in a ring topology. Consider the following modification of the Lamport’s mutual exclusion.
Mutual Exclusion Algorithms. Topics r Defining mutual exclusion r A centralized approach r A distributed approach r An approach assuming an organization.
CSC 8420 Advanced Operating Systems Georgia State University Yi Pan Transactions are communications with ACID property: Atomicity: all or nothing Consistency:
The “New Network Node” Algorithm Brought to you by: Brian Wolf(Researcher) Harlan Russell (Advisor) Joe Hammond (Advisor Emeritus) Vivek Mehta(Graduate.
Network types Point-to-Point (Direct) Connection Dedicated circuit boards connected by cable; To transfer data from A to B: – A writes on its circuit board;
Coordination and Agreement
Outline Distributed Mutual Exclusion Introduction Performance measures
Dynamic Replica Placement for Scalable Content Delivery
Distributed Systems and Concurrency: Synchronization in Distributed Systems Majeed Kassis.
Presentation transcript:

Eyal Blum Alex Honda

FaReCast Fast Reliable Application Layer Multicast for Flash Dissemination Application Layer Flash Dissemination Authors Kyungbaek Kim Sharad Mehrotra Nalini Venkatasubramanian

FaReCast Motvation Emergency dissemination of information Assumes high node and link failure rates Emergencies are infrequent Earthquake Tsunami Forrest Fires Tornados Require reliable and fast transmission

FaReCast Structure Multitree structure Single reliable “root” Multiple parents for each client node Local topology maintained by each client nodes Global topology maintained by configuration manager

Configuration Manager (CM) Maintains network topology Join – client is assigned parents and children Update – client is informed of its current neighbors Leave – client gracefully exits the group Timeout – client fails Not used in dissemination Single point of failure Performance bottleneck

Distributing the CM Use FreePastry to Evenly distribute the load Handle reliable group communication Each CM maintains a subset of the client data More efficient – for updates No redundancy – assume CMs are reliable Ensure that the number of nodes in the system is globally consistent Central Coordinator Algorithm

Distributed CM Join Assign a client parents and children, based on level in tree Requires consistent number of nodes in the system Choose arbitrary centralized authority Pass a token from and back to centralized authority A join process can only start once its CM hold the token Join Process Maintain parent set uniqueness – No two clients can have the same parent set Select a parent set at random If PSU is violated, throw out the candidate parent with the most children (heuristic) Keep requesting parents until we have fan-in many, and PSU is satisfied

Issues Minimizing intra-server messages Minimizing response time for update requests Ensuring global consistency for critical variables Preventing race conditions for threaded processes Emulating multiple clients for testing the CM

Results Currently in progress Consistency issues Heissenbugs Fun Fact: Favorite (and most used) command: “killall java”