1 / 10

Masking Failures Using Anti Entropy and Redundant Independent Paths

Masking Failures Using Anti Entropy and Redundant Independent Paths. Rebecca Braynard and Amin Vahdat Internet Systems and Storage Group Duke University http://issg.cs.duke.edu. Building Reliable Overlays. Hide failures in the network from applications using the overlay

charla
Download Presentation

Masking Failures Using Anti Entropy and Redundant Independent Paths

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. Masking Failures Using Anti Entropy and Redundant Independent Paths Rebecca Braynard and Amin Vahdat Internet Systems and Storage Group Duke University http://issg.cs.duke.edu

  2. Building Reliable Overlays • Hide failures in the network from applications using the overlay • Scalable, reliable publish subscribe systems • Goal: • Input: overlay with neighbor connection information and reliability target • Probe neighbors for reliability information • Construct end-to-end paths that match the target level of reliability • Benefit: Proactively handle failures • Avoid convergence time after network failures through redundancy Rebecca Braynard

  3. Restricted Flooding • All nodes in the overlay receive the data • Messages do not travel along every link in the overlay • Prevent nodes from receiving multiple copies • Idea is similar to Anti Entropy: used to maintain consistency between replicas in distributed computing Source Destination Rebecca Braynard

  4. First Step: Maximum Reliability Tree Dest_1 0.951 .94 .98 .96 .95 .92 .96 .99 .98 Source .97 .97 .93 .94 .97 .99 .98 .96 .96 .97 .92 Dest_2 Link Reliability (assume independence) .98 .96 0.922 Highest reliability paths for source to destinations Rebecca Braynard

  5. Second Step: Multiple Disjoint Routes 0.951 Dest_1 .94 0.997 .98 .96 .95 .92 .96 .99 .98 Source .97 .97 .93 .94 .97 .99 .98 .96 .96 .97 .92 0.922 .98 .96 Dest_2 0.996 Basic Flood: 14 Restricted Flooding: 8 Tune connectivity to application specifications Rebecca Braynard

  6. Questions? • Webpage: • http://issg.cs.duke.edu/malachi • E-Mail: • Rebecca Braynard: rebecca@cs.duke.edu • Amin Vahdat: vahdat@cs.duke.edu Rebecca Braynard

  7. Research Problems • Disjoint paths may not be available C A D B • Loss correlations between overlay links Overlay link 2 5 Physical link 1 4 Overlay node 3 6 Internet router • Nodes only have local network state information to make decisions • Only probe direct neighbors in the overlay Rebecca Braynard

  8. Differences: RON • RON: O(N2) probing to obtain network state information • Each node probes every other node in the overlay • Global network state to make routing decisions • Limits scalability Multiple Routes with AE RON Base Overlay Rebecca Braynard

  9. Differences: Mesh-Based Content Routing • MBCR: intermediate nodes receive messages multiple times • Single receiver • We address the problem of finding disjoint routes Restricted Flooding to reduce network resource consumption Intermediate nodes receive the same message multiple times Rebecca Braynard

  10. Link Loss Correlation • Loss rates correlation between links • share a link in the underlying topology .99 .99 .98 .98 .95 .95 Rebecca Braynard

More Related