5. [1.5] Suppose distributing a file of F = 15 Gbits to N peers. The server has an upload rate of us= 30Mbps, and each peer has a download rate of d; = 2Mbps and an upload rate of u. For N = 10, 100, and 1000and u = 300 Kbps, 700 Kbps, and 2 Mbps, prepare a chart giving the minimum distribution time for eachof the combinations of N and u for both client-server distribution and P2P distribution. (Hints: 300Kbps =300/1024 Mbps.)

Here we have to calculate the minimum distribution time to distribute a file of size (F=15 Gbits) to…

Answered: 5. [1.5] Suppose distributing a file of…

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

Problem 1 A user in Beirut, connected to the internet via an 8 Mb/s connection (R = 8 Mb/s), retrieves a web page from a server in California (size of the web page = L = 50 Kbytes). The web page references 9 images on the same server (size .of each image = | = 310 Kbytes) Assume that the distance between Beirut and California is 15000Km, the average speed of .electrons in the used wire is 2 x 10^8 m/s :Find the one-way propagation delay * 90 msec O 80 msec O 75 msec 50 msec None of the mentioned
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 data, and an initial 2 × RTT of "handshaking" before data is sent: (a) The bandwidth is 10 Mbps, and data packets can be sent continuously. (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.
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.
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 bandwidth is 10 Mbps, and data packets can be sent continuously. The bandwidth is 10 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.
(a) Suppose a server S and client C are connected over the Internet. The one-way prop- agation delay from S to C is 50 ms. The maximum throughput between S and C is R = 200 Mbps. A browser on client C makes an HTTP request for a webpage on server S. The base HTML file is of size 500 KB and it references five objects, each of size 5 MB. Find the total response time for the client to receive the entire webpage using nonpersistent HTTP with up to two parallel connections. Assume that when two par- allel connections are active, the throughput for each connection is 40% of the maximum throughput R. (b) Suppose an application running on host ece.gmu.edu needs to resolve the domain name cs.vtech.edu. Draw a diagram (with labels) showing the sequence of queries/responses in a recursive DNS query to find the answer in a scenario where all levels of the DNS hierarchy are involved.
A frame containing http request is sent from Computer (A) [in whichever subnet it is now, make sure to show it in your figure], to the access point it is associated with. Draw the address fields (1, 2, and 3) of the frame travelling from Computer A to AP and the source and destination addresses of the frame travelling from AP to R1. The MAC addresses of AP1, AP2, and AP3 are M1, M2, and M3 respectively, and the Router R1’s MAC address connected to this Switch/AP is MRA. IP address values are already given, and the port addresses could also be used as given. The Router’s MAC address facing WAN side is MRW.
. 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.
Network & Data Communcations
Describe the working of recursive and iterative queries in DNS. Use figures for the description. A file of F = 3 x 105 bits is distributed to N peers. The server has an upload rate of us = 1 x 105 bps. Each peer has a download rate of di = 1 x 105 bps and an upload rate of u = 30,000 bps. For N = 1 to 10, and for both client-server and P2P architectures, plot a single graph with minimum distribution time on the y-axis and N on the x-axis. Use a table to show all the values for N = 1 to 10 and use the values to plot the graph. Clearly show the calculation only for N = 1, 2, and 3. Explain at least one P2P application (BitTorrent or DHT) in detail.
3) Consider a 1 Mbps token ring having N stations (assume N=50), each with infinite buffer size. Each station generates 10 messages per sec. The average message length is 1000 bit. The stations are equally spaced on the ring and the ring is of length I Km and has a propagation speed of 3 x 10 meter/ sec. Determine average cycle time Te (i.e., scan time), the approximate average channel access time, and the average dwell time per visit of the server at any station.
IN PYTHON Given the following six-node wide area network for which the numbers attached to the links are a measure of the “delay” in using that link (e.g., some lines could be more heavily used than others and therefore have a longer wait time), answer the following question. What is the shortest path from node A to node D, where shortest path is defined as the path with the smallest sum of the delays on each individual link? Explain exactly how you went about finding that path.

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS