BGP C的onvergence.pptVIP

BGP Convergence Jennifer Rexford Outline Border Gateway Protocol (BGP) Prefix-based routing at the AS level Policy-based path-vector protocol Incremental protocol with update messages BGP convergence Causes of BGP routing changes Path exploration during convergence Minimum route advertisement timer BGP does not necessarily converge Bistable routing configurations Protocol oscillation Interdomain Routing AS-level topology Destinations are IP prefixes (e.g., /8) Nodes are Autonomous Systems (ASes) Links are connections and business relationships Challenges for Interdomain Routing Scale Prefixes: 150,000-200,000, and growing ASes: 20,000 visible ones, and growing AS paths and routers: at least in the millions… Privacy ASes don’t want to divulge internal topologies … or their business relationships with neighbors Policy No Internet-wide notion of a link cost metric Need control over where you send traffic … and who can send traffic through you Shortest-Path Routing is Restrictive All traffic must travel on shortest paths All nodes need common notion of link costs Incompatible with commercial relationships Link-State Routing is Problematic Topology information is flooded High bandwidth and storage overhead Forces nodes to divulge sensitive information Entire path computed locally per node High processing overhead in a large network Minimizes some notion of total distance Works only if policy is shared and uniform Typically used only inside an AS E.g., OSPF and IS-IS Distance Vector is on the Right Track Advantages Hides details of the network topology Nodes determine only “next hop” toward the dest Disadvantages Minimizes some notion of total distance, which is difficult in an interdomain setting Slow convergence due to the counting-to-infinity problem (“bad news travels slowly”) Idea: extend the notion of a distance vector Path-Vector Routing Extension of distance-vector routing Support flexible routing policies Avoid count-to-infinity problem Key idea: advertise the e