EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 3, Problem P51P
a)
Program Plan Intro
Given scenario:
Two TCP connections, C1 and C2 have the same RTT of 100msec. suppose that at time t0, C1’s congestion window size is 15 segments but C2’s congestion widow size is 10 segments.
b)
Program Plan Intro
Given scenario:
Two TCP connections, C1 and C2 have the same RTT of 100msec. suppose that at time t0, C1’s congestion window size is 15 segments but C2’s congestion widow size is 10 segments.
c)
Program Plan Intro
Given scenario:
Two TCP connections, C1 and C2 have the same RTT of 100msec. suppose that at time t0, C1’s congestion window size is 15 segments but C2’s congestion widow size is 10 segments.
d)
Program Plan Intro
Given scenario:
Two TCP connections, C1 and C2 have the same RTT of 100msec. suppose that at time t0, C1’s congestion window size is 15 segments but C2’s congestion widow size is 10 segments.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these 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.
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?
TCP
a. Consider two TCP connections, one between Hosts A (sender) and B (receiver), and another
between Hosts C (sender) and D (receiver). The RTT between A and B is half that of the RTT
between C and D. Suppose that the senders' (A's and C's) congestion window sizes are
identical. Is their throughput (number of segments transmitted per second) the same?
Explain.
b. Now suppose that the average RTT between A and B, and C and D are identical. The RTT
between A and B is constant (never varies), but the RTT between C and D varies
considerably. Will the TCP timer values of the two connections differ, and if so, how are they
different, and why are they different?
Give one reason why TCP uses a three-way (SYN, SYNACK, ACK) handshake rather than a
two-way handshake to initiate a connection.
a.
Chapter 3 Solutions
EBK COMPUTER NETWORKING
Ch. 3 - Prob. R1RQCh. 3 - Prob. R2RQCh. 3 - Consider a TCP connection between Host A and Host...Ch. 3 - Prob. R4RQCh. 3 - Prob. R5RQCh. 3 - Prob. R6RQCh. 3 - Suppose a process in Host C has a UDP socket with...Ch. 3 - Prob. R8RQCh. 3 - Prob. R9RQCh. 3 - In our rdt protocols, why did we need to introduce...
Ch. 3 - Prob. R11RQCh. 3 - Prob. R12RQCh. 3 - Prob. R13RQCh. 3 - Prob. R14RQCh. 3 - Suppose Host A sends two TCP segments back to back...Ch. 3 - Prob. R16RQCh. 3 - Prob. R17RQCh. 3 - Prob. R18RQCh. 3 - Prob. R19RQCh. 3 - Prob. P1PCh. 3 - Prob. P2PCh. 3 - UDP and TCP use 1s complement for their checksums....Ch. 3 - Prob. P4PCh. 3 - Prob. P5PCh. 3 - Prob. P6PCh. 3 - Prob. P7PCh. 3 - Prob. P8PCh. 3 - Prob. P9PCh. 3 - Prob. P10PCh. 3 - Prob. P11PCh. 3 - Prob. P12PCh. 3 - Prob. P13PCh. 3 - Prob. P14PCh. 3 - Prob. P15PCh. 3 - Prob. P16PCh. 3 - Prob. P17PCh. 3 - Prob. P21PCh. 3 - Prob. P22PCh. 3 - Prob. P25PCh. 3 - Prob. P26PCh. 3 - Prob. P27PCh. 3 - Host A and B are directly connected with a 100...Ch. 3 - Prob. P29PCh. 3 - Prob. P30PCh. 3 - Prob. P31PCh. 3 - Prob. P33PCh. 3 - Prob. P34PCh. 3 - Prob. P35PCh. 3 - Prob. P37PCh. 3 - Prob. P38PCh. 3 - Prob. P39PCh. 3 - Prob. P41PCh. 3 - Prob. P42PCh. 3 - Prob. P43PCh. 3 - Prob. P44PCh. 3 - Prob. P45PCh. 3 - Prob. P46PCh. 3 - Prob. P47PCh. 3 - Prob. P48PCh. 3 - Prob. P49PCh. 3 - Prob. P51PCh. 3 - Prob. P53PCh. 3 - Prob. P55P
Knowledge Booster
Similar questions
- Consider four Internet hosts, each with a TCP session. These four TCP sessions share a common bottleneck link - all packet loss on the end-to-end paths for these four sessions occurs at just this one link. The bottleneck link has a transmission rate of R. The round trip times, RTT, for all fours hosts to their destinations are approximately the same. No other sessions are currently using this link. The four sessions have been running for a long time. i) What is the approximate throughput of each of these four TCP sessions? Explain your answer briefly. ii) What is the approximate size of the TCP window at each of these hosts? Explain briefly how you arrived at this answer.arrow_forwardConsider the scenario below where 4 TCP senders are connected to 4 receivers. The servers transmit to the receiving hosts at the fastest rate possible (i.e., at the rate at which the bottleneck link between a server and its destination is operating at 100% utilization, and is fairly shared among the connections passing through that link). R =1 Gbps and Rc is 300 Mbps and Rs is 400 Mbps. And that all four senders have data to send, What is the minimum value of Re that will ensure that the connections to Host-1 and Host-2 are not bottlenecked at links with capacity Rc or Re?arrow_forwardSuppose 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 rearrow_forward
- 14. A TCP connection with a flow control window of 50 packets uses slow start with a minimum congestion window of 1 with ss thresh-40. How many RTTS are required to send 25 packets (with sequence number 1 through 25), assuming packets with sequence number 6 and 7 are lost and retransmitted. No other packets are lost.arrow_forwardASAParrow_forwardAssume that when establishing a TCP connection, the threshold for the Congestion Window (cwnd) is 1& segments. The congestion control algorithm is TCP Reno. In the oth round, a time out occurs.The ACK packets are then received correctly until the 1 Pth round. In this round, a triple duplicate ack occurs. Then until the 1Sth round, the ack packets are received correctly. Show these steps by plotting (the vertical axis is the congestion window capacity (cwnd) and the horizontal axis is the round number). Also specify the threshold value change each time it occurs. Graph the chart in any software you want and upload the filearrow_forward
- In TCP connection, congestion occurs if the load on the network is greater than the capacity of the network. TCP uses the following algorithm to handle congestion. The algorithm is based on the size of the congestion window (cwnd) which starts with one maximum segment size (MSS). The MSS is determined during connection establishment. At each time the whole window of segments is acknowledged (one transmission), the size of the window grows exponentially. To stop this exponential growth, the sender keeps the track of a threshold. The threshold is set to 16 MSS. After reaching the threshold, the size of the congestion window is increased by 1. After how many transmissions the congestion window size will be 22 MSS?arrow_forwardSuppose there are two TCP connections over a bottleneck connection of rate R bps. Both links have a large file to transfer (in the same direction over the bottleneck link). The files are sent simultaneously. What rate of transmission will TCP provide to each connection?arrow_forwardAssume 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?arrow_forward
- Consider a TCP connection with congestion window size 40 KB, maximum segment size is 2 KB, if time taken by TCP connection to get 37 KB congestion window is 351 ms, round trip time of the connection is __(ms).arrow_forwardHost 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.arrow_forwardConsider the network shown in Scenario 2 in Section 3.6.1 . Suppose both sending hosts A and B have some fixed timeout values.a. Argue that increasing the size of the finite buffer of the router might possibly decrease the throughput (? ).b. Now suppose both hosts dynamically adjust their timeout values (like what TCP does) based on the buffering delay at the router. Would increasing the buffer size help to increase the throughput? Why?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Principles of Information Security (MindTap Cours...Computer ScienceISBN:9781337102063Author:Michael E. Whitman, Herbert J. MattordPublisher:Cengage Learning
Principles of Information Security (MindTap Cours...
Computer Science
ISBN:9781337102063
Author:Michael E. Whitman, Herbert J. Mattord
Publisher:Cengage Learning