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 KB and an initial 2 x RTT of "hand- shaking" before data is sent. (b) The bandwidth is 10 Mbps, but after we finish sending each data packet we must wait one RTT before sending the next. (c) The link allows infinitely fast transmit, but limits bandwidth such that only 20 packets can be sent per RTT. (d) Zero transmit time as in (c), 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 = 23-1, 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 KB and an initial 2 x RTT of "hand- shaking" before data is sent. (b) The bandwidth is 10 Mbps, but after we finish sending each data packet we must wait one RTT before sending the next. (c) The link allows infinitely fast transmit, but limits bandwidth such that only 20 packets can be sent per RTT. (d) Zero transmit time as in (c), 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 = 23-1, and so on.

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

A TCP connection is established through 10 wireless hops in an acoustic underwater ad hoc network. Assume that each hop is 100 meter in the average, acoustic signals travel 1500 meter per second, 10 kilobit data can be sent per second over a link, the source node has one megabyte of data to send, the receiver window size is 64 kilobytes, the maximum segment size is 1 kilobyte and the average processing delay for routing at each node is one millisecond. Assume also that the following segments do not reach the destination: 67, 112, 137. What would be the average utilization of the links for this connection if there is not another communications through them? Explain an alternative approach to increase the bandwidth utilization?
Suppose Host X wants to send a large file to Host Y. The path from Host X to Host Y has three links of rates R1 = 10 Mbps, R2 = 1 Mbps, and R3 = 4 Mbps. (i) Assuming no other traffic in the network, what is the throughput for the file transfer? (ii) Suppose the file is 16 million bytes. Roughly how long will it take to transfer the file to Host Y?
9. Consider the given scenario where Host A wants to send a file to host B. Calculate the end to end delay between Host A and Host B, when the propagation speed at each link is approximately 2x108 m/sec, and the processing and queuing delays at the router are 10 msec and 25 msec, respectively, when: (a) File size is 1500 bytes and only one packet is sent. 4 (b) File size is 6000 bytes and four packets are sent (1500 bytes in each packet). HOST A R1-200kbps D1=15km Router 1 R2=5Mbps D2=100km HOST B
5. A wireless Base Station (BS) is serving N users with a single channel having a capacity C bits/second. The BS has two options for serving the users a) Option1: BS divides the channel into multiple sub-channels using FDMA and assigns a dedicated sub-channel to each user and process his traffic in a separate buffer. b) Option2: BS put the traffic from all users in one buffer and transmits all traffic packet- by-packet on the same channel in a first-come-first serve order 1 Compute the transmission time of each packet (on the air) for Option1 and Option2 if the packet size is L bits.
I need the answer as soon as possible
Channel partitioning MAC protocols are: A. Efficient for low channel load since the delay is N/2, whereas N is the number of nodes. B. None is true. C. Efficient for low channel load since the delay is 1/N, whereas N is the number of nodes. D. Efficient for high channel load since the delay is N/2, whereas N is the number of nodes. E. Efficient for high channel load since the delay is 1/N, whereas N is the number of nodes.
Suppose Host X wants to send a large file to Host Y. The path from Host X to Host Y has three links, of rates R1 = 10 Mbps, R2 = 1 Mbps, and R3 = 4 Mbps. a) Assuming no other traffic in the network, what is the throughput for the file transfer? b) Suppose the file is 16 million bytes. Roughly how long will it take to transfer the file to Host Y? c) Repeat (a) and (b), but now with R3 reduced to 500 kbps.
Networking & Data Communcations
in computer networks
Give some details of how you might augment the sliding window protocol with flow control by having ACKs carry additional information that reduces the SWS as the receiver runs out of buffer space. Illustrate your protocol with a timeline for a transmission; assume the initial SWS and RWS are 4, the link speed is instantaneous, and the receiver can free buffers at the rate of one per second (i.e., the receiver is the bottleneck). Show what happens at T = 0, T = 1,...,T = 4 seconds.
Delays. A user in Madagascar, connected to the internet via a 100 Mb/s (b=bits) connection retrieves a 250 KB (B=bytes) web page from a server in Tokyo, where the page references three images of 500 KB each. Assume that the one-way propagation delay is 82 ms and that the user’s access link is the bandwidth bottleneck for this connection. a.) Approximately how long does it take for the page (including images) to appear on the user’s screen, assuming non-persistent HTTP using a single connection at a time? (For this part, you should ignore queueing delay and transmission delays at other links in the network)b.) Assume a cache rate of 45% on the information received by the user in Madagascar from the Tokyo server. How does this affect your answer in a? Show your work.