In the congestion control method of TCP we are having a connection between nodes A and node B which is called connection X. There is another TCP connection between node Cand node D which is called connection Y. The initial threshold window size for connection X is 20 KB and for Y is 16 KB. Both the connections X, Y are working independently and follow the Additive increase multiplicative decrease algorithm (AIMD) for congestion control with a maximum segment size of 2 KB. The first timeout occurs at the fifth transmission in connection X and at the sixth transmission in connection Y. After every third transmnission from timeout vOu again encounter the

In the congestion control method of TCP we are having a connection between nodes A and node B which is called connection X. There is another TCP connection between node Cand node D which is called connection Y. The initial threshold window size for connection X is 20 KB and for Y is 16 KB. Both the connections X, Y are working independently and follow the Additive increase multiplicative decrease algorithm (AIMD) for congestion control with a maximum segment size of 2 KB. The first timeout occurs at the fifth transmission in connection X and at the sixth transmission in connection Y. After every third transmnission from timeout vOu again encounter the

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

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
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.
Computer Networks 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 9.
In a two-phase, total-order multicast system, messages are sent in the following sequence from node S to G1 and G2. G1 and G2 are the members of the group. S sends m1 to G1 S sends m1 to G2 S sends m2 to G2 S sends m2 to G1 Use the basic implementation of the Lamport clock. The clock s at each node start at: S: 4, G1: 6, G2: 1. Show the exchange of messages and their acknowledgments in a clock diagram using the basic implementation of Lamport's clock. In which order and at what times are m1 and m2 delivered?
IN PYTHON Given the following six-node wide area network for which the numbers attached to the links are a measure of the “delay” in using that link (e.g., some lines could be more heavily used than others and therefore have a longer wait time), answer the following question. What is the shortest path from node A to node D, where shortest path is defined as the path with the smallest sum of the delays on each individual link? Explain exactly how you went about finding that path.
We discussed increasing the timeout interval once a timeout occurred. This strategy is used to control traffic congestion. Why, in addition to the doubling-timeoutinterval approach, does TCP require a window-based congestion-control method?
Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network. Tabulate the executed iteration for the Dijkstra Algorithm using the table below.                                                                                                                                                            Iteration Nodes R1 R2 R3 R4 R5 R7 R8 R9 R10 0 [6] 1 [6,3] 2 [6,3,2] 3 [6,3,2,1] 4 [6,3,2,1,4] 5 [6,3,2,1,4,5] 6 [6,3,2,1,4,5,7]…
Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network. Tabulate the executed iteration for the Dijkstra Algorithm using the table below.                                                                                                                                                            Iteration Nodes R1 R2 R3 R4 R5 R7 R8 R9 R10 0 [6] 1 [6,3] 2 [6,3,2] 3 [6,3,2,1] 4 [6,3,2,1,4] 5 [6,3,2,1,4,5] 6 [6,3,2,1,4,5,7]…
Give Complete Solution of this question: 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=9
Consider a TCP connection with the following parameters: a) Initial ssthreshold = 4 segmentsb) Round Trip Time (RTT) = 10 millisecondsc) Timeout period = 40 millisecondsd) Segment size = 3900 bytesThe TCP connection was used to transfer 17 data segments. While sendingthe segments, data segment 7 and data segment 15 were lost the first timethey were sent (but arrived at the receiver properly when retransmitted).There were no other segment losses apart from the aforementioned. Assumethat data segments received out-of-order are buffered at the receiver. Whatis the average throughput obtained in sending all the data segments (inbytes/sec)? Draw a diagram to show the communication process in detail.
Consider a TCP connection with the following parameters: a) Initial ssthreshold = 4 segmentsb) Round Trip Time (RTT) = 10 millisecondsc) Timeout period = 40 millisecondsd) Segment size = 3900 bytesThe TCP connection was used to transfer 17 data segments. While sendingthe segments, data segment 7 and data segment 15 were lost the first timethey were sent (but arrived at the receiver properly when retransmitted).There were no other segment losses apart from the aforementioned. Assumethat data segments received out-of-order are buffered at the receiver. Whatis the average throughput obtained in sending all the data segments (inbytes/sec) including draw a diagram to show the communication process in detail.
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).