Computer Networking: A Top-Down Approach, 7th Edition: Solutions to Review Questions and Problems

Chapter 1 Review Questions Chapter 1 Problems Problem 1 Problem 2 At time N*(L/R) the first packet has reached the destination, the second packet is stored in the last router, the third packet is stored in the next-to-last router, etc. At time N*(L/R) + L/R, the second packet has reached the destination, the third p... Problem 3 Problem 4 Problem 5 Problem 6 Problem 7 Problem 8 Problem 9 Problem 10 Problem 11 Problem 12 Problem 13 Problem 14 Problem 15 Problem 16 Problem 17 Problem 18 Problem 19 Problem 20 Problem 21 Problem 22 Problem 23 Problem 24 Problem 25 Problem 26 Problem 27 Problem 28 Problem 29 Problem 30 Problem 31 Problem 32 Problem 33 Chapter 2 Review Questions Chapter 2 Problems Problem 1 Problem 2 Problem 3 Problem 4 Problem 5 Problem 6 Problem 7 Problem 8 Problem 9 Problem 10 Problem 11 Problem 12 Problem 13 Problem 14 Problem 15 Problem 16 Problem 17 Problem 18 Problem 19 Problem 20 Problem 21 Problem 22 Problem 23 Problem 24 Problem 25 Problem 26 Problem 27 a. N files, under the assumption that we do a one-to-one matching by pairing video versions with audio versions in a decreasing order of quality and rate. b. 2N files. Problem 28 Problem 29 Chapter 3 Review Questions Chapter 3 Problems Problem 1 Problem 2 Problem 3 Problem 4 Problem 5 Problem 6 Problem 7 Problem 8 Problem 9 Problem 10 Problem 11 Problem 12 Problem 13 Problem 14 Problem 15 Problem 16 Problem 18 Problem 19 Problem 20 Problem 21 Problem 22 Problem 23 Problem 24 Problem 25 Problem 26 Problem 27 Problem 28 Problem 29 Problem 30 Problem 32 Problem 33 Problem 34 Problem 35 Problem 36 Problem 37 Problem 38 Problem 39 Problem 40 Problem 41 Problem 42 Problem 43 Problem 44 Problem 46 Problem 47 Problem 48 Problem 49 Problem 50 Problem 51 Problem 52 Problem 53 Problem 54 Problem 55 Problem 56 Chapter 4 Review Questions Chapter 4 Problems Problem 1 Problem 3 Problem 4 Problem 5 Problem 6 Problem 7 Problem 8 Problem 9 Problem 10 Problem 11 Problem 12 Problem 13 Problem 14 Problem 15 Problem 16 Problem 17 Problem 18 Problem 19 Problem 20 Problem 21 Problem 22 Chapter 5. Review Questions. Chapter 5. Problems. Problem 1 Problem 2 Problem 3 Problem 4 Problem 5 Problem 6 Problem 7 Problem 8 Problem 9 Problem 10 Problem 11 Problem 12 Problem 13 Problem 14 Problem 15 Problem 16 Problem 17 Problem 18 Problem 19 Problem 20 Since Z wants to transit Y's traffic, Z will send route advertisements to Y. In this manner, when Y has a datagram that is destined to an IP that can be reached through Z, Y will have the option of sending the datagram through Z. However, if Z adverti... Problem 21 Problem 22 Chapter 6 Review Questions Chapter 6 Problems Problem 1 Problem 2 Problem 3 Problem 4 Problem 5 Problem 6 Problem 7 Problem 8 Problem 9 Problem 11 Problem 12 Problem 14 Problem 15 Problem 16 Problem 17 Problem 18 Problem 19 Problem 20 Problem 21 Problem 22 Problem 23 Problem 24 Problem 25 Problem 26 Problem 27 Problem 28 Problem 29 Problem 31 The server hosting the Web page will send back the Web page to your computer via HTTP response messages. Those messages will be encapsulated into TCP packets and then further into IP packets. Those IP packets follow IP routes and finally reach your fi... Problem 32 a) Each flow evenly shares a link’s capacity with other flows traversing that link, then the 80 flows crossing the B to access-router 10 Gbps links (as well as the access router to border router links) will each only receive 10 Gbps / 80 = 125 Mbps b) In Topology of Figure 5.31, there are four distinct paths between the first and third tier-2 switches, together providing 40 Gbps for the traffic from racks 1-4 to racks 9-12. Similarly, there are four links between second and fourth tier-2 switche... c) Now 20 flows will need to share each 1 Gbps bandwidth between pairs of TOR switches. So the host-to-host bit rate will be 0.5 Gbps. Problem 33 Chapter 7 Review Questions Chapter 7 Problems Problem 6 Suppose that wireless station H1 has 1000 long frames to transmit. (H1 may be an AP that is forwarding an MP3 to some other wireless station.) Suppose initially H1 is the only station that wants to transmit, but that while half-way through transmittin... Now suppose that after sending its first frame, H1 returns to step 1; that is, it waits a short period of times (DIFS) and then starts to transmit the second frame. H1’s second frame will then be transmitted while H2 is stuck in backoff, waiting for a... A frame without data is 32 bytes long. Assuming a transmission rate of 11 Mbps, the time to transmit a control frame (such as an RTS frame, a CTS frame, or an ACK frame) is (256 bits)/(11 Mbps) = 23 usec. The time required to transmit the data frame i... DIFS + RTS + SIFS + CTS + SIFS + FRAME + SIFS + ACK = DIFS + 3SIFS + (3*23 + 751) usec = DIFS + 3SIFS + 820 usec Chapter 8 Review Questions Chapter 9 Review Questions Chapter 9 Problems