Distance Vector: Link Cost Changes. Interdomain Routing. Distance Vector: Count to Infinity Problem. Distance Vector: Poisoned Reverse

Transcription

1 istance Vector: Link ost hanges 7 loop: Interdomain Routing 8 wait (until sees a link cost change to neighbor V 9 or until receives update from neighbor V) 0 if ((, V) changes by d) for alldestinations Y through V do 2 (,Y) = (,Y) + d 3 else if (update ( V, Y) received from V) (,Y) = (,V) + (V, Y); 5 if (there is a new minimum for destination Y) 6 send (, Y) to all neighbors 7 forever 50 EES 89 omputer etworks Z. Morley Mao Tuesday Sept 2, 200 ode ode good news travels fast cknowledgement: Some slides adapted from Kurose&Ross and Katz&Stoica Link cost changes here time lgorithm terminates 2 istance Vector: ount to Infinity Problem istance Vector: Poisoned Reverse 7 loop: ode ode 5 8 wait (until sees a link cost change to neighbor V 9 or until receives update from neighbor V) 0 if ((, V) changes by d) for alldestinations Y through V do 2 (,Y) = (,Y) + d ; 3 else if (update ( V, Y) received from V) (,Y) = (,V) + (V, Y); 5 if (there is a new minimum for destination Y) 6 send (, Y) to all neighbors 7 forever time Link cost changes here; recall from slide 2 that also maintains shortest distance to through, which is 6. Thus (, ) becomes 6! 8 2 bad news travels slowly 3 If routes through to get to : ode ode 5 - tells its ( s) distance to is infinite (so won t route to via ) - Will this completely solve count to infinity problem? Link cost changes here; updates (, ) = 60 as has advertised (, ) = time lgorithm terminates Link State vs. istance Vector re We one? Per-node message complexity LS: O(e) messages - e: number of edges V: O(d) messages, many times - d is node s degree omplexity/onvergence LS: O(n 2 ) computation V: convergence time varies - may be routing loops - count-to-infinity problem Robustness: what happens if router malfunctions? LS: - node can advertise incorrect link cost - each node computes only its own table V: - node can advertise incorrect path cost - each node s table used by others; error propagate through network We now know how to route scalably What more is there to do? 5 6

2 Issues We Haven t ddressed Scaling Scaling - ddressing - Router table size Structure - utonomy - Policy Every router must be able to forward based on *any* destination IP address - Given address, it needs to know next hop (table) aive: Have an entry for each address - There would be 0^8 entries! etter: Have an entry for a range of addresses - ut can t do this if addresses are assigned randomly! ddresses allocation is a big deal 7 8 etwork Structure utonomous Systems (S) Internet is not a single network! Stub Large ISP Large ISP The Internet is a collection of networks, each controlled by different administrations ial-up ISP Small ISP ccess etwork n autonomous system (S) is a network under a single administrative control Stub Stub The Internet contains a large number of diverse networks 9 0 Implications Intradomain nd Interdomain Ss want to choose own local routing algorithm - S takes care of getting packets to/from their own hosts - Interdomain routing and Intradomain routing 2 GP Intraomain 8 RIP Ss want to choose own nonlocal routing policy - Interdomain routing must accommodate this - GP is the current interdomain routing protocol 3 2 Intraomain 3 IGRP OSPF Intraomain

3 Interconnection IP unifies network technologies - allows any network to communicate with another GP unifies network organizations - ties them into a global Internet OSPF (Open Shortest Path First) open : publicly available Uses Link State algorithm - LS packet dissemination - Topology map at each node - Route computation using ijkstra s algorithm OSPF advertisement carries one entry per neighbor router dvertisements disseminated to entires (via flooding) - arried in OSPF messages directly over IP (rather than TP or UP 3 OSPF advanced features (not in RIP) Hierarchical OSPF Security: all OSPF messages authenticated (to prevent malicious intrusion) Multiple same-cost paths allowed (only one path in RIP) For each link, multiple cost metrics for different TOS (e.g., satellite link cost set low for best effort; high for real time) Integrated uni- and multicast support: - Multicast OSPF (MOSPF) uses same topology data base as OSPF Hierarchical OSPF in large domains. 5 6 Hierarchical OSPF Outline Two-level hierarchy:local area, backbone. - Link-state advertisements only in area - each nodes has detailed area topology; only know direction (shortest path) to nets in other areas. rea border routers: summarize distances to nets in own area, advertise to other rea order routers. ackbone routers: run OSPF routing limited to backbone. oundary routers: connect to other S s. ddressing GP 7 8 3

4 ssigning ddresses (Ideally) Original ddressing Scheme Host: gets IP address from its organization or ISP Organization: gets IP address block from ISP ISP: gets address block from routing registry: - RI: merican Registry for Internet umbers - RIPE: Reseaux IP Europeens - PI: sia Pacific etwork Information enter - Whois h whois.arin.net <IP> Each S is assigned a 6-bit number (65536 total) - urrently 0,000 S s in use - Most stub, so don t really need own number 9 lass-based addressing schemes: - 32 bits divided into 2 parts: lass 0 network - lass - lass network network host 6 host Original Vision: Route on network number 2 host 26 nets ~6M hosts ~6K nets ~65K hosts ~2M nets 25 hosts ll nodes with same net # are directly connected 20 lassless Interdomain Routing (IR) #: ddress Space Exhaustion Introduced to solve two problems: exhaustion of IP address space size and growth rate of routing table Example: an organization needs 500 addresses. - single class address not enough (25 hosts). - Instead a class address is allocated. (~65K hosts) - That s overkill, a huge waste! IR: networks assigned on arbitrary bit boundaries. - Requires explicit masks to be passed in routing protocols - Masks: identify the network portion of the address IR solution for example above: organization is allocated a single /23 address (equivalent of 2 class s) IR ddressing More Formally Suppose fifty computers in a network are assigned IP addresses They share the prefix Range: to How to write X? onvention: /26 - There are 32-26=6 bits for the 50 computers = 6 addresses Specify a range of addresses by a prefix: X/Y - The common prefix is the first Y bits of X. - X: The first address in the range has prefix X - Y: 2 32-Y addresses in the range Example /23 - ommon prefix is 23 bits: umber of addresses: 2 9 = 52 Prefix aggregation - ombine two address ranges /2 and 28.5./2 gives /23 Routers match to longest prefix 23 2

5 Problem #2: Routing Table Size Without IR: service provider Global internet order Gateway Protocol With IR: service provider /6 Global internet ignore the details pay attention to the why Internet inter-s routing: GP Who speaks GP? GP (order Gateway Protocol): the de facto standard S2 GP provides each S a means to:. Obtain subnet reachability information from neighboring Ss. 2. Propagate the reachability information to all routers internal to the S. 3. etermine good routes to subnets based on reachability information and policy. llows a subnet to advertise its existence to rest of the Internet: I am here S GP R2 R3 R R border router internal router Two types of routers order router (Edge), Internal router (ore) Purpose of GP I-GP and E-GP you can reach net via me S2 I-GP IGP: Interior Gateway Protocol. Example: OSPF S traffic to R GP R2 R3 S R2 E-GP IGP S2 R3 announce table at R: R border router dest next hop R2 internal router Share connectivity information across Ses R R border router internal router R S3 R

6 Issues hoice of Routing lgorithm What basic routing algorithm should GP use? How are the routes advertised? How are routing policies implemented? - policy routing: not always shortest path Peering, transit, and reachability onstraints: - scaling - autonomy (policy and privacy) Link-state? - requires sharing of complete network informatin - information exchanges doesn t scale - can t express policy istance Vector? - scales and retains privacy - can t implement policy - can t avoid loops if shortest paths not taken 3 32 Path Vector Protocol GP Routing Table istance vector algorithm with extra information - For each route, store the complete path (Ss) - o extra computation, just extra storage dvantages: - can make policy choices based on set of Ss in path - can easily avoid loops ner-routes>show ip bgp GP table version is 62879, local router I is Status codes: s suppressed, d damped, h history, * valid, > best, i - internal Origin codes: i - IGP, e - EGP,? - incomplete etwork ext Hop Metric LocPrf Weight Path i * 80 i * i i * i / ? * e / e Every route advertisement contains the entire S path an implement policies for choosing best route an detect loops at an S level 33 3 dvertising Routes GP routing policy One router can participate in many GP sessions. Initially node advertises LL routes it wants neighbor to know (could be > 50K routes) Ongoing only inform neighbor of changes W X Y legend: provider network customer network: S2 S GP Sessions S3 Figure.5 -GPnew: a simple GP scenario,, are provider networks X,W,Y are customer (of provider networks) X is dual-homed: attached to two networks - X does not want to route from via X to -.. so X will not advertise to a route to

7 GP routing policy (2) Why different Intra - and Inter-S routing? W advertises Figure.5to -GPnew: the path a simple W GP scenario advertises to X the path W Should advertise to the path W? X Y legend: provider network customer network: - o way! gets no revenue for routing W since neither W nor are s customers - wants to force to route to w via - wants to route only to/from its customers! Policy: Inter-S: admin wants control over how its traffic routed, who routes through its net. Intra-S: single admin, so no policy decisions needed Scale: hierarchical routing saves table size, reduced update traffic Performance: Intra-S: can focus on performance Inter-S: policy may dominate over performance asic Messages in GP Routes Have ttributes Open: - Establishes GP session (uses TP port #79) - GP uses TP otification: - Report unusual conditions Update: - Inform neighbor of new routes that become active - Inform neighbor of old routes that become inactive Keepalive: - Inform neighbor that connection is still viable When a route is advertised it is described in terms of attributes: - next hop, S-path, etc. - We will discuss: Origin, ME, Local Preference Origin: - Who originated the announcement? Where was a prefix injected into GP? - IGP, EGP or Incomplete (often used for static routes) 39 0 Multi-Exit iscriminator (ME) Local Preference When S s interconnected via 2 or more links S announcing prefix sets ME (S2 in picture) S receiving prefix uses ME to select link way to specify how close a prefix is to the link it is announced on S Link Link ME=50 ME=0 S2 Used to indicate preference among multiple paths for the same prefix anywherein the Internet. The higher the value the more preferred Exchanged between IGP peers only. Local to the S. Often used to select a specific exit point for a particular destination /2 S S2 S3 S GP table at S: estina tion S Path Local Pref S S /2 S3 S /2 S2 S

8 hoosing est Route Routing Process Overview hoose route with highest LOL_PREF - Preference-based routing Multiple choices: select route with shortest hop-count Multiple choices for same neighboring S: choose path with min ME value hoose route based on lowest origin type - IGP < EGP < IOMPLETE mong IGP paths, choose one with lowest cost Routes received from neighbors accept, deny, set preferences Import Policy Engine hoose best route ecision process Routes used by router forward, not forward set MEs Export Policy Engine Routes sent to neighbors Finally use router I to break the tie. GP table IP routing table 3 Import and Export Policies Transit vs. ontransit S Transit traffic = traffic whose source and destination are outside the S Inbound filtering controls outbound traffic - Filters route updates received from other peers - Filtering based on IP prefixes, S_PTH, community ontransit S: does not carry transit traffic dvertise own routes only o not propagate routes learned from other S s Transit S: does carry transit traffic dvertises its own routes PLUS routes learned from other S s Outbound filtering controls inbound traffic - Forwarding a route means others may choose to reach the prefix through you - ot forwarding a route means others must use another router to reach the prefix ISP r2 S r2 r2 ISP2 ISP r2, S r2 r2, ISP2 5 6 S Relationships and Export Rules ustomer-transit Problem S has customers, providers and peers Relationships between S pairs: - ustomer-provider - Peer-to-peer Type of relationship influences policies Exporting to provider: S exports its routes & its customer s routes, but not routes learned from other providers or peers Exporting to peer: (same as above) Exporting to customer: S exports its routes plus routes learned from its providers, peers and other customers r2, Large ISP r2 Small ISP r2, Large ISP ssume that the small ISP is a customer of two large ISPs If customer ISP does not obey export rules forwards advertisements from one large ISP to another arries huge volume of transit traffic between two large ISPs 7 8 8

9 Is Reachability Guaranteed? Peering & Transit In normal routing, if graph is connected then reachability is assured With policy routing, not always Peering - The business relationship whereby ISPs reciprocally provide to each other connectivity to each others transit customers Transit (customer) - The business relationship whereby one ISP provides (usually sells) access to all destinations in it s routing table 9 50 Peering Transit Figure from William. orton, Internet Service Providers and Peering Figure from William. orton, Internet Service Providers and Peering West and East Peer with USet but they can t reach each other 5 52 Reachability? GP and Performance epends on series of economic relationships ot a technical solution, but an economic one GP designed for policy not performance - Hot Potato routing common but suboptimal - 20% of internet paths inflated by at least 5 router hops Susceptible to router misconfiguration - lackholes: announce a route you cannot reach Incompatible policies - Solutions to limit the set of allowable policies

10 Research side What is one of the most important Internet design principles? In what way is GP robust? - an it protect against node failures? - an it protect against spoofing? - an it protect against lying? Semantic failures versus syntactic failures - GP can check who you are, but not what you say 55 0