Network Layer: Routing

9/28/99


Click here to start


Table of Contents

Network Layer: Routing

PPT Slide

The Network Layer Problem

Forwarding

Switching: Crossbar Switches

Routing

Is routing easy or hard ?

Key problem

Requirements

Telephone network topology

Telephony routing algorithm

Features of telephone network routing

The cost of simplicity

Dynamic nonhierarchical routing (DNHR)

Data Network Routing Issues

Data network routing example

Routing alternatives

Routing alternatives

Distance Vector routing

Routing Information Protocol (RIP)

Link State protocols

Dijkstra’s algorithm

Dijkstra’s algorithm

Dijkstra’s algorithm

Topology dissemination

Link state vs Distance vector

Role of Addresses

ATM Networks: VCs & Label Switching

Summary

 Author: Shivkumar Kalyanaraman

Email: shivkuma@ecse.rpi.edu

Home Page: http://www.ecse.rpi.edu/Homepages/shivkuma