A file of F = 3 x 105bits is distributed to N 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.

A file of F = 3 x 105bits is distributed to N 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.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.5: The M/m/1/gd/c/∞ Queuing System

Problem 3P

See similar textbooks

Similar questions

DONT COPY FROM CHEGG!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! A communication line capable of transmitting at a rate of 50 Kbits/secwill be used to accommodate 10 sessions each generating Poisson traffic at a rate 150 packets/min.Packet length are exponentially distributed with mean 1000 bits. For each session, find the averagenumber of packets in queue, the average number in the system, and the average delay per packetwhen the line is allocated to the sessions by using:i) 10 equal-capacity time-division multiplexed channels;ii) statistical multiplexing
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.
Consider the figure used to illustrate Web caching below. Suppose that the access link capacity is C bits/sec and the average object size is S bits and that the average request rate from the institution’s browsers to the origin servers is A requests/sec. Also, suppose that the amount of time it takes from when the router on the Internet side of the access link forwards an HTTP request until it receives the response is T secondson average. Model the total average response time perceived by the institutional users as the sum of the average access delay (that is, the delay from the Internet router to institution router) and the average Internet delay. For the average access delay, use D/(1 − DB), where D is the average time required to transmit an object over the access link and B is the arrival rate of objects to the access link. Note that this access delay includes both the transmission and queuing delays. (Note also that B = A if there isno caching.) Ignore the details of persistent or…
Consider the figure used to illustrate Web caching below. Suppose that the access link capacity is C bits/sec and the average object size is S bits and that the average request rate from the institution’s browsers to the origin servers is A requests/sec. Also, suppose that the amount of time it takes from when the router on the Internet side of the access link forwards an HTTP request until it receives the response is T secondson average. Model the total average response time perceived by the institutional users as the sum of the average access delay (that is, the delay from the Internet router to institution router) and the average Internet delay. For the average access delay, use D/(1 − DB), where D is the average time required to transmit an object over the access link and B is the arrival rate of objects to the access link. Note that this access delay includes both the transmission and queuing delays. (Note also that B = A if there isno caching.) Ignore the details of persistent or…
Suppose nodes A and B are on the same 10 Mbps broadcast channel, and the propagation delay between the two nodes is 245 bit-times. Suppose A and B send Ethernet frames at the same time. Suppose the transmission time of the entire frame is 295 bit-times. So, the frames collide, and then A and B choose different values of K in the CSMA/CD algorithm. A node chooses the value of K at random from {0,1,2,...2n−1} where n is the number of collisions experienced on the channel – note n is set to 1 in this case). For Ethernet, the actual amount of time a node waits is K*512 bit times (i.e., K times the amount of time needed to send 512 bits into the Ethernet). Suppose A chooses a K value of 0 and B chooses a K value of 1. Assuming no other nodes are active, can the retransmissions from A and B collide? Justify your answer by showing all the intermediate steps of your calculations.
Suppose we have n+m servers, of which nn have Intel CPUs and mm have AMD CPUs. Suppose also that Intel CPUs are vulnerable to a ping attack that remotely crashes the server, but AMD CPUs are not. If we pick a server at random and ping it, what is the probability that at least k pings are needed to produce a crash?
A slotted ALOHA system with N nodes. Each node transmits a frame in a slot with probability 0.26. If we want the efficiency of the link to be greater than 0.3, what is the minimum and maximum number of nodes?
Consider a node in a network running the BECA topology. Three timer parameters are Ta = 10s, Ty = 2s and Ta = 3s. Assume the node just start on its sleep mode at time Os. Threre routing traffic in the network that it can potentially participate in at times 5s, 11s and 13s. The node aiso has some local data of its own to send at 19s. Given this information, draw a ime line showing periods when the node is asleep, listen and active mode.
Consider the three words in the network A, B, and C. The host sends a 700-bit packet to the host saw via the host b tree. The propagation speed from A to B is 2 *10 power 8 metres per second, and the propagation speed from B to C is 3 *10 power 8 metres per second. The distance between hosts a and b is in the thousands of kilometres. B and C are separated by 1500 kilometres. The a-b and b-c RCM connection bandwidth is 5 Mbps. What is the packet's end-to-end delay?
Suppose we have n+m servers, of which nn have Intel CPUs and mm have AMD CPUs. Suppose also that Intel CPUs are vulnerable to a ping attack that remotely crashes the server, but AMD CPUs are not. If we pick a server at random and ping it, what is the probability that the kth ping is the first that causes a crash?
6.4-6. Self Learning Switches (c). Consider the network below with six nodes, star-connected into an Ethernet switch. Suppose that A sends a frame to A', A’ replies to A, then B sends a message to B’ and B’ replies to B, and then A sends to B and B replies to A. In this sequence of frame transmissions, how many frames have appeared at the interface at C'? Assume that the switch's table is initially empty. [Note: You can find more examples of problems similar to this here.]
In a network scenario, access link rate is 2 Mbps, RTT from the company router to server is 2 sec and web object size is 100K bits. If the average request rate from browsers to origin servers is 18 requests per second, what is the access link utilization? What are the problems associated with high link utilization? If a cache server with hit rate of 60% is used, what is the access link utilization?