Introduction |
---|
Distance Vector Concept |
---|
Distance Vector: Update |
---|
Distance Vector: Network Discovery |
---|
Distance Vector: Topology Change |
---|
Link State Concept |
---|
Link State: Update |
---|
Link State: Network Discovery |
---|
Link State: Topology Change |
---|
Interial and Exterior Routing |
---|
Routing Information Protocol (RIP) |
---|
Interior Gateway Routing Protocol (IGRP) |
---|
Open Shortest Path First (OSPF) |
---|
Border Gateway Protocol (BGP) |
---|
Enhanced IGRP (EIGRP) |
---|
Summary |
---|
Protocol | Description | Charateristics
Distance Vector
| RIPv1 and RIPv2
| Interior Gatway Routing Protocol(IGRP)
|
Link-State
| Open Shortest Path First(OSPF)
| Intermediate-System to Intermediate-System(IS-IS) |
|
---|
Comparison |
---|
Distance Vector | Link State
View network from neighbor's perspective
| Get common view of entire network topology
| Add distance vectors form router to router
| Caculate the shortest path to other routers
| Frequent periodic updates: | slow convergence Event triggered upfates: | faster convergence Passes copies of routing tables to neighbor routers
| Passes Link-State routing updates to other routers
| |
---|
Link State vs Distance Vector |
---|
Advantages | Disadvantages
Fast convergence: changes are reported
immediately by the source affected
| Significant demands on memory and processing resources
| Robustness against routing loops
| Requires very strict network design
| Routers know the topology
| Requires a knowledgeable network administrator
| Link-state packets are sequenced and aged
| Initial flooding can impede network performance
| The link-state database sizes can be
minimized with careful network design
| |
---|
Reference |
---|