Abstract: Shortest path routing systems and methods are presented for networks with non-fully meshed vertices or nodes. The systems and methods may include a shortest path routing method in a network with non-fully meshed vertices, a network with non-fully meshed vertices, and a system for implementing the shortest path routing methods. The shortest path routing systems and methods include modifications to the Dijkstra algorithm to more accurately model a network, such as an optical or photonic network. In an exemplary embodiment, the Dijkstra algorithm is modified to represent degrees at a site with an ingress vertex (e.g., a demultiplexer) and an egress vertex (e.g., a multiplexer). In another exemplary embodiment, in addition to representing degrees as ingress and egress vertices, the Dijkstra algorithm is modified to maintain knowledge of previously visited degrees to prevent revisiting a same degree in determining a shortest path.

Abstract: Shortest path routing systems and methods are presented for networks with non-fully meshed vertices or nodes. The systems and methods may include a shortest path routing method in a network with non-fully meshed vertices, a network with non-fully meshed vertices, and a system for implementing the shortest path routing methods. The shortest path routing systems and methods include modifications to the Dijkstra algorithm to more accurately model a network, such as an optical or photonic network. In an exemplary embodiment, the Dijkstra algorithm is modified to represent degrees at a site with an ingress vertex (e.g., a demultiplexer) and an egress vertex (e.g., a multiplexer). In another exemplary embodiment, in addition to representing degrees as ingress and egress vertices, the Dijkstra algorithm is modified to maintain knowledge of previously visited degrees to prevent revisiting a same degree in determining a shortest path.