. 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

Consider a single-platter disk with the following parameters: rotation speed:7200 rpm; number of tracks on one side of platter: 30,000; number of sectors per track: 600; seek time: one ms for every hundred tracks traversed. Let the disk receive a request to access a random sector on a random track and assume the disk head starts at track 0. a. What is the average seek time? b. What is the average rotational latency? c. What is the transfer time for a sector?
w2
7
We want to send to a file of 2MB by using asynchronous serial transmission with a parity added to each byte. Find the transmission time (minutes) over a 115.200 baud line with two stop bits.
Consider a disk that rotates at 3600 rpm. The seek time to move the head between ad- jacent tracks is 2 ms. There are 32 sectors per track, which are stored in linear order from sector 0 through sector 31. The head sees the sectors in ascending order. Assume the read/write head is positioned at the start of sector 1 on track 8. There is a main memory buffer large enough to hold an entire track. Data is transferred between disk locations by reading from the source track into the main memory buffer and then writing the date from the buffer to the target track. a. How long will it take to transfer sector 1 on track 8 to sector 1 on track 9? b. How long will it take to transfer all the sectors of track 8 to the corresponding sec- tors of track 9?
Question B
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.
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.
As soon as possible. Ple
Help
Consider a disc with 512-byte sectors, 1,000-track platters, 100-sector tracks, ten-track cylinders, and a block size of 2,048 bytes plus 48 bytes for non-data overhead. Assume that a file with 1,000,000 100-byte records is to be stored on such a disc, and that no record can transcend two blocks. a) How many recordings can fit on a single block? b) How many cylinders will be needed to store the complete file?
Consider a disk with 2 MB/track, a rotation time of 10 msec, average seek time of 5 msec. On average, how long it takes to read 500 bytes from the disk?