bar gossip
play

Bar Gossip Aleksander Jurkowski University of Warsaw - PowerPoint PPT Presentation

Dec 06, 2022 •28 likes •648 views

Bar Gossip Aleksander Jurkowski University of Warsaw aj262944@students.mimuw.edu.pl October 18, 2010 Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 1 / 25 Introduction Goal Provide p2p data streaming system usable for live

  1. Bar Gossip Aleksander Jurkowski University of Warsaw aj262944@students.mimuw.edu.pl October 18, 2010 Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 1 / 25

  2. Introduction Goal Provide p2p data streaming system usable for live podcasts. There is no competitive solution so far... Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 2 / 25

  3. Introduction Goal Provide p2p data streaming system usable for live podcasts. There is no competitive solution so far... Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 2 / 25

  4. Motivation Why BAR Gossip? Benefitting from p2p systems robustness, scalability and adaptivity Shifting costs (e.g. bandwidth) to clients Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 3 / 25

  5. Motivation Why BAR Gossip? Benefitting from p2p systems robustness, scalability and adaptivity Shifting costs (e.g. bandwidth) to clients Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 3 / 25

  6. Key features Difference from other solutions provides stable, reliable throughput focuses on short intervals does not optimize overall download speed small amount of data at given time robust agains Byzantine and Rational clients no purely local, long term based reputation Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 4 / 25

  7. Key features Difference from other solutions provides stable, reliable throughput focuses on short intervals does not optimize overall download speed small amount of data at given time robust agains Byzantine and Rational clients no purely local, long term based reputation Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 4 / 25

  8. Key features Difference from other solutions provides stable, reliable throughput focuses on short intervals does not optimize overall download speed small amount of data at given time robust agains Byzantine and Rational clients no purely local, long term based reputation Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 4 / 25

  9. Vocabulary BAR ? Byzantine - arbitrary malitious client Altruistic - implementing protocol exactly as described Rational - self-serving client Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 5 / 25

  10. Vocabulary BAR ? Byzantine - arbitrary malitious client Altruistic - implementing protocol exactly as described Rational - self-serving client Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 5 / 25

  11. Vocabulary BAR ? Byzantine - arbitrary malitious client Altruistic - implementing protocol exactly as described Rational - self-serving client Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 5 / 25

  12. Security basis Assumptions Digital signatures - each of the clients signs sent messages Dynamic membership - non-Byzantine clients remain in the system until end of the broadcast Single identity for each of the clients Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 6 / 25

  13. Security basis Assumptions Digital signatures - each of the clients signs sent messages Dynamic membership - non-Byzantine clients remain in the system until end of the broadcast Single identity for each of the clients Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 6 / 25

  14. Security basis Assumptions Digital signatures - each of the clients signs sent messages Dynamic membership - non-Byzantine clients remain in the system until end of the broadcast Single identity for each of the clients Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 6 / 25

  15. Vocabulary POM Proof Of Misbehavior - a sequence of signed messages proving that a client violates the protocol Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 7 / 25

  16. Broadcast Broadcast consists of rounds , each T + δ long T - time interval sufficient to complete message communication for one round Update expires deadline rounds after being sent by broadcaster. It is delivered to the media player after expiration. The update is considered delivered timely when it is received before the deadline Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 8 / 25

  17. Broadcast Broadcast consists of rounds , each T + δ long T - time interval sufficient to complete message communication for one round Update expires deadline rounds after being sent by broadcaster. It is delivered to the media player after expiration. The update is considered delivered timely when it is received before the deadline Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 8 / 25

  18. Broadcast Broadcast consists of rounds , each T + δ long T - time interval sufficient to complete message communication for one round Update expires deadline rounds after being sent by broadcaster. It is delivered to the media player after expiration. The update is considered delivered timely when it is received before the deadline Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 8 / 25

  19. Broadcast Broadcast consists of rounds , each T + δ long T - time interval sufficient to complete message communication for one round Update expires deadline rounds after being sent by broadcaster. It is delivered to the media player after expiration. The update is considered delivered timely when it is received before the deadline Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 8 / 25

  20. Connecting to the broadcast Client generates a session public and private key Client sends the keys to the broadcaster Broadcaster verifies the keys Broadcaster publishes a list of clients (identity, address, public key) Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 9 / 25

  21. Connecting to the broadcast Client generates a session public and private key Client sends the keys to the broadcaster Broadcaster verifies the keys Broadcaster publishes a list of clients (identity, address, public key) Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 9 / 25

  22. Connecting to the broadcast Client generates a session public and private key Client sends the keys to the broadcaster Broadcaster verifies the keys Broadcaster publishes a list of clients (identity, address, public key) Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 9 / 25

  23. Connecting to the broadcast Client generates a session public and private key Client sends the keys to the broadcaster Broadcaster verifies the keys Broadcaster publishes a list of clients (identity, address, public key) Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 9 / 25

  24. Round Broadcaster sends the update to nSeeds randomly selected clients nSeeds must be high enough for at least one non-Byzantine client to receive the update Every client cannot receive the update from the broadcaster, delivery to the rest is based on protocols: Balanced Exchange Optimistic Push Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 10 / 25

  25. Round Broadcaster sends the update to nSeeds randomly selected clients nSeeds must be high enough for at least one non-Byzantine client to receive the update Every client cannot receive the update from the broadcaster, delivery to the rest is based on protocols: Balanced Exchange Optimistic Push Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 10 / 25

  26. Round Broadcaster sends the update to nSeeds randomly selected clients nSeeds must be high enough for at least one non-Byzantine client to receive the update Every client cannot receive the update from the broadcaster, delivery to the rest is based on protocols: Balanced Exchange Optimistic Push Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 10 / 25

  27. Balanced Exchange The idea The updates are traded one by one, meaning that each of the clients sends exactly the same number of updates. Problems This protocol itself is insufficient for unlucky (rarely chosen by broadcaster) or facing network failures clients. Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 11 / 25

  28. Balanced Exchange The idea The updates are traded one by one, meaning that each of the clients sends exactly the same number of updates. Problems This protocol itself is insufficient for unlucky (rarely chosen by broadcaster) or facing network failures clients. Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 11 / 25

  29. Optimistic push Push In Optimistic Push the client can send more updates than he receives, allowing the fallen behind client to get the data. Optimistic This mechanism is considered optimistic because it is based on hope that the benefitting client will do the same favor in return later. Such behavior is not enforced by the protocol. Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 12 / 25

  30. Optimistic push Push In Optimistic Push the client can send more updates than he receives, allowing the fallen behind client to get the data. Optimistic This mechanism is considered optimistic because it is based on hope that the benefitting client will do the same favor in return later. Such behavior is not enforced by the protocol. Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 12 / 25

  31. Balanced Exchange and Optimistic Push Aleksander Jurkowski (MIM UW) Bar Gossip October 18, 2010 13 / 25

Recommend

CS5412: USING GOSSIP TO BUILD OVERLAY NETWORKS Lecture XX Ken Birman Gossip and Network

CS5412: USING GOSSIP TO BUILD OVERLAY NETWORKS Lecture XX Ken Birman Gossip and Network

Gossip-Based Networking Workshop 1 CS5412: USING GOSSIP TO BUILD OVERLAY NETWORKS Lecture XX Ken Birman Gossip and Network Overlays A topic that has received a lot of recent attention Today well look at three representative

443 views • 16 slides
Gossip and Self-Stabilization Lonnie Princehouse CS 5412 February 28, 2012 Gossip Protocols

Gossip and Self-Stabilization Lonnie Princehouse CS 5412 February 28, 2012 Gossip Protocols

Gossip and Self-Stabilization Lonnie Princehouse CS 5412 February 28, 2012 Gossip Protocols Gossip is the family of protocols loosely characterized by Randomized peer selection Probabilistic convergence Round-based execution

1.18k views • 51 slides
Ken Birman i Cornell University. CS5410 Fall 2008. Gossip 201 Last time we saw that gossip

Ken Birman i Cornell University. CS5410 Fall 2008. Gossip 201 Last time we saw that gossip

Ken Birman i Cornell University. CS5410 Fall 2008. Gossip 201 Last time we saw that gossip spreads in log(system size) time But is this actually fast? B i hi ll f 1.0 d % infected 0.0 Time Gossip in distributed

493 views • 32 slides
CS5412: BIMODAL MULTICAST ASTROLABE Lecture XIX Ken Birman Leiden; Dec 06 Gossip 201 2

CS5412: BIMODAL MULTICAST ASTROLABE Lecture XIX Ken Birman Leiden; Dec 06 Gossip 201 2

Gossip-Based Networking Workshop 1 CS5412: BIMODAL MULTICAST ASTROLABE Lecture XIX Ken Birman Leiden; Dec 06 Gossip 201 2 Recall from early in the semester that gossip spreads in log(system size) time But is this actually

607 views • 40 slides
CS5412/LECTURE 12 Ken Birman GOSSIP PROTOCOLS CS5412 Spring 2019

CS5412/LECTURE 12 Ken Birman GOSSIP PROTOCOLS CS5412 Spring 2019

CS5412/LECTURE 12 Ken Birman GOSSIP PROTOCOLS CS5412 Spring 2019 HTTP://WWW.CS.CORNELL.EDU/COURSES/CS5412/2019SP 1 GOSSIP 101 Gossip protocols: Ones in which information is spread node-to-node at random, like a Zombie virus. At first, the

543 views • 42 slides
Heterogeneous Gossip Davide Frey Rachid Guerraoui Anne-Marie Kermarrec Boris Koldehofe Maxime

Heterogeneous Gossip Davide Frey Rachid Guerraoui Anne-Marie Kermarrec Boris Koldehofe Maxime

Heterogeneous Gossip Davide Frey Rachid Guerraoui Anne-Marie Kermarrec Boris Koldehofe Maxime Monod Martin Mogensen Vivien Quma Outline Context Live Streaming Gossip Limitations Heterogeneous Gossip Protocol

824 views • 24 slides
Distributed Gossip Protocols Krzysztof R. Apt CWI and University of Amsterdam Based on joint

Distributed Gossip Protocols Krzysztof R. Apt CWI and University of Amsterdam Based on joint

Distributed Gossip Protocols Krzysztof R. Apt CWI and University of Amsterdam Based on joint work with Wiebe van der Hoek and Davide Grossi Anyone who has obeyed nature by transmitting a piece of gossip experiences the explosive relief that

498 views • 49 slides
Gossip Based Dissemination R. Friedman 1 A.-M. Kermarrec 2 H. Miranda 3 L. Rodrigues 4 1 Technion,

Gossip Based Dissemination R. Friedman 1 A.-M. Kermarrec 2 H. Miranda 3 L. Rodrigues 4 1 Technion,

Gossip Based Dissemination R. Friedman 1 A.-M. Kermarrec 2 H. Miranda 3 L. Rodrigues 4 1 Technion, Israel 2 INRIA, France 3 U. of Lisbon, Portugal 4 INESC-ID/IST, Portugal MiNEMA Winter School March 25th, 2009 Gossip Example The Election Rumour

980 views • 42 slides
Epistemic Gossip Protocols Krzysztof R. Apt CWI Based on joint work with Wiebe van der Hoek

Epistemic Gossip Protocols Krzysztof R. Apt CWI Based on joint work with Wiebe van der Hoek

Epistemic Gossip Protocols Krzysztof R. Apt CWI Based on joint work with Wiebe van der Hoek and Davide Grossi Anyone who has obeyed nature by transmitting a piece of gossip experiences the explosive relief that accompanies the satisfying of

874 views • 50 slides
Engineering Emergence through Gossip ! Communication network ! The nodes of the network are people

Engineering Emergence through Gossip ! Communication network ! The nodes of the network are people

Abstract Components of Gossip (I) Engineering Emergence through Gossip ! Communication network ! The nodes of the network are people ! The connections (edges) in the network are Mrk Jelasity defined by relations such as neighbours, friends,

446 views • 10 slides
2 GOSSIP READ IT, FEEL IT, GENERATE IT! - WE INTRODUCE TO YOU THE FUTURE OF NEWS AGGREGATORS

2 GOSSIP READ IT, FEEL IT, GENERATE IT! - WE INTRODUCE TO YOU THE FUTURE OF NEWS AGGREGATORS

2 GOSSIP READ IT, FEEL IT, GENERATE IT! - WE INTRODUCE TO YOU THE FUTURE OF NEWS AGGREGATORS USING YOUR EMOTIONAL RESPONSE TO PROVIDE THE MOST INTERESTING NEWS & GOSSIP WORLD WIDE! Questions & feedback

457 views • 11 slides
ALMOST SURE CONVERGENCE OF RANDOM GOSSIP ALGORITHMS Giorgio Picci with T. Taylor, ASU Tempe AZ.

ALMOST SURE CONVERGENCE OF RANDOM GOSSIP ALGORITHMS Giorgio Picci with T. Taylor, ASU Tempe AZ.

ALMOST SURE CONVERGENCE OF RANDOM GOSSIP ALGORITHMS Giorgio Picci with T. Taylor, ASU Tempe AZ. Wofgang Runggaldiers Birthday, Brixen July 2007 1 CONSENSUS FOR RANDOM GOSSIP ALGORITHMS Consider a finite set of nodes representing say

452 views • 12 slides
Middleware for Gossip Protocols Michael Chow and Robbert van Renesse Cornell University Mo:va:on

Middleware for Gossip Protocols Michael Chow and Robbert van Renesse Cornell University Mo:va:on

Middleware for Gossip Protocols Michael Chow and Robbert van Renesse Cornell University Mo:va:on Gossip protocols are highly robust Problema:c when an error does occur E.g. Amazon S3 6 hours to fix an otherwise simple problem

635 views • 37 slides
CS5412: BIMODAL MULTICAST ASTROLABE Lecture XIX Ken Birman Gossip 201 2 Recall from early

CS5412: BIMODAL MULTICAST ASTROLABE Lecture XIX Ken Birman Gossip 201 2 Recall from early

CS5412 Spring 2016 1 CS5412: BIMODAL MULTICAST ASTROLABE Lecture XIX Ken Birman Gossip 201 2 Recall from early in the semester that gossip spreads in log(system size) time But is this actually fast? 1.0 % infected 0.0 Time

643 views • 49 slides
Simple, Fast and Deterministic Gossip and Rumor Spreading Main paper by: B. Haeupler, MIT Talk

Simple, Fast and Deterministic Gossip and Rumor Spreading Main paper by: B. Haeupler, MIT Talk

Simple, Fast and Deterministic Gossip and Rumor Spreading Main paper by: B. Haeupler, MIT Talk by: Alessandro Dovis, ETH Presentation Outline What is gossip? Applications Basic Algorithms Advanced Algorithms Other

1.57k views • 88 slides
Gossip-based peer sampling Mateusz Fedoryszak on the base of M. Jelasity, S. Voulgaris, R.

Gossip-based peer sampling Mateusz Fedoryszak on the base of M. Jelasity, S. Voulgaris, R.

Gossip-based peer sampling Mateusz Fedoryszak on the base of M. Jelasity, S. Voulgaris, R. Guerraoui, A.-M. Kermarrec, and M. van Steen: Gossip - based peer sampling, ACM Transactions on Computer Systems, vol. 25, no. 3, August 2007,

474 views • 21 slides
1 Convergent consistency Kelips To illustrate our point, contrast Cornells Kelips system

1 Convergent consistency Kelips To illustrate our point, contrast Cornells Kelips system

On Gossip and Shape Epidemic Algorithms and Why is gossip interesting? Emergent Shape Powerful convergence properties? Especially in support of epidemics Mathematical elegance? Ken Birman But only if the system model

390 views • 11 slides
Gossip-based Truth Discovery Motivation Motivating Examples Problem Formulation Zhiying Xu

Gossip-based Truth Discovery Motivation Motivating Examples Problem Formulation Zhiying Xu

Gossip-based Truth Discovery Zhiying Xu Introduction Gossip-based Truth Discovery Motivation Motivating Examples Problem Formulation Zhiying Xu Computational Complexity Proposed Algorithms Exact June 4, 2017 Algorithm

1.1k views • 41 slides
Hierarchical Spatial Gossip for Hierarchical Spatial Gossip for Multi- -Resolution

Hierarchical Spatial Gossip for Hierarchical Spatial Gossip for Multi- -Resolution

Hierarchical Spatial Gossip for Hierarchical Spatial Gossip for Multi- -Resolution Representations Resolution Representations Multi in Sensor Networks in Sensor Networks Rik Sarkar Sarkar Xianjin Zhu Zhu Jie Jie Gao Gao Rik

489 views • 23 slides
Fundmentals 1 Our world is made of: Stories and gossip make up 65% of our daily conversations.

Fundmentals 1 Our world is made of: Stories and gossip make up 65% of our daily conversations.

Help is at the door: Brand New Public Awareness tools for Home Visiting Programs Marketing is WO WORDS VI VISUAL SUALS STRATE STRATEGY GY Fundmentals 1 Our world is made of: Stories and gossip make up 65% of our daily

351 views • 14 slides
Balancing Gossip Exchanges in Networks with van Renesse and Firewalls L. Rodrigues

Balancing Gossip Exchanges in Networks with van Renesse and Firewalls L. Rodrigues

Balancing Gossip Exchanges in Networks with Firewalls J. Leit ao, R. Balancing Gossip Exchanges in Networks with van Renesse and Firewalls L. Rodrigues Introduction Balancing J. Leit ao, R. van Renesse and L. Rodrigues Gossip

1.02k views • 76 slides
The epistemic gossip problem Sequential and parallel protocols To appear in Discrete Mathematics

The epistemic gossip problem Sequential and parallel protocols To appear in Discrete Mathematics

The epistemic gossip problem Sequential and parallel protocols To appear in Discrete Mathematics (342)3, March 2019 https://authors.elsevier.com/c/1Y8W5,H-cE-W9 Martin C. Cooper, Andreas Herzig, Faustine Maffre, Frdric Maris, Pierre Rgnier

622 views • 36 slides
OVERHEAD OF A DECENTRALIZED GOSSIP ALGORITHM ON THE PERFORMANCE OF HPC APPLICATIONS ELY

OVERHEAD OF A DECENTRALIZED GOSSIP ALGORITHM ON THE PERFORMANCE OF HPC APPLICATIONS ELY

The Hebrew University of Jerusalem Faculty of Computer Science Institute of Systems Architecture, Operating Systems Group OVERHEAD OF A DECENTRALIZED GOSSIP ALGORITHM ON THE PERFORMANCE OF HPC APPLICATIONS ELY LEVY, AMNON BARAK, AMNON

202 views • 17 slides
Gossip Gossip pping in pp pp pping in p g g Bolo Bolo ogna ogna Ozalp Ba Ozalp Ba

Gossip Gossip pping in pp pp pping in p g g Bolo Bolo ogna ogna Ozalp Ba Ozalp Ba

Gossip Gossip pping in pp pp pping in p g g Bolo Bolo ogna ogna Ozalp Ba Ozalp Ba abaoglu abaoglu ALMA MATER STUDIORUM U ALMA MATER STUDIORUM U UNIVERSITA DI BOLOGNA UNIVERSITA DI BOLOGNA Background Background

654 views • 47 slides

More recommend