EE444HW6.sln.updated

# EE444HW6.sln.updated - A B D C E F 2 4 1 1 4 1 2 2 EE 444...

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

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.

Unformatted text preview: A B D C E F 2 4 1 1 4 1 2 2 EE 444 INTRODUCTION TO COMPUTER NETWORKS Spring 2009 HOMEWORK #6 Deadline: May 31 2009 (Sunday) @ 23:59 (No late submission is allowed.) Posted on May 15 2009. Question # 1 Consider the network given above with each link associated with its cost. Apply Dijkstra’s algorithm in order to find the least cost path from node A to node F. Clearly show the operation details by indicating each step and filling up the table below with the appropriate tentative (temporary) and permanent labels. Algorithm Step # Tentative (Temporary) Labels Permanent Labels 1 2 ... Solution: Algorithm Step # Tentative Labels Permanent Labels 1. Working node A: B(2,A) C(1,A) D(4,A) C(1,A) 2. Working node C: D(3,C) F(5,C) B(2,A) B(2,A) 3. Working node B: E(3,B) D(3,C) F(5,C) D(3,C) 4. Working node D: E(3,B) F(5,C) (Nothing new) E(3,B) 5. Working node E: F(4,E) F(4,E) The least cost path from A to F=ABEF with cost 4. Question # 2 You are managing the IP network of a school. The school owns four buildings, which are located next to each You are managing the IP network of a school....
View Full Document

## This note was uploaded on 04/09/2010 for the course EE ee444 taught by Professor Akan during the Spring '10 term at Middle East Technical University.

### Page1 / 3

EE444HW6.sln.updated - A B D C E F 2 4 1 1 4 1 2 2 EE 444...

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

View Full Document
Ask a homework question - tutors are online