Data-centric Networking Through Adaptive Content-based Routing Hans-Arno Jacobsen Bell University Laboratory Chair Middleware Systems Research Group University.

Data-centric Networking Through Adaptive Content-based Routing Hans-Arno Jacobsen Bell University Laboratory Chair Middleware Systems Research Group University of Toronto MIDDLEWARE SYSTEMS RESEARCH GROUP http://www.padres.msrg.utoronto.ca Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 Amazon to Chapters to You.... Monday, October 10th in Cyberspace Your book “...” is available at.... $10 off Thursday, November 15th, in Toronto

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 else Business Process Example Check score Credit check Credit check 2 Check score 2 Reject Approve Send to officer Store in DB … … Loan Application Processing

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 Large-scale Business Processes Vendor Sale Manufactory Finance Dispatch B Out-stock B Pick-up goods Packaging Marketing Design Out-stock B Target price Prototype OutTake Control Assign Confirm Determinate plan Check stock Raw materials Audit Raw Determinate plan Execute plan Process control Monitor Process Pay Check Signature Print receipt Warehouse Delivery FedEx Pick up Monitoring Statistic Chart Strategy Design Marketing Order Manufactory Payment Requirement collection Feature selection Goods selection Confirm features Material Make plan Feedback Check order Fill order Check dealerCheck credit Approval Validate Affirm order Sale prediction Sign Contract CCC administrate Goods delivery Fill dispatch bill Fill out-stock bill Credit card

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 What is the Common Denominator? Many applications are driven by asynchronous state transitions.  Something happens, … an appropriate reaction is expected and required. Asynchronous state transitions represent events.  A process is triggered, a request submitted, … Many applications require event management and processing capabilities to run effectively.

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 In Terms of the Examples These applications are driven by events  Information matching the query is found and indexed  Person walks by a bookstore  Loan request is submitted online Abstractly speaking events are disseminated and filtered against queries events queries

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 What Event Processing Support is Required ? De-coupling and loose coupling Fine-grained event filtering In-network event processing Composite event detection Event correlation

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 Many Applications are Event-based A BC D E F RFID and sensor networksService oriented architectures Workflows, business processes and job scheduling Supply chain and logistics Event-Based Light Callback Razor SKU Transform Fault Temperature Invoke Loan Order Delivered In flight Job A done Trigger

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 What Abstractions Do Not Work? Databases  Great for managing historic data  But what about future data Data streams  Great for managing structured streams of tuples  But what about un-structured, multi-typed, sporadic events from many sources Rule-based expert systems  Great for inference and reasoning  But what about managing large numbers of fined-grained filters in distributed envrionments Take this cum gran salis

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 What Abstractions Enable Event Processing? The afore-mentioned points can best be addressed by  The content-based publish/subscribe model  Realized by content-based message routing Events are conveyed as publications. Event listening, filtering and correlating is based on content-based subscriptions managed by the pub/sub system.

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 Publish/Subscribe 101 Not all publish/subscribe is equal Publish/Subscribe models and evolution  Channel-based OMG CORBA Event Service, …  Topic-based WS Notifications, OMG Data Dissemination Service …  Type-based OMG Data Dissemination Service (partially), …  Content-based The PADRES ESB (see below), …  State-based  Subject Spaces

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 Content-based Publish/Subscribe Publisher Subscriber Subscriptions Publications Notification IBM=84 MSFT=27 INTC=19 JNJ=58 ORCL=12 HON=24 AMGN=58 Stock markets NYSE NASDAQ TSX Subscriptions: IBM > 85 ORCL < 10 JNJ > 60 Broker(s)

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 The Content-based Pub/Sub Model Language and data model  Boolean functions over predicates  Subscriptions are conjunctions of predicates  Publications are sets of attribute-value pairs Matching semantic  A subscription matches if all its predicates match Example Tree- structured data Graph- structured data Un-structured data Regular languages Relational model Subscription XPathRDF QueryKeywordsRegular expressions SQL Publication XMLRSS feedsText, documentsSentences over some alphabet DBs, i.e., tables

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 data tuples subscriptions query publication Query and subscription are very similar. Data tuples and publication are very similar. However, the two problem statements are inverse. That’s Like Data Base Querying  !! sets of tuples About past About future sets of tuples

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Content-based Message Routing Event-Based Decoupled Flexible Responsive Content Routing Declarative A1 S2 P1 S1 P2 S2 [class,=,stock],[symbol,=,YHOO],[price,>,20.0] [class,=,stock],[symbol,=,MSFT],[price,>,50.0] [class,=,stock],[symbol,=,YHOO] [class,=,stock],[price,>,40.0] A2 S1 [class, stock],[symbol, YHOO],[price,25.0] [class, stock],[symbol, YHOO],[price,45.0] [class, stock],[symbol, MSFT],[price, 55.0] Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Publication Space weight height Adv: [height > 70],[weight > 25] Sub: [height > 75],[weight > 20] 70 75 Sub intersecting Adv 2025 weight height Sub: [height > 75],[weight > 20] 70 90 Pub matching Sub 2032 Pub: [height, 90],[weight, 32] Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 ToPSS - The Toronto Publish/Subscribe System Family [2000 – present] Matching algorithms  Language expressiveness vs. efficient matching Routing protocols  Network architectures & scalability Higher level abstractions  Workflow execution  Monitoring S-ToPSS (semantic) X-ToPSS (XML matching) A-ToPSS (approximate) persistent-ToPSS (subject spaces) L-ToPSS (location-based) ToPSS (matching) M-ToPSS (mobile) Ad hoc-ToPSS (ad hoc networking) Federated-ToPSS (federation of ToPSS brokers) Rb-ToPSS (rule-based) P2P-ToPSS (peer-to-peer) LB-ToPSS (load balancing) FT-ToPSS (fault tolerance) Historic-ToPSS (historic data) CS-ToPSS (composite subs) BPEL-ToPSS (BPEL execution) JS-ToPSS (job scheduling)

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen PADRES Data-centric Event Bus First generation of students, when I looked away   Peng Alex David aRno Eli Serge PADRES is Publish/subscribe Applied to Distributed Resource Scheduling PAdres is Distributed REsource Scheduling http://www.padres.msrg.utoronto.ca Acknowledgements http://padres.msrg.utoronto.ca Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 PADRES Event Bus Consists of pub/sub message brokers  Content-based publish/subscribe interface  Content-based message routing  Store-and-forward message queuing Comprised of a federation of brokers deployed as overlay Offers a slim client library for applications Soon available under an open (source) license model and as Apache Poloka incubation project

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 B B B S S P B P B input queue output queue dest2 output queue dest3 dest1 dest2 dest3 P S = publisher = subscriber subscriptiondest Matching Engine Routing Table + temperature > 37 dest2 temperature > 40 dest3 Publications temperature = 38temperature = 42temperature = 36 PADRES Event Broker

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Queue Handler Pre Processor Post Processor Forwarder PADRES Broker Matcher Input Queue Output Queues PRT SRT Pub/Sub Messages Event Broker Architecture If sub intersectsSend to [class,=,foo],[attr,>,17]B1 If pub matchesSend to [class,=,foo],[attr,>,20]B2 Adv Sub Pub Sub Pub Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 Innovative PADRES Features A BC D E F Composite Events Historic Access Management Robustness Load Balancing Security

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Limitations of Acyclic Overlays Sensitive to  Congestion  Imbalanced workloads  Broker failures  Overlay changes Broker Publisher Subscriber P Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen PPP P Robust Self-healing Adaptive Flexible Publisher Subscriber Congested Link General Overlay Network Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Challenges with General Overlays Subscriptions route in loops Brokers receive duplicate subscriptions Multiple copies of message maybe created Same problem for publications 2 34 5 1 6 Adv 1 Adv 2 S X S S Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Content-based Routing in General Overlays Maintain the same interface to pub/sub clients Develop content-based routing protocols for  Advertisement  Subscription  Publication Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Advertisement Routing Each advertisement forms a spanning advertisement tree Duplicate advertisements are discarded by brokers Each advertisement is assigned a unique tree identifier (TID)  e.g., A: [class,=,stock]……[TID,=,adv_msg_id] SRT (Subscription Routing Table)  A set of [advertisement, last hop] Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Subscription Routing I Each subscription augmented with a TID- predicate with a variable.  e.g., S: [class,=,stock] … [TID,=,$X] The variable is bound to the TID of matching advertisements PRT (Publication Routing Table)  A set of [subscription, { (TID, last hop of subscription) } ] Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen S: [class,=,stock],[name,=,*],[price,>,50], [TID,=,$Z] At Broker 1: Adv1: [class,=,stock],[name,=,IBM], [price,>,60],[TID,=,Adv1] Adv2: [class,=,stock],[name,=,HP], [price,>,50],[TID,=,Adv2] S matching Adv1: [class,=,stock],[name,=,*], [price,>,50],[TID,=,Adv1] S matching Adv2: [class,=,stock],[name,=,*],[price,>,50], [TID,=,Adv2] Subscription Routing II 2 34 5 1 6 Adv 1 Adv 2 S X S Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Publication Routing Each publication is assigned the TID of its inducing advertisement  e.g., P [class, stock]……[TID, adv_msg_id] Publications routing protocols:  Fixed TID routing: a publication is routed to subscribers along its advertisement tree.  Dynamic publication routing: a publication may be routed to subscribers across branches of different advertisement trees. Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Fixed TID Routing 2 34 5 1 6 Adv 1 Adv 2 X P Sub P Property 1: No broker receives duplicate publication messages. Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Dynamic Publication Routing Publication’s TID can be changed in transit. ``Best`` path algorithms Property 2: Changing a publication P’s TID while in transit will not change the set of subscribers notified of P. 2 34 5 1 6 Adv 1 Adv 2 X Sub P Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Faster Matching with TIDs Subscriptions are augmented with TIDs only once at the first broker. Other brokers can route the subscription based on the TID alone. Similar argument applies to publication routing. Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Advantages Simple and powerful concept Retain the publish/subscribe client interface Speed up subscription and publication propagation Generate duplicated messages only at advertisement level Build multiple subscription routing paths for publications Route publications dynamically Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 Composite Subscription AND OR S1S2 OR S3S4 AND S5 CS={ {S1 OR S2} AND {S3 OR S4} AND S5 } A composite event is the constellation of events being detected by the composite subscription. S are atomic subscriptions. I.e., they are satisfied by a single, multi-attribute event. Composite subscriptions (CS) are used for event correlation, in network filtering, and the detection of composite events (complex event). Applications: BPM, BAM

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Topology-based CS Routing 2 34 5 1 6 Adv 1 Adv 2 7 8 9 CS={ {S1 AND S2} AND S3 } CS S2 S3 S1 CS’ Adv 3 Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Adaptive CS Routing CSs may be split according to potential publication traffic, bandwidth, latency, etc. 2 13 Adv 1 Adv 2 CS={S1 AND S2} 2 13 Adv 1 Adv 2 CS={S1 AND S2} (a) (b) Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Evaluation 32 overlay brokers, 20 publishers, 30 subscribers 20 machine vs. PlanetLab Workload  http://research.msrg.utoronto.ca/Padres/DataSets  Yahoo!Finance stock quote traces Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Conclusions The right abstraction for event processing is content-based publish/subscribe. Event processing & publish/subscribe are interesting research areas. ToPSS and PADRES explore many aspects of these areas. Vanderbilt, September, 2008 http://padres.msrg.utoronto.ca

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 Acknowledgements Graduate students and PDFs currently working on PADRES. Many PADRES Alumni (see our web site) Alex Cheung Guoli Li Bala Maniymaran Vinod Muthusamy Reza Sherafat Young Yoon

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 References The PADRES ESB project home  http://padres.msrg.utoronto.ca http://padres.msrg.utoronto.ca An eQoSystem for declarative distributed applications with SLAs  http://research.msrg.utoronto.ca/Eqosystem/ http://research.msrg.utoronto.ca/Eqosystem The Micro-ToPSS event processing middleware for sensor networks  http://microToPSS.msrg.utoronto.ca/ http://microToPSS.msrg.utoronto.ca/ Mobile-ToPSS – publish/subscribe for mobile and location-based applications  http://research.msrg.utoronto.ca/Mobile/ http://research.msrg.utoronto.ca/Mobile/ ToPSS - the Toronto Publish/Subscribe System Family Portal  http://www.ToPSS.biz (coming soon ) http://www.ToPSS.biz Quantifying events in software to increase modularity & customization in C- based systems and software-based product lines  http://www.AspeCtC.net (ACC - the AspeCt-oriented C compiler) http://www.AspeCtC.net The Middleware Systems Research Group  http://www.msrg.utoronto.ca http://www.msrg.utoronto.ca My web site  http://www.eecg.toronto.edu/~jacobsen http://www.eecg.toronto.edu/~jacobsen @ the University of Toronto The DEBS Conference http://www.debs.org July 2009 at Vanderbilt U. Everything events Portal http://www.event-based.org

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Vanderbilt, September, 2008 Benefits of Content-based Publish/Subscribe Simplifies IT development and maintenance by decoupling enterprise components Supports sophisticated interactions among components using expressive subscription languages – going beyond the limits of topics Allows fine-grained queries and event management Achieves scalability with in-network filtering and processing

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Faster Matching with TIDs Subscriptions are augmented with TIDs only once at the first broker. Other brokers can route the subscription based on the TID alone. Similar argument applies to publication routing. 2 34 5 1 6 Adv 1 Adv 2 S X S Adv1 S Adv2 Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Effect of Subscriber Distance DistanceFixed(ms)Dynamic(ms)Improvement 6 Hops47.20247.568-0.78% 10 Hops64.47752.89517.96% 12 Hops74.41660.59818.57% Max Diff57.65%27.39% Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen More Results Faster matching  1926 publications cause 16997 times of matching operations in the “Dense Topology” experiment.  About 89% of the matching operations can be saved if we apply the TID-based faster matching. Overhead of dynamic publication routing  Average CPU usage: 6.3% more than the Fixed routing  Average memory usage: 8.9% more than the Fixed routing Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Summary Minimize redundant traffic induced by cycles Improve scalability and robustness of pub/sub systems by offering routing path alternatives Enable flexible composite subscription routing Simplify solutions for failure recovery and load balancing Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Cost Model Routing cost of CS  RC B (CS)) = Σ i T in *|P(CS Bi )| + Σ i T matching *|P(CS Bi )| + Σ i T out_i *|P(CS)| Selection factor (SF)  SF A (S) = |σ S P(A)| / |P(A)|  e.g., SF A (a = v) = 1 / (max - min) Subscription cardinality  |P(S)| = Σ i r i * SF Ai (S) |P(S l )| + |P(S r )| if op = or  |P(CS)| = min (|P(S l )|, |P(S r )|) if op = and Rete input output s Vanderbilt, September, 2008

MIDDLEWARE SYSTEMS RESEARCH GROUP Copyright © 2008 - Hans-Arno Jacobsen Fast Matching 1926 publications cause 16997 matching operations in the “Dense Topology” experiment. 89% of the matching operations can be saved with TID-based fast matching. Vanderbilt, September, 2008

Data-centric Networking Through Adaptive Content-based Routing Hans-Arno Jacobsen Bell University Laboratory Chair Middleware Systems Research Group University.

Similar presentations

Presentation on theme: "Data-centric Networking Through Adaptive Content-based Routing Hans-Arno Jacobsen Bell University Laboratory Chair Middleware Systems Research Group University."— Presentation transcript:

Similar presentations

About project

Feedback

Log in

Auth with social network:

Data-centric Networking Through Adaptive Content-based Routing Hans-Arno Jacobsen Bell University Laboratory Chair Middleware Systems Research Group University.

Similar presentations

Presentation on theme: "Data-centric Networking Through Adaptive Content-based Routing Hans-Arno Jacobsen Bell University Laboratory Chair Middleware Systems Research Group University."— Presentation transcript:

Similar presentations

About project

Feedback