hw7 - 5 2-4-5-6 6 {2,4,1,3,5,6} 3 2-1 3 2-3 2 2-4 3 2-4-5 5...

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

View Full Document Right Arrow Icon
Zhou, HuanXian (ID: 0225418) HW7 EE136 Instructor: Kang Xi The number of hops is 1 less than the number of nodes. a. The fixed number of hops is 2. b. The furthest distance from a station is half-way around the loop. On average, a station will send data half this distance. For an N-node network, the average number of hops is (N/2*1/2)-1 = (N/4)-1. c. The number of hops is 1. Starting from node 2: M L(1) Path L(3) Path L(4) Path L(5) Path L(6) Path 1 {2} 3 2-1 3 2-3 2 2-4 -- -- 2 {2,4} 3 2-1 3 2-3 2 2-4 3 2-4-5 -- 3 {2,4,1} 3 2-1 3 2-3 2 2-4 3 2-4-5 -- 4 {2,4,1,3} 3 2-1 3 2-3 2 2-4 3 2-4-5 8 2-3-6 5 {2,4,1,3,5} 3 2-1 3 2-3 2 2-4 3 2-4-5
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 5 2-4-5-6 6 {2,4,1,3,5,6} 3 2-1 3 2-3 2 2-4 3 2-4-5 5 2-4-5-6 Starting from node 2: h L(1) Path L(3) Path L(4) Path L(5) Path L(6) Path ∞ --∞ --∞ --∞ --∞ --1 3 2-1 3 2-3 2 2-4 ∞ --∞ --2 3 2-1 3 2-3 2 2-4 3 2-4-5 8 2-3-6 3 3 2-1 3 2-3 2 2-4 3 2-4-5 5 2-4-5-6 4 3 2-1 3 2-3 2 2-4 3 2-4-5 5 2-4-5-6 If there is a unique least-cost path, the two algorithms will have the same result, because they are both guaranteed to find the least-cost path. If there are two or more equal least-cost paths, the two algorithms may find different least-cost paths, depending on the order of node taken....
View Full Document

This note was uploaded on 11/02/2010 for the course EE 136 taught by Professor Kang xi during the Spring '10 term at NYU Poly.

Page1 / 2

hw7 - 5 2-4-5-6 6 {2,4,1,3,5,6} 3 2-1 3 2-3 2 2-4 3 2-4-5 5...

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