Answered: Consider the window size is 10,…

Consider the window size is 10, bandwidth is 1500 bps, transmission delay is 2 ms atpropagation delay is 50 ms. What is the throughput using Go Back N protocol? a) 294.11 b) 140.23 c) 96 d) 154.21

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter13: Internet And Distributed Application Services

Section: Chapter Questions

Problem 15VE

See similar textbooks

Similar questions

Computer Science Assume the length of each message is L=5, the access link has a speed of X=180 Mbps, and there are B=6 messages per second on average. What is the total average delay for receiving a message when no cache is used, i.e., the sum of LAN delay, access delay, and internet delay? Give your answer in milliseconds.
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 ??????.
Assume a 10Mbps Ethernet has two nodes, A and B, connected by a 360m cable with threerepeaters in between, and they each have one frame of 1,024 bits to send to each other. Further assumethat the signal propagation speed across the cable is 2*10^8 m/sec, CSMA/CD uses back-off intervals ofmultiples of 512 bits, and each repeater will insert a store-and-forward delay equivalent to 20-bittransmission time. At time t=0, both A and B attempt to transmit. After the first collision, A draws K = 0and B draws K = 1 in the exponential back-off protocol after sending the 48bits jam signal. a. What is the one-way propagation delay (including all repeater delays) between A and B inseconds? At what time is A's packet completely delivered at B? b. Now suppose that only A has a packet to send and that the repeaters are replaced with switches.Suppose that each switch has an 8-bit processing delay in addition to a store-and-forward delay.At what time, in seconds, is A's packet delivered at B?
Suppose that R = 1 Gbps and Rc is 300 Mbps and Rs is 200 Mbps. Assuming that the servers are sending at their maximum rate possible, enter the link utilization of the shared link, whose rate is R, below. Enter your answer as a decimal, of the form 1.00 (if the utilization is 1, or 0.xx if the utilization is less than 1, rounded to the closest xx).
Assume that there is a shared connection (for example, an Ethernet bus) with a speed of 1 Mbps. How much time (in microseconds) is required to send a frame with a length of 1000 bits over this link?
Consider a short, 10-meter link, over which a sender can transmit at a rate of 150 bits/sec in both directions. Suppose that packets containing data are 100,000 bits long, and packets containing only control (e.g., ACK or handshaking) are 200 bits long. Assume that N parallel connections each get 1/N of the link bandwidth. Now consider the HTTP protocol, and suppose that each downloaded object is 100 Kbits long, and that the initial downloaded object contains 10 referenced objects from the same sender. Would parallel downloads via parallel instances of non-persistent HTTP make sense in this case? Now consider persistent HTTP. Do you expect significant gains over the non-persistent case? Justify and explain your answer
The network referenced is shown in the picture below: Assume the network uses packet switching and 2 Kilobyte packets. Assume both L1 and L2 each have a propagation delay of 0.1 seconds. We are sending a 100 Kilobyte file. If L1 has infinite bandwidth, and L2 has a bandwidth of 1 Megabit (125 Kilobytes) per second, how long does it take to send the entire file? After the entire file is sent, a single acknowledgment is needed to say the file arrived, how long does the entire process take now (you can assume the ack has negligible size)? If a maximum of 10 packets can be sent per an RTT (this is the equivalent of a fixed window size of 10 packets), how long does it take to send the entire file? What if we start with a congestion window of 1 packet in slow start phase and no slow start threshold, How long to send the entire file now (Hint: This is similar to the previous question but with a variable window rather than fixed)? What if we start in congestion avoidance (linear growth)?
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. a.Now assume that Rc = 60Mbps, Rs = 40Mbps, R1 = R3 = 30Mbps, R2 = 10Mbps and R4 = 20Mbps. Suppose that the message is segmented into 6000 packets, with each packet being 10,000 bits long. How long does it take to move the first packet from source host to the first switch? When the first packet is being sent from the first switch to the second switch, the second packet is being sent from the source host to the first switch. At what time will the second packet be fully received at the first switch? b) How long does it take to move the file from source host to destination host when message segmentation is used if path R3, R4 is chosen?
3.4-8 Channel utilization with pipelining. Suppose a packet is 10K bits long, the channel transmission rate connecting a sender and receiver is 10 Mbps, and the round-trip propagation delay is 10 ms. What is the channel utilization of a pipelined protocol with an arbitrarily high level of pipelining for this channel?
Consider a IP address 201.24.58.69 in classful address, if the number of 1's in directed broadcast address is a and number of 1's in network ID, of the given IP address is b, value of a + b.
suppose two hosts, A and B, are separated by 20,000 kilometers and are connected by a direct link of R = 2 Mbps. Suppose the propagation speed over the link is 2.5 x 108 meters/sec. 1. Calculate the bandwidth-delay product, R x dprop. 2. Consider sending a file of 800, 000 bits from Host A to Host B. Suppose the file is sent continuously as one large message. What is the maximum number of bits that will be in the link at any given time? 3. Provide an interpretation of the bandwidth-delay product?
1.4.12.2 End-to-end Delay. Consider again the network shown above. The links again have transmission rates of R1 = R2 = 100 Mbps (i.e., 100 x 106 bits per second), and each packet is 1 Mbit (106 bits) in size. Assume that the propagation delay is 1 msec per link. What is the end-to-end delay of a packet from when it first begins transmission at the sender, until it is received in full by the server at the end of the rightmost link. Assume store-and forward packet transmission. You can assume the queueing delay is zero. Answer choices: A. 2 x 106 msec b. 2.01 msec C. 1.1 msec D. 2.02 msec 1.4.12.3 Maximum Throughput. Consider again the network shown above. The links again have transmission rates of R1 = R2 = 100 Mbps Assume that the link R2 is fairly shared (as we've seen is done via TCP) between the two sessions. What is the maximum end-to-end throughput achieve by each session, assuming both sessions are sending at the maximum rate possible? Answer choices:…