1 / 11

BubbleStorm Overview

BubbleStorm Overview. Christof Leng, Max Lehn, Robert Rehner. Peer-to-Peer: A Failure?. The hype is over cornered in the file-sharing niche few new applications appear most applications are relatively primitive research results are too complex for practical use What developers want:

estrella-gomez
Download Presentation

BubbleStorm Overview

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. BubbleStorm Overview Christof Leng, Max Lehn, Robert Rehner 18.04.2011 | Databases and Distributed Systems

  2. Peer-to-Peer: A Failure? • The hype is over • cornered in the file-sharing niche • few new applications appear • most applications are relatively primitive • research results are too complex for practical use • What developers want: • powerful queries (keyword search, SQL, XPath) • proper abstraction • predictable reliability • easy to use 18.04.2011 | Databases and Distributed Systems

  3. Separation of Concerns Expressive search is easy Frontend Application Logic Backend Data Store BubbleStorm Middleware BubbleStorm Middleware Black Box Internet 18.04.2011 | Databases and Distributed Systems

  4. Powerful search Push and Pull possible O(√n) replicas Very scalable Network size static Query/Data ratio static No resilience against churn Principle of Rendezvous Search search request Web Server query new page found Crawler data 18.04.2011 | Databases and Distributed Systems

  5. CAP-Theorem (also known as Brewer‘s theorem) You can never satisfy all three of the following guarantees Consistency • all nodes see the same data at the same time Availability • node failures do not prevent survivors from continuing to operate Partition tolerance • the system continues to operate despite arbitrary message loss Wegiveupsomeconsistency andtrytomaximizethetwootherguarantees 18.04.2011 | Databases and Distributed Systems

  6. O(√λn) replicas Probabilistic guarantees Flexible balancing Resilient against churn BubbleStorm Concept Searching Node query Publisher Node data BubbleStorm: Resilient, Probabilistic, and Exhaustive Peer-to-Peer SearchWesley W. Terpstra, Jussi Kangasharju, Christof Leng, Alejandro P. BuchmannProceedings of the 2007 ACM SIGCOMM Conference, Kyoto, Japan, August 2007 18.04.2011 | Databases and Distributed Systems

  7. Random Topology 18.04.2011 | Databases and Distributed Systems

  8. Bubblecast 18.04.2011 | Databases and Distributed Systems

  9. Three Types of Replication Fading Data • fire & forget • no updates • cannot be deleted • no overhead • will diminish over time Managed Data • tied to a maintainer • updates / deletes serialized by maintainer • new nodes poll for managed data • disappears when maintainer leaves • orphaned / inconsistent data gets flushed eventually Durable Data • should stay forever (unless deleted) • use unstructured key-based routing • update / delete possible • eventual consistency enabled by churn Maintaining Replicas in Unstructured P2P SystemsChristof Leng, Wesley W. Terpstra, Bettina Kemme, Wilhelm Stannat, Alejandro P. BuchmannProceedings of ACM CoNEXT 2008, Madrid, Spain, December 2008 Publication under preparation 18.04.2011 | Databases and Distributed Systems

  10. BubbleStorm Wrap-up • Resilient, probabilistic peer-to-peer search overlay • Tailor-made for complex queries or publish/subscribe • Mutable metadata stored in the network • Different replication modes for typical scenarios • Easy to use for application developers 18.04.2011 | Databases and Distributed Systems

  11. Thanks for listening! ? Questions http://www.bubblestorm.net http://www.dvs.tu-darmstadt.de 18.04.2011 | Databases and Distributed Systems

More Related