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

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

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

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.
We explore whether either UDP or TCP offers any level of end-point authentication in this problem. a. Consider a server that accepts a request via UDP and responds via UDP (for example, as done by a DNS server). Where would the server give its answer if a client with IP address X spoofs it with address Y? b. Assume a server receives a SYN with IP source address Y and responds with SYNACK. The server then receives an ACK with IP source address Y and the right acknowledgmentamount. Assuming the server selects a random initial sequence number and there is no "man-in-the-middle," how can the server be confident that the recipient is really at Y (and not at any other address X that spoofs Y)?
QUESTION 19 Suppose a process in Host C has a UDP socket with port number 4320. Suppose both Host A and Host B each send a UDP segment to Host C with destination port number 4320. Then both of these segments will be directed to the same socket with port number 4320 at Host C True False QUESTION 20 With TCP’s flow control mechanism, where the receiver tells the sender how much free buffer space it has (and the sender always limits the amount of outstanding, unACKed, in-flight data to less than this amount), it is not possible for the sender to send more data than the receiver has room to buffer. True False
Assume a simple network of two directly adjacent routers. At time T=0 seconds both sent updates (A -> B "can reach 10.0.0.0 with cost 1", B -> A "can reach 20.0.0.0 with cost 1"). At time T=10 second router B exploded and, as a sad consequence, it stopped sending or receiving any packets. Select all statements that are true: - If at T=15s A sends a packet to 20.0.0.1, A will immediately drop the packet - If at T=15s A sends a packet to 20.0.0.1, it will not reach the destination - If at T=125s A sends a packet to 20.0.0.1, A will immediately drop the packet - At time T=125s node A has no knowledge about the route to 20.0.0.0/24 - If at T=185s A sends a packet to 20.0.0.1, A will immediately drop the packet - At time T=185s node A has no knowledge about the route to 20.0.0.0/24 - If at T=305s A sends a packet to 20.0.0.1, A will immediately drop the packet - At time T=305s node A has no knowledge about the route to 20.0.0.0/24
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.
Consider the pattern of red and green packet arrivals to a router’s output port queue, shown below. Suppose each packet takes one time slot to be transmitted, and can only begin transmission at the beginning of a time slot after its arrival. Indicate the sequence of departing packet numbers (at t = 1, 2, 3, 4, 5, 6, 7) under Priority scheduling, where red packets have priority over green packets.. Match each time unit (t=1, t=2, t=3 ....) with the number of the packet that was transmitted and thus "departs" at that time unit.
Suppose two TCP connections are present over some bottleneck link of rate R bps. Both connections have a huge file to send (in the same direction over the bottleneck link). The transmissions of the files start at the same time. What transmission rate would TCP like to give to each of the connections?
Given the following topology of a network where the router connecting the two subnets together, Nodes 1 and 2 are ’inside’ of the subnet neta, Nodes 4 and 5 are ’outside’ of neta and Node 3 with a firewall is the gateway of neta. Try to write rules as general as possible. For example, although there are only two nodes outside, try to write rules such that the policy is achieved even if there were more than two nodes outside. Suppose the default policy is ACCEPT in the firewall on Node 3. Write packet filtering rules for the following goals (each of which is treated separately): Rule 1. Block ping (icmp) packets being forwarded between the two subnets; Rule 2. Block ping packets coming into the firewall;Rule 3. Prevent Node1 from SSHing to any outside nodes; Change the default policy as DROP and write packet filtering rules for the following golas: Rule 4. Allow inside hosts can access outside websites;Rule 5. Allow outside hosts can SSH into Node1. No other access should be allowed.…
Consider a node called A that sends packets to an adjacent node called B. To control the packet flow to node B, node A employs a credit manager scheme in which parameters C=3(credits), C_max=4(credits) and \tao=6(msec), respectively. node A has an infinite buffer to temporarily store packets. When a packet arrives at node A, node A stores the packet at the bottom of the buffer. Node A also has a single server (transmitter). As soon as the server becomes idle, the server picks up a packet at the head of the buffer, if any, and serves the packet for packet transmission time T_p as far as there remains a credit. (The packet transmission time T_p = 4 (msec).) We observed the arrival times of the first 12 packets, denoted by aA(1)⋯A(12), which were as follows: n A(n) 1 0.5 msec 2 1.0 3 1.5 4 2.0 5 4.5 6 5.5 7 6.5 8 12.5 9 13.0 10 13.5 11 14.0 12 14.6 1. Let R(n) denote the departure time of the n th packet from the buffer for n∈{1,2,...}. Find R(n) for…
Two computers A and B open a TCP connection between themselves. Consider the flow of data from A to B. B’s RWND as known to A is 25 MSS. A’s initial CT = 12 MSS. At time unit 7, one of A’s RTO timer goes off, at time unit 14 A receives three duplicate ACKs, and at time unit 20 A gets one more timeout of its RTO timers.Show in a graph the detailed changes of A’s congestion window (CWND) if TCP Reno is used.
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?
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?