15 Routing Protocols

IP Routing
Novan Aryandi naryandi@cisco.com Cisco Systems Indonesia
BRKRST-1301 14444_04_2008_c1
2008 Cisco Systems, Inc. All rights reserved.
Cisco Public
What is Routing?
10.120.2.0 172.16.1.0
To route a router need to know:

Destination addresses Sources it can learn from Possible routes Best route Maintain and verify routing information
BRKRST-1301 14444_04_2008_c1 2008 Cisco Systems, Inc. All rights reserved. Cisco Public
What is Routing? (cont.)

10.120.2.0 E0 172.16.1.0
S0
Network Protocol Connected Learned
Destination Network 10.120.2.0 172.16.1.0
Exit Interface E0 S0
Routed Protocol: IP
Routers must learn destinations that are not directly connected

Identifying Static and Dynamic Routes
Static Route
Uses a route that a network administrator enters into the router manually
Dynamic Route
Uses a route that a network routing protocol adjusts automatically for topology or traffic changes
BRKRST-1301 14444_04_2008_c1
Cisco Public
Static Routes
Stub Network
172.16.1.0 SO
Network
A 172.16.2.2
172.16.2.1
B B
Configure unidirectional static routes to and from a stub network to allow communications to occur.
BRKRST-1301 14444_04_2008_c1
Cisco Public
Static Route Configuration
Router(config)#ip route network [mask] {address | interface}[distance] [permanent]
Defines a path to an IP destination network or subnet
BRKRST-1301 14444_04_2008_c1
Cisco Public
Static Route Example

Stub Network
172.16.1.0 SO
Network
172.16.2.2
172.16.2.1
B B
ip route 172.16.1.0 255.255.255.0 172.16.2.1

This is a unidirectional route. You must have a route configured in the opposite direction.
Default Routes
Stub Network
172.16.1.0 SO
Network
172.16.2.2
172.16.2.1
B B
ip route 0.0.0.0 0.0.0.0 172.16.2.2
This route allows the stub network to reach all known networks beyond router A.
What is a Routing Protocol?

10.120.2.0
Routing protocols are used between routers to determine paths and maintain routing tables. Once the path is determined a router can route a routed protocol.
172.16.1.0
E0
S0
Network Protocol Connected RIP IGRP
Destination Network
Exit Interface
172.17.3.0
10.120.2.0 172.16.2.0 172.17.3.0
E0 S0 S1
Routed Protocol: IP Routing protocol: RIP, IGRP

Autonomous Systems: Interior or Exterior Routing Protocols

IGPs: RIP, IGRP EGPs: BGP
Autonomous System 100
Autonomous System 200
An autonomous system is a collection of networks under a common administrative domain

IGPs operate within an autonomous system EGPs connect different autonomous systems
10
Administrative Distance: Ranking Routes
I need to send a packet to Network E. Both router B and C will get it there. Which route is best?
IGRP Administrative Distance=100

Router A
Router B
RIP Administrative Distance=120
E Router C Router D
BRKRST-1301 14444_04_2008_c1
Cisco Public
11
Classes of Routing Protocols
Distance Vector
C
B A D
Hybrid Routing
B C D A
Link State
BRKRST-1301 14444_04_2008_c1
Cisco Public
12
Distance Vector Routing Protocols
B C DistanceHow far VectorIn which direction A
Routing Table
Routing Table
Routing Table
Routing Table
Pass periodic copies of routing table to neighbor routers and accumulate distance vectors
13
Distance VectorSources of Information and Discovering Routes

10.1.0.0
E0
10.2.0.0 A
S0 S0
10.3.0.0 B
S1 S0
10.4.0.0 C
E0
Routing Table 10.1.0.0 10.2.0.0 E0 S0 0 0
Routing Table 10.2.0.0 10.3.0.0 S0 S1 0 0
Routing Table 10.3.0.0 10.4.0.0 S0 0 0
E0
Routers discover the best path to destinations from each neighbor
BRKRST-1301 14444_04_2008_c1
Cisco Public
14

10.1.0.0
E0
10.2.0.0 A
S0 S0
10.3.0.0 B
S1 S0
10.4.0.0 C
E0
Routing Table 10.1.0.0 10.2.0.0 10.3.0.0 E0 S0 S0 0
Routing Table
Routing Table
10.2.0.0
10.3.0.0 10.4.0.0
S0
S1 S1
0
0 1
10.3.0.0
10.4.0.0 10.2.0.0
S0 E0 S0
0
0 1
0
1
Routers discover the best path to 10.1.0.0 S0 1 destinations from each neighbor
BRKRST-1301 14444_04_2008_c1
Cisco Public
15

10.1.0.0
E0
10.2.0.0 A
S0 S0
10.3.0.0 B
S1 S0
10.4.0.0 C
E0
Routing Table 10.1.0.0 10.2.0.0 10.3.0.0 10.4.0.0 E0 0 0 1 2
Routing Table
Routing Table
10.2.0.0
10.3.0.0 10.4.0.0
S0
S1
0
0 1
10.3.0.0
10.4.0.0 10.2.0.0
S0 E0 S0 S0
0
0 1 2
S0
S0 S0
S1 the best path to Routers discover 10.1.0.0 from 1 neighbor 10.1.0.0 S0 each destinations
BRKRST-1301 14444_04_2008_c1
Cisco Public
16
Distance VectorSelecting Best Route with Metrics

A 56 RIP Hop count IPX IGRP Bandwidth Delay Load 56
T1
Reliability MTU
Ticks, hop count
T1 B
Information used to select the best path for routing
BRKRST-1301 14444_04_2008_c1
Cisco Public
17
Distance VectorMaintaining Routing Information

Process to update this routing table Topology change causes routing table update
Updates proceed step-by-step from router to router

19

Process to update this routing table Router A sends out this updated routing table after the next period expires Topology change causes routing table update
BRKRST-1301 14444_04_2008_c1
Cisco Public
20

Process to update this routing table Router A sends out this updated routing table after the next period expires Process to update this routing table Topology change causes routing table update
BRKRST-1301 14444_04_2008_c1
Cisco Public
21
Maintaining Routing Information ProblemRouting Loops

10.1.0.0
E0
10.2.0.0 A
S0 S0
10.3.0.0 B
S1 S0
10.4.0.0 C
E0
Routing Table
Routing Table 0 0
Routing Table 0 0 10.3.0.0 S0 10.4.0.0 E0 10.2.0.0 S0 0 0 1
10.1.0.0
10.2.0.0 10.3.0.0 10.4.0.0
E0
10.2.0.0 S0
10.3.0.0 S1 10.4.0.0 S1
S0
S0
Each node maintains the distance from itself to each possible 2 1 2 10.1.0.0 S0 S0 10.1.0.0 S0 destination network
BRKRST-1301 14444_04_2008_c1
Cisco Public
22

10.1.0.0
E0
10.2.0.0 A
S0 S0
10.3.0.0 B
S1 S0
10.4.0.0 C
E0
Routing Table
Routing Table 0 0
Routing Table 0 0 10.3.0.0 S0 10.2.0.0 S0 0 1 2 10.4.0.0 E0 Down
10.1.0.0 E0
10.2.0.0 S0 10.3.0.0 10.4.0.0 S0
10.2.0.0 S0
10.3.0.0 S1 10.4.0.0 S1
Slow produces inconsistent routing 2 convergence 1 10.1.0.0 S0 S0 10.1.0.0 S0
BRKRST-1301 14444_04_2008_c1
Cisco Public
23

10.1.0.0
E0
10.2.0.0 A
S0 S0
10.3.0.0 B
S1 S0
10.4.0.0 C
E0
Routing Table
Routing Table 0 0
Routing Table 0 0 10.3.0.0 S0 10.4.0.0 S0 10.2.0.0 S0 S0 0 2 1 2
10.1.0.0 E0
10.2.0.0 10.3.0.0 10.4.0.0
10.2.0.0 S0
10.3.0.0 S1 10.4.0.0 10.1.0.0 S1 S1
S0
S0 S0
1 1
10.1.0.0
Router C concludes that the best path to network 10.4.0.0 is through Router B
24

10.1.0.0
E0
10.2.0.0 A
S0 S0
10.3.0.0 B
S1 S0
10.4.0.0 C
E0
Routing Table
Routing Table 0 0
Routing Table 0 0 10.3.0.0 S0 10.4.0.0 S0 10.2.0.0 S0 0 2 1 2
10.1.0.0 E0
10.2.0.0 S0 10.3.0.0 10.4.0.0 S0 S0
10.2.0.0 S0
10.3.0.0 S1 10.4.0.0 S1 10.1.0.0 S0
3 1
10.1.0.0 S0
Router A updates its table to reflect the new but erroneous hop count
25
Symptom: Counting to Infinity

10.1.0.0
E0
10.2.0.0 A
S0 S0
10.3.0.0 B
S1 S0
10.4.0.0 C
E0
Routing Table
Routing Table 0 0
Routing Table 0 0 10.3.0.0 S0 10.4.0.0 S0 10.2.0.0 S0 0 4 1 2
10.1.0.0 E0
10.2.0.0 S0 10.3.0.0 10.4.0.0 S0 S0
10.2.0.0 S0
10.3.0.0 S1 10.4.0.0 10.1.0.0 S1 S0
Packets for network 10.4.0.0 bounce between routers A, B, and C Hop count for network 10.4.0.0 counts to infinity
6
1
10.1.0.0 S0
BRKRST-1301 14444_04_2008_c1
Cisco Public
26
Solution: Defining a Maximum

10.1.0.0
E0
10.2.0.0 A
S0 S0
10.3.0.0 B
S1 S0
10.4.0.0 C
E0
Routing Table
Routing Table 0 0
Routing Table 0 0 10.3.0.0 10.4.0.0 10.2.0.0 10.1.0.0
10.1.0.0 E0
10.2.0.0 S0 10.3.0.0 10.4.0.0 S0 S0
10.2.0.0 S0
10.3.0.0 S1 10.4.0.0 10.1.0.0 S1 S0
S0
S0 S0 S0
0 16 1 2
16 1
16
Define a limit on the number of hops to prevent infinite loops
BRKRST-1301 14444_04_2008_c1
Cisco Public
27
Solution: Split Horizon

10.1.0.0
E0
10.2.0.0 A
S0
10.3.0.0 B
S1
10.4.0.0
S0
S0
E0
Routing Table
Routing Table 0 0
Routing Table 0 0 10.3.0.0 10.4.0.0 10.2.0.0 S0 S0 S0 S0 0 0 1 2
10.1.0.0
10.2.0.0 10.3.0.0 10.4.0.0
E0
10.2.0.0 S0
10.3.0.0 S1 10.4.0.0 10.1.0.0 S1 E1
S0
S0 S0
1 2
10.1.0.0
It is never useful to send information about a route back in the direction from which the original packet came
BRKRST-1301 14444_04_2008_c1
Cisco Public
28
Solution: Route Poisoning

10.1.0.0
E0
10.2.0.0 A
S0 S0
10.3.0.0 B
S1 S0
10.4.0.0 C
E0
Routing Table
Routing Table 0 0
Routing Table 0 0 10.3.0.0 10.4.0.0 10.2.0.0 10.1.0.0
10.1.0.0 E0
10.2.0.0 S0 10.3.0.0 10.4.0.0 S0 S0
10.2.0.0 S0
10.3.0.0 S1 10.4.0.0 S1 10.1.0.0 E1
S0
1 2
S0 Infinity 1 S0 S0 2
Routers set the distance of routes that have gone down to infinity
BRKRST-1301 14444_04_2008_c1
Cisco Public
29
Solution: Poison Reverse

10.1.0.0
E0
10.2.0.0 A
S0 S0
10.3.0.0 B
S1 S0
10.4.0.0 C
E0
Poison Reverse
Routing Table Routing Table 0 0 1 Routing Table 0 0
Possibly Down
10.1.0.0 E0
10.2.0.0 S0 10.3.0.0 10.4.0.0 S0 S0
10.2.0.0 S0
10.3.0.0 S1 10.4.0.0 S1 10.1.0.0 E1
10.3.0.0 10.4.0.0 10.2.0.0 10.1.0.0
S0
S0 Infinity 1 S0 S0 2
Poison Reverse overrides split horizon
BRKRST-1301 14444_04_2008_c1
Cisco Public
30
Solution: Hold-Down Timers
Update after hold-down Time
Network 10.4.0.0 is unreachable
10.1.0.0
E0
10.2.0.0 A
S0 S0
10.3.0.0 B
S1 S0
10.4.0.0 C
E0
Update after hold-down Time
Network 10.4.0.0 is down then back up then back down
Router keeps an entry for the network possibly down state, allowing time for other routers to recompute for this topology change
BRKRST-1301 14444_04_2008_c1
Cisco Public
31
Solution: Triggered Updates
10.1.0.0
E0
10.2.0.0 A
S0 S0
10.3.0.0 B
S1 S0
10.4.0.0 C
E0
Router sends updates when a change in its routing table occurs
BRKRST-1301 14444_04_2008_c1
Cisco Public
32
RIP Timers
1. 2. 3. Update Timer Broadcast the routing table to all it neighbour for every 30 seconds. Invalidation Timer It is either 3 or 6 times the Update Timer. If no updates are received for a particular route and that route is marked as Invalid route. Holddown Timer The Invalid route is not removed from the routing table it will be marked as possibly down on the routing table. If it receives the route with the better metric before the hold down timer expiry then it will accept or it will remove.
BRKRST-1301 14444_04_2008_c1
Cisco Public
34
Hybrid Routing
Choose a routing path based on distance vectors Balanced Hybrid Routing Converge rapidly using change-based updates
Share attributes of both distance-vector and link-state routing

35
IP Routing Configuration Tasks
Network 172.16.0.0
RIP
Router configuration
Select routing protocols Specify networks or interfaces RIP
IGRP, RIP
IGRP
Network 160.89.0.0
Network 172.30.0.0
BRKRST-1301 14444_04_2008_c1
Cisco Public
36
Dynamic Routing Configuration
Router(config)#router protocol [keyword]

Defines an IP routing protocol
Router(config-router)#network network-number Mandatory configuration command for each IP routing process

Identifies the physically connected network that routing updates are forwarded to
37
RIP Overview
19.2 kbps T1 T1 T1
Hop count metric selects the path
Routes update every 30 seconds

38
RIP Configuration
Router(config)#router rip
Starts the RIP routing process
Router(config-router)#network network-number Selects participating attached networks The network number must be a major classful network number
BRKRST-1301 14444_04_2008_c1
Cisco Public
39
RIP Configuration Example

E0 172.16.1.0 S2 S2
10.1.1.2 B
S3
S3
E0
192.168.1.0
A 172.16.1.1 10.1.1.1
C 10.2.2.2 10.2.2.3 192.168.1.1
2.3.0.0 router rip network 172.16.0.0 network 10.0.0.0
2.3.0.0 router rip network 192.168.1.0 network 10.0.0.0
router rip network 10.0.0.0
BRKRST-1301 14444_04_2008_c1
Cisco Public
40
Verifying the Routing ProtocolRIP

E0 172.16.1.0 S2 S2 10.1.1.2 B S3 S3 E0 192.168.1.0
A 172.16.1.1 10.1.1.1
C 10.2.2.2 10.2.2.3 192.168.1.1
RouterA#sh ip protocols Routing Protocol is "rip" Sending updates every 30 seconds, next due in 0 seconds Invalid after 180 seconds, hold down 180, flushed after 240 Outgoing update filter list for all interfaces is Incoming update filter list for all interfaces is Redistributing: rip Default version control: send version 1, receive any version Interface Send Recv Key-chain Ethernet0 1 1 2 Serial2 1 1 2 Routing for Networks: 10.0.0.0 172.16.0.0 Routing Information Sources: Gateway Distance Last Update 10.1.1.2 120 00:00:10 Distance: (default is 120)
41
Displaying the IP Routing Table

E0 172.16.1.0 S2 S2 10.1.1.2 B S3 S3 E0 192.168.1.0
A 172.16.1.1 10.1.1.1
C 10.2.2.2 10.2.2.3 192.168.1.1
RouterA#sh ip route Codes: C - connected, S - static, I - IGRP, R - RIP, M - mobile, B BGP D - EIGRP, EX - EIGRP external, O - OSPF, IA - OSPF inter area N1 - OSPF NSSA external type 1, N2 - OSPF NSSA external type 2 E1 - OSPF external type 1, E2 - OSPF external type 2, E - EGP i - IS-IS, L1 - IS-IS level-1, L2 - IS-IS level-2, * - candidate default U - per-user static route, o - ODR T - traffic engineered route Gateway of last resort is not set 172.16.0.0/24 is subnetted, 1 subnets 172.16.1.0 is directly connected, Ethernet0 10.0.0.0/24 is subnetted, 2 subnets 10.2.2.0 [120/1] via 10.1.1.2, 00:00:07, Serial2 10.1.1.0 is directly connected, Serial2 192.168.1.0/24 [120/2] via 10.1.1.2, 00:00:07, Serial2
Cisco Public
C R C R
BRKRST-1301 14444_04_2008_c1
42
debug ip rip Command

E0 172.16.1.0 S2 S2 10.1.1.2 B S3 S3 E0 192.168.1.0
A 172.16.1.1 10.1.1.1
C 10.2.2.2 10.2.2.3 192.168.1.1
RouterA#debug ip rip RIP protocol debugging is on RouterA# 00:06:24: RIP: received v1 update from 10.1.1.2 on Serial2 00:06:24: 10.2.2.0 in 1 hops 00:06:24: 192.168.1.0 in 2 hops 00:06:33: RIP: sending v1 update to 255.255.255.255 via Ethernet0 (172.16.1.1) 00:06:34: network 10.0.0.0, metric 1 00:06:34: network 192.168.1.0, metric 3 00:06:34: RIP: sending v1 update to 255.255.255.255 via Serial2 (10.1.1.1) 00:06:34: network 172.16.0.0, metric 1
BRKRST-1301 14444_04_2008_c1
Cisco Public
43
Introduction to OSPF
Area 0
Area 2 Area 1
Open Standard Link State Protocol, Uses SPF algorithm Fast Convergence with triggered updates Classless protocol, supports VLSM and summarization Uses Cost as metric (Inverse Bandwidth)
BRKRST-1301 14444_04_2008_c1
Cisco Public
44
Link-State Routing Protocols
B C D
Link-State Packets Topological Database SPF Algorithm
Routing Table
Shortest Path First Tree

After initial flood, pass small event-triggered link-state updates to all other routers
45
Shortest Path Algorithm
The best path is the lowest-cost path.

BRKRST-1301 14444_04_2008_c1
Cisco Public
46
OSPF Terminology
g
BRKRST-1301 14444_04_2008_c1
Cisco Public
47
Steps in the Operation of OSPF
BRKRST-1301 14444_04_2008_c1
Cisco Public
48
Hello Protocol
It is the means by which neighbors are discovered. It advertises several parameters on which two routers must agree before they can become neighbors. Hello packets act as keepalives between neighbors. It ensures bi-directional communication between neighbors. It elects Designated Routers (DRs) and Backup Designated Routers (BDRs) on Broadcast and Nonbroadcast Multiaccess (NBMA) networks.
BRKRST-1301 14444_04_2008_c1
Cisco Public
49
Establishing Adjacency
BRKRST-1301 14444_04_2008_c1
Cisco Public
50
OSPF Network Types
BRKRST-1301 14444_04_2008_c1
Cisco Public
51
DR and BDR Election Process
Router with highest priority
In case of tie, router with highest router ID
BRKRST-1301 14444_04_2008_c1
Cisco Public
52
Hierarchical Design (Areas)

OSPF supports two important concepts: autonomous systems and areas. Within an AS, areas are used to provide hierarchical routing. An area is a logical grouping of OSPF routers and links that effectively divide an OSPF domain into sub-domains
Areas are used to control when and how much routing information is shared across your network.
OSPF implements a two-layer hierarchy: the backbone (area 0) and areas off of the backbone (areas 165,535) Every area off the backbone must be connected to the backbone area.
BRKRST-1301 14444_04_2008_c1
Cisco Public
53
OSPF CONFIGURATION
BRKRST-1301 14444_04_2008_c1
Cisco Public
54
Configuring the OSPF Routing Process
BRKRST-1301 14444_04_2008_c1
Cisco Public
55
Configuring OSPF Loopback Address and Router Priority
BRKRST-1301 14444_04_2008_c1
Cisco Public
56
Modifying OSPF Cost Metric
BRKRST-1301 14444_04_2008_c1
Cisco Public
57
Configuring OSPF Timers
BRKRST-1301 14444_04_2008_c1
Cisco Public
58
Common OSPF Configuration Issues
BRKRST-1301 14444_04_2008_c1
Cisco Public
59
Verifying OSPF Configuration
show ip protocol
show ip route
show ip ospf interface shop ip ospf show ip ospf neighbor detail show ip ospf database
BRKRST-1301 14444_04_2008_c1
Cisco Public
60
EIGRP
1. 2. 3. 4. 5. 6. Characterstic of EIGRP Cisco properitary. Advanced Distance vector protocol. Claless routing protocol. Multiple network layer protocol support using PDM. Faster convergence. Equal and Unequal cost path load balancing.
7.
8.
Manual summarization at Interface level.

Bandwidth usage control for routing updates.
BRKRST-1301 14444_04_2008_c1
Cisco Public
61
Hybrid Routing
Choose a routing path based on distance vectors Balanced Hybrid Routing Converge rapidly using change-based updates Share attributes of both distance-vector and link-state routing
BRKRST-1301 14444_04_2008_c1
Cisco Public
62
Process and Techniques

1. 2. 3. 4. Efficient Neighbour Discovery. It uses RTP for its updates. DUAL Finite state Machine. Protocol Dependent Module
BRKRST-1301 14444_04_2008_c1
Cisco Public
63
Three Tables Maintained by EIGRP

1. 2. 3. Neighbour table. Topology table. Routing table.
BRKRST-1301 14444_04_2008_c1
Cisco Public
64
Terms Used by Eigrp

1. 2. Successor route The Efficient and Loop free path with the lowest FD. Feasible Distance The Distance between the local router and the Destination Network.
3.
4.
Advertise Distance The Distance between the Next hop router and the destination.
Successor Next Hop Router of the Best path.
5.
Feasible Successor Next Hop router fo the backup path for the Best route.
BRKRST-1301 14444_04_2008_c1
Cisco Public
65
Condition for Feasible successor

AD of the considered backup route < FD of the sucessor route.
BRKRST-1301 14444_04_2008_c1
Cisco Public
66
More Info
Topology table will have a maximum of six backup path for a successor route. It is for faster convergence. Active State - Recomputation Passive state No Re-computation
BRKRST-1301 14444_04_2008_c1
Cisco Public
67
EIGRP packet types

1. 2. 3. 4. 5. Hello Update Query Reply Ack
6.
Note: 224.0.0.10 is the multicast address used by EIGRP packet types (Hello, Update and Query Packet)
BRKRST-1301 14444_04_2008_c1
Cisco Public
68
Conditions to Establish Neighbour Adjacency

1. 2. Identical K Metrics Same AS.
BRKRST-1301 14444_04_2008_c1
Cisco Public
69
EIGRP Metric parameters

1. 2. 3. Bandwidth Load Delay
4.
5. 6.
Reliability
MTU Note: Eigrp Metric = IGRP Metric * 256.
7.
8.
Eigrp Metric 32 bit

Igrp Metric 24 bit
BRKRST-1301 14444_04_2008_c1
Cisco Public
70
Basic configuration
Conf t)#router eigrp <AS> -rtr)#network <Network ID> <WM>
BRKRST-1301 14444_04_2008_c1
Cisco Public
71
Load Balancing
Eigrp supports Equal cost path load balancing. Default is 4 and Maximum is 6. It also supports Unequal cost path load balancing using Variance command.
BRKRST-1301 14444_04_2008_c1
Cisco Public
72
Useful show commands for EIGRP

Sh ip eigrp neighbour Sh ip eigrp topology Sh ip route eigrp Sh ip protocols.
BRKRST-1301 14444_04_2008_c1
Cisco Public
73
Summary
After completing this chapter, you should be able to perform the following tasks:
Determine when to use a static or dynamic route. Configure a static route on a Cisco Router.
Describe how distance vector routing protocols operate.

Configure the RIP and OSPF routing protocols on a Cisco router. Use show ip route, show ip protocols, and other show and debug commands to verify proper routing operation.
BRKRST-1301 14444_04_2008_c1
Cisco Public
74
BRKRST-1301 14444_04_2008_c1
Cisco Public
75

15 Routing Protocols

Caricato da

Informazioni sul documento

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

15 Routing Protocols

Caricato da

Copyright:

Formati disponibili

IP Routing

Novan Aryandi naryandi@cisco.com Cisco Systems Indonesia

2008 Cisco Systems, Inc. All rights reserved.

To route a router need to know:

What is Routing? (cont.)

Network Protocol Connected Learned

Destination Network 10.120.2.0 172.16.1.0

Routers must learn destinations that are not directly connected

Identifying Static and Dynamic Routes

2008 Cisco Systems, Inc. All rights reserved.

2008 Cisco Systems, Inc. All rights reserved.

Static Route Configuration

Router(config)#ip route network [mask] {address | interface}[distance] [permanent]

Defines a path to an IP destination network or subnet

2008 Cisco Systems, Inc. All rights reserved.

Static Route Example

ip route 172.16.1.0 255.255.255.0 172.16.2.1

ip route 0.0.0.0 0.0.0.0 172.16.2.2

What is a Routing Protocol?

Network Protocol Connected RIP IGRP

10.120.2.0 172.16.2.0 172.17.3.0

Routed Protocol: IP Routing protocol: RIP, IGRP

Autonomous Systems: Interior or Exterior Routing Protocols

Autonomous System 100

Autonomous System 200

An autonomous system is a collection of networks under a common administrative domain

Administrative Distance: Ranking Routes

IGRP Administrative Distance=100

RIP Administrative Distance=120

2008 Cisco Systems, Inc. All rights reserved.

Classes of Routing Protocols

2008 Cisco Systems, Inc. All rights reserved.

Distance Vector Routing Protocols

B C DistanceHow far VectorIn which direction A

Distance VectorSources of Information and Discovering Routes

Routing Table 10.1.0.0 10.2.0.0 E0 S0 0 0

Routing Table 10.2.0.0 10.3.0.0 S0 S1 0 0

Routing Table 10.3.0.0 10.4.0.0 S0 0 0

Routers discover the best path to destinations from each neighbor

2008 Cisco Systems, Inc. All rights reserved.

Distance VectorSources of Information and Discovering Routes

Routing Table 10.1.0.0 10.2.0.0 10.3.0.0 E0 S0 S0 0

2008 Cisco Systems, Inc. All rights reserved.

Distance VectorSources of Information and Discovering Routes

Routing Table 10.1.0.0 10.2.0.0 10.3.0.0 10.4.0.0 E0 0 0 1 2

2008 Cisco Systems, Inc. All rights reserved.

Distance VectorSelecting Best Route with Metrics

Ticks, hop count

Information used to select the best path for routing

2008 Cisco Systems, Inc. All rights reserved.

Distance VectorMaintaining Routing Information

Updates proceed step-by-step from router to router

Distance VectorMaintaining Routing Information

Updates proceed step-by-step from router to router

2008 Cisco Systems, Inc. All rights reserved.

Distance VectorMaintaining Routing Information

Updates proceed step-by-step from router to router

2008 Cisco Systems, Inc. All rights reserved.

Maintaining Routing Information ProblemRouting Loops

Routing Table 0 0 10.3.0.0 S0 10.4.0.0 E0 10.2.0.0 S0 0 0 1

2008 Cisco Systems, Inc. All rights reserved.

Maintaining Routing Information ProblemRouting Loops

Routing Table 0 0 10.3.0.0 S0 10.2.0.0 S0 0 1 2 10.4.0.0 E0 Down

Slow produces inconsistent routing 2 convergence 1 10.1.0.0 S0 S0 10.1.0.0 S0