Optical Network Security Daniel Stewart. Preliminary work Dijkstra's Algorithm Dijkstra's algorithm,...

11
Optical Network Security Daniel Stewart

Transcript of Optical Network Security Daniel Stewart. Preliminary work Dijkstra's Algorithm Dijkstra's algorithm,...

Page 1: Optical Network Security Daniel Stewart. Preliminary work Dijkstra's Algorithm Dijkstra's algorithm, is a graph search algorithm that solves the single-

Optical Network Security

Daniel Stewart

Page 2: Optical Network Security Daniel Stewart. Preliminary work Dijkstra's Algorithm Dijkstra's algorithm, is a graph search algorithm that solves the single-

Preliminary work

Dijkstra's Algorithm

Dijkstra's algorithm, is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree.

• Use the shortest path tree as a routing table

• Request routes from any given node to any other node on the map

Page 3: Optical Network Security Daniel Stewart. Preliminary work Dijkstra's Algorithm Dijkstra's algorithm, is a graph search algorithm that solves the single-

B C D E F G H

20 40 50 inf 30 90 60

A F C B A C

Page 4: Optical Network Security Daniel Stewart. Preliminary work Dijkstra's Algorithm Dijkstra's algorithm, is a graph search algorithm that solves the single-

Protected Routes

Physical security risks to optical networks:• Data traveling in the same fiber

o High frequency disruptiono Amplification / attenuation

• Data traveling through the same routerso Wavelength Select Switch

(WSS) Crosstalk• Tapping

Page 5: Optical Network Security Daniel Stewart. Preliminary work Dijkstra's Algorithm Dijkstra's algorithm, is a graph search algorithm that solves the single-

Reserved route originating from node A and terminating at node D

Page 6: Optical Network Security Daniel Stewart. Preliminary work Dijkstra's Algorithm Dijkstra's algorithm, is a graph search algorithm that solves the single-

New route from node A to node D

Page 7: Optical Network Security Daniel Stewart. Preliminary work Dijkstra's Algorithm Dijkstra's algorithm, is a graph search algorithm that solves the single-

Avoiding multiple overlaps

Page 8: Optical Network Security Daniel Stewart. Preliminary work Dijkstra's Algorithm Dijkstra's algorithm, is a graph search algorithm that solves the single-

Route reserved from node B to node E

Page 9: Optical Network Security Daniel Stewart. Preliminary work Dijkstra's Algorithm Dijkstra's algorithm, is a graph search algorithm that solves the single-

Route reserved from node F to node I

Page 10: Optical Network Security Daniel Stewart. Preliminary work Dijkstra's Algorithm Dijkstra's algorithm, is a graph search algorithm that solves the single-

Two non-intersecting routes create two equal cost routes from node A to node J

Lower risk Higher risk

Page 11: Optical Network Security Daniel Stewart. Preliminary work Dijkstra's Algorithm Dijkstra's algorithm, is a graph search algorithm that solves the single-

Conclusion

• Further modification of Dijkstra's algorithm