Graph Theory: Networking
Home
>
Graph Theory: Networking
> Objectives
Crib Sheet
Library
Help
Map
Problem List
Module Home
Links Home
Introduction
Objectives
Prerequisites
Foundations
Directed Graphs
Definitions
Shortest Paths
Shortest-Path Algorithms
Problem Variations
Dijkstra's Algorithm
Bellman-Ford Algorithm
Routing
Overview
Designing A Routing Protocol
Telephone Networks
Overview
Routing Strategies
Costs
DNHR
The Internet
Overview
Distance-Vector Routing
Link-State Routing
What's Next?
concepts
discover
apply
collaborate
practice
Objectives
After having studied this module, you should know:
How to model real-world networks as directed graphs.
Some of what makes telephone networks and the Internet very different.
How network topology affects the choice of routing algorithm.
Copyright 1999 Rensselaer Polytechnic Institute. All Rights Reserved.