“SUB-2-SUB” Self-Organizing Collaborative Content-based Pub/Sub Spyros Voulgaris, Etienne Rivière, Anne-Marie Kermarrec, Maarten van Steen.

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

CAN 1.Distributed Hash Tables a)DHT recap b)Uses c)Example – CAN.
Alex Cheung and Hans-Arno Jacobsen August, 14 th 2009 MIDDLEWARE SYSTEMS RESEARCH GROUP.
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.
Peer to Peer and Distributed Hash Tables
Pastry Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK Some slides are borrowed from the original presentation by the authors.
20/10/2006ALPAGE1 Ordered slicing of very large scale overlay networks Mark Jelasity University of Bologna, Italy Anne-Marie Kermarrec INRIA Rennes/IRISA,
Cognitive Publish/Subscribe for Heterogeneous Clouds Šarūnas Girdzijauskas, Swedish Institute of Computer Science (SICS) Joint work with:
Network Coding in Peer-to-Peer Networks Presented by Chu Chun Ngai
1 PASTRY Partially borrowed from Gabi Kliot ’ s presentation.
LightFlood: An Optimal Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.
Common approach 1. Define space: assign random ID (160-bit) to each node and key 2. Define a metric topology in this space,  that is, the space of keys.
Small-Scale Peer-to-Peer Publish/Subscribe
Unstructured overlays: construction, optimization, applications Anne-Marie Kermarrec Joint work with Laurent Massoulié and Ayalvadi Ganesh.
Subscription Subsumption Evaluation for Content-Based Publish/Subscribe Systems Hojjat Jafarpour, Bijit Hore, Sharad Mehrotra, and Nalini Venkatasubramanian.
Applications over P2P Structured Overlays Antonino Virgillito.
©NEC Laboratories America 1 Hui Zhang Samrat Ganguly Sudeept Bhatnagar Rauf Izmailov NEC Labs America Abhishek Sharma University of Southern California.
M ERCURY : A Scalable Publish-Subscribe System for Internet Games Ashwin R. Bharambe, Sanjay Rao & Srinivasan Seshan Carnegie Mellon University.
More routing protocols Alec Woo June 18 th, 2002.
Carnegie Mellon University Complex queries in distributed publish- subscribe systems Ashwin R. Bharambe, Justin Weisz and Srinivasan Seshan.
Mercury: Scalable Routing for Range Queries Ashwin R. Bharambe Carnegie Mellon University With Mukesh Agrawal, Srinivasan Seshan.
Fault-tolerant Routing in Peer-to-Peer Systems James Aspnes Zoë Diamadi Gauri Shah Yale University PODC 2002.
Efficient Content Location Using Interest-based Locality in Peer-to-Peer Systems Presented by: Lin Wing Kai.
Aggregating Information in Peer-to-Peer Systems for Improved Join and Leave Distributed Computing Group Keno Albrecht Ruedi Arnold Michael Gähwiler Roger.
Mercury: Supporting Scalable Multi-Attribute Range Queries A. Bharambe, M. Agrawal, S. Seshan In Proceedings of the SIGCOMM’04, USA Παρουσίαση: Τζιοβάρα.
Topics in Reliable Distributed Systems Fall Dr. Idit Keidar.
Intradomain Anycast for Content Centric Networks.
ICDE A Peer-to-peer Framework for Caching Range Queries Ozgur D. Sahin Abhishek Gupta Divyakant Agrawal Amr El Abbadi Department of Computer Science.
Distributed Publish/Subscribe Network Presented by: Yu-Ling Chang.
© 2009 AT&T Intellectual Property. All rights reserved. Multimedia content growth: From IP networks to Medianets Cisco-IEEE ComSoc Webinar. Sept. 23, 2009.
INTRODUCTION TO PEER TO PEER NETWORKS Z.M. Joseph CSE 6392 – DB Exploration Spring 2006 CSE, UT Arlington.
Roger ZimmermannCOMPSAC 2004, September 30 Spatial Data Query Support in Peer-to-Peer Systems Roger Zimmermann, Wei-Shinn Ku, and Haojun Wang Computer.
Alex King Yeung Cheung and Hans-Arno Jacobsen University of Toronto June, 24 th 2010 ICDCS 2010 MIDDLEWARE SYSTEMS RESEARCH GROUP.
COCONET: Co-Operative Cache driven Overlay NETwork for p2p VoD streaming Abhishek Bhattacharya, Zhenyu Yang & Deng Pan.
PIC: Practical Internet Coordinates for Distance Estimation Manuel Costa joint work with Miguel Castro, Ant Rowstron, Peter Key Microsoft Research Cambridge.
Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks Niloy Ganguly.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved Chapter 2 ARCHITECTURES.
Distributed Load Balancing for Key-Value Storage Systems Imranul Hoque Michael Spreitzer Malgorzata Steinder.
GeoGrid: A scalable Location Service Network Authors: J.Zhang, G.Zhang, L.Liu Georgia Institute of Technology presented by Olga Weiss Com S 587x, Fall.
Gil EinzigerRoy Friedman Computer Science Department Technion.
Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications Xiaozhou Li COS 461: Computer Networks (precept 04/06/12) Princeton University.
Tony McGregor RIPE NCC Visiting Researcher The University of Waikato DAR Active measurement in the large.
Implicit group messaging in peer-to-peer networks Daniel Cutting, 28th April 2006 Advanced Networks Research Group.
An IP Address Based Caching Scheme for Peer-to-Peer Networks Ronaldo Alves Ferreira Joint work with Ananth Grama and Suresh Jagannathan Department of Computer.
SIGCOMM 2001 Lecture slides by Dr. Yingwu Zhu Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.
Analyzing the Vulnerability of Superpeer Networks Against Attack Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
A Membership Management Protocol for Mobile P2P Networks Mohamed Karim SBAI, Emna SALHI, Chadi BARAKAT.
Content-based Publish-Subscribe Over Structured P2P Networks Peter Triantafillou and Ioannis Aekaterinidis Presented by Jesse Chen 4/10/07.
DHT-based unicast for mobile ad hoc networks Thomas Zahn, Jochen Schiller Institute of Computer Science Freie Universitat Berlin 報告 : 羅世豪.
Lecture 12 Distributed Hash Tables CPE 401/601 Computer Network Systems slides are modified from Jennifer Rexford.
LightFlood: An Efficient Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.
Information-Centric Networks10b-1 Week 10 / Paper 2 Hermes: a distributed event-based middleware architecture –P.R. Pietzuch, J.M. Bacon –ICDCS 2002 Workshops.
Information-Centric Networks Section # 10.2: Publish/Subscribe Instructor: George Xylomenos Department: Informatics.
Algorithms and Techniques in Structured Scalable Peer-to-Peer Networks
Peter R Pietzuch and Jean Bacon Peer-to-Peer Overlay Networks in an Event-Based Middleware DEBS’03, San Diego, CA, USA,
LOOKING UP DATA IN P2P SYSTEMS Hari Balakrishnan M. Frans Kaashoek David Karger Robert Morris Ion Stoica MIT LCS.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Design and implementation of an intentional naming system William Adjie-WinotoElliot Schwartz Hari BalakrishnanJeremy Lilley MIT Laboratory for Computer.
Two Peer-to-Peer Networking Approaches Ken Calvert Net Seminar, 23 October 2001 Note: Many slides “borrowed” from S. Ratnasamy’s Qualifying Exam talk.
INTERNET TECHNOLOGIES Week 10 Peer to Peer Paradigm 1.
Stefanos Antaris Distributed Publish/Subscribe Notification System for Online Social Networks Stefanos Antaris *, Sarunas Girdzijauskas † George Pallis.
Incrementally Improving Lookup Latency in Distributed Hash Table Systems Hui Zhang 1, Ashish Goel 2, Ramesh Govindan 1 1 University of Southern California.
CSE 486/586 Distributed Systems Distributed Hash Tables
Fabián E. Bustamante, Fall 2005 A brief introduction to Pastry Based on: A. Rowstron and P. Druschel, Pastry: Scalable, decentralized object location and.
Distributed Hash Tables (DHT) Jukka K. Nurminen *Adapted from slides provided by Stefan Götz and Klaus Wehrle (University of Tübingen)
Peer-to-peer networking
DIMPLE: DynamIc Membership ProtocoL for Epidemic protocols
Small-Scale Peer-to-Peer Publish/Subscribe
A Semantic Peer-to-Peer Overlay for Web Services Discovery
Presentation transcript:

“SUB-2-SUB” Self-Organizing Collaborative Content-based Pub/Sub Spyros Voulgaris, Etienne Rivière, Anne-Marie Kermarrec, Maarten van Steen

2/18 Publish/Subscribe What are pub/sub systems?  Subscribers register their interest  Publishers issue events  An event is delivered to all interested subscribers, and no others Here: Content-based Pub/Sub  Range subscriptions on multiple numeric attributes.

3/18 Current systems:  Centralized servers (e.g., Tibco)  Broker-based (e.g., Siena) Servers become a bottleneck/single point of failure  network size increases  node churn increases  more events are published Triggered interest in decentralized P2P solutions Current solutions

4/18 What kind of P2P system is suitable? Most research has focused on Structured P2P (DHTs)  Map attribute to peer Peers handling popular attributes get overloaded  Map (attribute,value) to peer Can lead to explosion of registrations for range subscriptions Meghdoot, based on CAN DHT, supports ranges too We show how Unstructured P2P can give a simple and efficient solution, supporting ranges Interest in P2P solutions

5/18 Sub-2-Sub: System Model Assume N attributes (real numbers)  A 1, A 2, …, A N Subscriptions are range (trivially exact) predicates on one or more attributes  E.g. A 2 ==3.07 && (2.5< A 4 <4.7)  One subscription per peer Events define exact values for all attributes  E.g. {A 1,A 2,A 3,A 4 } = {3, 0, 7, 10.5} The set of all possible events define the event space  It’s an N-dimensional, continuous space

6/18 Sub-2-Sub: Key Concept “Partition event space in homogeneous subspaces” (homogeneous subspace: all its events have the same subscribers)

7/18 Sub-2-Sub: Operation 1. Let subscribers of “near” subspaces discover each other 2. Organize subscribers of the each subspace in a ring 3. To publish an event, navigate to the target subspace, and hand the event to any one subscriber  Event reaches all and only interested subscribers, autonomously!

8/18 How do we build Sub-2-Sub? How do we…  Q1: …maintain connectivity in the face of churn / failures?  Q2: …form links between related subscribers?  Q3: …organize subscribers within a subspace in a ring? Each node  3 sets of links to other nodes  Managed by 3 gossiping protocols

9/18 We use the CYCLON gossiping protocol [S. Voulgaris, D. Gavidia, M. van Steen. Journal of Network and Systems Management, Vol. 13, No. 2, June 2005] Nodes maintain a few links to other nodes Periodically a node gossips to exchange some links CYCLON overlays have shown to:  Resemble random graphs  Be extremely robust to failures / churn  Fast adaptive to network changes Q1: Maintaining connectivity

10/18 We need some notion of distance In this case we use the Euclidean distance between two subscriptions  Note: Distance 0 denotes overlap Nodes gossip similarly to CYCLON,  but keep neighbors of minimum distance  “VICINITY” protocol [S. Voulgaris, M. van Steen. EuroPar 2005] Why not run VICINITY alone (without CYCLON)?  The network would fall apart in no time! Q2: Forming links (related subscr.)

11/18 We run VICINITY again, with another distance metric. Please refer to the paper! Q3: Organizing subscribers in rings

12/18 Sub-2-Sub: To recap Random subscribers (CYCLON) Overlapping subscr. (VICINITY) Ring links (VICINITY)

13/18 Performance Evaluation Simulated experiment:  10K nodes  3 attributes  For each attribute: Power-law (1/x^3) value popularity Uniformly random range widths Evaluation criteria  How fast the network self-organizes  How fast publishers reach target subspace  How fast events are disseminated

14/18 Self-organization evolution Each bar corresponds to 10,000 random events

15/18 Hops to reach target subspace # publishers

16/18 Hops for Event Dissemination # subscribers in subspace hops to complete dissemination

17/18 Summary Showed that Unstructured P2P can build overlays for apps as complex as pub/sub Sub-2-Sub  Accurate  All and only interested nodes receive event  Autonomous, Self-contained  No need for extra devices  Collaborative  Self-organized  Very scalable

18/18 Questions?

19/18 Ring sizes