prelab5_solution

# Prelab5_solution - Boston University EC441 Introduction to Computer Networks Solutions to Lab 5(Prelab Problem 22 Evolution Table Step 1 Step 2

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

Boston University EC441 Introduction to Computer Networks Solutions to Lab 5 (Prelab) Problem 22 Evolution Table: Step 1 Step 2 Step 3 Step 4 Step 5 Step 6 Step 7 C(s)=∞ C(s)=∞ C(s)=∞ C(s)=10 C(s)=10 C(s)=8 C(s)=8(-) C(t)=∞ C(t)=7 C(t)=7 C(t)=7 C(t)=7 C(t)=7(-) C(t)=7(-) C(u)=∞ C(u)=6 C(u)=6 C(u)=6(-) C(u)=6(-) C(u)=6(-) C(u)=6(-) C(v)=3 C(v)= 3(-) C(v)=3(-) C(v)=3(-) C(v)=3(-) C(v)=3(-) C(v)=3(-) C(y)=6 C(y)=4 C(y)=4(-) C(y)=4(-) C(y)=4(-) C(y)=4(-) C(y)=4(-) C(w)=6 C(w)=6 C(w)=6 C(w)=6 C(w)=6(-) C(w)=6(-) C(w)=6(-) C(z)=∞ C(z)=∞ C(z)=18 C(z)=18 C(z)=18 C(z)=12 C(z)=12 Reddened cost indicates the node included into the group at each step. Trace back the table, we then obtain the corresponding shortest-path tree: Problem 24 Evolution of distance table at node z: Step 1 Step 2 Dest. Next hop Cost u - v v 5 x x 2 y y 10 Dest. Next hop Cost u v 9 v v 5 x x 2 y x 3

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

View Full Document
The table on the right gives the final one at node z. Problem 26
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 11/09/2010 for the course ECE 441 taught by Professor Davidstarobinski during the Fall '09 term at BU.

### Page1 / 3

Prelab5_solution - Boston University EC441 Introduction to Computer Networks Solutions to Lab 5(Prelab Problem 22 Evolution Table Step 1 Step 2

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

View Full Document
Ask a homework question - tutors are online