Solved by verified expert:Answer the question that I have attached please thank you
homework_3_3.docx
Unformatted Attachment Preview
Homework 2
1. Consider the following graph representing a network with a, b, c, d, e and z routers and
the metric is the distance. (1.5 points)
Show execution of Dijkastra’s algorithm to find the shortest path from router a to all
other routers.
2. Consider the same graph representing a network where vector distance algorithm is to
be used (1.5 points)
Consider the router B. At time t, it obtain these following vectors from its neighbors I, E,
F, G and D.
D
E
F
G
I
A
11
20
24
12
17
B
15
31
26
10
18
C
22
21
15
15
12
D
0
18
17
13
22
E
18
0
19
22
23
F
17
14
0
33
24
G
10
11
27
0
25
H
6
23
23
28
29
I
19
29
33
27
0
Delay BD is 8, delay BE is 12, delay BF is 6, delay BG is 11, delay BI is 9
What is the new routing table for B based on the new estimated delay?
3. Consider the following network (1 point)
Source
Router1
Router2
Router3
Destination
Assuming Router1’s MTU is 1300, router2’s MTU is 1500 and router3’s MTU is 1000. If
Path MTU Discovery is used, describe the exchanged packets from source to destination
assuming the source sends initially packets 1600-long packet. You can show the messages
on the network diagram.
4. A network on the Internet has a subnet mask of 255.255.240.0. What is the maximum
number of hosts it can handle? (0.5 point)
5. What is the difference between transparent fragmentation and non-transparent
fragmentation. (0.5 point)
…
Purchase answer to see full
attachment
