Calculate the total time required to transfer a 1000-kb file

Assignment Help Basic Computer Science

Reference no: EM131046333

Calculate the total time required to transfer a 1000-KB file in the following cases, assuming an RTT of 100 ms, a packet size of 1 KB 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.

(d) The bandwidth is infinite, and during the first RTT we can send one packet (21-1 ), during the second RTT we can send two packets (22-1 ), during the third we can send four (23-1 ), and so on. (A justification for such an exponential increase will be given in Chapter 6.)

Reference no: EM131046333

Questions Cloud

Consider a token ring with a ring latency of 200 µs : Answer for both a single active host and for "many" hosts; for the latter, assume there are sufficiently many hosts transmitting that the time spent advancing the token can be ignored. Assume a packet size of 1 KB.

Fiona pham graduated from central washington university : Fiona Pham graduated from Central Washington University in 1994. She set to work opening a coffee shop in Tacoma called Blue Moon and found a perfect location in a new development.

Calculate the maximum effective throughput rate : calculate the maximum effective throughput rate that any one host can achieve

Who is princeton.edu and who is princeton for starters : The Unix utility who is can be used to find the domain name corresponding to an organization, or vice versa. Read the man page documentation for who is and experiment with it. Try who is princeton.edu and who is princeton, for starters.

Calculate the total time required to transfer a 1000-kb file : The bandwidth is infinite, and during the first RTT we can send one packet (21-1 ), during the second RTT we can send two packets (22-1 ), during the third we can send four (23-1 ), and so on. (A justification for such an exponential increase will..

Substantially better thannlogn steps : Let A[1..n] be an array such that the first n-n√ elementsare already sorted (though we know nothing about the remainingelements).Give an algorithm that sorts A in substantially better thannlogn steps.

Who were your favorite authors or texts to write about : Do you notice a difference between how you wrote about the texts at the beginning of the semester compared to how you write or think about than now late in the semester?

Partitioning idea of quicksort to give an algorithm : Use the partitioning idea of quicksort to give an algorithm that finds the median element of an array of n integers in expectedO(n) time. (Hint: must you look at both sides of the partition?)

What differences might you expect to find : What differences might you expect to find

User Account

All Pages