37. Consider the following plot below of TCP window size as a function of time. Assuming TCP Reno is the protocol experiencing the behaviour shown above, answer the following questions. In all cases, you should provide a short discussion justifying your answer. a. Identify the intervals of time when TCP slow start is operating. b. Identify the intervals of time when TCP congestion avoidance is operating. c. After the 16th transmission round, is segment loss detected by a triple duplicate ACK or by a timeout?

37. Consider the following plot below of TCP window size as a function of time. Assuming TCP Reno is the protocol experiencing the behaviour shown above, answer the following questions. In all cases, you should provide a short discussion justifying your answer. a. Identify the intervals of time when TCP slow start is operating. b. Identify the intervals of time when TCP congestion avoidance is operating. c. After the 16th transmission round, is segment loss detected by a triple duplicate ACK or by a timeout?

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

cwmd 35 30 25 20 15 10 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 Transmission Round Assuming TCP Reno is the protocol experiencing the behavior shown above, answer the following questions. a. Identify the intervals of time when TCP slow start is operating. b. Identify the intervals of time when TCP congestion avoidance is operating. c. During what transmission round is the 120th segment sent? (Provide a short discussion justifying your answer.) Congestion Window Size (in segnments)
What mechanism does TCP use for flow control? The receiver indicates how much data it is able to receive in the "receive window" field of the TCP header. а. O b. TCP does not use flow control. O c. The sender estimates its congestion window, increasing it when it receives ACKS for previously sent data, and reducing it when a loss even occurs, like the expiration of the retransmission timer or three duplicate ACKS.
In the TCP we are using AIMD for congestion control, assume that after every fourth transmission timeout occurs. The slow start phase always starts with 1 MSS( maximum segment size) and the initial threshold window size is 8 MSS. What will be the threshold value (in MSS) when the threshold become constant? [Note: Always take a floor value if your threshold is in decimal.]
Compare GBN, SR, and TCP (no delayed ACK). Assume that the timeout values for all three protocols are sufficiently long such that 5 consecutive data segments and their corresponding ACKs can be received (if not lost in the channel) by the receiving host (Host B) and the sending host (Host A) respectively. Suppose Host A sends 5 data segments to Host B, and the 3rd segment (sent from A) is lost. In the end, all 5 data segments have been correctly received by Host B. How many segments has Host A sent in total and how many ACKs has Host B sent in total? What are their sequence numbers? Answer this question for all three protocols. The previous expert did the wrong question and the answer was incorrect. The 3rd packet is lost not the 2nd packet
Below are the two questions, so make sure to answer each part carefully and label the response for each question: 1) Why does TCP implement congestion control if it already has flow control to manage the sender's window? 2) Consider our recent reading [Chiu+89] Analysis of the Increase and Decrease algorithms for congestion avoidance in computer networks. How does this article showcases that TCP is fair?
Below are the two questions, so make sure to answer each part carefully: Why does TCP implement congestion control if it already has flow control to manage the sender's window? Consider our recent reading [Chiu+89] Analysis of the Increase and Decrease algorithms for congestion avoidance in computer networks. How does this article showcases that TCP is fair?
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.
Consider a long-lived TCP session with an end- to-end bandwidth of 1 Gbps (= 10⁹ bits-per- second). The session starts with a sequence number of 1234. The minimum time (in seconds, rounded to the closest integer) before this sequence number can be used again is
Given a M/M/1 queue, which has packets arriving at a rate 2 packets/sec, an output link rate R bps, and an average packet size of 1500 bytes, write down: the expression for T, the average delay for a packet (i.e., from arrival till completing transmission at the output). b. the expression for the output utilization c. the expression for average number of packets in the queue d. the expression for average number of packets in the output NIC
In TCP Fast Retransmit, if we receive three duplicate ACKS after sending out a packet that is not incrementally ACK-ed but before the time-out associated with that packet, we immediately retransmit the packet without waiting for the timeout to occur. Why do we wait for three duplicates instead of just one?
Consider a long-lived TCP session with an end- to-end bandwidth 500 Mb/s. The session starts with a sequence number of 3465. The minimum time (in seconds) before this sequence number can be used again is
Consider the TCP procedure for estimating RTT. Suppose that α=0.1. Let Sample RTT1, be the most recent sample RTT, let Sample RTT2 be the next most recent sample RTT, and so on.a. For a given TCP connection, suppose four unacknowledged have been returned with corresponding sample RTTs, SampleRTT4, Sample RTT3, SampleRTT2, and SampleRTT1. Express EstimatedRTT1 in terms of the four sample RTTs.b. Generalize your formula for n sample round-trip times.