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 link). Server-1 Host-1 Server-2 Answers: R/4 R₁ Re Server-3 4R Host-3 Host-2 Suppose that R-1 Gbps and Res 300 Mbos and R. is 200 Mbps. What is the TCP throughout achieved on each eacher c Server-4 Host-4 the 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 link). Server-1 Host-1 Server-2 Answers: R/4 R₁ Re Server-3 4R Host-3 Host-2 Suppose that R-1 Gbps and Res 300 Mbos and R. is 200 Mbps. What is the TCP throughout achieved on each eacher c Server-4 Host-4 the 4 connections?

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 8P

See similar textbooks

Similar questions

Q) Consider a single TCP connection using a 10 Gbps link which does not buffer any data. Assume 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 make the following simplifying assumptions:→ Each TCP segment size is 1500 bytes→ The RTT of the connection is 100 ms→ The TCP connection is always in congestion avoidance (ignore slow start) Calculate the loss rate of L using the given image as a formula to achieve 10 Gbps throughput, please specify all the calculations in detail.
Maximum end-end throughput (e). Consider the scenario below where 4 TCP senders are connected to 4 receivers. Servers 1 - 3 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). Server 4 has nothing to send, so its sending rate is zero. Suppose that R = 1 Gbps, Rc is 300 Mbps and Rs is 400 Mbps. What is the TCP throughput achieved on each of the 3 sctive-sending connections? A. 4R B. Rc C. R/4…
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 (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?
Under the assumption of no packets loss, how long will it take TCP to send an object that is 20KB over a link with a RTT of 400 milliseconds, a MSS of 2KB, and a rate of 10KB/second when: a. TCP is in slow start, CongWin = 1 and Threshold = 10: b. TCP is in congestion avoidance, CongWin = 5 and Threshold = 5
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.
This elementary problem begins to explore propagation delay and transmission delay, twocentral concepts in data networking. Consider two hosts, A and B, connected by a single link ofrate R bps. Suppose that the two hosts are separated by m meters, and suppose the propagationspeed along the link is s meters/sec. Host A is to send a packet of size L bits to Host B.a. Express the propagation delay, dprop, in terms of m and s.b. Determine the transmission time of the packet, dtrans, in terms of Land R.c. Ignoring processing and queuing delays, obtain an expression for the endto-end delay.d. Suppose Host A begins to transmit the packet at time t = 0. At time t = dtrans,where is the last bit of the packet?e. Suppose dprop is greater than dtrans. At time t = dtrans, where is the first bit ofthe packet?f. Suppose dprop is less than dtrans. At time t = dtrans, where is the first bit ofthe packet?g. Suppose s = 2.5 · 108, L = 120 bits, and R = 56 kbps. Find the distance mso that dprop equals…
This elementary problem begins to explore propagation delay and transmission delay, two central concepts in data networking. Consider two hosts, A and B, connected by a single link of rate R bps. Suppose that the two hosts are separated by m meters, and suppose the propagation speed along the link is s meters/sec. Host A is to send a packet of size L bits to Host B. a. Express the propagation delay, dprop, in terms of m and s.b. Determine the transmission time of the packet, dtrans, in terms of L and R.c. Ignoring processing and queuing delays, obtain an expression for the end-to-end delay.d. Suppose Host A begins to transmit the packet at time t = 0. At time t = dtrans, where is the last bit of the packet?e. Suppose dprop is greater than dtrans. At time t = dtrans, where is the first bit of the packet?f. Suppose dprop is less than dtrans. At time t = dtrans, where is the first bit of the packet?g. Suppose s = 2.5 * 108 meters/sec, L = 120 bits, and R = 0.112 Mbps. Find the distance m…
This elementary problem begins to explore propagation delay andtransmission delay, two central concepts in data networking. Consider two hosts, Aand B, connected by a single link of rate R bps. Suppose that the two hosts areseparated by m meters, and suppose the propagation speed along the link is smeters/sec. Host A is to send a packet of size L bits to Host B.a. Express the propagation delay, ????? , in terms of m and s.b. Determine the transmission time of the packet, ?????? , in terms of L and R.c. Ignoring processing and queuing delays, obtain an expression for the end to-enddelay
P5. Consider a datagram network using 32-bit host addresses. Suppose a router has four links, numbered 0 through 3, and packets are to be forwarded to the link interfaces as follows: (refer to first image) a. Provide a forwarding table that has five entries, uses longest prefix matching, and forwards packets to the correct link interfaces. b. Describe how your forwarding table determines the appropriate link interface for datagrams with destination addresses: (refer to second image)
This elementary problem begins to explore propagation delay andtransmission delay, two central concepts in data networking. Consider two hosts, Aand B, connected by a single link of rate R bps. Suppose that the two hosts areseparated by m meters, and suppose the propagation speed along the link is smeters/sec. Host A is to send a packet of size L bits to Host B. g. Suppose ? = 2.5?108, L=1500 bytes, and R=10 Mbps. Find the distance m sothat ????? equals ??????.
Consider a router that interconnects three subnets: A, B, and C. Supposeall of the interfaces in each of these subnets are required to have the prefix213.2.104.0/21. Suppose subnet A is required to support 1000 interfaces, andsubnets B and C are each required to support 500 interfaces. Provide networkaddresses for A,B and C (in the form a.b.c.d/x) that satisfy these constraints.
This elementary problem begins to explore propagation delay andtransmission delay, two central concepts in data networking. Consider two hosts, Aand B, connected by a single link of rate R bps. Suppose that the two hosts areseparated by m meters, and suppose the propagation speed along the link is smeters/sec. Host A is to send a packet of size L bits to Host B. d. Suppose Host A begins to transmit the packet at time t=0 . At time t= ?????? ,where is the last bit of the packet? e. Suppose ????? is greater than ?????? . At time t= ??????, where is the first bit of the packet?f. Suppose ????? is less than ??????. At time t= ?????? , where is the first bit of thepacket?