Computer Networking: A Top-Down Approach 6th Edition solutions

Computer Networking: A Top-Down Approach 6
Consider three LANs interconnected by two routers, as shown in Figure 5.33. a. Assign IP addresses to all of the interfaces. For Subnet 1 use addresses of the form 192.168.1.xxx; for Subnet 2 uses addresses of the form 192.168.2.xxx; and for Subnet 3 use addresses of the form 192.168.3.xxx. b. Assign

Computer Networking: A Top-Down Approach 6
In this problem, you will derive the efficiency of a CSMA/CD-like multiple access protocol. In this protocol, time is slotted and all adapters are synchronized to the slots. Unlike slotted ALOHA, however, the length of a slot (in seconds) is much less than a frame time (the time to transmit a frame).

Computer Networking: A Top-Down Approach 6
Perform a Traceroute between source and destination on the same continent at three different hours of the day. a. Find the average and standard deviation of the round-trip delays at each of the three hours. b. Find the number of routers in the path at each of the three hours. Did thepaths change du

Computer Networking: A Top-Down Approach 6
Suppose now that the leftmost router in Figure 5.33 is replaced by a switch. Hosts A, B, C, and D and the right router are all star-connected into this switch. Give the source and destination MAC addresses in the frame encapsulating this IP datagram as the frame is transmitted (i) from A to the switc

Computer Networking: A Top-Down Approach 6
Draw the FSM for the receiver side of protocol rdt3.0.

Computer Networking: A Top-Down Approach 6
In Section 4.2.2 an example forwarding table (using longest prefix matching) is given. Rewrite this forwarding table using the a.b.c.d/x notation instead of the binary string notation.

Computer Networking: A Top-Down Approach 6
Consider Figure 1.19(b). Now suppose that there are M paths between the server and the client. No two paths share any link. Path k (k = 1, . . ., M ) consists of N links with transmission rates Rk 1, Rk 2, . . ., RkN . If the server can only use one path to send data to the client, what is the maximu

Computer Networking: A Top-Down Approach 6
Consider the network fragment shown below. x has only two attached neighbors, w and y. w has a minimum-cost path to destination u (not shown) of 5, and y has a minimum-cost path to u of 6. The complete paths from w and y to u (and between w and y) are not shown. All link costs in the network have str

Computer Networking: A Top-Down Approach 6
a. Consider an audio conference call in Skype with N > 2 participants. Suppose each participant generates a constant stream of rate r bps. How many bits per second will the call initiator need to send? How many bits per second will each of the other N 1 participants need to send? What is the total s

Computer Networking: A Top-Down Approach 6
Describe the format of the 802.15.1 Bluetooth frame. You will have to do some reading outside of the text to find this information. Is there anything in the frame format that inherently limits the number of active nodes in an 802.15.1 network to eight active nodes? Explain.

Computer Networking: A Top-Down Approach 6
Suppose that the five measured SampleRTT values (see Section 3.5.3) are 106 ms, 120 ms, 140 ms, 90 ms, and 115 ms. Compute the EstimatedRTT after each of these SampleRTT values is obtained, using a value of = 0.125 and assuming that the value of EstimatedRTT was 100 ms just before the first of these

Computer Networking: A Top-Down Approach 6
Consider the Wireshark output below for a portion of an SSL session. a. Is Wireshark packet 112 sent by the client or server? b. What is the servers IP address and port number? c. Assuming no loss and no retransmissions, what will be the sequence number of the next TCP segment sent by the client? d.

Computer Networking: A Top-Down Approach 6
Consider a DHT with a mesh overlay topology (that is, every peer tracks all peers in the system). What are the advantages and disadvantages of such a design? What are the advantages and disadvantages of a circular DHT (with no shortcuts)?

Computer Networking: A Top-Down Approach 6
Suppose nodes A and B are on the same 10 Mbps broadcast channel, and the propagation delay between the two nodes is 245 bit times. Suppose A and B send Ethernet frames at the same time, the frames collide, and then A and B choose different values of K in the CSMA/CD algorithm. Assuming no other nodes

Computer Networking: A Top-Down Approach 6
Consider the 7-bit generator, G=10011, and suppose that D has the value 1010101010. What is the value of R?

Computer Networking: A Top-Down Approach 6
Consider problem P25 but now with a link of R = 1 Gbps. a. Calculate the bandwidth-delay product, R  dprop. b. Consider sending a file of 800,000 bits from Host A to Host B. Suppose the file is sent continuously as one big message. What is the maximum number of bits that will be in the link at any g

Computer Networking: A Top-Down Approach 6
Consider the three-node topology shown in Figure 4.30. Rather than having the link costs shown in Figure 4.30, the link costs are c(x,y) = 3, c(y,z) = 6, c(z,x) = 4. Compute the distance tables after the initialization step and after each iteration of a synchronous version of the distance-vector algo

Computer Networking: A Top-Down Approach 6
Define and contrast the following terms: subnet, prefix, and BGP route.

Computer Networking: A Top-Down Approach 6
Consider Figure 5.33 in problem P14. Provide MAC addresses and IP addresses for the interfaces at Host A, both routers, and Host F. Suppose Host A sends a datagram to Host F. Give the source and destination MAC addresses in the frame encapsulating this IP datagram as the frame is transmitted (i) from

Computer Networking: A Top-Down Approach 6
Describe how packet loss can occur at input ports. Describe how packet loss at input ports can be eliminated (without using infinite buffers).