Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
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 ... Question # 2 You are managing the IP network of a school. The school owns four buildings, which are located next to each other. The number of students working in each building is 280 in building 1, 190 in building 2, 260 in building 3 and 100 in building 4. You decide that each building should have its own subnet. Suppose you need to assign the subnet addresses to these buildings from the address block Answer
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Ask a homework question - tutors are online