# US 2013/0155840 A1 · Bandwidth management for MPLS fast rerouting > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2013/0155840 A1 - Document ID: US20130155840A1 - Status: Published application - Kind: A1 - Application number: 13/765,471 - Filed: 2013-02-12 - Published: 2013-06-20 - Earliest claimed: 2005-01-06 - Assignees: AT&T Intellectual Property II, L.P. - Inventors: Guangzhi Li; Dongmei Wang - Web page: https://patentgrep.com/patent/US20130155840A1 ## CPC - H04L 45/28: using route fault recovery - H04L 41/06: Management of faults, events, alarms or notifications - H04L 45/00: Routing or path finding of packets in data switching networks (routing or path finding in wireless networks H04W40/00) - H04L 45/12: Shortest path evaluation - H04L 45/247: using M:N active or standby paths - H04L 45/502: {Frame based} - H04L 47/15: {in relation to multipoint traffic (arrangements for broadcast or multicast in data networks H04L12/18)} - H04L 47/70: Admission control; Resource allocation - H04L 47/724: at intermediate nodes, e.g. resource reservation protocol [RSVP] - H04L 47/728: {for backup paths} - H04L 47/746: {Reaction triggered by a failure} - H04L 47/825: {Involving tunnels, e.g. MPLS} - Y04S 40/00: Systems for electrical power generation, transmission, distribution or end-user application management characterised by the use of communication or information technologies, or communication or information technology specific aspects supporting them - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) - Y04S: SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS ## Abstract Certain exemplary embodiments provide a method comprising: in a network at a node located on a label switched path: selecting a backup path to respond to a failure; and for each link along the backup path, reserving a backup bandwidth, wherein the backup bandwidth is sufficient to reroute traffic around the failure. ## Claims ### Claim 1 A system communicatively linked to a network comprising a plurality of link-coupled nodes at a non-terminal node located on a label switched path of a plurality of label switched paths in the network, the system comprising: a memory that stores instructions; a processor that executes the instructions to perform operations comprising: selecting an optimized backup path for rerouting traffic around a failure located downstream of the non-terminal node, wherein the failure is one of a plurality of possible failures on the plurality of label switched paths; reserving a backup bandwidth for each predetermined link of a plurality of predetermined links along the optimized backup path, wherein the backup bandwidth is determined by a value corresponding to a bandwidth associated with a particular failure of the plurality of possible failures; updating the value of the backup bandwidth; and adjusting a bandwidth associated with the optimized backup path to a previously stored value of a bandwidth associated with a link on the optimized backup path. ### Claim 2 (depends on 1) The system of claim 1, wherein the operations further comprise deleting the optimized backup path from a memory for each respective node. ### Claim 3 (depends on 2) The system of claim 2, wherein the operations further comprise transmitting a deletion signal along the optimized backup path, wherein the deletion signal deletes the optimized backup path from the memory for each respective node. ### Claim 4 (depends on 3) The system of claim 3, wherein the operations further comprise receiving a confirmation message indicating that the optimized backup path has been deleted. ### Claim 5 (depends on 1) The system of claim 1, wherein the operations further comprise decreasing the bandwidth associated with the optimized backup path to the previously stored value of the bandwidth. ### Claim 6 (depends on 1) The system of claim 1, wherein the operations further comprise determining the optimized backup path by resetting link weights for each predetermined link. ### Claim 7 (depends on 1) The system of claim 1, wherein the operations further comprise receiving a request for the label switched path, wherein the request comprises information related to a requested bandwidth. ### Claim 8 (depends on 1) The system of claim 1, wherein the operations further comprise receiving a message from a node immediately downstream of the non-terminal node on the label switched path that includes failure information for the failure. ### Claim 9 (depends on 1) The system of claim 1, wherein the operations further comprise reserving the backup bandwidth by adding the bandwidth associated with the optimized backup path to a previously stored value of a bandwidth associated with the failure. ### Claim 10 (depends on 1) The system of claim 1, wherein the operations further comprise rerouting traffic associated with a label switched path affected by the failure based on the optimized backup path. ### Claim 11 (depends on 1) The system of claim 1, wherein the operations further comprise transmitting a message associated with the optimized backup path to a node immediately downstream of the non-terminal node on the label switched path. ### Claim 12 (depends on 1) The system of claim 1, wherein the operations further comprise receiving a message from each respective node indicating backup path creation and bandwidth reservation. ### Claim 13 (depends on 1) The system of claim 1, wherein the backup bandwidth is reserved for each predetermined link of the plurality of predetermined links along the optimized backup path based on a signal including information regarding a node immediately downstream of the non-terminal node on the label switched path. ### Claim 14 (depends on 1) The system of claim 1, wherein the backup bandwidth is sufficient to reroute the traffic around a first single failure on one of the plurality of label switched paths. ### Claim 15 A method for use in a network comprising a plurality of link-coupled nodes at a non-terminal node located on a label switched path of a plurality of label switched paths in the network, the method comprising: selecting an optimized backup path for rerouting traffic around a failure located immediately downstream of the non-terminal node; reserving a backup bandwidth for each predetermined link of a plurality of predetermined links along the optimized backup path, wherein the backup bandwidth is determined by a value corresponding to a bandwidth associated with a particular failure of a plurality of possible failures; updating the value of the backup bandwidth; and adjusting, by utilizing instructions from memory that are executed by a processor, a bandwidth associated with the optimized backup path to a previously stored value of a bandwidth associated with a link on the optimized backup path. ### Claim 16 (depends on 15) The method of claim 15, further comprising deleting the optimized backup path from a memory for each respective node. ### Claim 17 (depends on 15) The method of claim 15, further comprising receiving a confirmation message from each respective node indicating that the optimized backup path has been deleted. ### Claim 18 (depends on 15) The method of claim 15, further comprising receiving a request for the label switched path, wherein the request comprises information related to a cost of service. ### Claim 19 (depends on 15) The method of claim 15, further comprising rerouting traffic associated with a label switched path affected by the failure by utilizing the optimized backup path. ### Claim 20 A machine-readable device coupled to a network comprising a plurality of link-coupled nodes at a non-terminal node located on a label switched path of a plurality of label switched paths in the network, the machine readable device comprising instructions, which when loaded and executed by a processor, cause the processor to perform operations comprising: selecting an optimized backup path for rerouting traffic around a failure located immediately downstream of the non-terminal node; reserving a backup bandwidth for each predetermined link of a plurality of predetermined links along the optimized backup, wherein the backup bandwidth is determined by a value corresponding to a bandwidth associated with a particular failure of a plurality of possible failures; updating the value of the backup bandwidth; and adjusting a bandwidth associated with the optimized backup path to a previously stored value of a bandwidth associated with a link on the optimized backup path.