Hw4 - CS/ECE 438 Communication Networks for Computers Spring 2010 Problem Set 4 Due start of class Wednesday March 12th Packet-Switched Networks

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
CS/ECE 438: Communication Networks for Computers Spring 2010 Problem Set 4 Due: start of class, Wednesday, March 12 th . Packet-Switched Networks Assigned reading: Peterson and Davie: Chapter 3 – 4. All problems carry equal weight. Please show all your work. 1. Datagram Forwarding Consider the network shown. Give the datagram routing tables for the switches S1-S4. Each switch should have a "default" routing entry which leads toward OUT. The links are labeled with relative costs; your tables should cause each packet to be forwarded along the lowest-cost path to its destination.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2. Virtual Circuits Consider the network shown, where hosts A through J are connected by virtual circuit routers 1 through 6. Assume that each VC may have a different VCID on each link, and VCIDs are assigned starting at 0 and using the next available ID. Suppose that there are virtual circuits established between: A → J, B → G, E → D, F → I, B → C, in that order. a.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 07/10/2011 for the course CS 438 taught by Professor Luo during the Spring '08 term at University of Illinois, Urbana Champaign.

Page1 / 4

Hw4 - CS/ECE 438 Communication Networks for Computers Spring 2010 Problem Set 4 Due start of class Wednesday March 12th Packet-Switched Networks

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online