HP Router Enablement Basic 2 - Open Routing Protocols and Standards TTP

Routing Protocol
Fundamentals
Alvaro Retana (alvaro.retana@hp.com)

Distinguished Technologist
Advanced Technology Group
© Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice. HP Restricted.
Agenda
Introduction
• Function of routing
• Routing Protocol Types
Internal Gateway Protocols (IGP)

• Link State Protocols (OSPF, IS-IS)
• Distance Vector Protocols (RIP, EIGRP)
• Migrating from EIGRP to OSPF
−Motivation
−Considerations and Strategy
External Gateway Protocols (EGP) - BGP

HP Router Portfolio Routing Protocol Matrix
2 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice. HP Restricted.
Introduction
Function of routing
A router provides L3 connectivity between local networks

• Routing Protocols are used to exchange reachability information the L3 networks
connected to individual routers
• They provide scalability, resiliency and convergence speed
Internal Gateway Protocols (IGP) are used to route within an
autonomous system
• Examples of an IGP are:
−Routing Information Protocol (RIP)
−Open Shortest Path First (OSPF)
−Intermediate-System to Intermediate-System (IS-IS)
External Gateway Protocols (EGP) are used to route between

independently administered L3 networks (aka Autonomous
Systems)
4
• Border Gateway Protocol (BGP) is the standard EGP
Routing Protocol Types
Link State Distance Vector Path Vector
What is Local knowledge to every Global knowledge to directly
advertised? other router in a flooding connected neighbors.
domain. • Distance to all known destinations.
• Local connectivity + state • Each router has knowledge of the
of the links to other distance and the direction (next
routers hop) to every destination
• Each router in a domain
Also advertises
has a complete view of the
the path (list of
topology and can calculate
autonomous
paths to any destination
systems) through
which the
destination is
reachable
Examples OSPF, IS-IS RIP, EIGRP BGP
Routing Protocol Topology Visibility
Link State Distance Vector

Each router in a domain has a Each router has knowledge of the
complete view of the topology and can distance and the direction (next hop)
calculate paths to any destination to every destination
Routing Convergence
Routing Protocol convergence involves 3 steps:
• Failure Detection
• Updated Routing Information Calculation
• Forwarding Table Updating
Only the second step is protocol dependent
Failure detection usually depends of the type of media, the type

of failure and the mechanism used for detection.
• In general, detection of failures in point-to-point links in straight forward as it is reflected on
the state of the link
• Non point-to-point links and shared media requires the use of a heartbeat mechanism.
−Routing Protocol Hellos or BFD can be used for failure detection
Link State Protocols
Link State Protocols Agenda
Basic Concepts
• Flooding
• Flooding Domains
• Routing Convergence
OSPF
• History
• Link State Advertisements
• Areas
• Traffic Flow
IS-IS
• History
• Basics
• Hierarchy
Link State Protocols - Flooding
A
Link State Advertisement (LSA)
LSA = Local connectivity + state of the
20 10 links to other routers
C’s LSA:
D B
−192.0.2.0/24, metric 10
10 15 −B, metric 15
−D, metric 10
The information is “flooded” to all of C’s

C
neighbors
10
192.0.2.0/24
Link State Protocols – Flooding (2)
A
Best Path to 192.0.2.0/24
Flooding
• Flooding = Copy + Retransmit
20 10 −B and D keep a copy of C’s LSA and
retransmit towards A
D B • Every router in the flooding domain has
information from every other router
10 15
• …and can use it to build a tree that
includes the shortest path to each
destination
C
10 • OSPF and IS-IS use the Dijkstra Shortest

Path Tree (SPF) algorithm
192.0.2.0/24
Link State Flooding Domains
A Flooding Domain is a
contiguous group of nodes and
networks
• OSPF = Area
• IS-IS = Domain
Each flooding domain has its own

topology database – not visible from
other flooding domains
• Summarization and Aggregation at the
boundaries
Backbone
The backbone MUST be contiguous and
connect to all other flooding domains
12 • Strict inter-area advertisement rules
Link State Routing Convergence
Link State Protocols require that the change be flooded

throughout the flooding domain, and for all the nodes to run
SPF (as needed)
Factors that can affect routing convergence:

• Topology: size and complexity
• Aggregation/Summarization
• Flooding/SPF Run Timers (Configuration)
OSPF History v 3)
PF
d S
e O
h ka
li s (a ed
PF ub rst 6 sh
S np fi v
P b li
O as I
a l t io w r u
in ca fo t p
i g
r cifi Fv2 ed PF rs
h S fi
O e
p SP lis 1998 O as 2008 2010
s O b w
pu
1989 1991 1999
6) e ss )
r 3
IPv d
d Fv
r A
( SP
fo
PF
8 38 n O
O
S 5 si
( F C l ie
40 R mi
53 Fa
F C
14 R
OSPF LSA Types
Name Type Description Originator Flooding
Scope
Router 1 Basic Local Link State All Nodes Area
Information
Network 2 Describes a LAN Designated Router (DR) Area
Network 3 Inter-Area Reachability Area Border Router Area

Summary (ABR)
ASBR Summary 4 ASBR Reachability Autonomous System Area
Border Router (ASBR)
External 5 External Routing Information ASBR Autonomous

System
NSSA External 7 External Routing Information ASBR Area
Opaque LSA 9, 10, 11 Opaque Information Any Node Variable
OSPF Areas
Area Type Description

Normal All Intra/Inter-Area Information Present
Stub No External LSAs allowed
Totally Stubby No Summary or External LSAs allowed, except the
default summary route
NSSA Same as Stub, but NSSA External (Type 7) LSAs are
allowed
NSSA Totally Stubby Same as Totally Stubby, but NSSA External (Type 7)
LSAs are allowed
LSAs and Areas
External
(Type 5)
ASBR
External
Summary (Type 7)
(Type 4) ASBR
NSSA
0/0
ABR
Router (Type 1) Summary Totally Stubby

Network (Type 2) (Type 3)
OSPF Intra-Area Routing Considerations
OSPF always prefers Intra-area

100 100
GbE GbE routes over Inter-area routes, so
100 GbE the placement of area boundaries
may affect the existing traffic flow
GbE 100 GbE
OSPF Traffic Flow
Area 0
100 GbE 100 GbE
100 GbE Link in Area 1
100 GbE
GbE 100
GbE
Area 1
Area Border Router (ABR)
OSPF Traffic Flow (2)
Area 0
100 GbE Link in Area 0 100 GbE 100 GbE
100 GbE
GbE 100 GbE
Area 1
IS-IS History efix o-
Pr Tw te
e
) id ith Rou t IS
-
I- S -W n w ka firs
n it h
(IS ai tio (a as w
85 om ribu -IS ) w ed 8 Pv6
9 d D t IS h 0 I
5
1 he i s e l i n g b lis 53 ng
O s D v ak u C ti
IS bli Le Le p
F
R ou
Pu 1990
(R S)
I
2008
1987 2000
g )
- in
IS k
195 ed e a
1 rat L
C g te
F
R nte
Rou
(I ) (
IS 02
53
F C
21
R
IS-IS Basics
Link State Packets (LSP)

• Used to describe the state – one LSP per router
• The LSP contains all the information organized in extensible TLVs
• IS-IS is a true Integrated protocol: the information for all the routed protocols in the
network is carried in the same LSP
Hierarchy
• Two-layer hierarchy: Level 1 and Level 2 (backbone)
Router Type
• L1 Only: intra-area routing
• L2 Only: Inter-area routing
• L1L2: Intra and Inter-area routing
IS-IS Hierarchy
L1L2 L1 Routers
• Topology Information for the local
L1L2 area only
L2 Routers
L2 • Topology information about the L2
L2 topology (even if in different areas)
• Set “attached-bit” to indicate
L1 connectivity to other areas
L2
L1L2
L2
• Know both topologies
L1L2
All L1 Areas are
Stubs!
Distance Vector
Protocols
Distance Vector Protocols Agenda
Basic Concepts
• Route Advertisement
• Split Horizon and Poison Reverse
RIP
• History
EIGRP
• Basics
• Diffusing Update Algorithm (DUAL)
−Feasible Successors
−Routing Convergence
Distance Vector Protocols -
Advertisement
A
Routing Update
• Distance to all known destinations
20 10 • C’s Advertisement:
−192.0.2.0/24, distance 10
D B
• B and D will add their distance to C and
10 15 advertise the prefix with a new distance
of 25 and 20, respectively
• A will add its distance to B and D before
selecting the best path
C
10
192.0.2.0/24
Distance Vector Protocols –
Advertisement
A
(2)
Rules
• Only routes being used are advertised
20 10 • Split Horizon
−Don’t advertise a route through the
D B interface used to reach the destination
10 15 • Poison Reverse
−Use a distance of infinity (i.e.
unreachable) to advertise a route
through the interface used to reach the
C
destination
10
192.0.2.0/24
RIP History o col
rot r st
P fi
io
n as
at w 6)
2 v
8 o rm i on 0
8 r IP
5 f
10 g In ers d 20 fo
C n V he F C ng
RF o u t
i P is R IP
RI bl (R
R pu 1998
1997
2)
1988 1993
n
s io
ri
Ve
RIP
(
53
24
FC
28 R
Enhanced Interior Gateway Routing
Protocol
EIGRP Basics
First Implemented by cisco in the early 1990’s

• Originally developed at SRI International
• Cisco has the only commercial implementation
“Advanced” Distance Vector Protocol
• Uses the DUAL to guarantee loop free paths, and find backups
• Billed as IGRP’s evolution, but they are very different protocols
Composite metric
…which results in (Bandwidth + Delay)
DUAL Operation
A
Route Advertisement
• C’s Advertisement:
20 10 192.0.2.0/24, distance 10
• A receives:
D B
B = 192.0.2.0/24, distance 25
10 15 D = 192.0.2.0/24, distance 20
Reported Distance (RD)
• A’s Best Path has a distance of 35,
C
through B
10 B is the Successor (aka Next Hop)
35 is the Feasible Distance (FD)
192.0.2.0/24
DUAL Operation (2)
A
Feasible Successors
• DUAL’s Feasibility Condition
20 10 −If the RD < FD, then the alternate path is
loop free!
D B • In this example:
−FD = 35 (distance from A to the
10 15
destination)
−D’s RD = 20
C −RD < FD
−D is a Feasible Successor
10 • If the path through B is no longer available,
then A can immediately start using the
192.0.2.0/24 path through D as its best path
• Sub-Second Convergence!
DUAL Operation (3)
Queries
A • If the Feasibility Condition is not met…
− FD = 35 (distance from A to the destination)
− D’s RD = 40
− RD > FD
20 10
• …then A must actively ask all its neighbors to determine if
D B after the failure an alternate path exists
− Active Process
30 15 • A Query has two functions:
D can answer − Ask for an alternate path
A’s Query with − Poison the route through the sender
an alternate C • Queries are propagated until either…
path
−a positive answer is received (i.e. an alternate path exits)
10 − no knowledge exists of the specific route (achieved
through summarization)
192.0.2.0/24 −a router has no neighbors to ask
• Convergence = O(200ms/hop)
Migrating from EIGRP
to OSPF
Motivation: Why Migrate to a Standard
Protocol
By insisting on open standards in your network your business
can realize multiple benefits:
• Lower capital expense
−A vendor who knows you cannot easily incorporate a competitor’s products into your
network is much less motivated at the bargaining table
• Best-in-class solutions
−Committing yourself to a single vendor using proprietary protocol sharply reduces your
ability to seek out the best product on the market for each function of your network
• Lower risk
−By diversifying your suppliers, you are less vulnerable to a single software malfunction
affecting your entire network. Your network is also less at risk of product obsolescence,
vendor buyouts, or business failures
• Innovation
−The most competitive enterprises see their network as a fundamental tool for business
34 innovation.
© Agility,
Copyright 2012 Hewlett-Packard adaptation,
Development Company, L.P. and flexibility
The information areis the
contained herein subject key qualities
to change that
without notice. HP keep your
Restricted.
network ahead of your competitors

Network Architecture Considerations
Hierarchy Structure & Addressing
Scheme
• EIGRP allows for unlimited hierarchy levels,
EIGRP defined by the location of summarization points
Summarizatio (manual or automatic).
n Points −Route summarization is allowed at any router
OSPF allows for two levels of strict

hierarchy, defined by the placement of
areas.
• Route summarization is allowed only at Area
Border Routers (ABR)
In general, the • The
placement andtopology
typeisofautomatically
an OSPFaggregated
area should
directly match the location and policies at the EIGRP
35 summarization points
Transition Strategies
Flash Transition / Overlay

1. Configure OSPF on the network with a high administrative distance
2. Verify the OSPF routing information
• The routes may not match if the EIGRP design used multiple summarization
points
3. Lower the OSPF administrative distance
• The routing table should now contain only OSPF routes
4. Remove EIGRP from the network
EIGRP EIGRP EIGRP

OSPF OSPF OSPF
Transition Strategies (2)
Coexistence (Redistribution)
1. Configure mutual redistribution at the border between OSPF and EIGRP
network regions
• Coexistence may be temporary while different regions are transitioned
EIGRP EIGRP EIGRP
OSPF Redistribution OSPF Redistribution OSPF

BGP
BGP Agenda
History
BGP Basics
When should you use BGP?
d
BGP History d o ns lish
e
e si b
d sh n pu
e l i e
l is
h
ub
E xt rst
b t p l fi
P pu s o e
BG n fir t oc er
a l t io a s
p ro -4 w
gin ca w l ti P
i
r ci fi -4 u BG
O e P M r
p B G f o 2006 2007
s 1995 1999
P-
1998
4) col
1989 1994
-BG v6) -
P to 4)
P IP G -
M r (B ipro GP
of fo 71 lt B
se 4 u r
(U 42 (M s fo
FC 0 n
545 R 76 sio
2 4 n
C FC
x te
RF R E
BGP Basics
Path Vector Protocol

• It includes the path through which an update travels in each update (Autonomous
Systems Path = AS_PATH)
• The AS_PATH is used to guarantee loop free paths
Runs Over TCP
• TCP handles all the connection details: setup, maintenance, retransmissions, etc.
Policy Rich Protocol
• Multiple Route Attributes can modify a specific path to a destination
• The Route Attributes are used in the selection of the best path
When should you use BGP?
1. Connection to the Internet

• Granular outbound traffic control is needed when multi-homed to different providers
• Granular inbound traffic control is needed when multi-homed
2. Connections to Extranets
• BGP hides the internal routing information, isolated failures to each domain and
provides policy and security
3. Network Scaling
• BGP scales at least an order of magnitude more than any IGP
• Internal backbone can be modeled as a service provider, using rich policy constructs
Routing Protocol Summary
OSPF EIGRP BGP
Type • Link State • Distance Vector • Path Vector
Standardization • Standardized by the IETF • Never submitted to any standards • Standardized by the IETF
Status • OSPFv2 = rfc2328 body • BGPv4 = rfc4271
Routing • Dijkstra Shortest Path First (SPF) • Diffusing Update Algorithm (DUAL) • Route Selection based on Route
Algorithm • SPF and strict inter-area propagation rules • DUAL guarantees 100% loop free Attributes
guarantee 100% loop free paths paths • 100% loop free paths guaranteed
• Sub-second convergence can be obtained • Sub-second convergence can be by carrying the path information
through tuning or the use of IP Fast achieved in the presence of • iBGP relies on the underlying IGP
Reroute feasible successors (no tuning for convergence
needed)
Summarization • Manual Route Summarization and • Auto-summarization at major • Manual summarization at any
and Hierarchy Automatic Topology Aggregation at area network boundaries point in the network – limited by
borders • Manual summarization at any point business relationships
• Supports two levels of hierarchy in the network • No strict hierarchy or other
• Carries intra-area topology information • Supports multiple levels of topology restrictions
hierarchy • No topology information carried
• No topology information carried
Metrics and • Path cost is derived from the link • Composite metric that can consider • Route Attributes used in place of
Load Sharing bandwidth bandwidth, delay, load, reliability end-to-end metrics
• Can load share over equal cost paths and MTU • Usually selects only one best
• Can load share over both equal and path.
unequal cost paths
IPv6 Support • OSPFv3 (rfc5340) was developed for IPv6 • Supported in a separate instance • Integrated Support
support
• Extensions exist to carry IPv4 in a
separate instance
Comprehensive Routing Protocol
Support
HP Router Portfolio Routing Protocol Matrix
HP MSR
Routing Protocols HP 8800 Series HP 6600 Series
Series
Routing Information Protocol (RIP)
Open Shortest Path First (OSPF)
Intermediate System to Intermediate System (IS-

IS)
Border Gateway Protocol (BGP)
RIPng
OSPFv3
IS-IS IPv6
BGP IPv6
Summary
Routing protocols provide the glue and intelligence for interconnecting large L3
networks
Routing protocols provide scalability, resiliency and fast convergence across a wide
range of topologies and deployment scenarios
Transitioning to open standards provide multiple business benefits, including lower

capital expense and access to industry-wide innovation and best-in-class solutions
HP has a strong commitment to open standards and routing protocols
HP MSR, 6600, 8800 routers have comprehensive support of all major routing
protocols
Thank You!
© Copyright 2012 Hewlett-Packard Development Company, L.P.

The information contained herein is subject to change without notice. HP Restricted.

HP Router Enablement Basic 2 - Open Routing Protocols and Standards TTP

Hochgeladen von

Dokumentinformationen

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

HP Router Enablement Basic 2 - Open Routing Protocols and Standards TTP

Hochgeladen von

Copyright:

Verfügbare Formate

Routing Protocol

Alvaro Retana (alvaro.retana@hp.com)

Internal Gateway Protocols (IGP)

External Gateway Protocols (EGP) - BGP

A router provides L3 connectivity between local networks

External Gateway Protocols (EGP) are used to route between

Link State Distance Vector

Only the second step is protocol dependent

Failure detection usually depends of the type of media, the type

The information is “flooded” to all of C’s

10 • OSPF and IS-IS use the Dijkstra Shortest

Each flooding domain has its own

Link State Protocols require that the change be flooded

Factors that can affect routing convergence:

Network 2 Describes a LAN Designated Router (DR) Area

Network 3 Inter-Area Reachability Area Border Router Area

External 5 External Routing Information ASBR Autonomous

NSSA External 7 External Routing Information ASBR Area

Opaque LSA 9, 10, 11 Opaque Information Any Node Variable

Area Type Description

Router (Type 1) Summary Totally Stubby

OSPF always prefers Intra-area

GbE 100 GbE

GbE 100 GbE

Link State Packets (LSP)

First Implemented by cisco in the early 1990’s

…which results in (Bandwidth + Delay)

network ahead of your competitors

OSPF allows for two levels of strict

Flash Transition / Overlay

EIGRP EIGRP EIGRP

EIGRP EIGRP EIGRP

OSPF Redistribution OSPF Redistribution OSPF

When should you use BGP?

Path Vector Protocol

1. Connection to the Internet

Routing Information Protocol (RIP)

Open Shortest Path First (OSPF)

Intermediate System to Intermediate System (IS-

Transitioning to open standards provide multiple business benefits, including lower

HP has a strong commitment to open standards and routing protocols

© Copyright 2012 Hewlett-Packard Development Company, L.P.

Das könnte Ihnen auch gefallen