ee555hw4fall2007

ee555hw4fall2007 - EE555: "Broadband Networks...

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

View Full Document Right Arrow Icon
EE555, Zahid, Fall-2007 1 EE555: "Broadband Networks Architecture" Professor A. Zahid, Fall Semester 2007 HW#4: Due Friday, October 12 Reading Assignment "William Stalling" Text: Chapter 15: Entire Chapter Chapter 16: Section 16.1 Problems Assignment 1. William Stalling's Book, Chapter 15, #15.5, 15.6 and 15.7 2. Consider the following network with 7 nodes. Each link is labeled with its cost a) Find the shortest path from node A to all other nodes in the network using Dijkstra’s algorithm. Show all steps. b) For this part (independent from part "a") node C sends a packet using flooding, what is the total number of packets generated in each of the following two cases: Each node keeps track of the flooded packets and discards duplicate The maximum hop count is equal to 2 A G B C E D 1 4 1 3 2 3 1 2 F 3 5 3
Background image of page 1

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

View Full DocumentRight Arrow Icon
EE555, Zahid, Fall-2007 2 3. An ISP was assigned a CIDR block of 207.32.128.0/17. A client organization needs 1000 IP addresses from the ISP for its Internet connection purposes. The ISP decided to offer it a CIDR block of
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

ee555hw4fall2007 - EE555: "Broadband Networks...

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