Assignment1-Solutions

Assignment1-Solutions - Solutions to Assignment 1 Questions...

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

View Full Document Right Arrow Icon
Solutions to Assignment 1 Questions 1. Problem 3, Chapter 1 a) We can n connections between each of the four pairs of adjacent switches. This gives a maximum of 4n connections. b) We can n connections passing through the switch in the upper-right-hand corner and another n connections passing through the switch in the lower-left-hand corner, giving a total of 2n connections. 2. Problem 5, Chapter 1 a) seconds. s m d prop / = b) seconds. R L d trans / = c) seconds. ) / / ( R L s m d end to end + = d) The bit is just leaving Host A. e) The bit is in the link and has not reached Host B. f) The bit has reached Host B. g) Want ( ) 893 10 5 . 2 10 28 100 8 3 = × × = = S R L m km. 3. Problem 10, Chapter 1 Because bits are immediately transmitted, the packet switch does not introduce any delay; in particular, it does not introduce a transmission delay. Thus, d end-end = L/R + d 1 /s 1 + d 2 /s 2 For the values in Problem 9, we get 8 + 16 + 4 = 28 msec.
Background image of page 1

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

View Full DocumentRight Arrow Icon
4. Problem 12, Chapter 1 The queuing delay is 0 for the first transmitted packet,
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

Assignment1-Solutions - Solutions to Assignment 1 Questions...

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