Patent ID: 8363553
Filing Date: 2013-01-29
Classification: H04J,H04Q

Abstract:
1. A routing method for a network, said network having a topology with at least first and second nodes connected together through links, said first nodes having different properties from said second nodes, said links forming paths for said routing and said paths having associated therewith respective run-through costs, comprising: for at least a given node among said first and second nodes, searching for a first set of paths between said given node and said second nodes that pass only through first nodes and have associated therewith a run-through cost lower than a predetermined cost; searching for a second set of paths comprising the paths between each couple of second nodes that pass only through first nodes and have associated therewith a run-through cost lower than said predetermined cost; constructing a simplified network topology comprising said given node, all said second nodes, said first set of paths and said second set of paths; and receiving at said given node a routing request specifying a destination node among said first and second nodes; and if said destination node is reachable from said given node only through a second node: constructing an enhanced network topology by adding to the simplified network topology said destination node and a third set of paths comprising the paths between said destination node and said second nodes that pass only through first nodes and have associated therewith a run-through cost lower than said predetermined cost; and searching for a path having the lowest run-through cost from said given node to said destination node in said enhanced network topology.