The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Dec. 16, 2008
Filed:
Sep. 05, 2003
Mansoor Ali Khan Alicherry, Scotch Plains, NJ (US);
Harsha S. Nagesh, New Providence, NJ (US);
Chitra A. Phadke, Basking Ridge, NJ (US);
Viswanath Poosala, Basking Ridge, NJ (US);
Mansoor Ali Khan Alicherry, Scotch Plains, NJ (US);
Harsha S. Nagesh, New Providence, NJ (US);
Chitra A. Phadke, Basking Ridge, NJ (US);
Viswanath Poosala, Basking Ridge, NJ (US);
Alcatel-Lucent USA Inc., Murray Hill, NJ (US);
Abstract
Techniques for network routing and design are provided. A technique for determining a route for a demand in a network, wherein the network comprises primary paths and secondary paths, and at least two secondary paths may share a given link, comprises the following steps/operations. First, a graph representing the network is transformed. Edges of the graph represent channels associated with paths and nodes of the graph represent nodes of the network. The transformation is performed such that costs associated with the edges reflect costs of using channels in secondary paths. Then, the shortest path between nodes corresponding to the demand is found in the transformed graph. The shortest path represents the least-cost path in the network over which the demand may be routed. When the above route determination steps/operations result in a path with at least one loop, an alternative routing process may be executed so as to determine a loopless path for the demand. Further, integer linear program formulation design techniques are provided.