1. Optical Network Security Daniel Stewart

2. 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

4. Protected Routes Physical security risks to optical networks: Data traveling in the same fiber o High frequency disruption o Amplification / attenuation Data traveling through the same routers o Wavelength Select Switch (WSS) Crosstalk Tapping

5. Reserved route originating from node A and terminating at node D

6. New route from node A to node D

7. Avoiding multiple overlaps

8. Route reserved from node B to node E

9. Route reserved from node F to node I

10. Two non-intersecting routes create two equal cost routes from node A to node J Lower riskHigher risk

11. Conclusion Further modification of Dijkstra's algorithm