Network Reachability and Disjoint Paths

Verified

Added on  2020/04/21

|11
|724
|403
AI Summary
The assignment delves into the concept of network reachability graphs, illustrating how to represent connectivity between nodes in a network. It then focuses on finding two link node disjoint paths within a given graph, demonstrating a specific path example. The assignment concludes with a list of references for further exploration of network topology concepts.

Contribute Materials

Your contribution can guide someone’s learning journey. Share your documents today.
Document Page
PHOTONICS NETWORKS

Secure Best Marks with AI Grader

Need help grading? Try our AI Grader for instant feedback on your assignments.
Document Page
Table of Contents
Question - 1..........................................................................................................................................2
Question - 2..........................................................................................................................................4
Question – 3..........................................................................................................................................7
References............................................................................................................................................7
1
Document Page
Question - 1
O-E-O Network Topology
Here, Node A is a Source and Node Z is a Destination
A)
Shortest Path
The O-E-O Network topology shortest path is shown in below (Nookaew, n.d.).
Graph Transformation
The O-E-O Network topology Graph Transformation is shown in below.
2
A CB Z
Graph Transformation
Document Page
3
A
E
B Z
D
C
G
F
I
H J
K
L
Path - 2
Path - 1
Path - 3
Path - 4
1 2 3
5
7
8
9
10 11
12 13
14
15
6
A
Z
1
2
7
11
3
5
8
9
12
13
10
4
4
14
15

Secure Best Marks with AI Grader

Need help grading? Try our AI Grader for instant feedback on your assignments.
Document Page
Alternative Path
The O-E-O Network topology Alternative path is shown in below (Rendell, n.d.).
Two link node disjoint path
The two link node disjoint path is shown in below.
Comparison of minimum summary metrics and graph transformation is provide the best path
for O-E-O network topology. These two methods are used to provide the minimum summary
metrics for a network topology (Kuratowski, 2014)
.
4
A
E
B Z
D
A CB Z
A
E
Z
D
Document Page
Question - 2
O-E-O Network Topology
Two link node disjoint path
Here, first assigned the dummy sources is K and destination is L.
The two link node disjoint path is shown in below (Hocking, 2012).
5
A YJ L
A ZJ L
B GF Z
B HI Y
Document Page
Transformed Topology
The transformed topology is shown in below.
6
L
Y
J
I
F
B
G
D
E
H
C
K
Z
A
17
8
14
1
2
15
3
16
45
11
6
10
13
12
7
9
18

Paraphrase This Document

Need a fresh take? Get an instant paraphrase of this document with our AI Paraphraser
Document Page
Question – 3
Optical-Bypass-Enabled Network
Optical Reach is 2000km by using the following path such as H-F-G-J.
7
A
B
Y
Z
1 2
10
8
9
4 3
18
14
11
12
5 6
7
13
Document Page
A) Graph Transformation
8
E
H
K
A
B
F
C
D
H
G
JI
L M
1
2 3
5
6
14
7
8
12
13
9
11
4
10
15
16
17
H
A
B
F
C
D
H
G
J
1
2 3
5
6
14
8
13
9
11
4
10
17
Document Page
B) Reachability Graph
Two link node disjoint path
The two link node disjoint path is shown in below.
9
H
A
F
H
G500 500
500
J
Source Destination
K
L M
15
16
A JH Z
B GF J

Secure Best Marks with AI Grader

Need help grading? Try our AI Grader for instant feedback on your assignments.
Document Page
References
Hocking, J. (2012). Topology. Dover Publications.
Kuratowski, K. (2014). Topology. Elsevier Science.
Nookaew, I. (n.d.). Network Topology.
Rendell, C. (n.d.). Network Topologies.
10
1 out of 11
circle_padding
hide_on_mobile
zoom_out_icon
[object Object]

Your All-in-One AI-Powered Toolkit for Academic Success.

Available 24*7 on WhatsApp / Email

[object Object]