Authors Renata Teixeira, Aman Shaikh and Jennifer Rexford(AT&T), Tim Griffin(Intel) Presenter : Farrukh Shahzad.

Slides:



Advertisements
Similar presentations
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)
Advertisements

Border Gateway Protocol Ankit Agarwal Dashang Trivedi Kirti Tiwari.
Lecture 9 Overview. Hierarchical Routing scale – with 200 million destinations – can’t store all dests in routing tables! – routing table exchange would.
Routing Protocol.
Fundamentals of Computer Networks ECE 478/578 Lecture #18: Policy-Based Routing Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
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.
© 2007 Cisco Systems, Inc. All rights reserved.ICND2 v1.0—3-1 Medium-Sized Routed Network Construction Reviewing Routing Operations.
Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What’s inside a router 4.4 IP: Internet Protocol –Datagram format.
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
1 Traffic Engineering for ISP Networks Jennifer Rexford IP Network Management and Performance AT&T Labs - Research; Florham Park, NJ
Traffic Engineering in IP Networks Jennifer Rexford Computer Science Department Princeton University; Princeton, NJ
1 Policy-Based Path-Vector Routing Reading: Sections COS 461: Computer Networks Spring 2006 (MW 1:30-2:50 in Friend 109) Jennifer Rexford Teaching.
Dynamics of Hot-Potato Routing in IP Networks Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
Unicast Routing Protocols: RIP, OSPF, and BGP
1 Design and implementation of a Routing Control Platform Matthew Caesar, Donald Caldwell, Nick Feamster, Jennifer Rexford, Aman Shaikh, Jacobus van der.
Internet Routing (COS 598A) Today: Hot-Potato Routing Jennifer Rexford Tuesdays/Thursdays 11:00am-12:20pm.
Network Monitoring for Internet Traffic Engineering Jennifer Rexford AT&T Labs – Research Florham Park, NJ 07932
Routing and Routing Protocols
Routing.
14 – Inter/Intra-AS Routing
1 Interdomain Routing Policy Reading: Sections plus optional reading COS 461: Computer Networks Spring 2008 (MW 1:30-2:50 in COS 105) Jennifer Rexford.
Backbone Networks Jennifer Rexford COS 461: Computer Networks Lectures: MW 10-10:50am in Architecture N101
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.
UNICAST ROUTING PROTOCOLS Major Functions:  Define the domain of operation (Internal/External to the ISPs), and interaction with other protocols.
ROUTING ON THE INTERNET COSC Aug-15. Routing Protocols  routers receive and forward packets  make decisions based on knowledge of topology.
Fundamentals of Networking Discovery 2, Chapter 6 Routing.
Routing and Routing Protocols Dynamic Routing Overview.
Network Sensitivity to Hot-Potato Disruptions Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
6: Routing Working at a Small to Medium Business.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Unicast Routing Protocols  A routing protocol is a combination of rules and procedures that lets routers in the internet inform each other of changes.
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
M.Menelaou CCNA2 ROUTING. M.Menelaou ROUTING Routing is the process that a router uses to forward packets toward the destination network. A router makes.
CS 3700 Networks and Distributed Systems Inter Domain Routing (It’s all about the Money) Revised 8/20/15.
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
A Case Study in Understanding OSPFv2 and BGP4 Interactions Using Efficient Experiment Design David Bauer†, Murat Yuksel‡, Christopher Carothers† and Shivkumar.
TCP/IP Protocol Suite 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Unicast Routing Protocols.
Dynamics of Hot-Potato Routing in IP Networks Jennifer Rexford AT&T Labs—Research Joint work with Renata Teixeira (UCSD),
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 2 Single-Area OSPF.
Network Layer4-1 Intra-AS Routing r Also known as Interior Gateway Protocols (IGP) r Most common Intra-AS routing protocols: m RIP: Routing Information.
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)
6: Routing Working at a Small to Medium Business.
Routing and Routing Protocols
Chapter 14 1 Unicast Routing Protocols There isn’t a person anywhere that isn’t capable of doing more than he thinks he can. - Henry Ford.
Routing protocols. 1.Introduction A routing protocol is the communication used between routers. A routing protocol allows routers to share information.
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.
Routing Protocols Brandon Wagner.
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
Chapter 25 Internet Routing. Static Routing manually configured routes that do not change Used by hosts whose routing table contains one static route.
1 Effective Diagnosis of Routing Disruptions from End Systems Ying Zhang Z. Morley Mao Ming Zhang.
Michael Schapira, Princeton University Fall 2010 (TTh 1:30-2:50 in COS 302) COS 561: Advanced Computer Networks
Inter-domain Routing Outline Border Gateway Protocol.
Routing and Routing Protocols CCNA 2 v3 – Module 6.
CS 3700 Networks and Distributed Systems
CS 3700 Networks and Distributed Systems
Jian Wu (University of Michigan)
Dynamic Routing Protocols part2
COS 561: Advanced Computer Networks
Interdomain Traffic Engineering with BGP
Intra-Domain Routing Jacob Strauss September 14, 2006.
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
BGP Instability Jennifer Rexford
Computer Networks Protocols
Presentation transcript:

Authors Renata Teixeira, Aman Shaikh and Jennifer Rexford(AT&T), Tim Griffin(Intel) Presenter : Farrukh Shahzad

SIGMETRICS’04 Internet Routing Architecture 2 UCSD Sprint AT&T Verio AOL interdomain routing (BGP) intradomain routing (OSPF,IS-IS) Changes in one AS may impact traffic and routing in other ASes User Web Server End-to-end performance depends on all ASes along the path

SIGMETRICS’04 Distance-vector &Link state routing  Distance vector routing  It involves two factors: the distance or metric, of a destination, and the vector, or direction to take to get there.  Routing information is only exchanged between directly connected neighbors.  A router knows from which neighbor a route was learned, but it does not know where that neighbor learned the route  A router can't see beyond its own neighbors. This aspect of distance vector routing is sometimes referred to as "routing by rumor."  Measures like split horizon and poison reverse are employed to avoid routing loops. 3

SIGMETRICS’04  Link-state routing  In contrast, requires that all routers know about the paths reachable by all other routers in the network.  Link-state information is flooded throughout the link-state domain (an area in OSPF ) to ensure all routers possess a synchronized copy of the area's link-state database.  From this common database, each router constructs its own relative shortest-path tree, with itself as the root, for all known routes.  BGP is DV routing protocol  OSPF is LS Routing Protocol 4 Distance-vector &Link state routing

SIGMETRICS’04 5  A router combines the BGP and IGP information to construct a forwarding table.  BGP exchanges route advertisements with neighboring domains, and propagate reachability information within AS.  IGP protocol, such as OSPF, computes shortest paths based on configurable link weights.  The interaction between IGP and BGP  Hot potato routing. Interaction between IGP and BGP

SIGMETRICS’04 Hot-Potato Routing 6 San Francisco Dallas New York Hot-potato routing = route to closest egress point when there is more than one route to destination ISP network 9 10 dst multiple connections to the same peer

SIGMETRICS’04 Hot-Potato Routing Change 7 San Francisco Dallas New York ISP network dst failure - planned maintenance - traffic engineering 11 Routes to thousands of destinations switch exit point!!! Consequences:  Transient forwarding instability  Traffic shift  Inter-domain routing changes 11

SIGMETRICS’04 Approach In Paper  Understanding impact in real networks  How often hot-potato changes happen?  How many destinations do they affect?  What are the convergence delays?  Main contributions  Methodology for measuring hot-potato changes  Characterization on AT&T’s IP backbone 8

SIGMETRICS’04 Challenges for Identifying Hot-Potato Changes  Cannot collect data from all routers  OSPF: flooding gives complete view of topology  BGP: multi-hop sessions to several vantage points  A single event may cause multiple messages  Group related routing messages in time  Router implementation affects message timing(PDelay)  Real Time & Controlled experiments of router in the lab  Many BGP updates caused by external events  Classify BGP routing changes by possible causes 9

SIGMETRICS’04 Measurement Methodology 10 Replay routing decisions from vantage point A and B to identify hot-potato changes AT&T backbone BGP monitor BGP updates OSPF Monitor OSPF messages A B

SIGMETRICS’04 Algorithm for Correlating Routing Changes  Step 1: Process stream of OSPF messages  Group OSPF messages close in time  Transform OSPF messages into vantage point’s routing changes  Step 2: Process stream of BGP updates from vantage point  Group updates close in time  Classify BGP routing changes by possible OSPF cause  Step 3: Match BGP routing changes to OSPF changes in time  Determine causal relationship 11

SIGMETRICS’04 Measurement Methodology 12

SIGMETRICS’04 Sections Details  Section III- A: presents the measurement infrastructure used to collect BGP updates and OSPF LSAs.  Section III-B : describe how to compute the distance vector from the OSPF LSAs in.  Section III-C : explains the classification of BGP routing changes in terms of the possible causes. This sets the stage for the discussion in next section.  Section III-D : How to associate BGP routing changes with related distance changes that occur close in time 13

SIGMETRICS’04 Measurement Infrastructure  iBGP session allows the monitor to see changes in the “egress point” of BGP routes.  The BGP monitor also dumps a snapshot of its routes four times a day to provide an initial view of the best route for each prefix for each vantage point, For later classify the type of BGP change as discussed in Section III-C 14

SIGMETRICS’04 Classifying BGP Rt Changes 15

SIGMETRICS’04  The large volume of BGP updates shows exploration of multiple alternate routes when a router switches from one best path to another.  IGP distance changes cause a router inside the AS to switch from one stable route to another with a different egress point. 16

SIGMETRICS’04 BGP Reaction Time to Distance Changes 17 (i)Rerun the IGP shortest-path computation (ii)Apply the BGP decision process to select the best route (iii) Send update messages to BGP neighbors for the routes that have changed.

SIGMETRICS’04 Transfer Delay for Multiple Prefixes 18 1-The LSA is flooded throughout the network and each router computes new distances. For example, A and B compute new distances of 21 and 11, respectively. 2- After their scan timers elapse, and rerun the BGP decision process. If runs first, selects the egress point with a distance of 20, since this is smaller than 21. Sometime afterwards, A selects egress point C. 3- B sends the new route (with egress point E ) to A, A and selects egress point with a distance of 19.

SIGMETRICS’04 Temporal and Spatial Variability(distance changes effect) 19

SIGMETRICS’04 Hot-Potato Variation Across Prefixes 20

SIGMETRICS’04 IMPLICATIONS OF HOT POTATOES  Performance Degradation  Routing and Traffic Shifts  Slow Forwarding-Plane Convergence  Measurement Inaccuracies  Active Probes of the Forwarding Plane  External Analysis of BGP Updates 21

SIGMETRICS’04 Conclusion  Hot-potato routing plays an important role in  BGP routing changes, and that BGP updates can lag 60 seconds (or more!) behind the related IGP events  The frequency and impact of hot-potato routing depends on the topology and configuration of the network under study  routing is usually a major contributor to large traffic variations. In particular, hot-potato routing changes are responsible for the largest shifts in the traffic matrix 22

SIGMETRICS’04 …conclusion  Setting IGP link weights without accounting for possible changes in the egress points can lead to routing configurations that cause unnecessary congestion. 23

SIGMETRICS’04 Thanks 24