K sources which are connected to the Internet via links of capacity RS, and within the network fairly share a common link of capacity R to K destinations. Each destination is connected to the network by a link of capacity RD. You can assume that there are no other links or source-destination pairs in the network. Now suppose that source Si has an infinitely large file it wants to send to destination Di (i.e., each source sends to a different destination). a. If K=10, RS = 100 Mbps, Rd=10 Mbps, and R = 10 Gbps. What is the throughput between each source-destination pair? Where are the bottleneck links? b. If we now assume that K=10, RS = 100 Mbps, Rd= 100 Mbps, and R = 0.5 Gbps. What are the new throughputs between each source-destination

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

The figure depicts K sources which are connected to the Internet via links
of capacity RS, and within the network fairly share a common link of
capacity R to K destinations. Each destination is connected to the network
by a link of capacity RD. You can assume that there are no other links or
source-destination pairs in the network.
Now suppose that source Si has an infinitely large file it wants to send to
destination Di (i.e., each source sends to a different destination).


a. If K=10, RS = 100 Mbps, Rd=10 Mbps, and R = 10 Gbps. What is the
throughput between each source-destination pair? Where are the
bottleneck links?


b. If we now assume that K=10, RS = 100 Mbps, Rd= 100 Mbps, and R = 0.5
Gbps. What are the new throughputs between each source-destination
pair? Where are the bottle-neck links?


c. In scenario b above, suppose we increase the capacity of the destination
links to 1 Gbps. Will this increase the throughput between sources and
destinations? Briefly (in less than 5 sentences) explain your answer.

2. Consider the network scenario in the figure below:
Sk
S2
S1
Rs
Rs
Rs
Rd
Rd
Rd
DK
D1
D2
Transcribed Image Text:2. Consider the network scenario in the figure below: Sk S2 S1 Rs Rs Rs Rd Rd Rd DK D1 D2
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Hyperlinks
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education