A Case Study in Understanding OSPFv2 and BGP4 Interactions Using Efficient Experiment Design David Bauer†, Murat Yuksel‡, Christopher Carothers† and Shivkumar.

Slides:



Advertisements
Similar presentations
Release 5.1, Revision 0 Copyright © 2001, Juniper Networks, Inc. Advanced Juniper Networks Routing Module 9: Static Routes & Routing Table Groups.
Advertisements

1 Interdomain Traffic Engineering with BGP By Behzad Akbari Spring 2011 These slides are based on the slides of Tim. G. Griffin (AT&T) and Shivkumar (RPI)
Border Gateway Protocol Ankit Agarwal Dashang Trivedi Kirti Tiwari.
CS540/TE630 Computer Network Architecture Spring 2009 Tu/Th 10:30am-Noon Sue Moon.
© J. Liebeherr, All rights reserved 1 Border Gateway Protocol This lecture is largely based on a BGP tutorial by T. Griffin from AT&T Research.
Fundamentals of Computer Networks ECE 478/578 Lecture #18: Policy-Based Routing Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
On Selfish Routing In Internet-like Environments Lili Qiu (Microsoft Research) Yang Richard Yang (Yale University) Yin Zhang (AT&T Labs – Research) Scott.
1 BGP Anomaly Detection in an ISP Jian Wu (U. Michigan) Z. Morley Mao (U. Michigan) Jennifer Rexford (Princeton) Jia Wang (AT&T Labs)
1 Interdomain Routing Protocols. 2 Autonomous Systems An autonomous system (AS) is a region of the Internet that is administered by a single entity and.
TIE Breaking: Tunable Interdomain Egress Selection Renata Teixeira Laboratoire d’Informatique de Paris 6 Université Pierre et Marie Curie with Tim Griffin.
1 Finding a Needle in a Haystack: Pinpointing Significant BGP Routing Changes in an IP Network Jian Wu (University of Michigan) Z. Morley Mao (University.
Traffic Engineering With Traditional IP Routing Protocols
Interdomain Routing and The Border Gateway Protocol (BGP) Courtesy of Timothy G. Griffin Intel Research, Cambridge UK
1 Traffic Engineering for ISP Networks Jennifer Rexford IP Network Management and Performance AT&T Labs - Research; Florham Park, NJ
MIRED: Managing IP Routing is Extremely Difficult Jennifer Rexford Internet and Networking Systems AT&T Labs - Research; Florham Park, NJ
Slide -1- February, 2006 Interdomain Routing Gordon Wilfong Distinguished Member of Technical Staff Algorithms Research Department Mathematical and Algorithmic.
Dynamics of Hot-Potato Routing in IP Networks Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
BGP – OSPF Experimentation Murat Yuksel and David Bauer.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 Informal Quiz 4: More Routing, DNS True or False? T F  Path-vector based distance vector.
Internet Routing (COS 598A) Today: Hot-Potato Routing Jennifer Rexford Tuesdays/Thursdays 11:00am-12:20pm.
A Routing Control Platform for Managing IP Networks Jennifer Rexford Princeton University
Impact of BGP Dynamics on Intra-Domain Traffic Patterns in the Sprint IP Backbone Sharad Agarwal, Chen-Nee Chuah, Supratik Bhattacharyya, Christophe Diot.
Measurement and Monitoring Nick Feamster Georgia Tech.
Hot Potatoes Heat Up BGP Routing Jennifer Rexford AT&T Labs—Research Joint work with Renata Teixeira, Aman Shaikh, and.
Dynamics of Hot-Potato Routing in IP Networks Jennifer Rexford AT&T Labs—Research Joint work with Renata Teixeira, Aman.
Computer Networks Layering and Routing Dina Katabi
EQ-BGP: an efficient inter- domain QoS routing protocol Andrzej Bęben Institute of Telecommunications Warsaw University of Technology,
Network Sensitivity to Hot-Potato Disruptions Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
Authors Renata Teixeira, Aman Shaikh and Jennifer Rexford(AT&T), Tim Griffin(Intel) Presenter : Farrukh Shahzad.
CS 3700 Networks and Distributed Systems Inter Domain Routing (It’s all about the Money) Revised 8/20/15.
Dongkee LEE 1 BorderGuard: Detecting Cold Potatoes from Peers Nick Feamster, et al.
Topology aggregation and Multi-constraint QoS routing Presented by Almas Ansari.
Lecture 4: BGP Presentations Lab information H/W update.
Chapter 9. Implementing Scalability Features in Your Internetwork.
Border Gateway Protocol
Dynamics of Hot-Potato Routing in IP Networks Jennifer Rexford AT&T Labs—Research Joint work with Renata Teixeira (UCSD),
SEP: Sensibility analysis of BGP convergence and scalability using network simulation Sensibility analysis of BGP convergence and scalability using network.
Meta-Simulation Design and Analysis for Large Scale Networks David W Bauer Jr Department of Computer Science Rensselaer Polytechnic Institute.
Border Gateway Protocol (BGP) W.lilakiatsakun. BGP Basics (1) BGP is the protocol which is used to make core routing decisions on the Internet It involves.
A Measurement Study on the Impact of Routing Events on End-to-End Internet Path Performance Feng Wang 1, Zhuoqing Morley Mao 2 Jia Wang 3, Lixin Gao 1,
On Understanding of Transient Interdomain Routing Failures Feng Wang, Lixin Gao, Jia Wang, and Jian Qiu Department of Electrical and Computer Engineering.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #08: SOLUTIONS Shivkumar Kalyanaraman: GOOGLE: “Shiv.
TCOM 509 – Internet Protocols (TCP/IP) Lecture 06_a Routing Protocols: RIP, OSPF, BGP Instructor: Dr. Li-Chuan Chen Date: 10/06/2003 Based in part upon.
Intradomain Traffic Engineering By Behzad Akbari These slides are based in part upon slides of J. Rexford (Princeton university)
02/01/2006USC/ISI1 Updates on Routing Experiments Cyber DEfense Technology Experimental Research (DETER) Network Evaluation Methods for Internet Security.
6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.
Evolving Toward a Self-Managing Network Jennifer Rexford Princeton University
On Selfish Routing In Internet-like Environments Lili Qiu (Microsoft Research) Yang Richard Yang (Yale University) Yin Zhang (AT&T Labs – Research) Scott.
Evolving Toward a Self-Managing Network Jennifer Rexford Princeton University
1 Agenda for Today’s Lecture The rationale for BGP’s design –What is interdomain routing and why do we need it? –Why does BGP look the way it does? How.
7/11/0666th IETF1 QoS Enhancements to BGP in Support of Multiple Classes of Service Andreas Terzis Computer Science Department Johns Hopkins University.
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
Border Gateway Protocol. Intra-AS v.s. Inter-AS Intra-AS Inter-AS.
Doing Don’ts: Modifying BGP Attributes within an Autonomous System Luca Cittadini, Stefano Vissicchio, Giuseppe Di Battista Università degli Studi RomaTre.
1 CS716 Advanced Computer Networks By Dr. Amir Qayyum.
CS 3700 Networks and Distributed Systems
CS 3700 Networks and Distributed Systems
Jian Wu (University of Michigan)
Border Gateway Protocol
COMP 3270 Computer Networks
BGP supplement Abhigyan Sharma.
Interdomain Traffic Engineering with BGP
Module Summary BGP is a path-vector routing protocol that allows routing policy decisions at the AS level to be enforced. BGP is a policy-based routing.
Chapter 9: Multiarea OSPF
COS 561: Advanced Computer Networks
Chapter 9: Multiarea OSPF
COS 561: Advanced Computer Networks
Chapter 9: Multiarea OSPF
Computer Networks Protocols
QoS routing Finding a path that can satisfy the QoS requirement of a connection. Achieving high resource utilization.
Presentation transcript:

A Case Study in Understanding OSPFv2 and BGP4 Interactions Using Efficient Experiment Design David Bauer†, Murat Yuksel‡, Christopher Carothers† and Shivkumar Kalyanaraman‡ †Department of Computer Science ‡Department of Electrical, Computer and Systems Engineering Rensselaer Polytechnic Institute

Problem Statement Computational Complexity Models: BGP4, OSPFv2, TCP-Reno, IPv4 Design Complexity Parameter Space: fixed inputs, protocol timers, decision algorithm Highly Detailed Models ROSS.Net built and utilized to address both parts of the problem ROSS.Net built and utilized to address both parts of the problem Goal: “good results fast” leading to an understanding of the system under test (make sense of the results) Goal: “good results fast” leading to an understanding of the system under test (make sense of the results)

BGP4 Response Surface OSPFv2 Understand protocol interactions through UPDATE messages generated by and between protocols Understand protocol interactions through UPDATE messages generated by and between protocols  OO: OSPF caused OSPF Updates  BO: BGP caused OSPF Updates  BB: BGP caused BGP Updates  OB: OSPF caused BGP Updates INTERACTION

Why Are Feature Interactions Harmful? Network protocol weaknesses are not fully understand until implemented / simulated in the large-scale Network protocol weaknesses are not fully understand until implemented / simulated in the large-scale Are decisions made to efficiently route data within a domain adversely affecting our ability to efficiently route data across the domain? Are decisions made to efficiently route data within a domain adversely affecting our ability to efficiently route data across the domain?  Hot-potato routing: small degree of unstable information affects large portion of traffic  Cold potato routing AS 0AS 1AS 2 Local Policy: optimize routing within AS (OSPFv2)Local Policy: optimize routing between ASes (BGP4)Global Policy: optimize routing within and between ASes

Large-scale Simulation Topology from Rocketfuel data Topology from Rocketfuel data Network Hierarchy: Network Hierarchy: – Level 0 routers: 9.92 Gb/sec and 1 ms delay – Level 1 routers: 2.48 Gb/sec and 2 ms delay – Level 2 routers: 620 Mb/sec and 3 ms delay – Level 3 routers: 155 Mb/sec and 50 ms delay – Level 4 routers: 45 Mb/sec and 50 ms delay – Level 5 routers and below: 1.55 Mb/sec and 50 ms delay LEVEL 3: AS 3356 iBGP: 7,921eBGP: 210 OSPFv2: Routers: 2,064 Links: 8,669 Tiscali: AS 3257 iBGP: 441 eBGP: OSPFv2: Routers: 618 Links: 839 EBONE: AS 1755 iBGP: 16,384 OSPFv2: Routers: 438 Links: 1,192 EXODUS: AS 3967 iBGP: 50,176eBGP: 53 OSPFv2: Routers: 688 Links: 2,166 ABOVENET: AS 6461 iBGP: 2,500eBGP: 199 OPSFv2: Routers: 843 Links: 2,

Experiment Design and Analysis Three classes of protocol parameters: Three classes of protocol parameters: –OSPF timers, BGP timers, BGP decision RRS was allowed 200 trials to optimize (minimize) response surface RRS was allowed 200 trials to optimize (minimize) response surface –Heuristic search algorithm Applied multiple linear regression analysis on the results Applied multiple linear regression analysis on the results

Response Plane Intra-domain routing decisions can effect inter-domain behavior, and vice versa. Intra-domain routing decisions can effect inter-domain behavior, and vice versa. All updates belong to either of four categories: All updates belong to either of four categories: –OSPF-caused OSPF (OO) update –OSPF-caused BGP (OB) update – interaction –BGP-caused OSPF (BO) update – interaction –BGP-caused BGP (BB) update Destination OB Update 8 10 Link failure or cost increase (e.g. maintenance)

Intra-domain routing decisions can effect inter-domain behavior, and vice versa. Intra-domain routing decisions can effect inter-domain behavior, and vice versa. All updates belong to either of four categories: All updates belong to either of four categories: –OSPF-caused OSPF (OO) update –OSPF-caused BGP (OB) update –BGP-caused OSPF (BO) update –BGP-caused BGP (BB) update Response Plane eBGP connectivity becomes available Destination BO Update These interactions cause route changes to thousands of IP prefixes, i.e. huge traffic shifts!!

High Level Characterization Optimized with respect to OB+BO response surface. Optimized with respect to OB+BO response surface. BGP timers play the major role, i.e. ~15% improvement in the optimal response. BGP timers play the major role, i.e. ~15% improvement in the optimal response. –BGP KeepAlive timer seems to be the dominant parameter.. – in contrast to expectation of MRAI! OSPF timers effect little, i.e. at most 5%. OSPF timers effect little, i.e. at most 5%. –low time-scale OSPF updates do not effect BGP. ~15% improvement when BGP timers included in search space

Design 1: Mgt Perspectives Varied response surfaces -- equivalent to a particular management approach. Varied response surfaces -- equivalent to a particular management approach. Importance of parameters differ for each metric. Importance of parameters differ for each metric. For minimal total updates: For minimal total updates: –Local perspectives are 20-25% worse than the global. For minimal total interactions: For minimal total interactions: –15-25% worse can happen with other metrics OB updates are more important than BO updates (i.e. ~0.1% vs. ~50%) OB updates are more important than BO updates (i.e. ~0.1% vs. ~50%) Important to optimize OSPF OB: ~50% of total updates BO: ~0.1% of total updates Global perspective 20-25% better than local perspectives Minimize total BO+OB 15-25% better than other metrics

Q: Can we use this approach to provide guidance for network routing policies? Q: Can we use this approach to provide guidance for network routing policies? Performed full factorial of RRS searches, turning Hot-, Cold-potato routing ON/OFF Performed full factorial of RRS searches, turning Hot-, Cold-potato routing ON/OFF Provide quantitative results from which qualitative stmts can be made Provide quantitative results from which qualitative stmts can be made Verified AT&T and Sprint measurements Verified AT&T and Sprint measurements Design 2: Hot- v Cold-Potato Routing No major impact regardless of search performed Majority of UPDATEs were generated by LOCAL-Pref and AS Path length MED was << 1% of UPDATEs Hot Potato was 0.8% Larger question: Which steps in the BGP decision making algorithm are most important?

Design 3: Network Robustness Q: Can we use this approach to provide network admins with guidance for network configurations? Q: Can we use this approach to provide network admins with guidance for network configurations? Link status varied with uniform random probability over simulation runtime Link status varied with uniform random probability over simulation runtime Link weights varied with uniform random probability over simulation runtime Link weights varied with uniform random probability over simulation runtime Response: BO + OB, Global Persp, and Default network settings Response: BO + OB, Global Persp, and Default network settings Search consistently provides better results Search consistently provides better results Response tied to link stability BGP parameters had greatest impact By maximizing link failure detection times, UPDATEs most effectively minimized

Conclusions –Number of experiments were reduced by many orders of magnitude in comparison to Full Factorial –Experiment design and statistical analysis enabled rapid elimination of insignificant parameters –Several qualitative statements and system characterizations could be obtained with few experiments. –Provided validation of network measurement community results, and called into question importance of premises –Search algorithms do not always find desired behaviour ! Allowed me to complete my thesis and graduate!