. 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 KB data, and an initial 2 × RTT of “handshaking” before data is sent: (a) The bandwidth is 1.5 Mbps, and data packets can be sent continuously. (b) The bandwidth is 1.5 Mbps, but after we finish sending each data packet we must wait one RTT before sending the next. (c) The bandwidth is “infinite," meaning that we take transmit time to be zero, and up to 20 packets can be sent per RTT.

. 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 KB data, and an initial 2 × RTT of “handshaking” before data is sent: (a) The bandwidth is 1.5 Mbps, and data packets can be sent continuously. (b) The bandwidth is 1.5 Mbps, but after we finish sending each data packet we must wait one RTT before sending the next. (c) The bandwidth is “infinite," meaning that we take transmit time to be zero, and up to 20 packets can be sent per RTT.

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

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.
Calculate the total time required to transfer a 1.5-MB file in the following cases, assuming an RTT of 80 ms, a packet size of 1 KBdata, and an initial 2 RTT handshake before data is sent: The link allows infinitely fast transmit, but limits bandwidth such that only 20 packets can be sent per RTT. The bandwidth is infinite, but during the first RTT we can send one packet, during the second RTT we can send two packets, during the third we can send four, etc.
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.
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 = 12.8 Mbps, R2 = 4000 kbps, and R3 = 2 Mbps.a. Assuming no other traffic in the network, what is the throughput for the file transfer?b. Suppose the file is 12 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 R2 reduced to 500 kbps.
Computer A uses the Go-back-N ARQ protocol to send a 110 Mbytes file to computer B with a window size of 15. Given each frame carries 100K bytes data. How long does it take to send the whole file (the total time taken from A sending the first bit of the file until A receiving the last acknowledgment)? Given that the transmission rate of the link is 500 Mbps and the propagation time between A and B is 15ms. Assume no data or control frame is lost or damaged and ignore the overhead due to header and trailer.
A file of size 20 KiloBytes is transmitted to a destination over a 10 Megabit/s network link (1 Mega = 10^6, 1 Kilo = 10^3, 1 byte = 8 bits). The propagation delay to the destination is 40 milliseconds (1 milli = 10^−3). Assume the queueing delay encountered by packets of the file is negligible. What is the total delay (in milliseconds) for the file to get to its destination?
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?
Calculate total time (in milliseconds) required to send a file of size of 8000 Bytes. Assume RTT (round trip time) of 80 milli second on a link with bandwidth of 0.8 x106bits /second and a packet size of 1000 Bytes where after sending each packet we must wait one RTT before sending the next packet.
Assume that a client can use UDP to obtain a file from a distant server at a known address. The client initiates the request for a file name, and the server responds with a sequence of data packets containing various file components. To ensure delivery reliability, the client and server use a stop-and-wait protocol. Is there anything else wrong with this protocol aside apparent performance issues? Consider the possibility of process failure.
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?
a) In a bus CSMA/CD network with a data rate of 10 Mbps, a collision occurs 20 µs after the first bit of the frame leaves the sending station. What should the length of the frame be so that the sender can detect the collision? b) There are only two stations, A and B, in a bus 1-persistence CSMA/CD network with Tp = 25.6 µs and Tr = 51.2 µs. Station A has a frame to send to station B. The frame is unsuccessful two times and succeeds on the third try. Draw a flowchart for this problem. Assume that the R is 1 and 2 respectively and ignore the time for sending a jamming signal.