Optical Network Security

Daniel Stewart

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

B C D E F G H

20 40 50 inf 30 90 60

A F C B A C

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

Reserved route originating from node A and terminating at node D

New route from node A to node D

Avoiding multiple overlaps

Route reserved from node B to node E

Route reserved from node F to node I

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

Lower risk Higher risk

Conclusion

• Further modification of Dijkstra's algorithm