U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Informed Detour Selection Helps Reliability Boulat A. Bash.

Slides:



Advertisements
Similar presentations
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science R3: Robust Replication Routing in Wireless Networks with Diverse Connectivity Characteristics.
Advertisements

Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science R3: Robust Replication Routing in Wireless Networks with Diverse Connectivity Characteristics.
Failure Recovery of Overlay Tree-based Structures Ing. Vladimír Dynda Doc. RNDr. Ing. Petr Zemánek, CSc. (supervisor) Czech Technical University in Prague.
1 Experimental Study of Internet Stability and Wide-Area Backbone Failure Craig Labovitz, Abha Ahuja Merit Network, Inc Presented by Changchun Zou.
Cristian Lumezanu Dave Levin Neil Spring PeerWise Discovery and Negotiation of Faster Paths.
Highly-Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks Computer Science Department, UCLA International Computer Science Institute,
On the Effectiveness of Measurement Reuse for Performance-Based Detouring David Choffnes Fabian Bustamante Fabian Bustamante Northwestern University INFOCOM.
Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination Wei Gao 1, Qinghua Li 2 and Guohong Cao 3 1 The University of Tennessee,
1 Dynamics of End-host controlled Routing Mukund Seshadri Prof. Randy Katz Sahara Retreat Jan 2004.
King : Estimating latency between arbitrary Internet end hosts Krishna Gummadi, Stefan Saroiu Steven D. Gribble University of Washington Presented by:
Exploring Tradeoffs in Failure Detection in P2P Networks Shelley Zhuang, Ion Stoica, Randy Katz HIIT Short Course August 18-20, 2003.
Efficient Hop ID based Routing for Sparse Ad Hoc Networks Yao Zhao 1, Bo Li 2, Qian Zhang 2, Yan Chen 1, Wenwu Zhu 3 1 Lab for Internet & Security Technology,
Delayed Internet Routing Convergence Craig Labovitz, Abha Ahuja, Abhijit Bose, Farham Jahanian Presented By Harpal Singh Bassali.
Exploring Tradeoffs in Failure Detection in P2P Networks Shelley Zhuang, Ion Stoica, Randy Katz Sahara Retreat June 4-6, 2003.
Drafting Behind Akamai (Travelocity-Based Detouring) Aleksandar Kuzmanovic Northwestern University Joint work with: A. Su, D. Choffnes, and F. Bustamante.
1 Drafting Behind Akamai (Travelocity-Based Detouring) AoJan Su, David R. Choffnes, Aleksandar Kuzmanovic, and Fabian E. Bustamante Department of Electrical.
Internet In A Slice Andy Bavier CS461 Lecture.
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.
Yao Zhao 1, Yan Chen 1, David Bindel 2 Towards Unbiased End-to-End Diagnosis 1.Lab for Internet & Security Tech, Northwestern Univ 2.EECS department, UC.
Scalable Construction of Resilient Overlays using Topology Information Mukund Seshadri Dr. Randy Katz.
Understanding Network Failures in Data Centers: Measurement, Analysis and Implications Phillipa Gill University of Toronto Navendu Jain & Nachiappan Nagappan.
Qualitative Studies: Case Studies. Introduction l In this presentation we will examine the use of case studies in testing research hypotheses: l Validity;
Achieving Load Balance and Effective Caching in Clustered Web Servers Richard B. Bunt Derek L. Eager Gregory M. Oster Carey L. Williamson Department of.
1 Meeyoung Cha (KAIST) Sue Moon (KAIST) Chong-Dae Park (KAIST) Aman Shaikh (AT&T Labs – Research) IEEE INFOCOM 2005 Poster Session Positioning Relay Nodes.
NAROS : Host-Centric IPv6 Multihoming with Traffic Engineering A solution to perform traffic engineering in a IPv6 multihomed end-site, using a multi-addressing.
Predicting and Bypassing End-to-End Internet Service Degradation Anat Bremler-BarrEdith CohenHaim KaplanYishay Mansour Tel-Aviv UniversityAT&T Labs Tel-Aviv.
Improving the Reliability of Internet Paths with One-hop Source Routing Krishna Gummadi, Harsha Madhyastha Steve Gribble, Hank Levy, David Wetherall Department.
Ao-Jan Su, David R. Choffnes, Fabián E. Bustamante and Aleksandar Kuzmanovic Department of EECS Northwestern University Relative Network Positioning via.
1 Meeyoung Cha, Sue Moon, Chong-Dae Park Aman Shaikh Placing Relay Nodes for Intra-Domain Path Diversity To appear in IEEE INFOCOM 2006.
CS An Overlay Routing Scheme For Moving Large Files Su Zhang Kai Xu.
MobiQuitous 2004Kimaya Sanzgiri Leveraging Mobility to Improve Quality of Service in Mobile Networks Kimaya Sanzgiri and Elizabeth Belding-Royer Department.
Resilient P2P Anonymous Routing by Using Redundancy Yingwu Zhu.
A Framework for Highly-Available Session-Oriented Internet Services Bhaskaran Raman, Prof. Randy H. Katz {bhaskar, The ICEBERG Project.
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
Mar 1, 2004 Multi-path Routing CSE 525 Course Presentation Dhanashri Kelkar Department of Computer Science and Engineering OGI School of Science and Engineering.
RON: Resilient Overlay Networks David Andersen, Hari Balakrishnan, Frans Kaashoek, Robert Morris MIT Laboratory for Computer Science
RON: Resilient Overlay Networks David Andersen, Hari Balakrishnan, Frans Kaashoek, Robert Morris MIT Laboratory for Computer Science
Aditya Akella The Performance Benefits of Multihoming Aditya Akella CMU With Bruce Maggs, Srini Seshan, Anees Shaikh and Ramesh Sitaraman.
A Routing Underlay for Overlay Networks Akihiro Nakao Larry Peterson Andy Bavier SIGCOMM’03 Reviewer: Jing lu.
CS551: End-to-End Packet Dynamics Paxon’99 Christos Papadopoulos (
Peer Pressure: Distributed Recovery in Gnutella Pedram Keyani Brian Larson Muthukumar Senthil Computer Science Department Stanford University.
1 Detecting and Reducing Partition Nodes in Limited-routing-hop Overlay Networks Zhenhua Li and Guihai Chen State Key Laboratory for Novel Software Technology.
A Light-Weight Distributed Scheme for Detecting IP Prefix Hijacks in Real-Time Lusheng Ji†, Joint work with Changxi Zheng‡, Dan Pei†, Jia Wang†, Paul Francis‡
Detection of Routing Loops and Analysis of Its Causes Sue Moon Dept. of Computer Science KAIST Joint work with Urs Hengartner, Ashwin Sridharan, Richard.
1 A Framework for Measuring and Predicting the Impact of Routing Changes Ying Zhang Z. Morley Mao Jia Wang.
6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.
1 RealProct: Reliable Protocol Conformance Testing with Real Nodes for Wireless Sensor Networks Junjie Xiong, Edith C.-Ngai, Yangfan Zhou, Michael R. Lyu.
Drafting Behind Akamai (Travelocity-Based Detouring) Dr. Yingwu Zhu.
Evaluation of a Novel Two-Step Server Selection Metric Presented by Karthik Lakshminarayanan
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
Masking Failures Using Anti Entropy and Redundant Independent Paths Rebecca Braynard and Amin Vahdat Internet Systems and Storage Group Duke University.
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
Network Computing Laboratory Load Balancing and Stability Issues in Algorithms for Service Composition Bhaskaran Raman & Randy H.Katz U.C Berkeley INFOCOM.
Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.
Placing Relay Nodes for Intra-Domain Path Diversity Meeyoung Cha Sue Moon Chong-Dae Park Aman Shaikh Proc. of IEEE INFOCOM 2006 Speaker 游鎮鴻.
OverQos: An Overlay based Architecture for Enhancing Internet Qos L Subramanian*, I Stoica*, H Balakrishnan +, R Katz* *UC Berkeley, MIT + USENIX NSDI’04,
Drafting Behind Akamai (Travelocity-Based Detouring) Ao-Jan Su, David R. Choffnes, Aleksandar Kuzmanovic and Fabián E. Bustamante Department of EECS Northwestern.
1 On the Impact of Route Monitor Selection Ying Zhang* Zheng Zhang # Z. Morley Mao* Y. Charlie Hu # Bruce M. Maggs ^ University of Michigan* Purdue University.
PlanetSeer: Internet Path Failure Monitoring and Characterization in Wide-Area Services Ming Zhang, Chi Zhang Vivek Pai, Larry Peterson, Randy Wang Princeton.
A Fault Tolerance Protocol for Uploads: Design and Evaluation
Introduction to Wireless Sensor Networks
Location Cloaking for Location Safety Protection of Ad Hoc Networks
Providing Secure Storage on the Internet
Anupam Das , Nikita Borisov
RealProct: Reliable Protocol Conformance Testing with Real Nodes for Wireless Sensor Networks Junjie Xiong
Pong: Diagnosing Spatio-Temporal Internet Congestion Properties
Achieving Resilient Routing in the Internet
Hari Balakrishnan Hari Balakrishnan Computer Networks
Presentation transcript:

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Informed Detour Selection Helps Reliability Boulat A. Bash

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Internet Reliability Problem Internet service outage probability 1.5% – 3.3% (Paxson, Dahlin, etc) Far short of 0.001% (99.999%, or five nines of reliability) observed in telephone networks How can we improve? Add redundancy Server redundancy CDNs (Akamai) Path redundancy

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Path Redundancy client server intermediary 1 intermediary 2

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Path Redundancy client server intermediary 1 intermediary 2

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Path Redundancy client server intermediary 1 intermediary 2

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Outline Introduction and motivation Previous work Our proposal Experimental validation Discussion Conclusion

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Choosing intermeds: aggressive probing Aggressive monitoring of complete overlay graph Example: RON (Resilient Overlay Network) node C node B node A node D

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Choosing intermeds: aggressive probing Aggressive monitoring of complete overlay graph Example: RON (Resilient Overlay Network) Problem: monitoring overhead  lack of scaling node C node B node A node D

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Choosing intermeds: random choice Choose intermediaries randomly No path monitoring, assume uncorrelated paths Example: SOSR (Scalable One-hop Source Routing) client server intermediary 1 intermediary 2

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Choosing intermeds: random choice Choose intermediaries randomly No path monitoring, assume uncorrelated paths Example: SOSR (Scalable One-hop Source Routing) client server intermediary 1 intermediary 2 ?

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Choosing intermeds: random choice Choose intermediaries randomly No path monitoring, assume non-overlapped paths Example: SOSR (Scalable One-hop Source Routing) Problem: overlapped paths  choose invalid detour client server intermediary 1 intermediary 2

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Our Proposal Rank intermediaries by overlap with S-D path Want less overlap No need to aggressively monitor: AS/PoP-level paths static over 24 hours client server intermediary 1 intermediary 2 A BC DE

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Our Proposal Rank intermediaries by overlap with S-D path Want less overlap No need to aggressively monitor: AS/PoP-level paths static over 24 hours client server intermediary 1 intermediary 2 A BC DE intermediary 2 ranked lower because of overlap

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Experimental Methodology Validation study PlanetLab-based experiment Monitor 4,269 paths from 46 PL nodes to set of Internet routers for 379 hours Each path monitored by one PL node Ping every 15 seconds, failure if two pings missed Intermediaries ping failed destination every 15 seconds during failure

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Experimental Methodology Use collected data and PoP path data (from iPlane) to simulate recovery from detected failures Random and informed choices of intermediaries client server intermediary 1 intermediary 2

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Experiment  55,000 path outage events Mean outage duration:  22 minutes Median outage duration: 2 minutes Longest outage: over 6 days Aggregate path outage probability: 1.48% Each client had access to between 83 and 97 intermediaries

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Improving Path Outage Impact of intermediary selection methods on path outage Number of intermediaries Random (SOSR) Common PoP count Common link count 01.48% 11.30%0.76%0.74% 21.15%0.65% 31.02%0.57% 41.02%0.52%0.53% 51.02%0.52%0.53%

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Improving Path Outage Impact of intermediary selection methods on path outage Number of intermediaries Random (SOSR) Common PoP count Common link count 01.48% 11.30%0.76%0.74% 21.15%0.65% 31.02%0.57% 41.02%0.52%0.53% 51.02%0.52%0.53% Informed methods reduce outage probability by half!

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Outline Introduction and motivation Previous work Our proposal Experimental validation Discussion Conclusion

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Discussion Why did informed selection outperform random? Paths not independent Reasons for path correlations PlanetLab design: universities on Internet2 Geography No knowledge of failure locations in study But can examine how close the sets of responding intermediaries are to what is expected If paths from intermediary set A are independent:

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science PlanetLab Design On average across failures, for intermediary X: P(X at university) = 92.0% P(X at university | X has valid path) = 91.6% Connectivity failures not correlated between universities

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Geography On average across failures, for intermediary X: Paths originating in the US P(X in US) = 71.6% P(X in US | X has valid path) = 59.8% Paths originating in Asia P(X in Asia) = 7.2% P(X in Asia | X has valid path) = 3.7% Path originating in Europe P(X in Europe) = 20.8% P(X in Europe | X has valid path) = 26.7% Thus, evidence of geographic correlation

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Path Outage revisited Effect of restricting random selection to intermediaries outside of vantage point geographical area Num intermeds Random (SOSR) Common PoP count Common link count Geog. random 01.48% 11.30%0.76%0.74%1.26% 21.15%0.65% 1.09% 31.02%0.57% 0.95% 41.02%0.52%0.53%0.84% 51.02%0.52%0.53%0.75%

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Conclusions Demonstrated potential improvement using informed detour selection in reliability over random selection in SOSR Biasing SOSR random selection outside own geographical area captures some benefit of informed method Future work Implement informed detour selection mechanism Evaluate path estimation services (Rocketfuel, iPlane) Examine whether fresher path information helps

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Thanks! Questions/Comments?