Consider the following network. The objective is to fill the routing and forwarding tables of node X. N FA0/1…

Consider the following network. The objective is to fill the routing and forwarding tables of node X. N FA0/1…

Question:

 

Transcribed Image Text:

Consider the following network. The objective is to fill the routing and forwarding tables of node X.
N
FA0/1
12-
FAO/2
FA0/9
X FA0/5 6
W
8-
7.
V
3-
4

T
U
Q1. Draw the shortest-path tree from X
Use the Dijkstra’s algorithm to compute the shortest path from X to all the other routers, then draw the shortest path tree.
Ac Organization 0
100.40.50.0/23
Organization 1
100.40.60.0/23
Organization 2
100.40.70.0/23
Organization 3
100.40.80.0/23
ISP-A
• Network Address :
Aggregated Network
A.B.C.D/M
In the figure above, BGP is used for inter-AS routing. ISP-A is then going to advertise a single route to access all the 4 networks at the left side (i.e. networks of
Organizations 0 to 3).
• Mask:
Internet
Q1. What is the aggregated network that is advertised by ISP-A? Write down the 4 parts of the address in different input boxes. i.e. if the address is a.1.2.3.4, write
down ‘1’ in the first box, ‘2’ in the second box, etc.
Activate Windo

Expert Answer:

Answer rating: 100% (QA)

The first image asks to draw the shortest path tree from router X using Dijkstra s algorithm To answer this request we need to go through the algorith
View the full answer