Professional Documents
Culture Documents
Bellmanford algorithm
max hopcount of 15
send routing updates at fixed time
version 2 supports md5 for updates
Rip is classful
Classful Vs Classless
AD is 120
Metric uses hop count 1=directly connected and 16=unreachable
16 hop count is infinite
Uses port udp 520
Distance Vector
30 seconds Rip messages
hold down (expiration) is 180 sec
garbage collection or flush timer is 240
Destination for update is 255.255.255.255 broadcast
“timer basic <update> <invalid> <holddown> <flush>
equal cost load balancing if 2 routes are detected
passive interface (makes the router a silent host), it still listens to RIP broadcasts and updates
its routing table. If the result is to prevent the router from learning routes on the link, it must be
achieved by filtering out the updates.
Neighbor command lets RIP send a unicast advertisement
Passive command prevents the broadcast update
Offsetlist command is used to manipulate the rip metric
offsetlist <accesslist number> <in|out> offset <type number>
RIP V2
Classless
Authentication of routing updates
External route tags
Multicast route updates 224.0.0.9
next hop addresses carried with each route entry
Supports VLSM
Route summarization “ip summaryaddress rip x.x.x.x mask” under the outgoing interface
Rip V2 sends update via multicast 224.0.0.9
Neighbor command will use unicast to send update
Rip V1 uses broadcast
“ip rip v2broadcast” will allow Rip V2 to broadcast
Eigrp
Enhance interior gateway routing protocol
proprietary
fast to converge, feature rich, easy to configure
only protocol to keep backup routes
feasible successor
distance vector (no cognisant view of the whole network)
flexibility of summarization
unequal cost loadbalancing
all eigrp table will contain neighbor table, topology table (list best route successor and second
best route (feasible successor), routing table
Terminology:
feasible distance (how far it is from you to reach a specific route)
Advertised distance is how far it is from the neighbor to get to that network
active route vs passive route active is bad, passive is good
Hello uses multicast 224.0.0.10
hello, update, query, reply, ack
eigrp metric (k value formula)
bandwidth and delay, reliability load and mtu
(k1*BW+((k2*BW)/(256load) + (k3*delay) K5/
256 * (slowest_BW+all_link_delays)
bw= 10^7/bw
AD is 90 170 for D EX IGRP 100
supports ip, ipx and appletalk
fastest convergence
Cisco proprietary
Dual routing algorithm
hybrid protocol distance vector and link state
supports vlsm (classless)
uses bandwidth and delay to calculate cost (default) (load and reliability)
load balance on equal and unequal path
has backup of the main route
successor and feasible successor (topology and routing) (topology for feasible)
variance = 1 for default
auto summarization by default
hop count of 255
hello messages
RTP uses multicast 224.0.0.10
3 tables neighbors, topology and routing table
Diffusing update algorithm Dual
partial updates as opposed to full updates
OSPF
CPU intensive
Link State. Other than ospf and isis, the rest are distance vector.
Maintain 3 tables: neighbor, topology, routing
uses Dijkstra’s shortest path (spf) algorithm
Sends triggered updates to announce network changes
Sends periodic updates on long interval
topology table consists of all the routes in the area
In distance vector (eigrp for example) the topology is only according to the neighbor router
Divides network into areas
All areas must connect to area 0 (backbone)
All routers in the same area have the same topology table
Localize updates within an area
Require a hierarchical design (so that you can summarize the networks)
Can’t summarize discontiguous networks
ASBR router that connects outside of the ospf AS
ASBR and ABR are the only router types that can do summarization in ospf
In eigrp, you can do summarization on any routers
Neighbors form in the same area
Determine Router ID (router’s name in the ospf process)
Highest active interface ip address when ospf starts
loopbacks beat physical interfaces
Hard coding overrules everything (routerid command)
hello message sent (1 every 10 sec on broadcast, 1 every 30 sec on nbma)
dead timer (4x hello timer)
Hello message contains (router id, hello and dead timer, area id, router priority, dr/bdr ip address,
neighbors, network mask, authentication password)
Down state
Init State (received hello) (must have hello/dead interval, mask, area id, auth password)
2 way state
exstart state (master slave relationship) master is determined by router priority. default priority
is 1 . router id breaks the tie. master sends dbd (database description) packet. Slave sends its
dbd packet
loading state (link state request, link state update)
Full
ospf is a reliable protocol. it has its own acknowledgment mechanism.
OSPF Cost = 100 / BW in Mbps
Cost for T1 is 65 100/1.544 Mbps
Cost for Ethernet is 10 100/10 Mbps
Fast ethernet is 1 (100/100 Mbps)
There is a command to adjust for the Gig, 10 Gig
BR and BDR per shared segment
initial update to 224.0.0.6 (to DR, BDR)
DR sends update to all routers 224.0.0.5
On point to point, address used is 224.0.0.5
No concept of DR or BDR
BR, BDR election (router priority) used to manage updates
Priority by default is 1
Tie breaker is RID
Higher RID breaks the tie
You will see neighbors with 2way status and not full. Can only have 2 routers with full states, BR
and BDR.
OSPF packet types
hello
DBD database decription
LSR Link State request
LSA Link State advertisement (updates about individual routes)
LSU Link state update
LSACK Link State Acknowledgement