Path computation systems and methods in optical networks

An optical network, comprising:

• a plurality of interconnected nodes each comprising wavelength capability constraints, wavelength availability constraints, and nodal connectivity constraints;
• and
• a path computation element associated with the plurality of interconnected photonic nodes, wherein the path computation element is configured to perform a constrained path computation through the plurality of interconnected nodes using Dijkstra's algorithm on a graph model with the photonic constraints considered therein;
• wherein the graph model represents the plurality of interconnected nodes and associated links therebetween, and wherein the graph model is modified to:
• represent each of the plurality of interconnected nodes as vertices;
• utilize directed edges to apply the wavelength capability constraints and the wavelength availability constraints;
• and
• utilize connectivity pairs as a subset of edges incident on each of the vertices to apply the nodal connectivity constraints.

A path computation element, comprising:

• a processing device configured to:
• receive photonic constraints associated with a network, wherein the photonic constraints comprise wavelength capability constraints at each node in the network, wavelength availability constraints at each node in the network, and nodal connectivity constraints of each node in the network;
• create a graph model of the network with the photonic constraints considered therein;
• and
• perform a constrained path computation in the network using Dijkstra's algorithm on the graph model of the network;
• wherein the graph model comprises:
• representation of nodes in the network as vertices;
• representation of directed edges to apply the wavelength capability constraints and the wavelength availability constraints;
• and
• representation of connectivity pairs as a subset of edges incident on each of the vertices to apply the nodal connectivity constraints.