Patent ID: 8908674

Claim:
A computer-implemented method executed by one or more computers for routing at least one traffic flow between a source node and a destination node in a network, said network comprising a plurality of nodes interconnected with each other by a plurality of links according to a predetermined network topology, comprising: representing said network with a graph, wherein the graph comprises at least a first plurality of arcs, wherein each of said first plurality of arcs comprises a structure in said network containing information describing at least one link in said network and a node in said network being adjacent to said link; determining at least one path on the graph for the at least one traffic flow based on said information, said at least one path on the graph comprising a group of said first plurality of arcs; and associating with said at least one path on the graph a respective path in said network for said at least one traffic flow, wherein representing the network with the graph comprises associating with each link of the network a number of arcs at least depending on a capability of said node of switching a lightpath from a first wavelength division multiplexing channel at an input of said node to a second wavelength division multiplexing channel at an output of said node in a strictly non-blocking way.