1 / 4

Fireflies: Scalable Intrusion-Tolerant Overlay Networking

Fireflies: Scalable Intrusion-Tolerant Overlay Networking. R o bbert v a n Renesse and Maya Haridasan, C o rnell University Håvard Johansen, Tromsø University, Norway André Allevana, University of Waterloo, Canada. Internet. Overlay Networks gaining in popularity.

williamsronald
Download Presentation

Fireflies: Scalable Intrusion-Tolerant Overlay Networking

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Fireflies: Scalable Intrusion-Tolerant Overlay Networking Robbert van Renesse and Maya Haridasan, Cornell University Håvard Johansen, Tromsø University, Norway André Allevana, University of Waterloo, Canada

  2. Internet Overlay Networks gaining in popularity Important additional functionality without changing Internet: • Multicast Routing • Resilient Routing • Content-based Routing DHTs often used, but: • Fragile, insecure routes • Nodes easily “eclipsed” •  No good for secure applications

  3. Fireflies Structure Accuse and rebut Deliver within  4 protocol components Each member monitors its 2t + 1 successors Membership Gossip 2t + 1 virtual rings: Pinging Set Reconciliation Monitor & Suspect Exchange diffs EACH COMPONENT IS PROBABILISTIC t chosen such that each member has no more than t byzantine predecessors with high probability

  4. Partial view gossip with connections PlanetLab Experiment #members accusation rate (accs/sec) Erdös & Rényi: if probability of link is high enough, graph will be connected with high probability Chung & Lu: such a graph will have logarithmic diameter Bandwidth (bytes/sec)

More Related