Reoptimization triggering by path computation elements

A method of operating a path computation element, said method comprising:

• determining that a fragmented bandwidth condition exists in a network;
• and
• in response to said fragmented bandwidth condition, causing rerouting of MPLS Traffic Engineering paths to increase likelihood of successful placements;
• wherein rerouting comprises receiving requests for reoptimization of paths until a timer expires;
• thereafter
• recomputing said paths in response to said requests.

A method of operating a path computation element to increase the likelihood of successful path placements, said method comprising:

• distributing a reoptimization request to a plurality of nodes within said network;
• receiving requests for reoptimization of paths until a timer expires;
• and thereafter
• recomputing said paths in response to said requests;
• wherein recomputing comprises:
• recomputing employing a virtual shortest path tree technique.

A method of operating a path computation element to increase the likelihood of successful path placements, said method comprising:

• distributing a reoptimization request to a plurality of nodes within said network;
• receiving requests for reoptimization of paths until a timer expires;
• and thereafter
• recomputing said paths in response to said requests;
• wherein recomputing comprises:
• recomputing said paths in order of decreasing bandwidth requirements.

A computer program product for operating a path computation element, said computer program product comprising:

• code that causes a determination that a fragmented bandwidth condition exists in a network;
• code that, in response to said fragmented bandwidth condition, causes rerouting of MPLS Traffic Engineering paths to increase likelihood of successful placements;
• and
• a computer-readable medium that holds the codes;
• wherein said code that causes determination of a fragmented bandwidth condition comprises code that causes monitoring of a failure rate in establishing paths and code that causes comparison of results of said monitoring to a failure rate criterion.

A computer program product for operating a path computation element, said computer program product comprising:

• code that causes a determination that a fragmented bandwidth condition exists in a network,
• code that, in response to said fragmented bandwidth condition, causes rerouting of MPLS Traffic Engineering paths to increase likelihood of successful placements;
• and
• a computer-readable medium that holds the codes;
• wherein said code that causes rerouting comprises:
• code that causes receipt of requests for reoptimization of paths until a timer expires;
• and
• code that causes recomputation of said paths in response to said requests.

A computer program product for operating a path computation element to increase the likelihood of successful path placements, said computer program product comprising:

• code that causes distribution of a reoptimization request to a plurality of nodes within said network;
• code that causes reception of requests for reoptimization of paths until a timer expires;
• code that causes recomputation of said paths in response to said requests;
• and
• a computer-readable medium that holds the codes;
• wherein said code that causes recomputation of paths comprises:
• code that causes recomputation employing a virtual shortest path tree technique.

A computer program product for operating a path computation element to increase the likelihood of successful path placements, said computer program product comprising:

• code that causes distribution of a reoptimization request to a plurality of nodes within said network;
• code that causes reception of requests for reoptimization of paths until a timer expires;
• code that causes recomputation of said paths in response to said requests;
• and
• a computer-readable medium that holds the codes;
• wherein said code that causes recomputation comprises:
• code that causes recomputation of said paths in order of decreasing bandwidth requirements.

Apparatus for operating a path computation element, said apparatus comprising:

• a processor;
• a memory device that stores instructions for execution by said processor, said instructions comprising:
• code that causes a determination that a fragmented bandwidth condition exists in a network;
• and
• code that, in response to said fragmented bandwidth condition, causes rerouting of MPLS Traffic Engineering paths to increase likelihood of successful placements;
• wherein said code that causes rerouting comprises:
• code that causes receipt of requests for reoptimization of paths until a timer expires;
• and
• code that causes recomputation of said paths in response to said requests.

Apparatus for operating a path computation element to increase the likelihood of successful path placements, said apparatus comprising:

• a processor;
• a memory device that stores instructions for execution by said processor, said instructions comprising:
• code that causes distribution of a reoptimization request to a plurality of nodes within said network;
• code that causes reception of requests for reoptimization of paths until a timer expires;
• and
• code that causes recomputation of said paths in response to said requests wherein code that causes recomputation of said paths comprises code that causes recomputation employing a virtual shortest path tree technique.

Apparatus for operating a path computation element, said method comprising:

• means for determining that a fragmented bandwidth condition exists in a network;
• and
• means for, in response to said fragmented bandwidth condition, causing rerouting of MPLS Traffic Engineering paths to increase likelihood of successful placements;
• wherein said means for causing rerouting comprises receiving requests for reoptimization of paths until a timer expires;
• thereafter
• recomputing said paths in response to said requests.

Apparatus for operating a path computation element to increase the likelihood of successful path placements, said apparatus comprising:

• means for distributing a reoptimization request to a plurality of nodes within said network;
• means for receiving requests for reoptimization of paths until a timer expires;
• and thereafter
• means for recomputing said paths in response to said requests, wherein recomputing comprises:
• recomputing employing a virtual shortest path tree technique.