6c. Utilization. Consider the scenario shown below, with a two clients sending to a server. The links attached to clients each have a capacity of R= R2 = 10 Mbps. The link from the router to the server has a capacity of and R3 = 100 Mbps, which is shared evenly between the two sources when they are each sending at their maximum rate. R R2 What is the utilization of the R, and R3 links, assuming that the clients are trying to send their maximum rates?

6c. Utilization. Consider the scenario shown below, with a two clients sending to a server. The links attached to clients each have a capacity of R= R2 = 10 Mbps. The link from the router to the server has a capacity of and R3 = 100 Mbps, which is shared evenly between the two sources when they are each sending at their maximum rate. R R2 What is the utilization of the R, and R3 links, assuming that the clients are trying to send their maximum rates?

Principles of Information Security (MindTap Course List)

6th Edition

ISBN:9781337102063

Author:Michael E. Whitman, Herbert J. Mattord

Publisher:Michael E. Whitman, Herbert J. Mattord

Chapter6: Security Technology: Access Controls, Firewalls, And Vpns

Section: Chapter Questions

Problem 2RQ

See similar textbooks

Similar questions

Consider the extended LAN connected using bridges B1 and B2 in the Figure given below. H1 shown in the figure is a hub which has the property of taking an input on one port and forwarding it on all other ports. Suppose the forwarding tables in the two bridges are empty. List all ports on which a packet will be forwarded by bridges B1 and B2 for the following sequence of data transmissions: a) A sends a packet to C b) E sends a packet to F c) F sends a packet to E d) G sends a packet to E e) D sends a packet to A f) B sends a packet to F
Consider a short, 10-meter link, over which a sender can transmit at a rate of 150 bits/sec in both directions. Suppose that packets containing data are 100,000 bits long, and packets containing only control (e.g., ACK or handshaking) are 200 bits long. Assume that N parallel connections each get 1/N of the link bandwidth. Now consider the HTTP protocol, and suppose that each downloaded object is 100 Kbits long, and that the initial downloaded object contains 10 referenced objects from the same sender. Would parallel downloads via parallel instances of non-persistent HTTP make sense in this case? Now consider persistent HTTP. Do you expect significant gains over the non-persistent case? Justify and explain your answer
According to the given figure, assume that, PC0 wants to send a message to PC4. If the distance between the two points is 22,000 km, 3.2-kbyte message sends in 2.4 x 100000000 mls speed through cable and the transmission link has 1.5 Gbps Bandwidth. When the message arrives at Routers , Router0 already has 4 packets to process in the queue and each will need 2ms. Router1 has no packets in the queue, but if it had then would require 3ms to process. Router2 already has 5 packets to process in the queue and each will need 1ms. Calculate the total time to send the message from PC0 to PC4.
Consider the following diagram: A,B,C and D are subnets, R1, R2, and R3 are routers. Default signifies theentire rest of the internet. All 4 subnets each contain the same number of hosts.Consider the following routing table at R3: CIDR Mask Link 0.0.0.0/0 L4 128.4.6.0/24 L3 128.4.8.0/24 L5 1. If 128.4.6.0 is in A, what is the routing table at R1? 2. The ISP that owns all these networks is short on IP addresses, so theyuse a NAT router for R2. How many public IP addresses will C andD use together assuming they use as many private 10.X IP addresses asthey can? How many total public IP addresses will be used by the entirenetwork? Why doesn’t the ISP care about how many private IP addressesare used? 3. Fix R3’s routing table now that we are using NAT: 4. A node in C is given the IP address 10.0.0.1 and only sends and receivespackets on port 1234. A packet destined for this node reaches R2 witha source of (IP=128.4.6.6, Port=3000) and destination of (IP=128.4.8.0,Port=10000).…
Consider a network with 4 links between two hosts where the maximum allowable packet size is 1000 bits; each link has a transmission rate of 2000 bits per second, except the second link has a transmission rate of 1000 bits per second. How long does it take to send 6000 bits from one host to the other? You may ignore propogation delay, assume there is no other traffic on the network, and assume that no routers drop packets due to queue length. Round your answer to two decimal places.
Consider this multihpop network running the 802.11 MAC protocol in ad-hoc mode (RTS-CTS-DATA-ACK) and a link speed of 1 Mbps: A === B === C === D Edges ‘===’ represent connectivity, so, for instance, nodes B and C can communicate with each other directly, but A and C cannot. All nodes are able to route packets on behalf of the other nodes and they employ store-and-forward to deliver packets to the destination. Suppose nodes A, B, and C have to send a lot of data frames to node D and have their link layer queue always full. What is the average data rate for A, B, and C assuming no DATA frames get lost due collisions? Explain your answer. Compare the data rates with the link rate.
Consider a scenario in which Host A and Host B want to send messages to Host C. Hosts A and C are connected by a channel that can lose and corrupt (but not reorder) messages. Hosts B and C are connected by another channel (independent of the channel connecting A and C) with the same properties. The transport layer at Host C should alternate in delivering messages from A and B to the layer above (that is, it should first deliver the data from a packet from A, then the data from a packet from B, and so on). Design a stop-and-wait-like error-control protocol for reliably transferring packets from A and B to C, with alternating delivery at C as described above. Give FSM descriptions of A and C.
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 of the client links (with transmission capacity RC)? 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). The utilization of client link is:
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)?
Consider the scenario below where 4 TCP senders are connected to 4 receivers. The servers transmit to the receiving hosts at the fastest rate possible (i.e., at the rate at which the bottleneck link between a server and its destination is operating at 100% utilization, and is fairly shared among the connections passing through that link). R =1 Gbps and Rc is 300 Mbps and Rs is 400 Mbps. And that all four senders have data to send, What is the minimum value of Re that will ensure that the connections to Host-1 and Host-2 are not bottlenecked at links with capacity Rc or Re?
Consider the following configuration to connect host A to host B through the three middle nodes with using packet switching to forward packets. Assume the throughput rates for links are R1= 10Mbps, R2=15Mbps, R3=7Mbps, and R4= 10Mbps. How long takes to transfer a file with size of 500MB from host A to Host B? (No queuing, processing delay)?
1.4.12.2 End-to-end Delay. Consider again the network shown above. The links again have transmission rates of R1 = R2 = 100 Mbps (i.e., 100 x 106 bits per second), and each packet is 1 Mbit (106 bits) in size. Assume that the propagation delay is 1 msec per link. What is the end-to-end delay of a packet from when it first begins transmission at the sender, until it is received in full by the server at the end of the rightmost link. Assume store-and forward packet transmission. You can assume the queueing delay is zero. Answer choices: A. 2 x 106 msec b. 2.01 msec C. 1.1 msec D. 2.02 msec 1.4.12.3 Maximum Throughput. Consider again the network shown above. The links again have transmission rates of R1 = R2 = 100 Mbps Assume that the link R2 is fairly shared (as we've seen is done via TCP) between the two sessions. What is the maximum end-to-end throughput achieve by each session, assuming both sessions are sending at the maximum rate possible? Answer choices:…