Single-Area OSPF

From Mycomputer Notes

(Difference between revisions)
Line 23: Line 23:
<tr>
<tr>
<td> Link-State </td> <td>OSPF <BR> IS-IS</td>
<td> Link-State </td> <td>OSPF <BR> IS-IS</td>
 +
<td>
 +
*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.
 +
</td>
</tr>
</tr>
</table>
</table>

Revision as of 19:47, 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.

Personal tools