EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 6, Problem P23P
Explanation of Solution
Figure 6.15:
- The figure 6.15 displays the institutional network that is connected together using four switches.
- It connects:
- Three departments (Electrical Engineering, Computer Science and Computer Engineering).
- Two servers
- One is Web server
- Another is Mail server
- Single router (contains four switches)
- It contains two sub-networks...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
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
2. Now suppose there are two links between source and destination, with one router connecting the two links. Each link is 5,000 km long. Again suppose the MP3 file is sent as one packet. Suppose there is no congestion, so that the packet is transmitted onto the second link as soon as the router receives the entire packet. What is the end-to-end delay?
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
Chapter 6 Solutions
EBK COMPUTER NETWORKING
Ch. 6 - Consider the transportation analogy in Section...Ch. 6 - If all the links in the Internet were to provide...Ch. 6 - Prob. R3RQCh. 6 - Prob. R4RQCh. 6 - Prob. R5RQCh. 6 - Prob. R6RQCh. 6 - Prob. R7RQCh. 6 - Prob. R8RQCh. 6 - Prob. R9RQCh. 6 - Prob. R10RQ
Ch. 6 - Prob. R11RQCh. 6 - Prob. R12RQCh. 6 - Prob. R13RQCh. 6 - Prob. R14RQCh. 6 - Prob. R15RQCh. 6 - Prob. R16RQCh. 6 - Suppose the information content of a packet is the...Ch. 6 - Suppose the information portion of a packet (D in...Ch. 6 - Prob. P4PCh. 6 - Prob. P5PCh. 6 - Prob. P6PCh. 6 - Prob. P7PCh. 6 - Prob. P8PCh. 6 - Prob. P9PCh. 6 - Prob. P10PCh. 6 - Prob. P11PCh. 6 - Prob. P12PCh. 6 - Prob. P13PCh. 6 - Prob. P14PCh. 6 - Prob. P15PCh. 6 - Prob. P16PCh. 6 - Prob. P17PCh. 6 - Prob. P18PCh. 6 - Prob. P19PCh. 6 - Prob. P20PCh. 6 - Prob. P21PCh. 6 - Prob. P22PCh. 6 - Prob. P23PCh. 6 - Prob. P24PCh. 6 - Prob. P25PCh. 6 - Prob. P26PCh. 6 - Prob. P27PCh. 6 - Prob. P32PCh. 6 - Prob. P33P
Knowledge Booster
Similar questions
- What is the total delay (latency) for a frame of size 5 million bits that is being sent on a link with 10 routers each having a queuing time of 2 µs and a processing time of 1 µs. The length of the link is 2000 Km. The speed of light inside the link is 2×108 m/s. The link has a bandwidth of 5 Mbps. Which component of the total delay is dominant? Which one is negligible?arrow_forwarda. Suppose N packets arrive simultaneously to a link at which no packets are currently being transmitted or queued. Each packet is of length L and the link has transmission rate R. What is the average queuing delay for the N packets? b. Now suppose that N such packets arrive to the link every LN/R seconds. What is the average queuing delay of a packet?arrow_forwardSuppose users share a 2 Mbps link. Also suppose each user transmits continuously at 1 Mbps when transmitting, but each user transmits only 20 percent of the time. (See the discussion of statistical multiplexing in Section 1.3.) a. When circuit switching is used, how many users can be supported? b. For the remainder of this problem, suppose packet switching is used. Why will there be essentially no queuing delay before the link if two or fewer users transmit at the same time? Why will there be a queuing delay if three users transmit at the same time? c. Find the probability that a given user is transmitting. d. Suppose now there are three users. Find the probability that at any given time, all three users are transmitting simultaneously. Find the fraction of time during which the queue grows.arrow_forward
- 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:arrow_forwardAssume that 2 packets arrive simultaneously to a switch at which one other packet is halfway done being transmitted on the outbound link and two other packets are waiting to be transmitted. Each packets is of length N = 1600 bytes and the outbound link has transmission rate R = 1.28 Mbps. Assume that the queuing buffer is big enough to hold at least five packets. What is the average queuing delay for the arriving 2 packets?arrow_forwardSuppose Host A wants to send a large 8 million bytes of file to Host B. The path from Host A to Host B has three links, of rates R1 = 1.5 Mbps, R2 = 2 Mbps, and R3 = 1 Mbps. Assuming no other traffic in the network. Roughly how long will it take to transfer the file to Host B?arrow_forward
- 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)?arrow_forwardSuppose that there are three inter-media nodes between Host 1 and Host 2, and the transmission rate of each link is 4.096 Mbps. The time of end-to-end circuit established is 0.5 second. How much seconds does it take to send a file of 8.192M byte from host H1 to host H2 over a packet-switched network?arrow_forwardMaximum end-end throughput (e). Consider the scenario below where 4 TCP senders are connected to 4 receivers. Servers 1 - 3 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). Server 4 has nothing to send, so its sending rate is zero. Suppose that R = 1 Gbps, Rc is 300 Mbps and Rs is 400 Mbps. What is the TCP throughput achieved on each of the 3 sctive-sending connections? A. 4R B. Rc C. R/4…arrow_forward
- TCP a. Consider two TCP connections, one between Hosts A (sender) and B (receiver), and another between Hosts C (sender) and D (receiver). The RTT between A and B is half that of the RTT between C and D. Suppose that the senders' (A's and C's) congestion window sizes are identical. Is their throughput (number of segments transmitted per second) the same? Explain. b. Now suppose that the average RTT between A and B, and C and D are identical. The RTT between A and B is constant (never varies), but the RTT between C and D varies considerably. Will the TCP timer values of the two connections differ, and if so, how are they different, and why are they different? Give one reason why TCP uses a three-way (SYN, SYNACK, ACK) handshake rather than a two-way handshake to initiate a connection. a.arrow_forwardA packet switch receives a packet and determines the outbound link to which the packet should be forwarded. When the packet arrives, one other packet is halfway done being transmitted on this outbound link and four other packets are waiting to be transmitted. Packets are transmitted in order of arrival. Suppose all packets are 1,200 bytes and the link rate is 2 Mbps. What is the queuing delay for the packet? More generally, what is the queuing delay when all packets have length L, the transmission rate is R, x bits of the currently-being-transmitted packet have been transmitted, and n packets are already in the queue?arrow_forwardConsider 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?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole
Principles of Information Security (MindTap Cours...Computer ScienceISBN:9781337102063Author:Michael E. Whitman, Herbert J. MattordPublisher:Cengage Learning
Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole
Principles of Information Security (MindTap Cours...
Computer Science
ISBN:9781337102063
Author:Michael E. Whitman, Herbert J. Mattord
Publisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning