Telecom
2110
Network Design
Midterm Study Notes
The midterm exam will cover the first six lectures (Slides 16). This includes the five
homework assignments.
The exam is open book and notes and will be a mix of short
answer questions and problems
Short answer question examples, include questions 1, 2
from Homework 1, question 1
from Homework 2,
question 2 parts(a) – (c)
from Homework 4. Some additional
examples from old exams
1.
Compare the network designs resulting from Prim’s MST Algorithm with those
from a Shortest Path Tree. What are the advantages and disadvantages of each?
2.
Consider the multispeed local access design algorithm. What does a positive
tradeoff value for a node indicate? When would a node with a negative tradeoff
value not have it’s traffic rerouted on a different link? Give an example of a
network design where the MSLA algorithm is used?
3.
What is the difference between the arc and path formulations of the max flow
problem given in the optimization lecture slides?
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Spring '10
 D>Tipper
 Graph Theory, Network switch, Shortest path problem

Click to edit the document details