Optimization to expand IS-IS leaf nodes during LFA computation

A method and system implemented by a network device, where the network device is in a network having a plurality of nodes. The method computes a loop free alternative (LFA) next hop as a backup for a primary path next hop for intermediate system-intermediate system (IS-IS). The method improves LFA c...

Full description

Saved in:
Bibliographic Details
Main Authors Chunduri Uma S, Patil Vasant, Lu Wenhu
Format Patent
LanguageEnglish
Published 01.11.2016
Subjects
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
Online AccessGet full text

Cover

More Information
Summary:A method and system implemented by a network device, where the network device is in a network having a plurality of nodes. The method computes a loop free alternative (LFA) next hop as a backup for a primary path next hop for intermediate system-intermediate system (IS-IS). The method improves LFA computation efficiency by minimizing expansion of prefixes. The method includes expanding all prefixes of the next LFA shortest path first (SPF) destination node and inheriting a next candidate next hop as a current LFA next hop where the next candidate next hop provides link or node protection and better protection than the current LFA next hop.
Bibliography:Application Number: US201414304656