Router(config-router)#network 172.16.0.0 0.0.255.255 area 0
Distance Vector (1)
Distance Vector protocols understand the direction and distance to any given network connections.
Algorithms calculate the cost to reach the connection and pass this information to every neighbour router.
Examples are RIP and IGRP.
Problems:
Routing loops
Counting to infinity
Distance Vector Solutions:
Defining a maximum number of hops:
RIP = 15
IGRP = 255
Split Horizon
If the router learns a route on an interface do not advertise it out of the same interface.
Route Poisoning
Information passed out of an interface is marked as unreachable by setting the hop count to 16 (for RIP).
Hold Down Timers
Ignores new routing updates until a determined time has passed.
Triggered Updates
Instead of routing updates being sent at the default intervals; a triggered update is sent every time to indicate a change in the routing table.
Link state (1)
These have a picture of the entire network from link state advertisements (LSA) and link State packets (LSP). Once these have all been passed only changes to the network are sent out reducing network traffic.
Req a lot of CPU time & b/width when LSAs are flooded eg:
OSPF
IS-IS
Routers use administrative distances to determine how believable the route learned is depending upon the protocol it learns the router from:
Routers prefer lowest distance eg:
Direct connection (0) >> OSPF (110) >> RIP (120)
Install this protocol in routing table
Link state (2)
Routing Protocols
Maintain table of hosts
Which i/face they can be reached by
Eg: RIP, OSPF
Routed Protocols
Used to transport traffic from source to destination
Eg: IP, IPX, AppleTalk
When a packet traverses a n/work from device to device (hop to hop):
IP address = constant
MAC address changes
Source - Default Distance:
Directly Connected Interface = 0
Static hop to next router = 1
EIGRP Summary = 5
External BGP = 20
EIGRP (Internal) = 90
OSPF = 110
IS-IS = 115
RIP = 120
Exterior Gateway Protocol (EGP) = 140
External EIGRP = 170
Internal BGP = 200
Unknown = 255
15. Routing Protocols
RIP v2
Uses UDP port 520
Classless
Max hop count 15
Multicasts route updates to 224.0.0.9
Supports authentication
Update timer 30 seconds
Invalid 90 seconds
Hold down 180 seconds
Flush 270 seconds
EIGRP
Uses IP protocol 88
Classless
Hybrid of distance vector and link state
Multicasts updates to 224.0.0.10
Uses feasible successors to determine alternative routes to networks.
The feasible successor is a backup route based upon the topology table.
OSPF
Uses IP protocol 89
Classless
Uses Dijkstras shortest path algorithm (SFP)
Router ID is the highest IP address but loopback address used if present
Backbone area is area 0
All non backbone areas must connect directly to area 0
Areas can be numbered from 0 to 65535
Multicasts on 224.0.0.5
OSPF Interface / Cost:
OSPF uses cost as a metric (see below - * indicates the most common) [Cost (10^8/Bandwidth)]
0 comments
Post a comment