Project Links Logo Artwork
Graph Theory: Networking
Home > Graph Theory: Networking > The Internet > Overview
Crib Sheet
Library
Help
Map
Problem List
Module Home
Links Home


conceptsdiscoverapplycollaboratepractice
 
 
go backgo forward
go backgo forward

Overview

Internet Routing: An Overview

We have seen that telephone networks are notable for the predictability of their traffic flows and their relatively small cores.

The environment of the Internet is very different:

  1. Links and routers are unreliable.
  2. Alternative paths are scarce
  3. Traffic patterns change unpredictably within minutes.

Routing strategies in such an environment therefore have to be much more tolerant of changes in the network than are the strategies for telephone networks. The two fundamental routing algorithms in packet-switched networks (the Internet and ATM networks) are:

  1. Distance-Vector (based on the Bellman-Ford Algorithm).
  2. Link-State (based on Dijkstra's Algorithm).

We will examine each of these routing strategies in turn.

 
 
go backgo forward
go backgo forward