Patent Document ID: 8854997
Application ID: 13233137
Patent Flag: 1

Claim One:
1. A shortest path routing method in a network with non-fully meshed vertices, comprising: using a controller coupled to a plurality of interconnected network elements, the controller configured to perform steps of; defining vertices for each degree in the network at each node in the network, the vertices at each degree comprising an ingress vertex and an egress vertex, wherein at least one node in the network comprises degrees which are not fully-meshed internally such that some of the degrees are not connected to one another directly internally at the at least one node and have no interconnectivity for signals between them; and implementing a Dijkstra algorithm in a constrained manner to determine a shortest, bidirectional path through the network between two degrees in the network; wherein each degree in the network, except for the degrees which are not fully-meshed, is configured to receive an ingress signal from an edge and transmit an egress signal to another degree at a same node for transmission to another edge; and wherein the each degree in the network is configured to receive an input signal from the edge and transmit an output signal to the edge, the edge comprising a bidirectional link.