©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Updates: in a highly unreliable environment. Motivation: Maintaining.

Slides:

Advertisements

Similar presentations

A Construction of Locality-Aware Overlay Network: mOverlay and Its Performance Found in: IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 22, NO.

Advertisements

Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.

Gossip and its application Presented by Anna Kaplun.

Playback delay in p2p streaming systems with random packet forwarding Viktoria Fodor and Ilias Chatzidrossos Laboratory for Communication Networks School.

On Large-Scale Peer-to-Peer Streaming Systems with Network Coding Chen Feng, Baochun Li Dept. of Electrical and Computer Engineering University of Toronto.

Rumor Routing Algorithm For sensor Networks David Braginsky, Computer Science Department, UCLA Presented By: Yaohua Zhu CS691 Spring 2003.

Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin LECS – UCLA Modified and Presented by Sugata Hazarika.

P2p, Spring 05 1 Topics in Database Systems: Data Management in Peer-to-Peer Systems Διαδικαστικά  Αύριο, Τετάρτη 18 Μαΐου 12:00 – 13:00 Ομιλία σε p2p.

1 CS 525 Advanced Distributed Systems Spring 09 Indranil Gupta Lecture 7 More on Epidemics (or “Tipping Point Protocols”) February 12, 2009 (gatorlog.com)

1 CS 194: Lecture 8 Consistency and Replication Scott Shenker and Ion Stoica Computer Science Division Department of Electrical Engineering and Computer.

Gossip Algorithms and Implementing a Cluster/Grid Information service MsSys Course Amar Lior and Barak Amnon.

Feb 7, 2001CSCI {4,6}900: Ubiquitous Computing1 Announcements.

Lecture 7 Data distribution Epidemic protocols. EECE 411: Design of Distributed Software Applications Epidemic algorithms: Basic Idea Idea Update operations.

Gossip Scheduling for Periodic Streams in Ad-hoc WSNs Ercan Ucan, Nathanael Thompson, Indranil Gupta Department of Computer Science University of Illinois.

PROMISE: Peer-to-Peer Media Streaming Using CollectCast Mohamed Hafeeda, Ahsan Habib et al. Presented By: Abhishek Gupta.

Database Replication techniques: a Three Parameter Classification Authors : Database Replication techniques: a Three Parameter Classification Authors :

1 Switching and Forwarding Bridges and Extended LANs.

Overview Distributed vs. decentralized Why distributed databases

Francisco Matias Cuenca-Acuna Christopher Peery Thu D. Nguyen Usando algoritmos probabilísticos para construir sistemas.

©2002, Karl Aberer, EPFL, Laboratoire de systèmes d'informations répartis Semantic Gossiping Karl Aberer, EPFL Distributed Information.

Oct 1999SRDS 991 On Diffusing Updates in a Byzantine Environment Dahlia Malkhi Yishay Mansour Michael K. Reiter.

©2004, Zoran Despotovic, Karl Aberer, EPFL-I&C, Laboratoire de systèmes d'informations répartis Maximum Likelihood Estimation of Peers’ Trustworthiness.

Strategies for Implementing Dynamic Load Sharing.

Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)

Epidemic Techniques Chiu Wah So (Kelvin). Database Replication Why do we replicate database? – Low latency – High availability To achieve strong (sequential)

Improving Data Access in P2P Systems Karl Aberer and Magdalena Punceva Swiss Federal Institute of Technology Manfred Hauswirth and Roman Schmidt Technical.

P-Grid Presentation by Thierry Lopez P-Grid: A Self-organizing Structured P2P System Karl Aberer, Philippe Cudré-Mauroux, Anwitaman Datta, Zoran Despotovic,

UNIVERSITY OF JYVÄSKYLÄ Resource Discovery Using NeuroSearch Presentation for the Agora Center InBCT-seminar Mikko Vapa, researcher InBCT 3.2.

1 Freenet  Addition goals to file location: -Provide publisher anonymity, security -Resistant to attacks – a third party shouldn’t be able to deny the.

Distributed Iterative Training Kevin Gimpel Shay Cohen Severin Hacker Noah A. Smith.

Multicast Communication Multicast is the delivery of a message to a group of receivers simultaneously in a single transmission from the source – The source.

Cache Updates in a Peer-to-Peer Network of Mobile Agents Elias Leontiadis Vassilios V. Dimakopoulos Evaggelia Pitoura Department of Computer Science University.

Peer-to-Peer in the Datacenter: Amazon Dynamo Aaron Blankstein COS 461: Computer Networks Lectures: MW 10-10:50am in Architecture N101

Epidemic Algorithms for replicated Database maintenance Alan Demers et al Xerox Palo Alto Research Center, PODC 87 Presented by: Harshit Dokania.

Communication (II) Chapter 4

Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.

Mobile Routing protocols MANET

Kevin Ross, UCSC, September Service Network Engineering Resource Allocation and Optimization Kevin Ross Information Systems & Technology Management.

Presented by Chaitanya Nemallapudi Understanding and Exploiting the Trade-Offs between Broadcasting and Multicasting in Mobile Ad Hoc Networks Lap Kong.

Lecture 5: Sun: 1/5/ Distributed Algorithms - Distributed Databases Lecturer/ Kawther Abas CS- 492 : Distributed system &

Sami Al-wakeel 1 Data Transmission and Computer Networks The Switching Networks.

Autonomous Replication for High Availability in Unstructured P2P Systems Francisco Matias Cuenca-Acuna, Richard P. Martin, Thu D. Nguyen

Computer Science 1 CSC 774 Advanced Network Security Distributed detection of node replication attacks in sensor networks (By Bryan Parno, Adrian Perrig,

PRESENTED BY A. B. C. 1 User Oriented Regional Registration- Based Mobile Multicast Service Management in Mobile IP Networks Ing-Ray Chen and Ding-Chau.

Autonomous Replication for High Availability in Unstructured P2P Systems (Paper by Francisco Matias Cuenca-Acuna, Richard P. Martin, Thu D. Nguyen) Hristo.

Salah A. Aly,Moustafa Youssef, Hager S. Darwish,Mahmoud Zidan Distributed Flooding-based Storage Algorithms for Large-Scale Wireless Sensor Networks Communications,

Data Communications and Networking Chapter 11 Routing in Switched Networks References: Book Chapters 12.1, 12.3 Data and Computer Communications, 8th edition.

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Self-Organized Construction of Distributed Access Structures: A Comparative.

1 SmartGossip: An Adaptive Broadcast Service for Wireless Sensor Networks Presented By Thomas H. Hand Duke University Adapted from: “ SmartGossip: An Adaptive.

Cache Updates in a Peer-to-Peer Network of Mobile Agents Ilias Leontiadis Master’s Thesis University of Ioannina,Greece Supervisors: Vassilios V. Dimakopoulos.

P2p, Fall 06 1 Topics in Database Systems: Data Management in Peer-to-Peer Systems Search in Unstructured P2p.

1 Gossip-Based Ad Hoc Routing Zygmunt J. Haas, Joseph Halpern, LiLi Cornell University Presented By Charuka Silva.

Location Directory Services Vivek Sharma 9/26/2001 CS851: Large Scale Deeply Embedded Networks.

a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.

Comparison of Tarry’s Algorithm and Awerbuch’s Algorithm CS 6/73201 Advanced Operating System Presentation by: Sanjitkumar Patel.

School of Electrical Engineering &Telecommunications UNSW Cost-effective Broadcast for Fully Decentralized Peer-to-peer Networks Marius Portmann & Aruna.

CSE 486/586 CSE 486/586 Distributed Systems Gossiping Steve Ko Computer Sciences and Engineering University at Buffalo.

Garbage Collecting the World Presentation: Mark Mastroieni Authors: Bernard Lang, Christian Queinne, Jose Piquer.

William Stallings Data and Computer Communications

CSE 486/586 Distributed Systems Gossiping

Gossip-based Data Dissemination

Effective Social Network Quarantine with Minimal Isolation Costs

Goal Control the amount of traffic in the network

CRBcast: A Collaborative Rateless Scheme for Reliable and Energy-Efficient Broadcasting in Wireless Sensor/Actuator Networks Nazanin Rahnavard, Badri N.

Mobile P2P Data Retrieval and Caching

ورود اطلاعات بصورت غيربرخط

Updates in Highly Unreliable, Replicated Peer-to-Peer Systems

Peer-to-Peer Networks 08 Kelips and Epidemic Algorithms

Replica Placement Model: We consider objects (and don’t worry whether they contain just data or code, or both) Distinguish different processes: A process.

-By Shrutirupa Let Us Gossip About It!! -By Shrutirupa

Presentation transcript:

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Updates: in a highly unreliable environment. Motivation: Maintaining consistent state in an unreliable environment. Update types: New data Update of existing data New node P-Grid reorganization

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis P-grid & updates

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis ‘Discovering’ new replicas 6

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Epidemic algorithms: Taxonomy (classical) Epidemic algorithms Feedback or Blind Counter or Coin

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Randomized rumor spreading A Unaware B Aware: Counter+Feedback C Aware: Counter D Aware: Stops Gossiping

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Push&Pull in an unreliable environment. Push When a new update is received Pull If replica knows that it had been offline. If it receives some Push/Query after a long time, it may like to ‘synchronize’. At random time, if it feels ‘lonely’ for a long time.

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Push

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis A B C D Duplicate messages

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Analysis: Push phase - Notations

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Analysis: Push phase Round 0

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Analysis: Push phase Round 1

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Analysis: Push phase Round 1

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Analysis: Push phase Round 1

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Analysis: Push phase Round t >= 2

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Analysis: Push phase Round t >= 2 f aware (t)= f aware (t-1) + f Δ aware (t-1)

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Analysis: Push phase Round t >= 2 ? ?

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Analysis: Push phase Round t >= 2 ML(t) = U + R B L(t) L(t) : Normalized length of the partial list of replicas (to which update has been sent).

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Analysis: Push phase Round t >= 2

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Analysis: Pull phase Pull If replica knows that it had been offline. If it receives some Push/Query after a long time, it may like to ‘synchronize’. At random time, if it feels ‘lonely’ for a long time. Pull when Push is Over (Online replicas will have the update) Going on (It may get the update as a Push message)

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Disquisition of the analytical results Varying initial online replicas

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Disquisition of the analytical results Inferences: Without a significant online population, it is difficult to propagate the update. The message overhead is relatively independent of the online population (if it is significantly large) Varying initial online replicas

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Disquisition of the analytical results Varying f r

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Disquisition of the analytical results Inferences: No need to forward messages to too many replicas, since it increases message overhead without significant benifit. Varying f r

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Disquisition of the analytical results Varying 

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Disquisition of the analytical results Inferences: The strategy is very robust to replicas going offline without forwarding the update. Curiously message overhead decreases if some replicas ‘fail’ to forward the update ! Varying 

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Disquisition of the analytical results Varying P F (t)

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Disquisition of the analytical results Inferences: The best strategy is to reduce the probability of forwarding updates with increase in Push round. Proper tuning of PF(t) is essential, lest many replicas don’t recieve the update at all ! Varying P F (t)

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Disquisition of the analytical results Parameter tuning and scalability

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Parameter tuning and scalability Though the algorithm is devised for a scenario where the maximum number of replicas will be only in thousands, it scales well (provided parameters are tuned properly). Number of duplicate messages, t, L(t) may be used to tune the parameters. Feedforward for parameter tuning? (apart from using Feedback)

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis A B C D Duplicate message avoidance - advantages and disadvantages. E F G ?

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Comparison with Gnutella like message flooding

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Comparison with Gnutella like message flooding

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Comparison with Gnutella like message flooding

©2002; Aberer,Datta,Hauswirth; LSIR-IC-EPFL. Laboratoire de systèmes d'informations répartis Comparison with Gnutella like message flooding