Академический Документы
Профессиональный Документы
Культура Документы
Dynamic Routing
Contents
Perlman, chapter 11, 12, 13, 14 Video lectures no. 23-28, 30-31, 34-35, 38 And then some.....
This approach works only for small IP networks We need to support dynamic large networks N1, N2, R2 N3, R2 N4, R2
A R1 N1 R4 N2 N3 R2 R3 N4 B
Levels of Abstraction
The Internet is huge
Necessary to divide the routing problem into sub-problems. There are several layers of abstractions
AS4
AS3
AS2 Area 0
AS2
Area 1
Area 2
Area 3
Autonomous SystemsRFC1930
An Autonomous system is generally administered by a single entity.
Operators, ISPs (Internet Service Providers)
An AS contains an arbitrary complex sub-structure. Each autonomous system selects the routing protocol to be used within the AS. Policies or updates within an AS are not propagated to other AS:s. An AS-number is (currently) a 16-bit unique identifier Interconnwection between AS:s
Service Level Agreements (SLA:s) Internet Exchange Points (IX:s) Network Access Points (NAPs)
AS Number
3 32 2839 1653 MIT STANFORD KTH SUNET
Network
National Provider AS4 POP NAP - Network Access Point POP Point of Presence IX Internet Exchange point
Metrics
Number of hops (most common) Bandwidth, Delay, Cost, Load, Policies
Aggregation
Also called summarization The netid part of IPv4 addresses can be aggregated (summarized) into shorter prefixes.
Currently: ~160000 global prefixes
Summarization is often done manually Leads to smaller routing tables (fewer prefixes) Threats: multi-homing and load-balancing
announced prefix:
199.1.0.0/16
199.1.3.0/24 199.1.2.0/24
199.1.1.0/24
Load Balancing
The routing protocol gives several routes to a network Either select the best Or load-balance between several links
Unequal-cost multi-path Equal-cost multi-path
Routing Protocols
Interior
Exterior
RIP
OSPF
IGRP (cisco)
IS-IS
BGP
EGP
Distance Vector
A node advertizes its distancevector
A list (vector) of all nodes that the node knows about The distance to each of them 2 4
a
1
3 1
Advertizements are sent to neighbours only Each neighbour updates its routing table and sends the new distance-vectors to its neighbours
Bellman-Ford algorithm
Distance-vector from e
R2
x
N1 N1 N 2 R1 N 2 R1
3.
N
N 16 N 16 N 2 R1 N 2 R1 N 16 N 16
4.
Now two things can happen: Either R1 reports its route to R2. Everything is fine.
N
N 16 N 16 N 16 N 16
R2
N
Loop! N 3 R2 N 3 R2 N 2 R1 N 2 R1
6.
N3 N3
N
N 3 R2 N 3 R2
Loop! N 4 R1 N 4 R1 N4 N4
7.
...
N
N 5 R2 N 5 R2
Loop! N 4 R1 N 4 R1
13. Finally, the cost reaches infinity at 16, and N is unreachable. The loop is broken!
N
N 16 N 16 N 16 N 16
R2
N
N 16 N 16 N 16 N 16
R2
N 16 N 16
N
N 16 N 16 N 16 N 16
R1
R2 always announces an unreachable route to N to R1.
N 16 N 16
R2
N
N 16 N 16 N 2 R1 N 2 R1
N 16 N 16
N
N 16 N 16 N 16 N 16
R1
R1 ignores updates to N from R2 for some period of time.
N2 N2
R2
N
N 16 N 16 N 2 R1 N 2 R1
N 16 N 16
N
N 16 N 16 N 16 N 16
Instability
After a router or link failure RIP takes minutes to stabilize.
Hops count may not be the best indication for which is the best route. The maximum useful metric value is 15
Network diameter must be less than or equal to 15.
AS boundary router: External routing, in the backbone area Area Border Router: one interface in each area
AS2 Area 0
AS2
Area 1
Area 2
Area 3
Fast Convergence
Disadvantage
uses more memory
a
2
3 1 4
b
1 2
a
2
3 1 4
b
1 2
c
1
c
1
e
Db (path) 3 (a-b) 2 (a-c-b)
d
Dc (path) 1 (a-c) 1 (a-c) 1 (a-c) 1 (a-c) 1 (a-c)
d
De (path) 2 (a-e) 2 (a-e) 2 (a-e) 2 (a-e) 2 (a-e)
2 (a-c-b) 2 (a-c-b)
{a, c, b, e, d} 2 (a-c-b)
BGP uses path-vector - enhancent of distance-vector. BGP implements policies chosen by the local administrator.
AS1
A 1.0/8 AS1
AS2 AS3
A 1.0/8 AS3 AS1 A 1.0/8 AS2 AS1 W 1.0/8
AS4
A 1.0/8 AS4 AS3 AS1
AS5
AS6
A 1.0/8 AS5 AS2 AS1 A 1.0/8 AS5 AS4 AS3 AS1
Link-State
Link state database would be enormous
BGP Architecture
AS1 E-BGP I-BGP AS2 E-BGP AS3
Adj RIB In
Peer 1
Peer 2
Adj RIB In
locRIB
Peer 2
Peer 3
Adj RIB In
Peer 3
FIB
When networks change, BGP peers advertise changes, and these may have problems to converge
Especially in the presence of faults
Route reflection
Break up the mesh into a hierarchy
AS confederations
divide-and-conquer use several sub-ASs
Whats Next
Lab 3
Note the schedule changes! Fri 21 Sept 9-13, 14-18
Material for next lecture not covered in the book ISP project
Voravit.....