From Mycomputer Notes
(Difference between revisions)
|
|
| Line 51: |
Line 51: |
| | | | |
| | | | |
| - | <table> | + | <table border=2> |
| | <caption align="bottom" style="caption-side: bottom"> <b>Advantages & Disadvatages of Link State routing</b> </caption> | | <caption align="bottom" style="caption-side: bottom"> <b>Advantages & Disadvatages of Link State routing</b> </caption> |
| | <tr> | | <tr> |
| Line 70: |
Line 70: |
| | *Initial flooding can impede network performance. | | *Initial flooding can impede network performance. |
| | </td> | | </td> |
| - | </tr>
| |
| - | <tr>
| |
| - | <td> Data-1b </td> <td> Data </td>
| |
| | </tr> | | </tr> |
| | </table> | | </table> |
Revision as of 21:05, 14 September 2006
Link State and Distance Vector Routing Protocols
| Protocol | Examples | Characteristics |
| Distance Vector | RIP v1 & Rip V2
|
- Copies Routing table to neightbors
- Updates frequentlu
- RIP v1 & v2 use hop count as metric
- View the network from the perspective of the neighbors
- Slow to converge
- Susceptible to routing loops
- Easy to configure and administer
- Consumes a lot of bandwith
|
| Link-State | OSPF IS-IS |
- Uses shortest path
- Updates are event triggered
- Sends Link-state packets to all network routers
- Has common view of network
- Fast to converge
- Not as susceptible to routing loops
- Harder to configure
- Requires more memory and processing power than distance vector.
- Consummes less bandwith than distance vector.
|
Link State Routing Protocols Features
How routing information is maintained
- LSAs
- Topological Database
- SFP Alogarithm
- SPF Tree
- Routing table of paths and ports to determine the best path for packets.
===Link states routing alogarithms
Advantages & Disadvatages of Link State routing
| Advantages | Disadvantages |
- Fast Convergence times, as changes are reported immediatelly by the source affected
- It provides robustness againts routing loops
- Routers known the topology
- Link-state packets are sequenced and aged
- The link-state database sizes can be minimized with carefull network design.
|
- Significant demands on memory and processing resources
- Requires very strict network design
- Requires a knowledgeable network administrator
- Initial flooding can impede network performance.
|
