- Please Do Part B Only 1 (128.41 KiB) Viewed 45 times
PLEASE DO PART B ONLY
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
PLEASE DO PART B ONLY
PLEASE DO PART B ONLY
The network shown in Figure below is a snapshot of a topology consisting of seven routers. The load on each link is normalized to a number (lick cost) indicated on that link. 12 8 R2 R4 (R5 13 3 (R7 8 3 7 R1 R3 R6 link cost a. Find the least-cost path between the two routers R1 and R7, using the shortest path approach as shown in the class (WebEx) during the lecture. b. Assume now that each router is a stand-alone device and on each link the number represents the reciprocal all of the bandwidth -for example it represents the cost the more the cost the less the bandwidth). Bandwidth BW (1) If now we assume that there is a parameter x that if we multiply with the bandwidth It provides us with the delay of the packets on each link as below: T(delay) = e-BWX (2) Please provide the steps and the solution for the following: (i) You need to estimate all the delays on all links (as per the above estimations (Equations 1 and 2) and apply the flooding algorithm (for distributing the packets from source R12 destination R7) with numbered steps for a total of 9 packets (namely packet one packet two etc is shown in our example in our class) to show the all the different steps that take place when flooding algorithm with one basis level (one- hop) is applied. (ii) Now by using the same approach as in (i) please apply the flooding algorithm to show the response and all the steps by using a two hop level approach for distributing the packets from source R1 destination R7.
The network shown in Figure below is a snapshot of a topology consisting of seven routers. The load on each link is normalized to a number (lick cost) indicated on that link. 12 8 R2 R4 (R5 13 3 (R7 8 3 7 R1 R3 R6 link cost a. Find the least-cost path between the two routers R1 and R7, using the shortest path approach as shown in the class (WebEx) during the lecture. b. Assume now that each router is a stand-alone device and on each link the number represents the reciprocal all of the bandwidth -for example it represents the cost the more the cost the less the bandwidth). Bandwidth BW (1) If now we assume that there is a parameter x that if we multiply with the bandwidth It provides us with the delay of the packets on each link as below: T(delay) = e-BWX (2) Please provide the steps and the solution for the following: (i) You need to estimate all the delays on all links (as per the above estimations (Equations 1 and 2) and apply the flooding algorithm (for distributing the packets from source R12 destination R7) with numbered steps for a total of 9 packets (namely packet one packet two etc is shown in our example in our class) to show the all the different steps that take place when flooding algorithm with one basis level (one- hop) is applied. (ii) Now by using the same approach as in (i) please apply the flooding algorithm to show the response and all the steps by using a two hop level approach for distributing the packets from source R1 destination R7.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!