| 摘要 |
<p>A technique for re-routing traffic in a network topology based on Shortest Path First, SPF, calculations is described. The network comprises a plurality of nodes, a traffic source and a traffic destination, wherein a path of nodes represents a shortest source-to-destination path for the traffic from the traffic source to the traffic destination, and wherein each node has pre-calculated a shortest node-to-destination path from the respective node to the traffic destination. In a method aspect, the method is performed in a first node and comprises the steps of receiving, from a second node at the first node, a notification indicating a loss of connection, the first node being a next-hop of the second node, and selecting, at the first node, a neighbouring node as a new next-hop whose shortest node-to-destination path does not cross the connection-lost node.</p> |
