Opportunistic Multipath Forwarding in Publish/Subscribe Systems Reza Sherafat Kazemzadeh AND Hans-Arno Jacobsen Middleware Systems Research Group University.

Slides:



Advertisements
Similar presentations
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
Advertisements

Chapter 1 The Study of Body Function Image PowerPoint
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
OSPF 1.
1 Building a Fast, Virtualized Data Plane with Programmable Hardware Bilal Anwer Nick Feamster.
Multihoming and Multi-path Routing
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science R3: Robust Replication Routing in Wireless Networks with Diverse Connectivity Characteristics.
1 Multi-Channel Wireless Networks: Capacity and Protocols Nitin H. Vaidya University of Illinois at Urbana-Champaign Joint work with Pradeep Kyasanur Chandrakanth.
MobiClique: Middleware for Mobile Social Networking Anna-Kaisa Pietilainen (Thomson), with Earl Oliver (University of Waterloo), Jason LeBrun (UC Davis),
An Alliance based Peering Scheme for P2P Live Media Streaming Darshan Purandare Ratan Guha University of Central Florida August 31, P2P-TV, Kyoto.
Scalable Routing In Delay Tolerant Networks
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Addition Facts
Year 6 mental test 5 second questions
Around the World AdditionSubtraction MultiplicationDivision AdditionSubtraction MultiplicationDivision.
ZMQS ZMQS
Predicting Performance Impact of DVFS for Realistic Memory Systems Rustam Miftakhutdinov Eiman Ebrahimi Yale N. Patt.
Video Services over Software-Defined Networks
Robust Window-based Multi-node Technology- Independent Logic Minimization Jeff L.Cobb Kanupriya Gulati Sunil P. Khatri Texas Instruments, Inc. Dept. of.
Best of Both Worlds: A Bus-Enhanced Network on-Chip (BENoC) Ran Manevich, Isask har (Zigi) Walter, Israel Cidon, and Avinoam Kolodny Technion – Israel.
Managing Web server performance with AutoTune agents by Y. Diao, J. L. Hellerstein, S. Parekh, J. P. Bigu Jangwon Han Seongwon Park
Randomized Algorithms Randomized Algorithms CS648 1.
ABC Technology Project
Shadow Prices vs. Vickrey Prices in Multipath Routing Parthasarathy Ramanujam, Zongpeng Li and Lisa Higham University of Calgary Presented by Ajay Gopinathan.
1 Routing Protocols I. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Distance Vector Routing Protocols Routing Protocols and Concepts –
Mohamed ABDELFATTAH Vaughn BETZ. 2 Why NoCs on FPGAs? Embedded NoCs Power Analysis
A Survey of Web Cache Replacement Strategies Stefan Podlipnig, Laszlo Boszormenyl University Klagenfurt ACM Computing Surveys, December 2003 Presenter:
Mobile IP: Multicast Service Reference: Multicast routing protocol in mobile networks; Hee- Sook Shin; Young-Joo Suh;, Proc. IEEE International Conference.
Communications Research Centre (CRC) Defence R&D Canada – Ottawa 1 Properties of Mobile Tactical Radio Networks on VHF Bands Li Li & Phil Vigneron Communications.
IP Multicast Information management 2 Groep T Leuven – Information department 2/14 Agenda •Why IP Multicast ? •Multicast fundamentals •Intradomain.
Making Time-stepped Applications Tick in the Cloud Tao Zou, Guozhang Wang, Marcos Vaz Salles*, David Bindel, Alan Demers, Johannes Gehrke, Walker White.
1 Breadth First Search s s Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.
Squares and Square Root WALK. Solve each problem REVIEW:
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
1 Weiren Yu 1,2, Xuemin Lin 1, Wenjie Zhang 1 1 University of New South Wales 2 NICTA, Australia Towards Efficient SimRank Computation over Large Networks.
© 2012 National Heart Foundation of Australia. Slide 2.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 EN0129 PC AND NETWORK TECHNOLOGY I NETWORK LAYER AND IP Derived From CCNA Network Fundamentals.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 ETHERNET Derived From CCNA Network Fundamentals – Chapter 9 EN0129 PC AND NETWORK TECHNOLOGY.
Chapter 5 Test Review Sections 5-1 through 5-4.
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
HJ-Hadoop An Optimized MapReduce Runtime for Multi-core Systems Yunming Zhang Advised by: Prof. Alan Cox and Vivek Sarkar Rice University 1.
Publiy: A Multi-purpose Distributed Publish/Subscribe System Reza Sherafat AND Hans-Arno Jacobsen Middleware Systems Research Group University of Toronto.
PSIRP Publish-Subscribe Internet Routing Paradigm 08-Oct /27.
Addition 1’s to 20.
25 seconds left…...
Equal or Not. Equal or Not
Slippery Slope
Week 1.
We will resume in: 25 Minutes.
Connecting LANs, Backbone Networks, and Virtual LANs
1 Unit 1 Kinematics Chapter 1 Day
University of Minnesota Optimizing MapReduce Provisioning in the Cloud Michael Cardosa, Aameek Singh†, Himabindu Pucha†, Abhishek Chandra
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Link-State Routing Protocols Routing Protocols and Concepts – Chapter.
1 Chapter 6 Dynamic Programming Slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved.
New Opportunities for Load Balancing in Network-Wide Intrusion Detection Systems Victor Heorhiadi, Michael K. Reiter, Vyas Sekar UNC Chapel Hill UNC Chapel.
Efficient Event-based Resource Discovery Wei Yan*, Songlin Hu*, Vinod Muthusamy +, Hans-Arno Jacobsen +, Li Zha* * Chinese Academy of Sciences, Beijing.
Alex Cheung and Hans-Arno Jacobsen August, 14 th 2009 MIDDLEWARE SYSTEMS RESEARCH GROUP.
Partition-Tolerant Distributed Publish/Subscribe Systems
Overlay Neighborhoods for Distributed Publish/Subscribe Systems Reza Sherafat Kazemzadeh Supervisor: Dr. Hans-Arno Jacobsen SGS PhD Thesis Defense University.
Alex King Yeung Cheung and Hans-Arno Jacobsen University of Toronto June, 24 th 2010 ICDCS 2010 MIDDLEWARE SYSTEMS RESEARCH GROUP.
Content-Based Routing in Mobile Ad Hoc Networks Milenko Petrovic, Vinod Muthusamy, Hans-Arno Jacobsen University of Toronto July 18, 2005 MobiQuitous 2005.
MIDDLEWARE SYSTEMS RESEARCH GROUP MSRG.ORG Total Order in Content-based Publish/Subscribe Systems Joint work with: Vinod Muthusamy, Hans-Arno Jacobsen.
MIDDLEWARE SYSTEMS RESEARCH GROUP Adaptive Content-based Routing In General Overlay Topologies Guoli Li, Vinod Muthusamy Hans-Arno Jacobsen Middleware.
Minimal Broker Overlay Design for Content-Based Publish/Subscribe Systems Naweed Tajuddin Balasubramaneyam Maniymaran Hans-Arno Jacobsen University of.
Congestion Avoidance with Incremental Filter Aggregation in Content-Based Routing Networks Mingwen Chen 1, Songlin Hu 1, Vinod Muthusamy 2, Hans-Arno Jacobsen.
Presentation transcript:

Opportunistic Multipath Forwarding in Publish/Subscribe Systems Reza Sherafat Kazemzadeh AND Hans-Arno Jacobsen Middleware Systems Research Group University of Toronto

Agenda The content-based publish/subscribe model – Characteristics and challenges Our approach – Overlay neighborhoods – Adaptive multipath forwarding Experimental evaluation results 2Opportunistic Multipath ForwardingMiddleware 2012

Content-Based Pub/Sub Model 3 Pub/Sub S S S S S S S S S S S S S S P P Publish P P P P P P S S Subscribers P P P Publishers Opportunistic Multipath ForwardingMiddleware 2012

Content-Based Pub/Sub Model 4 Pub/Sub Publish S S Subscribers P P P Publishers Opportunistic Multipath ForwardingMiddleware 2012 Many to many communication between a large number of publishers/subscribers Selective delivery based on subscription matching Unicast (one) Multicast (some) Broadcast (all) Variations in traffic patterns makes it difficult to design an optimal overlay network Many to many communication between a large number of publishers/subscribers Selective delivery based on subscription matching Unicast (one) Multicast (some) Broadcast (all) Variations in traffic patterns makes it difficult to design an optimal overlay network

Forwarding paths in the overlay are constructed in fixed end-to-end manner (no/little path diversity) This results in a high number of “pure forwarding” brokers Current Pub/Sub Overlays D C E B A P S ✗ ✗ ✓ ✗ ✓ 5 P P #msgs delivered #msgs sent System Yield = = 1/5 = 20% Opportunistic Multipath ForwardingMiddleware 2012

Summary of Our Goals Construct a highly connected overlay mesh that provides high path diversity between publishers and subscribers Avoid pure forwarders by allowing brokers to make fine- grained forwarding decisions based on individual publications and their matching sets Improve system yield, efficiency, scalability and delivery delay Support dynamic adaptive routing based on live traffic patters while avoiding high costs of full overlay reconfiguration 6Opportunistic Multipath ForwardingMiddleware 2012

Fixed end-to-end (baseline) Total msgs: 6 Forwarding strategy 1 Total msgs: 5 Forwarding strategy 2 Total msgs: 3 ABC * D * * Forwarding Strategies ABC * D * * p * * * * * * p * * * * * * ABC * D * * p * * * * * * 7Opportunistic Multipath ForwardingMiddleware 2012

Routing Tables (Δ-neighborhoods knowledge) Links Management (best links via a gain function) Pub. Forwarding (Path Computations for strategies) Our Approach in a Nutshell A A Δ=1 Δ=2 Δ=3 S S 8Opportunistic Multipath ForwardingMiddleware 2012

AC ** * B D AC ** * B D Path Computation for Forwarding Strategies Strategy 1 Middleware 2012Opportunistic Multipath Forwarding9 ABC * D * * p * * * * * * ABC * D * * p * * * * * * Strategy 2

Experimental Evaluations We have implemented the algorithms and performed large-scale experimental evaluations with up to 500 brokers Datasets – Synthesized based on Zipf distribution – Social networking traces from Facebook We measured performance of the system in terms of: – Overlay mesh connectivity – Delivery delay – Maximum system throughput – System yield – Publication propagation path length – Memory and CPU overhead Middleware 2012Opportunistic Multipath Forwarding10

Number of Available paths Path Diversity in Overlay Mesh Network size:120 Delta=3 Network size:250 Delta=3 Path diversity: 20% of brokers w/ 100 paths Path diversity: 10% of brokers w/ 1000 paths 11Opportunistic Multipath ForwardingMiddleware 2012 Graph is based on a snapshot of the state of links in a running system

Publication Hop Count Experiment setup: 120 Brokers Publish rate is 1,800 msgs/sec and number of deliveries: 73,000 (in 5 min) 12Opportunistic Multipath ForwardingMiddleware 2012 Fixed-end-to-end Strategy 2 115% throughput enhancement

Conclusions Brokers build a highly connected overlay mesh and make fine-grained forwarding decisions for each publication in order to avoid pure forwarding neighbors We used the notion of overlay neighborhoods to enable local traffic profiling and avoid high costs of overlay reconfiguration Our approach enhances system’s efficiency and yield, and ultimately improves its scalability and performance 13Opportunistic Multipath ForwardingMiddleware 2012

Thanks Questions! 14Opportunistic Multipath ForwardingMiddleware 2012

Client Broker Pub/Sub Characteristics Many to many communication between a large number of publishers/subscribers Selective delivery based on subscription matching – Unicast (one) – multicast (some) – broadcast (all) Traffic patterns depends on workload application and may change over time 15Opportunistic Multipath ForwardingMiddleware 2012

Related Work: Overlay Reconfiguration Broker overlay is “reconfigured” by addition and removal of links between brokers Advantages – Forwarding path may be improved bringing some publishers and subscribers closer together Disadvantages – Some forwarding paths between publishers and subscribers may indeed suffer – Resulting overlay still relies on fixed end-to-end paths – Reconfiguration is costly and requires full or partial re-propagation of subscriptions [1] Virgillito, A., Beraldi, R., Baldoni, R.: On event routing in content-based publish/subscribe through dynamic networks, FTDCS ‘03 [2] Virgillito, A., Beraldi, R., Baldoni, R.: On event routing in content-based publish/subscribe through dynamic networks. In: FTDCS. (2003)   Re- configure 16Opportunistic Multipath ForwardingMiddleware 2012

Links types – Primary links – Soft links – shortcut links – Candidate links – expeditionary links Traffic profiling – In intervals of T sec, brokers count the number of pubs sent over each links – Gain function gain(A,B,T) = pub_traffic_during_T * dist(A,B) Soft link selection – Profiling input – Link state measured – Broker load information exchanged Links ranking A B C D E F G E F … high → low Links Management Overlay Network AB C D B B Primary link Candidate link Soft link 17Opportunistic Multipath ForwardingMiddleware 2012

Master v. Working Routing Data Structures Overlay map captured by brokers’ Δ-neighborhoods are relatively static  Master overlay Map (MOM) Brokers link connectivity change dynamically, brokers need an efficient way to compute forwarding paths over the changing set of links  Working Overlay Map (WOM) MOM is a concise representation of the primary overlay that only contains brokers with a direct link Master Routing Tables Working Routing Tables construct 18Opportunistic Multipath ForwardingMiddleware 2012

Master v. Working Subscription Tables Similar to WOM, brokers adapt their subscription tables based on the current set of available links:  Working Subscription Table (WST) Between Brokers Sets Beyond Brokers Sets Behind Brokers Sets Master Subscription Table Working Subscription Table Working Overlay Map 19Opportunistic Multipath ForwardingMiddleware 2012

Delivered publications StrategyNumber of pure Pure Forwarders System Yield 284,000 (Dense Workload) Baseline 195,00059% Strategy 1 104,00073% Strategy 2 69,00080% Delivered publications Strategy Number of pure Pure Forwarders System Yield 73,000 (Sparse Workload) Fixed end-to-end 91,00044% Strategy 1 42,00063% Strategy 2 29,00071% System Yield (measure of efficiency) 20Opportunistic Multipath ForwardingMiddleware 2012

Publication Hop Count Experiment setup: 120 Brokers Sparse and dense workloads Publish rate of 1,800 msgs/sec  Deliveries: 73,000 in 5 min 21Opportunistic Multipath ForwardingMiddleware 2012

Publication Hop Count Experiment setup: 120 Brokers Sparse publication/subscription workload Publish rate of 1,800 msgs/sec  Deliveries: 73,000 in 5 min 22Opportunistic Multipath ForwardingMiddleware 2012

Publication Hop Count Sparse Matching WorkloadDense Matching Workload Multi-path forwarding is more effective in sparse workloads 23Opportunistic Multipath ForwardingMiddleware 2012

Impact of Broker Fanout on Subscription Covering Experiment setup: 500 brokers Fanout of Opportunistic Multipath ForwardingMiddleware 2012