a3 - CSE 489/589Homework Assignment 3 Due at the end of...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CSE 489/589Homework Assignment 3 Due at the end of class on Mon, Nov 16. * October 30, 2009 Problem 1 (Virtual Circuit) . In a virtual circuit network, a new connection establishes a path from the source to the destination of the connection. Edges on the same connection path are allowed to have different VCI (virtual circuit identifier). Suppose the VCI-field is k-bit long, then there can be up to 2 k paths containing a particular edge on the network. (Think of the network as a graph, an edge is a link between two vertices of the graph.) Now, suppose in order to simplify the VCI assignment algorithm we enforce an additional constraint that all edges on the same connection path must be assigned with the same VCI. (a) The number of connection paths containing a particular edge is called the load of that edge. Come up with an example in which all current edge loads are strictly less than 2 k (for some k you can specify), yet there is no available VCI to assign to a new connection path. (b) Suppose we always choose a shortest path for a new source/destination connection request, and always assign the lowest available VCI to a new connection. Give an example of a graph, an integer k , and a sequence of source/destination requests for which the last request cannot be assigned with...
View Full Document

This document was uploaded on 11/22/2009.

Page1 / 4

a3 - CSE 489/589Homework Assignment 3 Due at the end of...

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

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