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.

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.

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

Explain the flow control of TCP protocol when the size of the sliding window will be 500 and the first client sends 201, 301, 402, 455, 330, and once acknowledgments will receive client will send 602. Make a flow control of these packets
Suppose a client is communication with a server via a TCP Reno connection. The client has sent the data up to sequence number 120. The client has received acknowledgment number 80 from the server, and the received window is 50 in the last message received by the client from the server. Moreover, the client has estimated the congestion window as 36 for the server. If the client receives two more acknowledgment number 80, then how much maximum data the client can send to the server? Justify your answer via proper references and procedure. (coding required)
Consider that only a single TCP (Reno) connection uses one 10Mbps link which does not buffer any data. Suppose that this link is the only congested link between the sending and receiving hosts. Assume that the TCP sender has a huge file to send to the receiver, and the receiver's receive buffer is much larger than the congestion window. We also make the following assumptions: each TCP segment size is 1,500 bytes; the two-way propagation delay of this connection is 150 msec; and this TCP connection is always in congestion avoidance phase, that is, ignore slow start. A. What is the maximum window size (in segments) that this TCP connection can achieve? B. What is the average window size (in segments) and average throughput (in bps) Of this TCP connection? C. How long would it take for this TCP connection to reach its maximum window again after recovering from a packet loss?
Host A is sending an enormous file to Host B over a TCP connection. Over this connection there is never any packet loss and the timers never expire. Denote the transmission rate of the link connecting Host A to the Internet by R bps. Suppose that the process in Host A is capable of sending data into its TCP socket at a rate S bps, where S=10•R. Further suppose that the TCP receive buffer is large enough to hold the entire file, and the send buffer can hold only one percent of the file. What would prevent the process in Host A from continuously passing data to its TCP socket at rate S bps? TCP flow control? TCP congestion control? Or something else? Elaborate.
Q1.Suppose a client, say C, has established a TCP connection with a server, say S. After establishing the connection, the sender sends two TCP messages with data back-to-back ( the first TCP message with sequence number 32 and the second TCP message with sequence number 100). a. What is the sequence number chosen by the client? What could be the reason for choosing this value of sequence number?b. What is the data size of first and second TCP data messages?c. Suppose the server receives the first and second TCP messages with data with the difference of 100 milliseconds delay. What could be the ACK number for both the TCP data messages from the server side as per the TCP RFC.
Find number of data in first segment for given scenario: In the given scenario, "Host A" sends two TCP segments to "Host B" over the TCP connection. • The sequence number of first segment is "90". • The sequence number of second segment is "110".
Consider a TCP connection betweek two hosts between A and B. The first data byte sent by A is numbered 1. The LastByteRcvd at B is 500. Then, the range of values SendBase at A may take is from to 500
Is this accurate or false? Assume that the most recent SampleRTT on a TCP connection is one second. The connection's current TimeoutInterval value must be greater than one second.
TCP is a sliding window protocol. This means. а. there can be more than one segment "in flight" (sent but no ACK has been received) at a time. O b. the TCP retransmission timer slides up as ACKS are received. O c. there can only be one segment outstanding (sent but no ACK has been received) at at time.
SInternet Check sum Consider the figure below (simplex communication scenario). The TCP sender sends an initial window of 4 segments. Suppose the initial value of the sender ན༽)། sequence number, SEQ1, is 100 and the first 4 segments each contain 400 bytes of payload. As you can see ACK 3 is lost. What is the SEQ number (SEQ2, SEQ3, SEQ4, SEQ5) from the Sender and ACK Number (ACK1, ACK2, ACK3, ACK4, ACK5) from the receiver for each segment? Sender Seq1 Seq2 Seq3 Seg4 ACK1 ACK2 ACK3 ACK4 Seq5 ACK5 Receiver
Question 2 please (a,b,c,d included)
Consider a simple congestion-control algorithm that uses linear increase and multiplicative decrease but not slow start, that works in units of packets rather than bytes, and that starts each connection with a congestion window equal to one packet. Give a detailed sketch of this algorithm. Assume the delay is latency only and that when a group of packets is sent only a single ACK is returned. Plot the congestion window as a function of round-trip times for the situation in which the following packets are lost: 9, 25, 30, 38, and 50. For simplicity, assume a perfect timeout mechanism that detects a lost packet exactly 1 RTT after it is transmitted.