SOLUTIONS MANUAL-DATA AND COMPUTER COMMUNICATIONS Seventh Edition-WILLIAM STALLINGS-part 2

# SOLUTIONS MANUAL-DATA AND COMPUTER COMMUNICATIONS Seventh Edition-WILLIAM STALLINGS-part 2

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
-57- A A NSWERS TO NSWERS TO P P ROBLEMS ROBLEMS 12.1 The number of hops is one less than the number of nodes visited. 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/4) 1. c. 1. 12.2 The mean node-node path is twice the mean node-root path. Number the levels of the tree with the root as 1 and the deepest level as N. The path from the root to level N requires N 1 hops and 0.5 of the nodes are at this level. The path from the root to level N 1 has 0.25 of the nodes and a length of N 2 hops.
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 52

SOLUTIONS MANUAL-DATA AND COMPUTER COMMUNICATIONS Seventh Edition-WILLIAM STALLINGS-part 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