2. In the figure below, Host A has a UDP Echo client while Host B has a UDP Echo server. The UDP Echo Client at Host A sends a message of size 100 Bytes to the UDP Echo server at Host B, and Host B echoes the same message back to Host A. Please measure the round trip time it would take for Host A to receive back the message it sends to Host B. Hosts A and B are connected using a Router R1 and links L1 and L2. The links, L1 and L2, have link transmission rates of 1 Mbps and 1 Mbps respectively. Assume that the router has a queuing delay of 1 milliseconds and a processing delay of 0.05 milliseconds. Assume that propagation delay is 0. Please state your response in accuracy of 6 decimal points. i.e., your response should have up to 6 places after the decimal. R Host A (UDP Echo Client) Link L1 1 Mbps Router R1 Link L2 1 Mbps Host B (UDP Echo Server)

2. In the figure below, Host A has a UDP Echo client while Host B has a UDP Echo server. The UDP Echo Client at Host A sends a message of size 100 Bytes to the UDP Echo server at Host B, and Host B echoes the same message back to Host A. Please measure the round trip time it would take for Host A to receive back the message it sends to Host B. Hosts A and B are connected using a Router R1 and links L1 and L2. The links, L1 and L2, have link transmission rates of 1 Mbps and 1 Mbps respectively. Assume that the router has a queuing delay of 1 milliseconds and a processing delay of 0.05 milliseconds. Assume that propagation delay is 0. Please state your response in accuracy of 6 decimal points. i.e., your response should have up to 6 places after the decimal. R Host A (UDP Echo Client) Link L1 1 Mbps Router R1 Link L2 1 Mbps Host B (UDP Echo Server)

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider one TCP connection on a path with a bottleneck link with capacity L. We have a file of size F(assume F is a very large file size). If TCP segment size is B bytes, the two-way propagation delay is tp and connection is always in congestion avoidance phase, find the following: A. Maximum window size that TCP can achieve B. Average window size and average throughput in this TCP connection C. Time it will take from connection establishment to reaching the maximum window size.
Host A and B are directly connected with a 100 Mbps link. There is one TCP connection between the two hosts, and Host A is sending to Host B an enormous file over this connection. Host A can send its application data into its TCP socket at a rate as high as 120 Mbps but Host B can read out of its TCP receive buffer at a maximum rate of 50 Mbps. Describe the effect of TCP flow control.
Suppose Host A sends two TCP segments back to back to Host B over a TCP connection. The first segment has sequence number 90, the second has sequence number 110. How much data is in the first segment? What will be the acknowledgement number Host B sends to Host A upon receiving the first segment? 19, 90 19, 110 20, 90 20, 110
The same route may be used to send several packets from one host to another. Explain in detail the numerous factors that contribute to the total time it takes for a single packet to travel from beginning to finish. Can we expect one of the delays to last a certain period of time and the other to last less stably?
Suppose A is connected to B via an intermediate router R, as in the previous problem. The A-R link is instantaneous, but the R–B link transmits only one packet each second, one at a time (so two packets take 2 seconds). Assume A sends to B using the sliding window protocol with SWS = 4. For Time = 0, 1, 2, 3, 4, state what packets arrive at and are sent from A and B. How large does the queue at R grow?
14 The following figure shows a TCP transaction. Assume Host A always has data to send, and each packet has size 20 Bytes. Assume Host A has a sending window of 40 Bytes, that is, it can send two "in-flight” packets maximum. Answer the following questions. A. At the time marked "1", i.e., when the first packet times out, will Host A send any packet? if your answer is no, explain why not; if your answer is yes, how many packets will be sent, what are the sequence numbers of them? B. At the time marked "2", i.e., when the ACK of the 2nd packet is received by Host A, will Host A send any packet? if your answer is no, explain why not; if your answer is yes, how many packets will be sent, what are the sequence numbers of them? Host A Host B Seq=80, 20 bytes of data Seq=100, 20 bytes of data Xª 1 2- timeout
Assume now that between A and B there is a switch S that uses store and forward. The distance from A to S is m meters and from S to B 2m meters. The link speed between A and S is R bps and between S and B R/2 bps. A has a supply of 6 packets to send to B using UDP. The switch buffer can accommodate 3 packets including the one being transmitted (until it finishes its transmission). Will there be packet losses at the switch buffer. Which packets (number packets 1, 2, 3, ...). Draw an annotated time-space diagram to illustrate this data transmission. (you should roughly respect the scales in your drawing).
Only typing answer Please explain step by step without table and graph thankyou
Suppose A is connected to B via an intermediate router R, as in the previous problem. The A-R link is instantaneous, but the R–B link transmits only one packet each second, one at a time (so two packets take 2 seconds). Assume A sends to B using the sliding window protocol with SWS = 4. For Time = 0, 1, 2, 3, 4, state what packets arrive at and are sent from A and B. How large does the queue at R grow?
In TCP Vegas, the calculation of Actual Rate is done by dividing the amount of data transmitted in one RTT interval by the length of the RTT. (a) Show that for any TCP, if the window size remains constant, then the amount of data transmitted in one RTT interval is constant once a full window-full is sent. Assume that the sender transmits each segment instantly upon receiving an ACK, packets are not lost and are delivered in order, segments are all the same size, and the first link along the path is not the slowest. (b) Give a timeline sketch showing that the amount of data per RIT above can be less than Congestion Window.
2. Now suppose there are two links between source and destination, with one router connecting the two links. Each link is 5,000 km long. Again suppose the MP3 file is sent as one packet. Suppose there is no congestion, so that the packet is transmitted onto the second link as soon as the router receives the entire packet. What is the end-to-end delay?