Scribd
Upload
2 views3 pages

Tutorial

The document provides a tutorial on drawing network diagrams that illustrate the final state of a network after link failures using the Temporally Ordered Routing Algorithm. It includes specific examples of link failures between various nodes (B and C, G and D, A and C, A and B, and B and D) and suggests using step-by-step diagrams for clarity. The focus is on representing the network's changes through arrows and quintuples.

Uploaded by

Nsuku Colleen Ngobeni
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views3 pages

Tutorial

The document provides a tutorial on drawing network diagrams that illustrate the final state of a network after link failures using the Temporally Ordered Routing Algorithm. It includes specific examples of link failures between various nodes (B and C, G and D, A and C, A and B, and B and D) and suggests using step-by-step diagrams for clarity. The focus is on representing the network's changes through arrows and quintuples.

Uploaded by

Nsuku Colleen Ngobeni
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Tutorial

With reference to diagram below, draw a diagram including arrows and quintuples that shows what the
final network would look like after link failure between node B and node C if the Temporally Ordered
Routing Algorithm was used.

(1,E,0,-3,C) (1,E,0,-2,E)

C E

B
(0,0,0,0,B) D F
DEST

(1,D,0,0,D) (1,D,0,-1,F)

(0,0,0,2,A) (0,0,0,3,B) (0,0,0,2,F)

A B F

C E G
(1,E,0,0,E)
(1,E,0,-1,G)
(0,0,0,1,C)

(0,0,0,0,D)
D
DEST

With reference to Figure above, draw a diagram including arrows and quintuples that
shows how the final network would look like after link failures between node G and node
D if the Temporarily Ordered Routing Algorithm was used. Note that it may be
advantageous to use step by step diagrams.
(1,D,0,-2,A) (1,D,0,-1,B)

A B

C
(0,0,0,1,C)

D
(1,D,0,0,D)

G
DEST

(0,0,0,0,G)

With reference to Figure above, draw a diagram including arrows and quintuples that shows what
the final network would look like after link failure between node A and node C if the Temporarily
Ordered routing algorithm was used. Note that it may be advantageous to use step by step

With reference to diagram below, draw a diagram including arrows and quintuples that shows
what the final network would look like after link failure between node A and node B; node B and
node D if the Temporally Ordered Routing Algorithm was used
(0,0,0,2,C) (0,0,0,3,E)

(0,0,0,1,B)
C E

B
D F
(0,0,0,2,D) (0,0,0,3,F)

A
(0,0,0,0,A)
DEST

You might also like