0% found this document useful (0 votes)
214 views17 pages

Computer Network - CS610 Power Point Slides Lecture 16

This document discusses computer networks and routing. It covers the following key points: 1. Packet switches in a WAN use next hop forwarding and store-and-forward to route packets based on destination address, allowing for source independence and efficient routing. 2. Hierarchical addressing groups destinations, allowing routing tables to be collapsed to specify just the next hop for an address group. 3. Modeling a WAN as a graph captures the network topology and allows routing algorithms to compute optimal routes from each switch to every possible destination.

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
0% found this document useful (0 votes)
214 views17 pages

Computer Network - CS610 Power Point Slides Lecture 16

This document discusses computer networks and routing. It covers the following key points: 1. Packet switches in a WAN use next hop forwarding and store-and-forward to route packets based on destination address, allowing for source independence and efficient routing. 2. Hierarchical addressing groups destinations, allowing routing tables to be collapsed to specify just the next hop for an address group. 3. Modeling a WAN as a graph captures the network topology and allows routing algorithms to compute optimal routes from each switch to every possible destination.

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/ 17

COMPUTER NETWORKS

CS610
Lecture-16
Hammad Khalid Khan
Review Lecture 15
 Wide Area Networks

 Packet Switches

 Physical Addressing in a WAN

 Store and Forward

 Next Hop Forwarding


Choosing Next Hop

 Packet switch doesn't keep complete information about all


possible destination

 Just keeps next hop

 So, for each packet, packet switch looks up destination in


table and forwards through connection to next hop
Choosing Next Hop
Source Independence
 Next hop to destination does not depend on source of packet,
called Source Independence

 Allows fast, efficient routing

 Packet switch need not have complete information, just next


hop
– Reduces total information
– Increases dynamic robustness - network can continue to
function even if topology changes without notifying entire
network
Hierarchical Addressing and
Routing

The Process of forwarding the packets from one hop to


the next is known as Routing
Hierarchical Addressing and
Routing
Hierarchical Addressing and
Routing
 In particular, all destinations on same switch have same next
hop
 Thus, routing table can be collapsed:
Routing in a WAN
 More computers == more traffic
 Can add capacity to WAN by adding more links and packet
switches
 Packet switches need not have computers attached
 Interior switch - No attached computers
 Exterior switch - Attached computers
Routing in a WAN
 Both Interior and Exterior switches:
– Forward Packets
– Need Routing Tables

 Must have:
– Universal Routing - Next hop for each possible
destination
– Optimal Routes - Next hop in table must be on shortest
path to destination

Modeling a WAN

 Use a graph:
– Nodes model switches
– Edges model direct connections between switches

 Captures essence of network, ignoring attached computers


Modeling a WAN
Route Computation with a Graph

 Can represent routing table with edges:

 Graph algorithms can be applied to find routes


Redundant Routing Information
 Notice duplication of information in routing table for node 1:

 Switch 1 has only one outgoing connection; all traffic must


traverse that connection
Default Routes

 Can collapse routing table entries with a Default Route

 If destination does not have an explicit routing table entry,


use the default route:
Default Routes
Summary
 Source Independence

 Hierarchical Addressing and Routing

 Routing in a WAN

 Default Routes

You might also like