Consider a modification to TCP's congestion control algorithm. Instead of additive increase, we can use multiplicative increase. A TCP sender increases its window size by a small positive constant a(0

Consider a modification to TCP's congestion control algorithm. Instead of additive increase, we can use multiplicative increase. A TCP sender increases its window size by a small positive constant a(0

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

Suppose two TCP connections share a path through a router R. The router's queue size is six segments; each connection has a stable congestion window of three segments. No congestion control is used by these connections. A third TCP connection now is attempted, also through R. The third connection does not use congestion control either. Describe a scenario in which, for at least a while, the third connection gets none of the available bandwidth. and the first two connections proceed with 50% each. Does it matter if the third connection uses slow start? How does full congestion avoidance on the part of the first two connections help solve this? 10:33 am Type a message Dorcon 1 tahir re
The following event is shown to occur in the figure below illustrating the operation of TCP Reno. For the following prompt, clearly state where it occurs and how we can identify where this event occurs based on the shape of the graph or changes to the congestion window size. a.) A segment loss event due to a timeout.
Q4: Draw a graph for TCP congestion control for both a) TCP Tahoe b) TCP Reno based on the following information. Also show SS, AI and MD phases on the graph. At round 1 CWND =1 MSS Initial ssthresh =Infinity Timeout = At round 7 3 Duplicate ACK = At round 15 3 Duplicate ACK = At round 22 Add X round after 22, where X is 1
Consider sending a file of F bits over a path of Q links. Each link transmits at R bits per second (bps). The network is lightly loaded so that there are no queueing delays. When a form of packet switching is used, the F bits are broken up into packets, each packet with L bits, of which h bits of it are header. Propagation delay is negligible. Let F = 5x104, Q = 20, R = 1 Mbps, L = 1000, and h = 10. c. Suppose the network is a packet-switched virtual circuit network. Denote the VC set-up time by ts = 250 milliseconds. How long does it take to send the file from source to destination?
Assume that a TCP process A first measures the actual round trip time to TCP process to be 30 ms, and A thus sets its estimated round trim time to be 30 ms. The next actual round trip time that A sees is 60 ms. In response. A increases its estimated round trip to 50 ms. another The next actual round trip time that A sees is 40 ms. What is the next estimated round trip computed by A?
Question 2 please (a,b,c,d included)
Assume that the TCP Round Trip Time (RTT) is currently 28 msec and the following ACK's come in after 29, 33, 22 ms respectively. What is the new estimate RTT (ms) using Jacoboson's algorithm (a=0.8).
Consider two hosts Pand Q connected through a router R. The maximum transfer unit (MTU) value of the link between Pand Ris 1500 bytes, and between Rand Qis 820 bytes. A TCP segment of size 1400 bytes was transferred from P to Q through R, with IP identification value as Ox1234. Assume that the IP header size is 20 bytes. Further, the packet is allowed to be fragmented, i.e., Don't Fragment (DF) flag in the IP header is not set by P. Which of the following statements is/are correct? (a) Two fragments are created at R and the IP datagram size carrying the second fragment is 620 bytes. (b) If the second fragment is lost, P is required to resend the whole TCP segment. (c) TCP destination port can be determined by analysing only the second fragment. (d) If the second fragment is lost, R will resend the fragment with the IP identification value Ox1234
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.
Assume that a bottleneck connection with a rate of R bps carries two TCP connections. In both cases, there is a big file that must be downloaded (in the same direction over the bottleneck link). The files are all transmitted at the same time How much data will TCP be able to transmit each connection?
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.
8