Loading patent…
AssigneesNokia of America Corporation, Alcatel-Lucent Canada Inc.
InventorsFang HAO, Murali KODIALAM, T.V. LAKSHMAN, Ehsan Rezaaifar
Estimating the term…
Various embodiments relate to a method and apparatus for computing a minimum segment labeling of a given path on a segment cover graph, the method including receiving a connection request for a connection between a source node and a destination node, generating a Shortest Path Directed Acyclic Graph (“SPDAG”) from the source node to the destination node by running a shortest path algorithm from the source node, determining an end node, between the source node and the destination node, at which the SPDAG deviates from the given path, determining whether the end node is the end of an Equal Cost Multipath (“ECMP”) and terminating the shortest path algorithm at a predecessor node to the end node if the end node is the end of an ECMP and making the predecessor node to the end node the source node.
A method for computing a minimum segment labeling of a given path on a segment cover graph, the method comprising:
A non-transitory machine-readable storage medium encoded with instructions executable to perform a method by a processor on a router for computing a minimum segment labeling of a given path on a segment cover graph, the machine-readable storage medium comprising:
Dependencies are inferred from the claim text.