. F = Suppose you are distributing a 10 Gbit file to N number of files. Server us = 20 Mbps It has upload speed and each es di = 1 Mbps download speed and upload speed. N = 10, Both client-server distribution and P2P for 100 and 1000 and u = 200 Kbps, 600 Kbps and 1 Mbps A chart that gives the minimum distribution time for each combination of the N and u values for the distribution prepare.

. F = Suppose you are distributing a 10 Gbit file to N number of files. Server us = 20 Mbps It has upload speed and each es di = 1 Mbps download speed and upload speed. N = 10, Both client-server distribution and P2P for 100 and 1000 and u = 200 Kbps, 600 Kbps and 1 Mbps A chart that gives the minimum distribution time for each combination of the N and u values for the distribution prepare.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter9: Integer Programming

Section9.2: Formulating Integer Programming Problems

Problem 14P

See similar textbooks

Similar questions

Suppose that I have 800 Gigabytes worth of movies on my hard drive at home, and I’d like to get them to a friend in Chicago. I could either send them over the Internet, or I could copy them to a thumb drive, drive to Chicago, and deliver them by hand. Assume that the specs for my cable connection 50 Mbps download / 10 Mbps upload, but the friend in Chicago has a cable connection which gets 25 Mbps download/5 Mbps upload. Which would be faster? Show your work. Note: you are 3 hours from Chicago
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.
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.
An ISP is granted a block of addresses starting with 160.40.0.0/16. The ISP wants to distribute these blocks to 2600 customers as follows. a. The first group has 200 medium-size businesses; each needs 128 addresses. b. The second group has 400 small businesses; each needs 16 addresses. c. The third group has 2000 households; each needs 4 addresses. Design the subblocks and give the slash notation for each subblock. Find out how many addresses are still available after these allocations.
Consider the following snapshot of a system: Allocation Max A,B,C,D A,B,C,DP0 0,2,0,2 2,3,3,8P1 1,3,2,2 3,5,2,5P2 1,2,0,1 3,4,5,1P3 2,1,1,1 3,2,1,3P4 1,0,2,0 2,3,3,1 Using the banker’s algorithm, determine whether or not each of the following states is unsafe. If thestate is safe, illustrate the order in which the processes may complete. Otherwise, illustrate why thestate is unsafe . Show algorithm procedure a. Available = (1, 2 , 0, 2)b. Available = (2, 1, 0, 2)
The previous problem is in the picture. Suppose that I have 800 Gigabytes worth of movies on my hard drive at home, and I’d like to get them to a friend in Chicago. I could either send them over the Internet, or I could copy them to a thumb drive, drive to Chicago, and deliver them by hand. Assume that the specs for my cable connection are the same as in the previous problem, but the friend in Chicago has a cable connection which gets 25 Mbps down/5 Mbps up. Which would be faster? Show your work.
In the Internet, file distribution can be performed using either a Peer-to-peer or Client-server model. Assume that an institutional network operates with the following parameters:• Client upload rate= 100• Server upload rate = 1000• Number of peers = 1000• File size = 40 kbits 4.1. Using the client-server model, please compute the time needed to distribute the file of size 40 kbits to the 1000 peers of the system. 4.2. Using the peer-to-peer model, please compute the time needed to distribute the file of size 40 kbits to the 1000 peers of the system.
Question 4 In the Internet, file distribution can be performed using either a Peer-to-peer or Client-server model. Assume that an institutional network operates with the following parameters: Client upload rate= 100 Server upload rate = 1000 Number of peers = 1000 File size = 40 kbits Using the client-server model, please compute the time needed to distribute the file of size 40 kbits to the 1000 peers of the system. Using the peer-to-peer model, please compute the time needed to distribute the file of size 40 kbits to the 1000 peers of the system. Please compare the performance of these two file distribution Please describe the key principles behind the BitTorrent protocol and how the exchange of data is performed between
Q) An ISP is granted a block of addresses starting with 150.80.0.0/16. The ISP wants to distribute these blocks to 2600 customers as follows; a) The first group has 200 medium-size businesses; each needs 128 addresses.b) The second group has 400 small businesses; each needs 16 addresses.c) The third group has 2000 households; each needs 4 addresses. Design the sub-blocks and give the slash notation for each sub-block. Find out how many addresses are still available after these allocations.
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.
A local area network (LAN) is desired to be set up in three different departments in an institution. The IP addresses of these subnets will be given manually in the format 192.168.n.h. Here n: represents the subnet, and h: represents the hosts (hosts) on that network. Suppose, in departments let the number of computers be 201, 308 and 65, respectively. Allocate IP addresses to these departments, determine the first and last IP addresses assigned, and create the table below. Show all the steps in detail in order.