Re-optimization of loosely routed P2MP-TE sub-trees
AssigneeCisco Technology, Inc.
InventorsRakesh Gandhi, Tarek Saad, Zafar Ali
Life of this patent
Estimating the term…
Abstract
In one embodiment, for a point to multipoint label switched path, an intermediate node receives a re-evaluation request from a head-end node for at least one routing path having a destination in a loosely routed network for a single destination or for a plurality of destinations in the label switched path forming tree or sub-tree. In response to the re-evaluation request, the intermediate node determines an availability for a remerge-free preferred path for the destination(s), which includes at least one loosely routed next hop, and the intermediate node transmits a preferred path available message to the head-end node based on the determined availability of the remerge-free preferred path.
Claims21
A method, comprising:
- receiving, at an intermediate node, a re-evaluation request for a tunnel having at least one loose hop to at least one destination in a loosely routed network, the re-evaluation request being transmitted from a head-end node;
- determining, in response to the re-evaluation request, an availability for a remerge-free preferred path to the destination, the remerge-free preferred path including at least one loose next hop;
- and
- transmitting a preferred path available message to the head-end node based on the determined availability of the remerge-free preferred path.
A method, comprising:
- generating a re-evaluation request for a tunnel having at least one loose hop to a destination in a loosely routed network;
- transmitting the re-evaluation request to an intermediate node to cause the intermediate node to determine an availability for a remerge-free preferred path for the destination or plurality of destinations that belong to the same label switch path, the remerge-free preferred path including at least one loosely next hop;
- and transmit a preferred path available message to a requesting node based on the determined availability of the remerge-free preferred path;
- receiving the preferred path available message at the requesting node;
- and
- transmitting data to the intermediate node based upon the preferred path available message.
An apparatus, comprising:
- one or more network interfaces of an intermediate node that communicate with a loosely routed network;
- a processor coupled to the network interfaces and adapted to execute one or more processes;
- and
- a memory configured to store a process executable by the processor, the process when executed operable to:
- receive a re-evaluation request for a tunnel having at least one loose hop to a destination in the loosely routed network, the re-evaluation request being transmitted from a head-end node;
- determine, in response to the re-evaluation request, an availability for a remerge-free preferred path for the destination, the remerge-free preferred path including at least one loosely next hop;
- and
- transmit a preferred path available message to the head-end node based on the determined availability of the remerge-free preferred path.
A tangible, non-transitory, computer-readable media having software encoded thereon, the software when executed by a processor of an intermediate node operable to:
- receive a re-evaluation request for a tunnel having at least one loose hop to a destination in the loosely routed network, the re-evaluation request being transmitted from a head-end node;
- determine, in response to the re-evaluation request, an availability for a remerge-free preferred path for the destination, the remerge-free preferred path including at least one loosely routed next hop;
- and
- transmit a preferred path available message to the head-end node based on the determined availability of the remerge-free preferred path.
Dependencies are inferred from the claim text.