Scribd
Upload
292 views22 pages

Computer Network - CS610 Power Point Slides Lecture 17

This document discusses computer networks and routing. It covers how routing tables are built, including static and dynamic routing. It describes using Dijkstra's algorithm to compute shortest paths in a graph and extract next hop information. Distance vector and link state routing are distributed routing algorithms. Example WAN technologies discussed include ARPANET, X.25, Frame Relay, and ATM.

Uploaded by

Ibrahim Choudary
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
292 views22 pages

Computer Network - CS610 Power Point Slides Lecture 17

This document discusses computer networks and routing. It covers how routing tables are built, including static and dynamic routing. It describes using Dijkstra's algorithm to compute shortest paths in a graph and extract next hop information. Distance vector and link state routing are distributed routing algorithms. Example WAN technologies discussed include ARPANET, X.25, Frame Relay, and ATM.

Uploaded by

Ibrahim Choudary
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 22

COMPUTER NETWORKS

CS610
Lecture-17
Hammad Khalid Khan
Review Lecture 16
 Source Independence

 Hierarchical Addressing and Routing

 Routing in a WAN

 Modeling a WAN

 Route Computation and Default Routes


Building Routing Tables
 How to enter information into routing tables:
– Manual entry
– Software

 How to compute routing table information:


– Static routing - At boot time
– Dynamic routing - Allow automatic updates by a program
Building Routing Tables

 Static Routing
– Simple
– Low Network Overhead
– Inflexible

 Dynamic Routing
– Can work around network failures automatically
Computing Shortest Path in a Graph
 Assume graph representation of network at each node

 Use Djikstra's algorithm to compute shortest path from each


node to every other node

 Extract next-hop information from resulting path information

 Insert next-hop information into routing tables


Weighted Graph
 Djikstra's algorithm can accommodate weights on edges in
graph

 Shortest path is then the path with lowest total weight (sum
of weights of all edges)

 Shortest path not necessarily fewest edges (or hops)


Weighted Graph
Distance Metrics
 Weights on graph edges reflect "cost" of traversing edge
– Time
– Dollars
– Hop count (weight == 1)

 Resulting shortest path may not have fewest hops


Distributed Route Computation

 Each packet switch computes its routing table locally and


sends messages to the neighbors

 Updates information periodically

 Network adapts if a link or a packet switch fails


 Packet switches modifies tables to avoid failed hardware
Distance Vector Routing
 Local information is next-hop routing table and distance from
each switch

 Switches periodically broadcast topology information i.e.


(destination, distance)

 Other switches update routing table based on received


information
Vector-Distance Algorithm

 In more detail:
Wait for next update message
Iterate through entries in message
If entry has shorter path to destination:
Insert source as next hop to destination
Record distance as distance from next hop to destination
PLUS distance from this switch to next hop
Link-State Routing (SPF)
Comparison
 Distance Vector Routing
– Very simple to implement
– Packet Switch updates its own routing table first

– Used in RIP

 Link-State Algorithm
– Much more complex
– Switches perform independent computations
– Used in OSPF
Examples-WAN Technology

 ARPANET
– Began in 1960s
– Funded by Advanced Research Projects Agency, an
organization of the US Defense Department
– Incubator for many of current ideas, algorithms and
internet technologies
Examples-WAN Technology

 X.25
– Early standard for connection-oriented networking
– From ITU, which was originally CCITT
– Predates computer connections, used for
terminal/timesharing connection
Examples-WAN Technology

 Frame Relay
– Telco service for delivering blocks of data
– Connection-based service; must contract with telco for
circuit between two endpoints
– Typically 56Kbps or 1.5Mbps; can run to 100Mbps
Examples-WAN Technology

 SMDS - Switched Multi-megabit Data Service


– Also a Telco service
– Connectionless service; any SMDS station can send a
frame to any other station on the same SMDS "cloud"
– Typically 1.5-100Mbps
Examples-WAN Technology

 ATM - Asynchronous Transfer Mode


– Designed as single technology for voice, video, data, ...
– Low jitter (variance in delivery time) and high capacity
– Uses fixed size, small cells - 48 octets data, 5 octets
header
– Can connect multiple ATM switches into a network
Chapter 14

Connection Oriented Networking


&
ATM
Summary (CH. 13)
 Packet Switch

 Next-Hope Forwarding

 Source Independence

 Hierarchical Addressing
Introduction

 LANs and WANs can both connect multiple computers, but


they have different base technologies and meet different
goals

 ATM is a single technology that is designed to meet the


goals of both LANs and WANs

 ATM uses the concept of Connection-Oriented Networking


Summary
 Routing Table Computation

 Shortest Path Computation in a Graph


 Dijkstra’s Algorithm

 Distributed Route Computation


 Distance Vector Routing
 Link State Routing

 Example WAN Technologies

You might also like