The next 4 questions are based on the following description: In all following calculations, assume K denotes 103 and M denotes 106. Assume RTT is 100 ms, packet size is 1.5 KB, and there is one RTT of "handshaking" before data is sent. What is the total time required to transfer a 3 MB file if the bandwidth is 1 Mbps, and data packets can be sent continuously?

The next 4 questions are based on the following description: In all following calculations, assume K denotes 103 and M denotes 106. Assume RTT is 100 ms, packet size is 1.5 KB, and there is one RTT of "handshaking" before data is sent. What is the total time required to transfer a 3 MB file if the bandwidth is 1 Mbps, and data packets can be sent continuously?

Principles of Information Security (MindTap Course List)

6th Edition

ISBN:9781337102063

Author:Michael E. Whitman, Herbert J. Mattord

Publisher:Michael E. Whitman, Herbert J. Mattord

Chapter6: Security Technology: Access Controls, Firewalls, And Vpns

Section: Chapter Questions

Problem 2RQ

See similar textbooks

Similar questions

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?
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)?
1. Suppose two hosts, A and B, are separated by 30,000 kilometers and are connected by a direct link of R = 3 Mbps. Suppose the propagation speed over the link is 2.5 x 108 meters/sec. a. Calculate the bandwidth-delay product, R _ dprop. b. Consider sending a file of 900,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?
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).
Suppose Host A wants to send a large file to Host B. The path from Host A to Host B has three links, of rates R1=500 kbps, R2=2 Mbps, and R3=1 Mbps a. Assuming no other traffic in the network, what is the throughput for the file transfer? b. Suppose the file is 4 million bytes. Dividing the file size by the throughput, roughly how long will it take to transfer the file to Host B? c. Repeat (a) and (b), but now with R reduced to 100 kbps.
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 ??????.
Suppose that a 20-Mbps 802.11 LAN is transmitting 64-byte frames back-to-back over a radio channel with a bit error rate of 10−7 (i.e., the probability of a bit to flip duringthe transmission). How many frames per second will be damaged on average?(*hint: you would need to calculate the probability that a frame does not suffer any bit errors, thisis equivalent to the fraction of frames that do not suffer any bit errors on average.)
Question 9 Suppose Host A wants to send a large file to Host B. The path from Host A to Host B has three links, of rates R1 = 1,024 kbps, R2 = 2,048 kbps, and R3 = 10 Mbps. Assuming no other traffic in the network, how long (in seconds) will it take to transfer a 50 KiB file? Disregard propagation, processing, and queuing delays. Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line
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:…
Calculate the total time required to transfer a 1000-KB file in the following cases, assuming an RTT of 50 ms, a packet size of 1 KBdata, and an initial 2 RTT handshake before data is sent: The bandwidth is 1.5 Mbps, and data packets can be sent continuously. The bandwidth is 1.5 Mbps, but after we finish sending eachdata packet we must wait one RTT before sending the next.
Calculate the total time required to transfer a 1000-KB file in the following cases, assuming an RTT of 50 ms, a packet size of 1 KBdata, and an initial 2 RTT handshake before data is sent: The bandwidth is "infinite," meaning that we take transmit time to be zero, and up to 20 packets can be sent per RTT. The bandwidth is infinite, and during the first RTT we cansend one packet, during the second RTT we can send two packets, during the third we can send four and so on.
Consider the following Aloha systems.(a) A group of N users share a 56 kbps pure Aloha channel. Each user generates at a Poisson rateof one 1000-bit packet every 100 sec, even if the previous one has not yet been sent. What is themaximum value of N (Hint: The pure Aloha maximum channel utilization is 18.4%)? (b) Ten thousand airline reservation stations are competing for the use of a single slotted Alohachannel. The average station makes 18 requests/hour. A slot is 125 μsec. What is the approximatetotal channel load (requests per slot)?