Documente Academic
Documente Profesional
Documente Cultură
Direct Delivery
Indirect Delivery
Routing strategies
Routing Table Update methods
Routing Protocols
Routing Information Protocol (RIP)
IGRP (Interior Gateway Routing Protocol )
Routing
Routing is the process of selecting paths in a network
along which to send network traffic.
Direct Delivery
Indirect Delivery
Routing Table
Routing Strategies
Advantage
Updating new information is easy as need to change at one
location (central Database)
Disadvantages
Each and every IP packet should be analyzed
Network traffic may increase at the central database because it
has to serve lots of requests from routers
Dynamic changes are not possible
Flooding
Advantages
Simple mechanism (IP packets are not analyzed at router)
Most likely it will reach the destination
Disadvantages
Causes high network traffic
Duplicate packets might reach the destination
Random Routing
Advantages
Will not cause unnecessary network traffic
Simple
Disadvantage
No guarantee that the IP packet will reach the destination
Adaptive Routing
Advantages
Network traffic is minimized
The best route will be selected most of the time
Disadvantages
Routers need to keep a routing table
Process each IP packet
Need to update routing tables automatically with the changes
in the network
Routing Methods used in Adaptive Routing
Default Routing
Host Specific Routing
Disadvantages
Large number of records
Table updating is difficult
Network Specific Routing
Advantages
Number of records are limited
Update is easy
Default Routing
A record in the routing table to say if any of the records does not match
You can only use default routing on stub networks, which means that they
B#show 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, ia - IS-IS inter
area
* - candidate default, U - per-user static route, o - ODR
P - periodic downloaded static route
Connected
Static
Dynamic
Connected
R1#show 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, ia - IS-IS
inter area
* - candidate default, U - per-user static route, o - ODR
P - periodic downloaded static route
R1#show 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, ia - IS-IS inter area
* - candidate default, U - per-user static route, o - ODR
P - periodic downloaded static route
Advantages:
Minimal CPU processing
Disadvantages:
Configuration and maintenance is time-consuming
Configuration is error-prone
Administrator intervention is required to maintain changing
route information
Dynamic
Advantages:
Administrator has less work
Disadvantages:
Router resources are used (CPU, memory and bandwidth)
State of the links (Information about type of the network and neighboring
Router(config)#router rip
Router(config-router)#network <network-number>
Router(config)#router rip
Router(config)#version 2
Router(config-router)#network <network-number>
IGRP Configuration
Router(config-router)#network <network-number>
Bellman-Ford Algorithm
Used by distance vector routing protocols
Dijkstras Algorithm
Used by link state routing protocols