Patent ID: 8634301

Claim:
A computerized method for optimizing the routing of a plurality of traffic-flow elements f traversing a network using a processor, wherein, said method comprises the steps of: obtaining a profit value w f for each of a plurality of traffic flow elements f traversing a network having at least one of a plurality of source nodes and a plurality of destination nodes, representing the expected financial gain associated with routing of said traffic flow element and a plurality of link capacity constraints of the network; calculating, using the processor and linear programming (LP), according to said profit value w f of at least some of said plurality of traffic flow elements f and said plurality of link capacity constraints, a predetermined recovery scheme having at least one backup network path for routing at least a group of said plurality of traffic flow elements while maximizing a total gained profit from said plurality of traffic flow elements before the routing of said plurality of traffic flow elements; routing said plurality of traffic-flow elements in said network; detecting at least one of a link failure and a node failure in said network; and changing the routing of said plurality of traffic-flow elements to routing according to said at least one backup network path of said predetermined recovery scheme in response to said detection.