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...
Saved in:
Main Authors | , , |
---|---|
Format | Patent |
Language | English |
Published |
01.11.2016
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | 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. |
---|---|
AbstractList | 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. |
Author | Chunduri Uma S Lu Wenhu Patil Vasant |
Author_xml | – fullname: Chunduri Uma S – fullname: Patil Vasant – fullname: Lu Wenhu |
BookMark | eNrjYmDJy89L5WSw8y8oyczNrEosyczPUyjJV0itKEjMS1HwDNb1DFbISU1MU8jLT0ktVkgpLcrMS1fwcXNUSM7PLSgtAevgYWBNS8wpTuWF0twMCm6uIc4euqkF-fGpxQWJyal5qSXxocGWJhamhubGTkbGRCgBAK7GMU4 |
ContentType | Patent |
DBID | EVB |
DatabaseName | esp@cenet |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: EVB name: esp@cenet url: http://worldwide.espacenet.com/singleLineSearch?locale=en_EP sourceTypes: Open Access Repository |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Medicine Chemistry Sciences |
ExternalDocumentID | US9485173B2 |
GroupedDBID | EVB |
ID | FETCH-epo_espacenet_US9485173B23 |
IEDL.DBID | EVB |
IngestDate | Fri Jul 19 14:42:03 EDT 2024 |
IsOpenAccess | true |
IsPeerReviewed | false |
IsScholarly | false |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-epo_espacenet_US9485173B23 |
Notes | Application Number: US201414304656 |
OpenAccessLink | https://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20161101&DB=EPODOC&CC=US&NR=9485173B2 |
ParticipantIDs | epo_espacenet_US9485173B2 |
PublicationCentury | 2000 |
PublicationDate | 20161101 |
PublicationDateYYYYMMDD | 2016-11-01 |
PublicationDate_xml | – month: 11 year: 2016 text: 20161101 day: 01 |
PublicationDecade | 2010 |
PublicationYear | 2016 |
RelatedCompanies | Telefonaktiebolaget L M Ericsson (publ) |
RelatedCompanies_xml | – name: Telefonaktiebolaget L M Ericsson (publ) |
Score | 3.0615284 |
Snippet | 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... |
SourceID | epo |
SourceType | Open Access Repository |
SubjectTerms | ELECTRIC COMMUNICATION TECHNIQUE ELECTRICITY TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION |
Title | Optimization to expand IS-IS leaf nodes during LFA computation |
URI | https://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20161101&DB=EPODOC&locale=&CC=US&NR=9485173B2 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3dS8MwED_GFPVNp-L8Ig_St2K3Lmv3UMV-sYlbh11lb6MfCQy0Hbaif76XrJu-6FtISEiO_O5ySX53ADcaHxiUcqpmXFByEnOAepBStaOjceG82zWZuBoYT_rDqPc4p_MGLDdcGBkn9FMGR0REpYj3Surr1c8lliv_Vpa3yRKrint_ZrlK7R3j8QW3mOLaljcN3MBRHMeKQmXybIkgKB1Dt1Fb7-Ap2hBg8F5sQUpZ_bYo_iHsTnGwvDqCBstbsO9sEq-1YG9cv3djsYZeeQx3AYL7rWZNkqog7AuBnJFRqI5C8spiTvIiYyVZEw_Jk_9AUpmyQfY4AeJ7M2eo4kQW20UvonA7Zf0UmnmRszMgZppSdJFo3EM_Ro9F7sdY4ybXtNRIkthsQ_vPYc7_abuAAyG9NcnuEprV-we7QmtbJddSTt8H7INI |
link.rule.ids | 230,309,783,888,25576,76876 |
linkProvider | European Patent Office |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3dT8IwEL8QNOKbokb87IPZ2-JglI2HaWRjAeUrbjO8kX20CYluxM3on--1DPRF35o2bdpLf3e9tr87gBuNdw1KOVUTLig5kdlFPUip2tTRuHDeaplMXA2MJ51B0H6c03kFlhsujIwT-imDIyKiYsR7IfX16ucSy5F_K_PbaIlV2b3rW45Sesd4fMEtpjg9qz-bOlNbsW0r8JTJsyWCoDQNvYfaegdP2IYAQ_-lJ0gpq98WxT2A3RkOlhaHUGFpHWr2JvFaHfbG5Xs3Fkvo5UdwN0Vwv5WsSVJkhH0hkBMy9NShR15ZyEmaJSwna-IhGbkPJJYpG2SPYyBu37cHKk5ksV30IvC2U9ZPoJpmKTsFYsYxRReJhm30Y_RQ5H4MNW5yTYuNKArNBjT-HObsn7ZrqA388WgxGk6ezmFfSHJNuLuAavH-wS7R8hbRlZTZN1vMhjs |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Apatent&rft.title=Optimization+to+expand+IS-IS+leaf+nodes+during+LFA+computation&rft.inventor=Chunduri+Uma+S&rft.inventor=Patil+Vasant&rft.inventor=Lu+Wenhu&rft.date=2016-11-01&rft.externalDBID=B2&rft.externalDocID=US9485173B2 |