1.4-6 Maximum end-end throughput (e). Consider the scenario below where 4 TCP senders are connected to 4 receivers. The servers transmit to the receiving hosts at the fastest rate possible (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 links Server-3 Server-1 Host-1 Server-2 Answers: R/4 Rs Rc Host-3 Host-2 Suppose that R-1 Gbps and 300 Mbos and R, is 200 Mbps. What is the TCP throughout achieved on eacher AR Server-4 Host-4 connections

1.4-6 Maximum end-end throughput (e). Consider the scenario below where 4 TCP senders are connected to 4 receivers. The servers transmit to the receiving hosts at the fastest rate possible (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 links Server-3 Server-1 Host-1 Server-2 Answers: R/4 Rs Rc Host-3 Host-2 Suppose that R-1 Gbps and 300 Mbos and R, is 200 Mbps. What is the TCP throughout achieved on eacher AR Server-4 Host-4 connections

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

Question 3 Consider a satellite channel running TCP/IP as shown in the figure below. Due to the long round trip time (RTT) and high bit error rate (BER) the conventional TCP congestion mechanism doesn’t work well in a satellite transmission system. 3.1 Assume traditional TCP/IP is used and that the congestion window of the TCP sender is 10k bytes, and it is in congestion avoidance (CA) state with the threshold variable equal to 8k bytes. Now, the sender receives 3 duplicated acknowledgements (ACKs). As a result, explain the effect on the congestion window size and the threshold.
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
Below are the two questions, so make sure to answer each part carefully and label the response for each question: 1) Why does TCP implement congestion control if it already has flow control to manage the sender's window? 2) Consider our recent reading [Chiu+89] Analysis of the Increase and Decrease algorithms for congestion avoidance in computer networks. How does this article showcases that TCP is fair?
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?
as a possible congestion control mechanism in a subnet using virtual circuits internally, a router could refrain from acknowledging a received packet until (1) it knows its last transmission along the virtual circuit was received successfully and (2) it has a free buffer. for simplicity, assume that the routers use a stop-and-wait protocol and that each virtual circuit has one buffer dedicated to it for each direction of traffic. if it takes 7 sec to transmit a packet (data or acknowledgement) and there are n routers on the path, what is the rate at which packets are delivered to the destination host? assume that transmission errors are rare and that the host-router connection is infinitely fast.
1. What is the difference between packet fragmentation (i.e., at network layer) and frame frag- mentation (i.e., at link layer) in terms of purpose? 2. Suppose that host A is connected to a router R1, R1 is connected to another router, R2, and R2 is connected to host B. Suppose that a TCP message that contains 800 bytes of data and 20 bytes of TCP header is passed to the IP function at host A for delivery to B. Show the Total length, DF, MF, and Fragment offset fields of the IP header in each packet transmitted over the three links. (Assume that link A-R1 can support a maximum frame size of 1024 bytes including a 14-byte frame header, link R1-R2 can support a maximum frame size of 512 bytes, including an 8-byte frame header, and link R2-B can support a maximum frame size of 432 bytes including a 12-byte frame header.) (*hint: the Fragment offset field is denominated by 8-bytes, not bytes) 3. What is the purpose of the path MTU discovery process (see textbook Figure 5-42) and why does…
2. Consider a slotted TDM hierarchical network in which there are 8 computers sharing a 10 Mbps channel to a router R1, sending packets to R1 which must all be forwarded by R1 over an outgoing link (called the MAN link), as shown in Figure 1. Computers A-H always have packets waiting to be sent, so no timeslot on the shared LAN is idle. Ignore the propagation delay on the LAN. The MAN link outgoing from R1 is a 100 Mbps link. The network layer protocol in use has a PDU with exactly 40 bytes of header and exactly 200 bytes of payload (SDU). The DLC layer protocol in use on the LAN has a PDU with exactly 40 bytes of header and 20 bytes of trailer. The DLC layer protocol in use on the outgoing link from R1 has a PDU with 40 bytes of header and no trailer. The physical layer does not impose any bit overhead in either channel. Use 1 Mbps = 1000000 bps. B D E F G H R1 R2 Figure 1 (a) What is the transmission delay of a bit for Computer A? (b) What is the transmission delay of a DLC PDU for…
Use again the network architecture provided in the figure above, were Rs, Rc and Ri for i = {1,2,3,4}, the transmission rates of the server link, client link and intermediate network links. Consider a message that is 60 · 106 bits long that is to be sent from client to server. Ignore propagation, queuing, and processing delays. c.How long does it take to move the file from source host to destination host when message segmentation is used and both path R1, R2 and path R3, R4 are used? How many packages should be routed from path R1, R2 and how many from path R3, R4 in order to maximize the use of the network? d.What is the end to end throughput if path R1, R2 is used, and what if path R3, R4 is used? What is the total throughput from client to server (if both paths are being used at the same time)?
Suppose two hosts (Host-A and Host-B) are connected through a shared Ethernet bus of 1 Mbps. The distance between two nodes is 5 meters. The signal propagation speed over physical media is 2.5 x 10^5 meters/second. Compute the propagation delay in this case. What will be the propagation delay for a shared bus of 10 Mbps instead Suppose both hosts sense idle channel at the same time and starts transmission. Will it result in collision (yes or no) If yes: How much time is needed to detect this collision at Host-A? If yes: How much time is needed to detect this collision at Host-B?
39. The figure below shows the TCP Congestion Window for various transmission rounds of a TCP connection. 20 18 16 14 12 10 4 2 2 4 6 10 12 14 16 18 20 Transmission Round How many more (or less) segments will TCP Tahoe send compared to TCP Reno between the transmission rounds 12 and 16 inclusive (i.e., t12 to t16) for the same sequence of events as shown in the graph above (i.e., loss events at t11, tl4 and t16)? a. TCP Tahoe send 13 less segments compared to TCP Reno b. TCP Tahoe send 20 more segments compared to TCP Reno c. TCP Tahoe send 13 more segments compared to TCP Reno d. TCP Tahoe send 20 less segments compared to TCP Reno e. TCP Tahoe send 28 less segments compared to TCP Reno Congestion Window (MSS) 00
Consider a long-lived TCP session with an end- to-end bandwidth of 1 Gbps (= 10⁹ bits-per- second). The session starts with a sequence number of 1234. The minimum time (in seconds, rounded to the closest integer) before this sequence number can be used again is
COMPUTER NETWORKS QUESTION : In TCP, hosts need to set the retransmission timeout (RTO) dynamically to adapt for the routing performance and optimize the bandwidth utilization. Assume that one sending hosts found from previous packet/acknowledgement pairs that the RTT between it and the receiver is 45 mS. What will be the RTO of that sending host after receiving a new packet/Ack pair witha new RTT sample = 100 mS. (assume that ?=0.875)