jaredec18

Untitled

Sep 15th, 2019
163
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.92 KB | None | 0 0
  1. 1.
  2.  
  3. Consider the given data
  4.  
  5. The number of nodes K = 10
  6.  
  7. The capacity of link of the source RS = 100 Mbps
  8.  
  9. The capacity of link of the destination RD = 54 Mbps
  10.  
  11. The common link capacity R = 50 Mbps.
  12.  
  13. The common link capacity R shares equally to all K nodes. For one node, R value = R/k = 50/10 = 5 Gbps = 5000Mbps.
  14.  
  15. The throughput between each source-destination pair is the link with the lowest capacity between the sources, the destinations and the common capacity link.
  16.  
  17. Here, the lowest capacity link is the destination link.
  18.  
  19. Therefore, the throughput between each source-destination pair is 54Mbps.
  20.  
  21. The bottleneck link is the link with the low capacity than other links.
  22.  
  23. Here, the destination links have low link capacity.
  24.  
  25. Therefore, the bottleneck links are the destination links.
  26.  
  27. 2.
  28.  
  29. Consider the given data
  30.  
  31. The number of nodes K = 10
  32.  
  33. The capacity of link of the source RS = 100 Mbps
  34.  
  35. The capacity of link of the destination RD = 1 Mbps
  36.  
  37. The common link capacity R = 0.75 Gbps.
  38.  
  39. The common link capacity R shares equally to all K nodes. For one node, R value = R/k = 0.75/10 = 0.075 Gbps= 75 Mbps.
  40.  
  41. The throughput between each source-destination pair is the link with the lowest capacity between the sources, the destinations and the common capacity link.
  42.  
  43. Here, the lowest capacity link is the destination link.
  44.  
  45. Therefore, the throughput between each source-destination pair is 1Mbps.
  46.  
  47. The bottleneck link is the link with low capacity than other links.
  48.  
  49. Here, the destination links have low link capacity.
  50.  
  51. Therefore, the bottleneck links are the destination links.
  52.  
  53. 3.
  54.  
  55. Consider the same data as in question 2.
  56.  
  57. But, the capacity of the destination link RD = 100 Mbps.
  58.  
  59. Then, the capacities of the source and the destination links are equal.
  60.  
  61. The common link capacity R shares equally to all K nodes. For one node, R value = R/k = 0.75/10 = 0.075 Gbps= 75 Mbps.
  62.  
  63. The throughput between each source-destination pair is the link with the lowest capacity between the sources, the destination and the common capacity link.
  64.  
  65. Here, the lowest capacity link is the common capacity link.
  66.  
  67. Therefore, the throughput between each source-destination pair is 75 Mbps.
  68.  
  69. Hence, the throughput between each sources and destinations will increase when the capacity of the destination links increases.
  70.  
  71. The bottleneck link is the link with low capacity than other links.
  72.  
  73. Here, the common capacity link has low link capacity.
  74.  
  75. Therefore, the bottleneck links are the common capacity link.
  76.  
  77. 4.
  78.  
  79. Consider the same data as in question 1.
  80.  
  81. But, the link connecting S1 to the network has a capacity of 1 Mbps and all other values are unchanged.
  82.  
  83. Then, the throughput for S1 is 1 Mbps and the throughput for all other links between the source-destination pairs is 54 Mbps.
  84.  
  85. The bottleneck links are the source link S1 connecting to the internet and the destination links for the other source-destination pairs
Advertisement
Add Comment
Please, Sign In to add comment