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?

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?

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

Related questions

Q: In this problem, we consider sending real-time voice from Host A to Host B over a packet-switched…

A: We need to find the elapsed time when the first bit is formed.

Q: Question 4 please

A: On packet switched networks, fragmentation is a common occurrence. When a large packet is received…

Q: Consider delivering voice through a direct connection network from Host A to Host B. (for example,…

Q: Host A and B are linked directly to a 100 Mbps link. There is a TCP link between the two servers,…

A: Host A and B are linked directly to a 100 Mbps link. There is a TCP link between the two servers,…

Q: Host A and B are directly connected with a 100 Mbps link. There is one TCP connection between the…

Q: Consider a simple protocol for transferring files over a link. After some initial negotiation, A…

A: Stop-and-wait stop and wait, implies, that anything the information that the shipper needs to send,…

Q: Hosts A and B are directly connected with a 1 Gbps link. There is one TCP connection between the two…

A: Given, Hosts A and B are directly connected with a 1 Gbps link. There is one TCP connection between…

Q: In IPV4, consider sending a 4,000 byte datagram (20 bytes of IP header) into a link that has an MTU…

A: Given:

Q: Suppose two TCP connections are present over some bottleneck link of rate R bps. Both connections…

A: Transmission rate for the connections Here the two TCP connections are present over some bottleneck…

Q: Consider that only a single TCP (Reno) connection uses one 10Mbps link which does not buffer any…

A: A The maximum window size that this TCP connection can achieve is 10 segments. BThe average window…

Q: Q.4) Consider the scenario below where 4 TCP senders are connected to 4 receivers. Senders transmit…

A: Here is the explanation of the above problem.

Q: as a possible congestion control mechanism in a subnet using virtual circuits internally, a router…

Q: In this problem, v congestion detecti

A: To avoid congestion, the Transmission Control Protocol (TCP) employs a network congestion-avoidance…

Q: Assume that a bottleneck connection with a rate of R bps carries two TCP connections. In both cases,…

A: Answer: Bottleneck Connection: A Bottleneck occurs in a network when there are too many users…

Question

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?

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Consider a TCP connection with the following parameters: a) Initial ssthreshold = 8 b) Round Trip Time (RTT) = 10 milliseconds c) Retransmission Timeout period = 40 milliseconds d) Segment size = 2700 bytes The TCP connection was used to transfer 19 data segments, numbered 1 through 19. While sending the segments, data segment 10 was lost the first time it was sent (but arrived at the receiver properly upon being retransmitted). There were no other segment losses apart from the aforementioned. Assume that data segments received out-of-order are buffered at the receiver. What is the average throughput obtained in sending all the data segments (in bytes/sec)? Draw a diagram to show the transmission of the segments in detail.
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
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.
Consider a TCP connection between Host A and Host B. Suppose that the TCP segments traveling from Host A to Host B have source port number x and destination port number y. What are the source and destination port numbers for the segments traveling from Host B to Host A?
TCP session sends 50 packets per second over an Ethernet Local Area Network (LAN). Each packet consists 2280B (excluding the preamble and cyclic redundancy check (CRC)). Calculate the size of the headers, and hence the TCP payload data. What therefore is the TCP throughput of the session?
Consider a simple protocol for transferring files over a link. After some initial negotiation, A sends data packets of size 1 KB to B; B then replies with an acknowledgment. A always waits for each ACK before sending the next data packet; this is known as stop-and-wait. Packets that are overdue are presumed lost and are retransmitted. (a) In the absence of any packet losses or duplications, explain why it is not necessary to include any "sequence number" data in the packet headers. (b) Suppose that the link can lose occasional packets, but that packets that do arrive always arrive in the order sent. Is a 2-bit sequence number (that is, N mod 4) enough for A and B to detect and resend any lost packets? Is a 1-bit sequence number enough? (c) Now suppose that the link can deliver out of order and that sometimes a packet can be delivered as much as 1 minute after subsequent packets. How does this change the sequence number requirements?
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
I need the answer as soon as possible
Consider a client has established TCP connection with a server and sending data. The propagation delay is 5 ms and there are no timeouts and errors during transmission. The size of the receiver advertised window is 128 KB, the slow-start threshold at the client is 64 KB, and the maximum segment size is 4 KB. The connection is established at time T = 10 ms. What is the size of the congestion window (in KB) at time 90 ms after all acknowledgements are processed?
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?
hdet b) Consider sending a packet contains 1100 bits from Host A to Host B in a store and forward nerwork. There are 10 links (and 9 routers) between A and B, and the links are congested (there Is a queuing delays). Assume propagation delay over the links are negligible. As a packet travels along the route, it encounters an average of 5 packets already waiting in the queue to be transmitted when it arrives at each router, How long does it take for the packet to get to the receiver if the nodes transmit on a "first come first served" basis (in ms)?