Photonic Networks Project: O-E-O Topology, Optical Bypass and Analysis

This project analyzes photonic networks, specifically focusing on O-E-O (Optical-Electrical-Optical) network topology and optical bypass-enabled networks. The assignment explores the shortest path and alternative paths within O-E-O networks, utilizing graph transformation techniques to visualize and analyze network structures. It investigates two-link node disjoint paths to enhance network reliability and efficiency, comparing minimum summary metrics to identify the best path. The project also examines optical bypass networks, determining reachability and employing graph transformations to optimize network performance. The project includes detailed diagrams, and references, providing a comprehensive understanding of photonic network concepts and analysis methods.

PHOTONICS NETWORKS

Table of Contents
Question - 1..........................................................................................................................................2
Question - 2..........................................................................................................................................4
Question – 3..........................................................................................................................................7
References............................................................................................................................................7
1

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

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

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

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

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

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

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

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

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