Basic HTML version of Foils prepared Dec. 6 98

Foil 27 Routing Basics (3)

From Introduction to Network Security Lectures at Xi'an Jaotong University -- Sept 1998. by Roman Markowski


1 Routing algorithms
  • goals: optimality, simplicity, stability, robustness, flexibility
  • static and dynamic
  • single-path and multi-path
  • flat and hierarchical (space of routers)
  • inter-domain (like RIP, IGRP) and intra-domain (like EGP, BGP)
  • host intelligent (end-node determines the whole path- source routing) and router intelligent
  • link-state (shortest path first - small updates everywhere, OSPF, IS-IS, E-IGRP) and distance vector (Bellman-Ford - larger updates only to neighboring routes, IGRP, RIP)

in Table To:


© Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Sun Dec 6 1998