1.4.11 Computing maximum thoughput. Consider the scenario shown below, with 10 different servers (three shown) connected to 10 different clients over ten three- hop paths. The pairs share a common middle hop with a transmission capacity of R-300 Mbps. The four links from the servers to the shared link have a transmission capacity of Rs 90 Mbps. Each of the four links from the shared middle link to a client has a transmission capacity of Rc-50 Mbps. What is the end-end maximum throughput on one of the the-hop poths, assuming all servers are sending at the maximum rote possible to their clienti? Answers 30 Mbps 300 Mbps 90 Mbps 50 Mbps 440 Mbps

1.4.11 Computing maximum thoughput. Consider the scenario shown below, with 10 different servers (three shown) connected to 10 different clients over ten three- hop paths. The pairs share a common middle hop with a transmission capacity of R-300 Mbps. The four links from the servers to the shared link have a transmission capacity of Rs 90 Mbps. Each of the four links from the shared middle link to a client has a transmission capacity of Rc-50 Mbps. What is the end-end maximum throughput on one of the the-hop poths, assuming all servers are sending at the maximum rote possible to their clienti? Answers 30 Mbps 300 Mbps 90 Mbps 50 Mbps 440 Mbps

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 8P

See similar textbooks

Similar questions

1.4.11 Computing maximum thoughput. Consider the scenario shown below, with 10 different servers (three shown) connected to 10 different dients over ten three- hop paths. The pairs share a common middle hop with a transmission capacity of R-300 Mbps. The four links from the servers to the shared link have a transmission capacity of Re90 Mbps. Each of the four links from the shared middle link to a client has a transmission capacity of Re-50 Mbps. What is the end-end maximum throughput on one of the the-hop poths, assuming all servers are sending at the maximum rate possible to their clienti? Answers: 30 Mbps 300 Mbps 90 Mbps 50 Mbps 440 Mbps
quickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk
1.4-2 Maximum end-end throughput. Consider the scenario shown below, with 10 different servers (four shown) connected to 10 different clients over ten three-hop paths. The pairs share a common middle hop with a transmission capacity of R= 200 Mbps. Each link from a server has to the shared link has a transmission capacity of Rs = 25 Mbps. Each link from the shared middle link to a client has a transmission capacity of Rc = 50 Mbps. Server-1 Host-1 Server-2 N Rs Rc Host-2 Rc R Server-10 Rs Rc... www Rc Host-10 What is the maximum achievable end-end throughput (in Mbps, give an integer value) for each of ten client-to-server pairs, assuming that the middle link is fairly shared and all servers are trying to send at their maximum rate?
Consider delivering voice through a direct connection network from Host A to Host B. (for example, Internet phone). Host A dynamically transforms analogue speech to a digital 64Kbps bit stream. The bits are subsequently organised into 128-byte packets by Host A. Between Host A and Host B, there is a single connection with a capacity of 10Mbps and a propagation latency of 50 msec. When Host A collects a packet, it immediately delivers it to Host B. When Host B gets a complete packet, it transforms its bits to an analogue signal. How long does it take for a bit to be produced (from the original analogue signal at Host A) and decoded (as a component of the analogue signal at Host B)? Disregard the time required for decoding.
Consider the scenario shown below, with 10 different servers (four shown) connected to 10 different clients over ten three-hop paths. The pairs share a common middle hop with a transmission capacity of R = 200 Mbps. Each link from a server has to the shared link has a transmission capacity of RS = 25 Mbps. Each link from the shared middle link to a client has a transmission capacity of RC = 50 Mbps. What is the maximum achievable end-end throughput (in Mbps, give an integer value) for each of ten client-to-server pairs, assuming that the middle link is fairly shared and all servers are trying to send at their maximum rate? Group of answer choices 200 Mbps 20 Mbps 275 Mbps 25 Mbps 50 Mbps
Consider the scenario shown below, with four different servers connected to four different clients over four three-hop paths. The four pairs share a common middle hop with a transmission capacity of R = 200 Mbps. The four links from the servers to the shared link have a transmission capacity of RS = 90 Mbps. Each of the four links from the shared middle link to a client has a transmission capacity of RC = 10 Mbps. You might want to review Figure 1.20 in the text before answering the following questions• What is the maximum achievable end-end throughput (in Mbps) for each of four client-to-server pairs, assuming that the middle link is shared (divides its transmission rate equally)? • Which link is the bottleneck link? Format as Rc, Rs, or R • Assuming that the servers are sending at the maximum rate possible, what are the link utilizations for the server links (RS)? Answer as a decimal • Assuming that the servers are sending at the maximum rate possible, what are the link utilizations…
Consider the scenario shown below, with four different servers connected to four different clients over four three-hop paths. The four pairs share a common middle hop with a transmission capacity of R = 300 Mbps. The four links from the servers to the shared link have a transmission capacity of RS = 50 Mbps. Each of the four links from the shared middle link to a client has a transmission capacity of RC = 90 Mbps.......Assuming that the servers are all sending at their maximum rate possible, what are the link utilizations for the server links (with transmission capacity RS)? Enter your answer in a decimal form of 1.00 (if the utilization is 1) or 0.xx (if the utilization is less than 1, rounded to the closest xx)?
Assume a 10Mbps Ethernet has two nodes, A and B, connected by a 360m cable with threerepeaters in between, and they each have one frame of 1,024 bits to send to each other. Further assumethat the signal propagation speed across the cable is 2*10^8 m/sec, CSMA/CD uses back-off intervals ofmultiples of 512 bits, and each repeater will insert a store-and-forward delay equivalent to 20-bittransmission time. At time t=0, both A and B attempt to transmit. After the first collision, A draws K = 0and B draws K = 1 in the exponential back-off protocol after sending the 48bits jam signal. a. What is the one-way propagation delay (including all repeater delays) between A and B inseconds? At what time is A's packet completely delivered at B? b. Now suppose that only A has a packet to send and that the repeaters are replaced with switches.Suppose that each switch has an 8-bit processing delay in addition to a store-and-forward delay.At what time, in seconds, is A's packet delivered at B?
Consider a local network with a 1 Gbps access link to the Internet. Hosts on this network are accessing resources with an average size of 2 MB from a distant server at an average rate of 50 requests per second. a. What is the link utilization of the access link to the internet? b. Suppose these requests were to go through a caching proxy server. What would the link utilization to the internet be if half of all requests were served from the cache of the proxy server? с. resources never being needed for example.) Would this still provide any advantages to the end user? Would there be any disadvantages to the end user? Suppose the proxy server could not serve any content from cache (due to the same
1. Consider that two hosts A and B are connected via a direct link with transmission rate of 30 Mbps. Host A wants to send a file of 1 MB to Host B. The distance between Host A and Host B is 100 Km and the propagation speed over the link is 2*10 m/s. The processing delay at Host A is 20 us. A В a. What is the propagation delay over the link from Host A to Host B? b. What is the transmission delay if the file is sent as one large packet? с. What is the total time needed for the file to arrive to Host B?
Consider a local area network (LAN) with multiple stations connected to the same bus using the Carrier Sense Multiple Access with Collision Detection (CSMA/CD) protocol for medium access control. Assume that each station has a packet to transmit and follows the CSMA/CD protocol to access the medium. The first station to sense the medium finds it idle and starts transmitting its packet. The second station also senses the medium as idle and starts transmitting its packet, but halfway through the transmission, it detects a collision with the first station’s packet. After detecting the collision, the second station follows the backoff and retransmission procedure specified by the CSMA/CD protocol. Assume that the backoff algorithm uses binary exponential backoff with a maximum number of retries of 10 and that the slot time is 512 bit times. (a) What is the minimum number of slots the second station must wait before attempting to retransmit its packet after detecting the collision? Show…
Assume a client is connected to the server and has already received an HTML webpage. It reads the webpage, and it now needs to get 3 new files, File A is 5 MB file B is 1 MB and file C is 1 KB. The client requests the files in the order A B C. The link has an RTT (round trip time) of 0.5 seconds and a bandwidth of 8 Mb/s(Megabits per second) (or 1 Megabyte per second). The client can reuse the open connection if the protocol allows it to. For all parts of this problem ignore header sizes, and start the timer when the client sends How long does it take to get file C under HTTP 0? How long does it take to get file C under HTTP 1 (assume the browser does not support pipeling)? How long does it take to get file C under HTTP 2 assuming a frame size of 1 KB and no server push? What event would make HTTP 3 faster than HTTP 2 for this use case (ignore TLS)?