WO2016177136A1 - 一种实现链路状态通告处理的方法及装置 - Google Patents

一种实现链路状态通告处理的方法及装置 Download PDF

Info

Publication number
WO2016177136A1
WO2016177136A1 PCT/CN2016/076729 CN2016076729W WO2016177136A1 WO 2016177136 A1 WO2016177136 A1 WO 2016177136A1 CN 2016076729 W CN2016076729 W CN 2016076729W WO 2016177136 A1 WO2016177136 A1 WO 2016177136A1
Authority
WO
WIPO (PCT)
Prior art keywords
lsa
router
spf
fails
added
Prior art date
Application number
PCT/CN2016/076729
Other languages
English (en)
French (fr)
Inventor
何建军
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2016177136A1 publication Critical patent/WO2016177136A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/32—Flooding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/021—Ensuring consistency of routing table updates, e.g. by using epoch numbers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/18—Loop-free operations

Definitions

  • This document relates to, but is not limited to, dynamic routing technology, and more particularly to a method and apparatus for implementing link state notification processing.
  • Dynamic routing protocols are mainly divided into distance vector routing algorithm and link state routing algorithm.
  • Distance vector routing algorithms include Routing Information Protocol (RIP) and Border Gateway Protocol (BGP).
  • Link state routing Algorithms include Open Shortest Path First (OSPF) and Intermediate System-to-Intermediate System (ISIS).
  • OSPF Open Shortest Path First
  • ISIS Intermediate System-to-Intermediate System
  • each router maintains a table listing the currently known best paths to each target, which are constantly updated by exchanging information between neighbors, and finally each Routers have the best path to reach each destination. Because the distance vector routing algorithm has certain shortcomings, for example, when the network topology changes, the distance vector algorithm takes too long to converge to a stable state, and thus the link state routing algorithm gradually emerges.
  • the neighbors are discovered by sending and receiving HELLO messages, and the link state database (LSDB, Link State Database) is synchronized between the neighbors, and the local router uses the synchronized LSDB to construct the shortest.
  • the Path First (SPF) tree finally calculates the acyclic optimal path to each destination address. After the link state database is synchronized, the link state databases of the two routers are the same. Running the SPF ensures that the calculated optimal path does not form a routing loop.
  • LSDB Link State Database
  • the link state database may be out of synchronization. For example, because the memory usage of one end router reaches the maximum value, there is no additional memory to store the newly received link state advertisement, resulting in the link between the two ends of the router. The state database is not synchronized. At this time, a routing loop is formed during the optimal path calculation performed by the SPF, and data packet transmission cannot be completed.
  • FIG. 1 is a schematic diagram of a network composition in the related art. As shown in FIG. 1 , the network is composed of four routers, and the link interface cost of the router 2 connected to the router 4 is 10, and the cost of the remaining link interfaces is 1.
  • Router 4 In the case of destination D, in the case where the link state database is consistent, router 1 runs SPF to calculate the best path to D is to reach router 4 through router 3, and router 2 runs SPF to calculate the best path to D is through router 1. Router 3 arrives at router 4.
  • router 1 runs SPF to calculate the best path to D is through router 2 Path 1
  • router 2 runs SPF to calculate the best path to D is route 2 through router 1 and router 3 to router 4
  • data packets sent by router 1 to destination D are sent to router 2, and router 2
  • the data packet destined for D is sent to router 1, and the data packet destined for destination D is forwarded back and forth between router 1 and the router until the lifetime is 0, that is, a routing loop occurs.
  • the routing loops prevent data packets from being transmitted to the destination route and affect the normal transmission of data packets.
  • the embodiment of the invention provides a method and a device for implementing link state advertisement processing, which can avoid a routing loop in the SPF calculation caused by a failure of a storage link state advertisement (LSA).
  • LSA storage link state advertisement
  • the embodiment of the present invention provides a method for implementing link state advertisement processing, including:
  • the router When the router stores the link state advertisement LSA failure, the LSA with the differentiated identifier is generated.
  • the router floods the LSAs with the differentiated identifiers to other routers in the network, and triggers the LSAs with differentiated identifiers generated by other routers in the process of calculating the optimal path by running the shortest path first SPF by adding the LSAs with differentiated identifiers.
  • the neighbor router is not added to the SPF candidate list;
  • the neighbor router is a neighbor router that generates a router that adds the LSA with the distinguished identifier.
  • the method further includes: when generating an LSA to which a differentiated identifier is added,
  • the router that fails to store the LSA enters a wait state, and sets a corresponding waiting duration according to the number of times the LSA fails to be stored. When the waiting time arrives, the LSA that fails to be stored is re-stored;
  • the waiting time is less than a preset maximum duration threshold.
  • setting the corresponding waiting duration according to the number of times the LSA fails to be stored includes:
  • the unit waiting time is preset, and the corresponding waiting time is set according to the number of times the LSA fails to be stored;
  • the waiting time is equal to the product of the number of failures of storing the LSA failure and the predetermined unit waiting time.
  • the setting the corresponding waiting duration according to the number of times the LSA fails to be stored includes:
  • the corresponding waiting time set according to the number of times the LSA fails to be stored is set by the exponential backoff mechanism.
  • re-storing the LSA that fails to store the storage includes:
  • the router that fails to store the LSA exits waiting for the wait state
  • the router regenerates the LSA that failed to store and stores it.
  • an embodiment of the present invention further provides a method for implementing link state advertisement processing, where the method includes:
  • the router that runs the shortest path first SPF to calculate the optimal path receives the storage link state advertisement LSA failed to flood the router to the LSA with the distinguished identifier added to the network;
  • the router that runs the shortest path first SPF to calculate the optimal path is added to the SPF tree when the router corresponding to the LSA with the differentiated identifier generated by the LSA triggering the optimal path in the SPF calculation is added to the SPF tree.
  • the neighbor router is a neighbor router that generates a router that adds the LSA with the distinguished identifier.
  • an embodiment of the present invention further provides an apparatus for implementing link state advertisement processing, including: a generating unit and a flooding unit;
  • the generating unit is configured to generate a differentiated identifier when the router fails to store the LSA.
  • LSA LSA
  • the flooding unit is configured to flood the LSAs with the differentiated identifiers to other routers in the network, and add the differentiated identifiers generated by other routers in the process of calculating the optimal path by running the SPF by adding the LSAs with differentiated identifiers.
  • the neighbor router is not added to the SPF candidate list;
  • the neighbor router is a neighbor router that generates a router that adds the LSA with the distinguished identifier.
  • the device further includes a waiting setting unit and a re-storing unit; wherein
  • the waiting setting unit is configured to: when the generating unit generates the LSA to which the distinguishing identifier is added, set the router that fails to store the LSA to enter a wait waiting state, and set a corresponding waiting duration according to the number of times the LSA fails to be stored;
  • the re-storage unit is configured to re-storage the LSA that failed to store when the waiting time arrives;
  • the waiting time is less than a preset maximum duration threshold.
  • the waiting time is equal to the product of the number of failures of storing the LSA failure and the predetermined unit waiting time.
  • the waiting setting unit is configured to: when the generating unit generates the LSA with the differentiated identifier, set the router that fails to store the LSA to enter a wait wait state, where
  • the preset unit waiting time product is set as the waiting time
  • the waiting time is set by the exponential backoff mechanism for the corresponding waiting time set according to the number of times the LSA fails to be stored.
  • the re-storage unit is set to,
  • the router that fails to store the LSA exits the wait waiting state
  • the router regenerates the storage. Store the failed LSA and store it.
  • an embodiment of the present invention further provides an apparatus for implementing link state advertisement processing, where the apparatus includes a receiving unit and a processing unit:
  • the receiving unit is configured to: the router that receives the storage link state advertisement LSA failure floods to the LSA with the distinguished identifier added to the network;
  • the processing unit is configured to: when receiving the LSA to which the differentiated identifier is added, add the router corresponding to the LSA added with the differentiated identifier generated by the LSA that is added to the SPF to calculate the optimal path according to the received LSA. When the tree is not added to the SPF candidate list;
  • the neighbor router is a neighbor router that generates a router that adds the LSA with the distinguished identifier.
  • the technical solution provided by the embodiment of the present invention includes: when the router fails to store the LSA, the LSA is added with the differentiated identifier; the LSA added with the differentiated identifier is flooded to other routers in the network, and passes through The LSAs with the differentiated identifiers are added to the SPF candidate list when other routers add the routers corresponding to the LSAs with the differentiated identifiers added to the SPF tree during the SPF calculation of the optimal path.
  • the neighbor routers are not generated. Add a neighbor router of the router corresponding to the identified LSA.
  • the LSA to which the differentiated identifier is added is generated, so that other routers do not add the neighbor router when the router that generates the LSA with the differentiated identifier is added to the SPF tree by running the SPF calculation optimal path.
  • the routing loop is avoided due to the failure of the storage LSA, and the normal transmission of data packets is guaranteed.
  • FIG. 1 is a schematic diagram of a network composition in a related art
  • FIG. 2 is a flowchart of a method for implementing link state advertisement processing according to an embodiment of the present invention
  • FIG. 3 is a flowchart of a method for implementing link state advertisement processing according to another embodiment of the present invention.
  • FIG. 4 is a structural diagram of an apparatus for implementing link state advertisement processing according to an embodiment of the present invention.
  • FIG. 5 is a structural diagram of an apparatus for implementing link state advertisement processing according to another embodiment of the present invention.
  • FIG. 6 is a flowchart of a method for processing an LSA failure when storing a first application example according to the present invention
  • FIG. 7 is a flowchart of a method according to a second application example of the present invention.
  • FIG. 8 is a flowchart of a method according to a third application example of the present invention.
  • FIG. 2 is a flowchart of a method for implementing link state advertisement processing according to an embodiment of the present invention. As shown in FIG. 2, the method includes:
  • Step 200 When the router fails to store the link state advertisement (LSA), the LSA is added with the differentiated identifier.
  • LSA link state advertisement
  • Adding the differentiated identifier to the generated LSA includes: adding a distinguishing identifier to the unused data frame of the LSA, for example, not used after the LSA length frame. An OVER is added to the data frame as the distinguishing identifier, and a new data frame may be extended on the generated LSA for adding the distinguishing identifier.
  • the method for adding the distinguishing identifier is a conventional technical means for those skilled in the art.
  • Step 201 The router floods the LSAs with the differentiated identifiers to other routers in the network, and triggers the LSAs with the differentiated identifiers to trigger the addition of other routers in the process of calculating the optimal path by running the shortest path first (SPF).
  • SPPF shortest path first
  • the routers that trigger the other routers to add the LSAs with the differentiated identifiers added to the SPF tree are added to the SPF candidate list during the shortest path first (SPF) calculation of the optimal path, the neighbor routers are not added to the SPF candidate list.
  • the process may be performed by adding an LSA that distinguishes the identifiers.
  • the router may send a notification to another router, so that other routers receive the LSA with the differentiated identifier, and the operation is the shortest.
  • the method of the embodiment may also be configured to trigger the LSA with the distinguishing identifier as a trigger condition in other routers.
  • the method of the embodiment of the present invention further includes: when generating an LSA to which a distinguishing identifier is added,
  • the waiting time is less than the preset maximum duration threshold.
  • the waiting time is equal to the product of the number of failures of storing the LSA failure and the predetermined unit waiting time.
  • the unit waiting time is an empirical value of a person skilled in the art, and the default is 200 milliseconds.
  • the maximum duration threshold is also set according to empirical values by those skilled in the art.
  • the modification wait time can be implemented by the backoff algorithm.
  • the corresponding waiting duration set according to the number of times the LSA fails to be stored may be set by an exponential backoff mechanism.
  • re-storing the LSA that failed to store includes:
  • the router that fails to store the LSA exits the wait wait state
  • the router regenerates the LSA that failed to store and stores it.
  • the router feeds back the stored information to other routers in the network, so that other routers will re-store the LSA when performing SPF calculation.
  • the router is added to the SPF tree to calculate the best path.
  • the method of the embodiment of the present invention may be performed by a router that fails to store the link state to notify the LSA; the LSA with the differentiated identifier is generated, the router that fails to store the LSA enters the wait state, and the LSA that fails to store the storage fails.
  • the equalization can be implemented by the central processor of the router, and the flooding of the LSAs that add the distinguishing identifier can be implemented by the transceiver of the router.
  • the LSA to which the differentiated identifier is added is generated, so that other routers do not add the neighbor router when the router that generates the LSA with the differentiated identifier is added to the SPF tree by running the SPF calculation optimal path.
  • the routing loop is avoided due to the failure of the storage LSA, and the normal transmission of data packets is guaranteed.
  • FIG. 3 is a flowchart of a method for implementing link state advertisement processing according to another embodiment of the present invention. As shown in FIG. 3, the method includes:
  • Step 300 The router that performs the shortest path first (SPF) calculation of the optimal path receives the storage link state advertisement (LSA) failure router flooded into the network and adds the differentiated identifier LSA;
  • SPF shortest path first
  • LSA storage link state advertisement
  • Step 301 The router that runs the shortest path first SPF to calculate the optimal path adds the router corresponding to the LSA added with the differentiated identifier generated in the process of running the SPF to calculate the optimal path to the SPF tree according to the LSA that is added with the differentiated identifier.
  • the router that runs the shortest path first SPF to calculate the optimal path adds the router corresponding to the LSA added with the differentiated identifier generated in the process of running the SPF to calculate the optimal path to the SPF tree according to the LSA that is added with the differentiated identifier.
  • the neighbor router is a neighbor router that generates a router to which an identified LSA is added.
  • the receiving of the LSA with the differentiated identifier can be implemented by the transceiver of the router that calculates the optimal path by running the SPF. If the neighbor router is not added to the SPF candidate list, the center of the router that calculates the optimal path by running the SPF can be calculated. Processor implementation.
  • FIG. 4 is a structural diagram of an apparatus for implementing link state advertisement processing according to an embodiment of the present invention. As shown in FIG. 4, the method includes: a generating unit and a flooding unit;
  • the generating unit is configured to generate an LSA with a differentiated identifier added when the router fails to store the LSA;
  • the flooding unit is configured to flood the LSAs with the differentiated identifiers to other routers in the network, and add the differentiated identifiers generated by other routers in the process of calculating the optimal path by running the SPF by adding the LSAs with differentiated identifiers.
  • the neighbor router is not added to the SPF candidate list;
  • the neighbor router includes: the neighbor router is a neighbor router that generates a router to which the identified LSA is added.
  • the device of the embodiment of the present invention further includes a waiting setting unit and a re-storing unit; wherein
  • the waiting setting unit is set to, when the generating unit generates the LSA to which the distinguishing identifier is added, the setting is saved.
  • the router that failed to store the LSA enters the wait wait state, and sets the corresponding wait duration according to the number of times the LSA fails to be stored.
  • the waiting time is equal to the product of the number of failures of storing the LSA failure and the predetermined unit waiting time.
  • the waiting setting unit is configured to: when the generating unit generates the LSA with the differentiated identifier, set the router that fails to store the LSA to enter the wait waiting state,
  • the preset unit waiting time product is set as the waiting time
  • the waiting time can be set by the exponential backoff mechanism.
  • the re-storage unit is set to re-storage the LSA that failed to store when the waiting time arrives;
  • the waiting time is less than the preset maximum duration threshold.
  • the re-storage unit is set to,
  • the router that fails to store the LSA exits the wait wait state
  • the router regenerates the LSA that failed to store and stores it.
  • the device in the embodiment of the present invention may be connected to a router that stores an LSA failed router, or may be directly embedded in a router that fails to store the LSA.
  • FIG. 5 is a structural diagram of another apparatus for implementing link state advertisement processing according to an embodiment of the present invention. As shown in FIG. 5, the method includes a receiving unit and a processing unit:
  • the receiving unit is configured to: the router that receives the storage link state advertisement LSA failure floods to the LSA with the distinguished identifier added to the network;
  • the processing unit is configured to: when receiving the LSA to which the differentiated identifier is added, add the router corresponding to the LSA added with the differentiated identifier generated by the LSA that is added to the SPF to calculate the optimal path according to the received LSA. When the tree is not added to the SPF candidate list;
  • the neighbor router is a neighbor router that generates a router to which an identified LSA is added.
  • the device in the embodiment of the present invention may be connected to a router that receives an LSA to which a differentiated identifier is added, or may be directly embedded in a router to which an LSA with a differentiated identifier is added.
  • the application example of the present invention is a clear and detailed description of the method for storing the LSA.
  • the LSA that fails to be stored in this application example may be the received LSA from other routers in the network, or the LSA generated by the router itself.
  • the reason for the failure may be that the router's memory reaches its maximum value.
  • FIG. 6 is a flowchart of a method for processing an LSA failure when the first application example of the present invention is used. As shown in FIG. 6, the method includes:
  • Step 600 When the LSA fails to be stored, it is determined whether the router is in the wait state. If not in the wait state, step 6010 is performed; otherwise, step 6020 is performed.
  • Step 6010 Generate an LSA added with a differentiated identifier and flood it to other routers in the network, and set a wait duration of the wait state to a unit waiting duration;
  • the SPF tree constructs the router that adds the LSA with the differentiated identifier to the SPF tree.
  • the neighbor router is not added to the SPF candidate list, that is, other routers will not store the failed router. As a forwarding next hop router.
  • Step 6020 if the router is in the wait state, determine whether the waiting time is equal to the maximum duration threshold, the waiting duration is equal to the maximum duration threshold, step 6021; waiting duration is less than the maximum duration threshold, executing 6022;
  • Step 6021 Set, by using an exponential backoff mechanism, a product of the number of times the storage LSA fails and the unit waiting time length as the waiting time.
  • Step 6022 Keep the waiting duration equal to the maximum duration threshold.
  • FIG. 7 is a flowchart of a method according to a second application example of the present invention. As shown in FIG. 7, the method includes:
  • Step 700 The waiting time is not reached, and the router is in a wait state
  • Step 701 The waiting time arrives, and the router exits the wait state.
  • Step 702 The router re-stores the LSA that fails to be stored. After the storage is completed, the LSA without the differentiated identifier is generated to the other routers, so that the other routers are added to the SPF candidate list when the SPF calculates the optimal path. That is, other routers may consider using a neighbor router as a forwarding next hop router.
  • FIG. 8 is a flowchart of a method according to a third application example of the present invention. As shown in FIG. 8, the method includes:
  • Step 800 The router running the SPF adds itself to the candidate list of the optimal path, and the cost value is 0;
  • Step 801 From the candidate list, select a router with the lowest cost and add the router to the SPF tree.
  • Step 802 Determine the LSA of the router with a distinguishing identifier; the LSA of the router does not have a distinguishing identifier, and perform step 803; the LSA of the router distinguishes the identifier, and returns to step 801;
  • Step 803 Process a link of the neighbor router.
  • Step 804 Determine whether the link check of the router passes; if the link check of the router passes, go to step 8050; if the link check of the router fails, go to step 8060.
  • Step 8050 Calculate a cost value of the next hop router N that the root router reaches the neighboring router.
  • router N is the next hop.
  • Step 8060 Determine whether there is a link of other unprocessed neighbor routers; if yes, go back to step 803; if no, go to step 80521.
  • Step 8051 determining whether the neighboring router is already in the candidate list; the neighboring router is not in the candidate list, executing 80520; the neighboring router is already in the candidate list, executing 80530;
  • Step 80520 Add a neighbor router to the candidate list.
  • Step 80521 it is determined whether there are still unprocessed neighbor router links; there are unprocessed neighbor router links, returning to step 803; there is no unprocessed neighbor router link, step 80522;
  • Step 80522 The judgment candidate list is empty; if the candidate list is empty, step 80523 is performed; if the candidate list is not empty, the process returns to step 801.
  • step 80530 it is determined that the calculated cost value is less than the known cost value; the calculated cost value is less than the known cost value, and step 805310 is performed; the calculated cost value is greater than or equal to the known cost value, and step 805320 is performed.
  • Step 805310 Modify the cost value of the neighboring router to calculate the cost of the next hop of the root router to reach the neighboring router, and determine that the next hop is the router N. Then step 80521 is performed.
  • Step 805320 Determine that the cost value is equal to the known cost value; the cost value is equal to the known cost value, and step 805321 is performed; the cost value is not equal to the known cost value, and the process returns to step 8060.
  • Step 805321 After adding the next one to the neighbor router to know the next hop list, proceed to step 8060.
  • the foregoing technical solution avoids the routing loop caused by the failure of the storage LSA, and ensures the normal transmission of data packets.

Abstract

一种实现链路状态通告处理的方法及装置，包括：路由器存储链路状态通告(LSA)失败时，生成添加有区分标识的LSA；将添加有区分标识的LSA洪泛到网络中的其他路由器中，并通过添加有区分标识的LSA触发其他路由器在运行最短路径优先(SPF)计算最优路径过程中将生成的添加有区分标识的LSA对应的路由器添加到SPF树时，不将邻居路由器添加到SPF候选列表中；邻居路由器为生成添加有区分标识的LSA的路由器的邻居路由器。本发明实施例方法通过存储LSA失败时，生成添加有区分标识的LSA，使其他路由器在运行SPF计算最优路径将生成添加有区分标识的LSA的路由器添加到SPF树时，不将邻居路由器添加到SPF候选列表中，避免了存储LSA失败造成路由环路，保证了数据报文的正常传输。

Description

一种实现链路状态通告处理的方法及装置 技术领域
本文涉及但不限于动态路由技术，尤指一种实现链路状态通告处理的方法及装置。
背景技术
动态路由协议主要分为距离矢量路由算法和链路状态路由算法两种；距离矢量路由算法包括路由信息协议(RIP，Routing Information Protocol)和边界网关协议(BGP，Border Gateway Protocol)；链路状态路由算法包括开放式最短路径优先(OSPF，Open Shortest Path First)和中间系统-中间系统(ISIS，Intermediate System-to-Intermediate System)。
在距离矢量路由算法中，每一台路由器维护一张表，表中列举了当前已知的到每个目标的最佳路径，这些表通过邻居之间的相互交换信息而不断被更新，最终每台路由器都有到达每个目的地的最佳路径。由于距离矢量路由算法存在一定的缺点，比如当网络拓扑结构发生变化后距离矢量算法需要太长时间才能收敛到稳定状态，由此逐渐出现了链路状态路由算法。在链路状态路由算法中，通过发送和接收打招呼(HELLO)报文来发现邻居，邻居之间进行链路状态数据库(LSDB，Link State Database)的同步，本地路由器利用同步完成的LSDB来构造最短路径优先(SPF，Shortest Path First)树，最终计算出到达每一个目的地址的无环最佳路径。链路状态数据库同步完成后，两端路由器链路状态数据库一致，运行SPF将保证计算出来的最佳路径不会形成路由环路。
在计算最优路径过程中，可能出现链路状态数据库不同步的问题，例如、由于一端路由器的内存使用达到最大值，没有额外的内存存储新接收的链路状态通告，导致两端路由器链路状态数据库不同步；此时，运行SPF计算出的最优路径过程中形成了路由环路，无法完成数据报文传输。图1是相关技术中网络组成示意图，如图1所示，网络由四台路由器构成，路由器2连接路由器4的链路接口花费值为10，其余链路接口花费值都为1。路由器4通 告目的地D，在链路状态数据库一致的情况下，路由器1运行SPF计算到达D的最佳路径是经过路由器3到达路由器4，路由器2运行SPF计算到达D的最佳路径是经过路由器1、路由器3到达路由器4。假设路由器1中的内存使用到达最大值，没有多余的存储空间将路由器3通告的路由器链路状态通告存储到自身数据库中；此时，路由器1运行SPF计算到达D的最佳路径是经过路由器2的路径1，而路由器2运行SPF计算到达D的最佳路径是经过路由器1、路由器3到达路由器4的路径2，路由器1发往目的地D的数据报文会发往路由器2，而路由器2会将目的地为D的数据报文发往路由器1，发往目的地D的数据报文会在路由器1和路由器之间来回传递直至生存时间为0，即出现了路由环路。路由环路造成数据报文无法传输到目的路由，影响数据报文的正常传输。
发明内容
以下是对本文详细描述的主题的概述。本概述并非是为了限制权利要求的保护范围。
本发明实施例提供一种实现链路状态通告处理的方法及装置，能够避免由于存储链路状态通告(LSA)失败造成SPF计算出现路由环路。
其中，本发明实施例提供一种实现链路状态通告处理的方法，包括：
路由器存储链路状态通告LSA失败时，生成添加有区分标识的LSA；
路由器将添加有区分标识的LSA洪泛到网络中的其他路由器中，并通过添加有区分标识的LSA触发其他路由器在运行最短路径优先SPF计算最优路径过程中将生成的添加有区分标识的LSA对应的路由器添加到SPF树时，不将邻居路由器添加到SPF候选列表中；
所述邻居路由器为生成所述添加有区分标识的LSA的路由器的邻居路由器。
可选的，所述方法还包括：生成添加有区分标识的LSA时，
设置所述存储LSA失败的路由器进入等待wait状态，并根据存储LSA失败的次数设置相应的等待时长，在等待时长到达时，重新存储所述存储失败的LSA；
所述等待时长小于预先设置的最大时长阈值。
可选的，根据存储LSA失败的次数设置相应的等待时长包括：
预先设定单位等待时长，根据存储LSA失败的次数设置相应的等待时长；
所述等待时长等于存储LSA失败的失败次数与预先设定的单位等待时长的乘积。
可选的，所述根据存储LSA失败的次数设置相应的等待时长包括：
当存储LSA失败的次数大于1时，通过指数退避机制对根据存储LSA失败的次数设置的相应的所述等待时长进行设置。
可选的，重新存储所述存储失败的LSA包括：
所述等待时长到达时，所述存储LSA失败的路由器退出等待wait状态；
当所述存储失败的LSA来自其他路由器时，接收其他路由器重传的存储失败的LSA并存储；
当所述存储失败的LSA为路由器自身生成的LSA时，路由器重新生成存储失败的LSA并存储。
另一方面，本发明实施例还提供一种实现链路状态通告处理的方法，所述方法包括：
运行最短路径优先SPF计算最优路径的路由器接收存储链路状态通告LSA失败的路由器洪泛到网络中的添加有区分标识的LSA；
运行最短路径优先SPF计算最优路径的路由器根据接收到添加有区分标识的LSA触发自身在运行SPF计算最优路径过程中将生成的添加有区分标识的LSA对应的路由器添加到SPF树时，不将邻居路由器添加到SPF候选列表中；
所述邻居路由器为生成所述添加有区分标识的LSA的路由器的邻居路由器。
另一方面，本发明实施例还提供一种实现链路状态通告处理的装置，包括：生成单元和洪泛单元；其中，
生成单元设置为，在路由器存储LSA失败时，生成添加有区分标识的 LSA；
洪泛单元设置为，将添加有区分标识的LSA洪泛到网络中的其他路由器中，并通过添加有区分标识的LSA触发其他路由器在运行SPF计算最优路径过程中将生成的添加有区分标识的LSA对应的路由器添加到SPF树时，不将邻居路由器添加到SPF候选列表；
所述邻居路由器为生成所述添加有区分标识的LSA的路由器的邻居路由器。
可选的，所述装置还包括等待设置单元和重新存储单元；其中，
等待设置单元设置为，生成单元生成所述添加有区分标识的LSA时，设置所述存储LSA失败的路由器进入wait等待状态，并根据存储LSA失败的次数设置相应的等待时长；
重新存储单元设置为，在等待时长到达时，重新存储所述存储失败的LSA；
所述等待时长小于预先设置的最大时长阈值。
可选的，等待时长等于存储LSA失败的失败次数与预先设定的单位等待时长的乘积。
可选的，等待设置单元是设置为，生成单元生成所述添加有区分标识的LSA时，设置所述存储LSA失败的路由器进入wait等待状态，
存储LSA失败的次数为1时，设置预先设定单位等待时长乘积作为等待时长；
当存储LSA失败的次数大于1时，所述等待时长通过指数退避机制对根据存储LSA失败的次数设置的相应的所述等待时长进行设置。
可选的，重新存储单元是设置为，
所述等待时长到达时，所述存储LSA失败的路由器退出wait等待状态；
当所述存储失败的LSA来自其他路由器时，接收其他路由器重传的存储失败的LSA并存储；
当所述存储失败的LSA为路由器自身生成的LSA时，路由器重新生成存 储失败的LSA并存储。
另一方面，本发明实施例还提供一种实现链路状态通告处理的装置，所述装置包括接收单元和处理单元：其中，
接收单元设置为，接收存储链路状态通告LSA失败的路由器洪泛到网络中的添加有区分标识的LSA；
处理单元设置为，接收到添加有区分标识的LSA时，根据接收到添加有区分标识的LSA触发自身在运行SPF计算最优路径过程中将生成的添加有区分标识的LSA对应的路由器添加到SPF树时，不将邻居路由器添加到SPF候选列表中；
所述邻居路由器为生成所述添加有区分标识的LSA的路由器的邻居路由器。
与相关技术相比，本发明实施例提供的技术方案，包括：路由器存储LSA失败时，生成添加有区分标识的LSA；将添加有区分标识的LSA洪泛到网络中的其他路由器中，并通过添加有区分标识的LSA触发其他路由器在运行SPF计算最优路径过程中将生成的添加有区分标识的LSA对应的路由器添加到SPF树时，不将邻居路由器添加到SPF候选列表；邻居路由器为生成添加有区分标识的LSA对应的路由器的邻居路由器。本发明实施例方法通过存储LSA失败时，生成添加有区分标识的LSA，使其他路由器在运行SPF计算最优路径将生成添加有区分标识的LSA的路由器添加到SPF树时，不将邻居路由器添加到SPF候选列表中，避免了存储LSA失败造成路由环路，保证了数据报文的正常传输。
在阅读并理解了附图和详细描述后，可以明白其他方面。
附图概述
图1是相关技术中网络组成示意图；
图2为本发明实施例实现链路状态通告处理的方法的流程图；
图3为本发明另一实施例实现链路状态通告处理的方法的流程图；
图4为本发明实施例实现链路状态通告处理的装置的结构程图；
图5为本发明另一实施例实现链路状态通告处理的装置的结构程图；
图6为本发明第一应用示例存储LSA失败时处理方法的流程图；
图7为本发明第二应用示例的方法流程图；
图8为本发明第三应用示例的方法流程图。
本发明的实施方式
下文中将结合附图对本申请的实施例进行详细说明。需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互任意组合。
图2为本发明实施例实现链路状态通告处理的方法的流程图，如图2所示，包括：
步骤200、路由器存储链路状态通告(LSA)失败时，生成添加有区分标识的LSA；
需要说明的是，存储LSA失败可以通过路由器反馈的参数信息进行确定；在生成的LSA上添加区分标识包括：可以在LSA未使用的数据帧上添加区分标识，例如、在LSA长度帧后面未使用的数据帧上添加OVER作为区分标识，也可以在生成的LSA上扩展一个新的数据帧，用于添加区分标识，添加区分标识的方法为本领域技术人员的惯用技术手段。
步骤201、路由器将添加有区分标识的LSA洪泛到网络中的其他路由器中，并通过添加有区分标识的LSA触发其他路由器在运行最短路径优先(SPF)计算最优路径过程中将生成的添加有区分标识的LSA对应的路由器添加到SPF树时，不将邻居路由器添加到SPF候选列表中。这里，邻居路由器包括生成添加区分标识的LSA对应的路由器的邻居路由器。
需要说明的是，触发其他路由器在运行最短路径优先(SPF)计算最优路径过程中将生成的添加有区分标识的LSA对应的路由器添加到SPF树时，不将邻居路由器添加到SPF候选列表中的过程可以以添加区分标识的LSA作为触发条件；可选的，本发明实施例方法，可以由路由器通过发送通知到其他路由器，以使其他路由器接收到添加有区分标识的LSA时，在运行最短路径优先(SPF)计算最优路径过程中将生成的添加有区分标识的LSA对应的路由器添加到SPF树时，不将邻居路由器添加到SPF候选列表中的处理；本发 明实施例方法也可以在其他路由器中设置添加有区分标识的LSA作为触发条件进行触发处理。
本发明实施例方法还包括：生成添加有区分标识的LSA时，
设置存储LSA失败的路由器进入等待(wait)状态，并根据存储LSA失败的次数设置相应的等待时长；
在等待时长到达时，重新存储存储失败的LSA；
等待时长小于预先设置的最大时长阈值。
可选的，等待时长等于存储LSA失败的失败次数与预先设定的单位等待时长的乘积。
需要说明的是，单位等待时长为本领域技术人员的经验值，一般默认为200毫秒。最大时长阈值也是根据本领域技术人员的经验值进行设定。修改等待时长可以通过退避算法实现。
可选的，当存储LSA失败的次数大于1时，根据存储LSA失败的次数设置的相应的等待时长可以通过指数退避机制进行设置。
可选的，重新存储存储失败的LSA包括：
等待时长到达时，存储LSA失败的路由器退出wait等待状态；
当存储失败的LSA来自其他路由器时，接收其他路由器重传的存储失败的LSA并存储；
当存储失败的LSA为路由器自身生成的LSA时，路由器重新生成存储失败的LSA并存储。
需要说明的是，完成存储失败的LSA的存储后，按照相关技术中的方法，路由器将反馈存储完成的信息到网络中的其他路由器，以使其他路由器在进行SPF计算时，将重新存储LSA的路由器添加到SPF树中，计算最佳路径。
另一方面，本发明实施例方法可以由存储链路状态通告LSA失败的路由器执行；添加有区分标识的LSA的生成、设置存储LSA失败的路由器进入等待(wait)状态、重新存储存储失败的LSA等均可以通过该路由器的中央处理器实现，添加区分标识的LSA的洪泛可以通过该路由器的收发装置实施。
本发明实施例方法通过存储LSA失败时，生成添加有区分标识的LSA，使其他路由器在运行SPF计算最优路径将生成添加有区分标识的LSA的路由器添加到SPF树时，不将邻居路由器添加到SPF候选列表中，避免了存储LSA失败造成路由环路，保证了数据报文的正常传输。
图3为本发明另一实施例实现链路状态通告处理的方法的流程图，如图3所示，包括：
步骤300、运行最短路径优先(SPF)计算最优路径的路由器接收存储链路状态通告(LSA)失败的路由器洪泛到网络中的添加有区分标识的LSA；
步骤301、运行最短路径优先SPF计算最优路径的路由器根据接收到添加有区分标识的LSA触发自身在运行SPF计算最优路径过程中将生成的添加有区分标识的LSA对应的路由器添加到SPF树时，不将邻居路由器添加到SPF候选列表中；
邻居路由器为生成添加有区分标识的LSA的路由器的邻居路由器。
需要说明的是，添加有区分标识的LSA的接收可以通过运行SPF计算最优路径的路由器的收发装置实现，不将邻居路由器添加到SPF候选列表中可以通过运行SPF计算最优路径的路由器的中央处理器实现。
图4为本发明实施例实现链路状态通告处理的装置的结构程图，如图4所示，包括：生成单元和洪泛单元；其中，
生成单元设置为，在路由器存储LSA失败时，生成添加有区分标识的LSA；
洪泛单元设置为，将添加有区分标识的LSA洪泛到网络中的其他路由器中，并通过添加有区分标识的LSA触发其他路由器在运行SPF计算最优路径过程中将生成的添加有区分标识的LSA的对应路由器添加到SPF树时，不将邻居路由器添加到SPF候选列表中；
邻居路由器包括：邻居路由器为生成添加有区分标识的LSA的路由器的邻居路由器。
本发明实施例装置还包括等待设置单元和重新存储单元；其中，
等待设置单元设置为，生成单元生成添加有区分标识的LSA时，设置存 储LSA失败的路由器进入wait等待状态，并根据存储LSA失败的次数设置相应的等待时长。
可选的，等待时长等于存储LSA失败的失败次数与预先设定的单位等待时长的乘积。
等待设置单元是设置为，生成单元生成所述添加有区分标识的LSA时，设置存储LSA失败的路由器进入wait等待状态，
存储LSA失败的次数为1时，设置预先设定单位等待时长乘积作为等待时长；
当存储LSA失败的次数大于1时，等待时长可以通过指数退避机制设置。
重新存储单元设置为，在等待时长到达时，重新存储存储失败的LSA；
等待时长小于预先设置的最大时长阈值。
重新存储单元是设置为，
等待时长到达时，存储LSA失败的路由器退出wait等待状态；
当存储失败的LSA来自其他路由器时，接收其他路由器重传的存储失败的LSA并存储；
当存储失败的LSA为路由器自身生成的LSA时，路由器重新生成存储失败的LSA并存储。
需要说明的是，本发明实施例装置可以以与存储LSA失败的路由器连接的装置，也可以直接嵌入到存储LSA失败的路由器中。
图5为本发明实施例另一实现链路状态通告处理的装置的结构程图，如图5所示，包括接收单元和处理单元：其中，
接收单元设置为，接收存储链路状态通告LSA失败的路由器洪泛到网络中的添加有区分标识的LSA；
处理单元设置为，接收到添加有区分标识的LSA时，根据接收到添加有区分标识的LSA触发自身在运行SPF计算最优路径过程中将生成的添加有区分标识的LSA对应的路由器添加到SPF树时，不将邻居路由器添加到SPF候选列表中；
邻居路由器为生成添加有区分标识的LSA的路由器的邻居路由器。
需要说明的是，本发明实施例装置可以以接收添加有区分标识的LSA的路由器连接的装置，也可以直接嵌入到添加有区分标识的LSA的路由器中。
以下通过具体应用示例对本发明实施例服务器架构进行清楚详细的说明，应用示例仅用于陈述本发明，并不用于限定本发明的保护范围。
应用示例1
本应用示例以存储LSA失败为例对本发明实施例方法进行清楚详细的说明，本应用示例中存储失败的LSA可以是接收的来自网络中其他路由器的LSA，也可以是路由器自身生成的LSA；存储失败的原因可能是路由器的内存达到最大值。
图6为本发明第一应用示例存储LSA失败时处理方法的流程图，如图6所示，包括：
步骤600、存储LSA失败时，判断路由器是否处于wait状态，如果未处于wait状态，则执行步骤6010；否则执行步骤6020.
步骤6010、生成添加有区分标识的LSA并洪泛到网络中的其他路由器，设置wait状态的等待时长为单位等待时长；
其他路由器接收到带区分标识的LSA后，构造SPF树将生成添加有区分标识的LSA的路由器添加到SPF树时，不将邻居路由器添加到SPF候选列表中，即其他路由器不会将存储失败路由器作为转发下一跳路由器。
步骤6020、如果路由器处于wait状态，判断等待时长是否等于最大时长阈值，等待时长等于最大时长阈值时，执行步骤6021；等待时长小于最大时长阈值，执行6022；
步骤6021、通过指数退避机制，设置存储LSA失败的次数与单位等待时长乘积作为等待时长。
步骤6022、保持等待时长等于最大时长阈值不变。
应用示例2
图7为本发明第二应用示例的方法流程图，如图7所示，包括：
步骤700、等待时长未到达，路由器处于wait状态；
步骤701、等待时长到达，路由器退出wait状态；
步骤702、路由器重新存储存储失败的LSA，存储完成后生成不带区分标识的LSA到其他路由器，以使其他路由器运行SPF计算最优路径时将邻居路由器添加到SPF候选列表中。即其他路由器可以考虑将邻居路由器作为转发下一跳路由器。
应用示例3
路由器洪泛添加区分标识的LSA到网络中的其他路由器，其他路由器在运行SPF计算最优路径的流程需要进行相应的修改，将生成添加有区分标识的LSA的路由器添加到SPF树时，不将邻居路由器添加到SPF候选列表中，从而保证了其他路由器不再将存储LSA失败路由器作为转发下一跳路由器，避免了可能出现的路由环路。图8为本发明第三应用示例的方法流程图，如图8所示，包括：
步骤800、运行SPF的路由器将自身添加到最优路径的候选列表中，花费值为0；
步骤801、从候选列表中，选取花费值最小的路由器，并将该路由器添加到SPF树中。
步骤802、判断路由器的LSA带有区分标识；路由器的LSA不带区分标识，执行步骤803；路由器的LSA带区分标识，返回步骤801；
步骤803、处理邻居路由器的链接。
步骤804、判断路由器的链接检查是否通过；路由器的链接检查通过，执行步骤8050；路由器的链接检查未通过，执行步骤8060。
步骤8050、计算根路由器到达邻居路由器的下一跳路由器N的花费值。这里，路由器N为下一跳。
步骤8060、判断是否存在其他未处理邻居路由器的链接；是，返回步骤803；不是，执行步骤80521。
步骤8051、判断邻居路由器是否已经在候选列表中；邻居路由器不在候选列表中，执行80520；邻居路由器已经在候选列表中，执行80530；
步骤80520、将邻居路由器添加到候选列表中。
步骤80521、判断是否还有未处理的邻居路由器链路；还有未处理的邻居路由器链路，返回步骤803；没有未处理的邻居路由器链路，执行步骤80522；
步骤80522、判断候选列表为空；候选列表为空，执行步骤80523；候选列表非空，返回步骤801。
步骤80523、SPF计算结束；
步骤80530、判断计算的花费值小于已知花费值；计算的花费值小于已知花费值，执行步骤805310；计算的花费值大于等于已知花费值，执行步骤805320。
步骤805310、将邻居路由器的花费值修改为计算根路由器到达邻居路由器的下一跳的花费值，确定下一跳为路由器N。之后执行步骤80521。
步骤805320、判断花费值等于已知花费值；花费值等于已知花费值，执行步骤805321；花费值不等于已知花费值，返回步骤8060。
步骤805321、添加下一条到邻居路由器已知下一跳列表后，继续执行步骤8060。
本领域普通技术人员可以理解上述方法中的全部或部分步骤可通过程序来指令相关硬件(例如处理器)完成，所述程序可以存储于计算机可读存储介质中，如只读存储器、磁盘或光盘等。可选地，上述实施例的全部或部分步骤也可以使用一个或多个集成电路来实现。相应地，上述实施例中的每个模块/单元可以采用硬件的形式实现，例如通过集成电路来实现其相应功能，也可以采用软件功能模块的形式实现，例如通过处理器执行存储于存储器中的程序/指令来实现其相应功能。本发明不限制于任何特定形式的硬件和软件的结合。”
虽然本申请所揭露的实施方式如上，但所述的内容仅为便于理解本申请而采用的实施方式，并非用以限定本申请，如本发明实施方式中的具体的实现方法。任何本申请所属领域内的技术人员，在不脱离本申请所揭露的精神 和范围的前提下，可以在实施的形式及细节上进行任何的修改与变化，但本申请的专利保护范围，仍须以所附的权利要求书所界定的范围为准。
工业实用性
上述技术方案避免了存储LSA失败造成路由环路，保证了数据报文的正常传输。

Claims (13)

  1. 一种实现链路状态通告处理的方法，所述方法包括：
    路由器存储链路状态通告LSA失败时，生成添加有区分标识的LSA；
    所述路由器将添加有区分标识的LSA洪泛到网络中的其他路由器中，并通过添加有区分标识的LSA触发其他路由器在运行最短路径优先SPF计算最优路径过程中将生成的添加有区分标识的LSA对应的路由器添加到SPF树时，不将邻居路由器添加到SPF候选列表中；
    所述邻居路由器为生成所述添加有区分标识的LSA的路由器的邻居路由器。
  2. 根据权利要求1所述的方法，所述方法还包括：所述生成添加有区分标识的LSA时，
    设置所述存储LSA失败的路由器进入等待wait状态，并根据存储LSA失败的次数设置相应的等待时长；
    所述等待时长到达时，重新存储所述存储失败的LSA；
    所述等待时长小于预先设置的最大时长阈值。
  3. 根据权利要求2所述的方法，其中，所述根据存储LSA失败的次数设置相应的等待时长包括：
    预先设定单位等待时长，根据存储LSA失败的次数设置相应的等待时长；
    所述等待时长等于存储LSA失败的失败次数与预先设定的单位等待时长的乘积。
  4. 根据权利要求3所述的方法，其中，所述根据存储LSA失败的次数设置相应的等待时长包括：
    当存储LSA失败的次数大于1时，通过指数退避机制对根据存储LSA失败的次数设置的相应的所述等待时长进行设置。
  5. 根据权利要求2～4任一项所述的方法，其中，所述重新存储所述存储失败的LSA包括：
    所述等待时长到达时，所述存储LSA失败的路由器退出等待wait状态；
    当所述存储失败的LSA来自其他路由器时，接收其他路由器重传的存储失败的LSA并存储；
    当所述存储失败的LSA为路由器自身生成的LSA时，路由器重新生成存储失败的LSA并存储。
  6. 一种实现链路状态通告处理的方法，所述方法包括：
    运行最短路径优先SPF计算最优路径的路由器接收存储链路状态通告LSA失败的路由器洪泛到网络中的添加有区分标识的LSA；
    运行最短路径优先SPF计算最优路径的路由器根据接收到添加有区分标识的LSA触发自身在运行SPF计算最优路径过程中将生成的添加有区分标识的LSA对应的路由器添加到SPF树时，不将邻居路由器添加到SPF候选列表中；
    所述邻居路由器为生成所述添加有区分标识的LSA的路由器的邻居路由器。
  7. 一种实现链路状态通告处理的装置，所述装置包括：生成单元和洪泛单元；其中，
    生成单元设置为，在路由器存储LSA失败时，生成添加有区分标识的LSA；
    洪泛单元设置为，将添加有区分标识的LSA洪泛到网络中的其他路由器中，并通过添加有区分标识的LSA触发其他路由器在运行SPF计算最优路径过程中将生成的添加有区分标识的LSA对应的路由器添加到SPF树时，不将邻居路由器添加到SPF候选列表；
    所述邻居路由器为生成所述添加有区分标识的LSA的路由器的邻居路由器。
  8. 根据权利要求7所述的装置，所述该装置还包括等待设置单元和重新存储单元；其中，
    等待设置单元设置为，生成单元生成所述添加有区分标识的LSA时，设置所述存储LSA失败的路由器进入wait等待状态，并根据存储LSA失败的 次数设置相应的等待时长；
    重新存储单元设置为，所述等待时长到达时，重新存储所述存储失败的LSA；
    所述等待时长小于预先设置的最大时长阈值。
  9. 根据权利要求8所述的装置，其中，所述等待时长等于存储LSA失败的失败次数与预先设定的单位等待时长的乘积。
  10. 根据权利要求9所述的装置，其中，所述等待设置单元是设置为，生成单元生成所述添加有区分标识的LSA时，设置所述存储LSA失败的路由器进入wait等待状态，
    存储LSA失败的次数为1时，设置预先设定单位等待时长乘积作为等待时长；
    当存储LSA失败的次数大于1时，所述等待时长通过指数退避机制对根据存储LSA失败的次数设置的相应的所述等待时长进行设置。
  11. 根据权利要求7～10任一项所述的装置，其中，所述重新存储单元是设置为，
    所述等待时长到达时，所述存储LSA失败的路由器退出wait等待状态；
    当所述存储失败的LSA来自其他路由器时，接收其他路由器重传的存储失败的LSA并存储；
    当所述存储失败的LSA为路由器自身生成的LSA时，路由器重新生成存储失败的LSA并存储。
  12. 一种实现链路状态通告处理的装置，所述装置包括接收单元和处理单元：其中，
    接收单元设置为，接收存储链路状态通告LSA失败的路由器洪泛到网络中的添加有区分标识的LSA；
    处理单元设置为，接收到添加有区分标识的LSA时，根据接收到添加有区分标识的LSA触发自身在运行SPF计算最优路径过程中将生成的添加有区分标识的LSA对应的路由器添加到SPF树时，不将邻居路由器添加到SPF候 选列表中；
    所述邻居路由器为生成所述添加有区分标识的LSA的路由器的邻居路由器。
  13. 一种计算机存储介质，所述计算机存储介质中存储有计算机可执行指令，所述计算机可执行指令用于执行权利要求1～6中任一项所述的方法。
PCT/CN2016/076729 2015-07-31 2016-03-18 一种实现链路状态通告处理的方法及装置 WO2016177136A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201510466664.1A CN106411729B (zh) 2015-07-31 2015-07-31 一种实现链路状态通告处理的方法及装置
CN201510466664.1 2015-07-31

Publications (1)

Publication Number Publication Date
WO2016177136A1 true WO2016177136A1 (zh) 2016-11-10

Family

ID=57218483

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/076729 WO2016177136A1 (zh) 2015-07-31 2016-03-18 一种实现链路状态通告处理的方法及装置

Country Status (2)

Country Link
CN (1) CN106411729B (zh)
WO (1) WO2016177136A1 (zh)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108259358B (zh) * 2017-05-24 2020-12-04 新华三技术有限公司 路由发布方法和装置
CN109525496B (zh) * 2018-12-24 2021-01-26 杭州迪普科技股份有限公司 一种链路状态信息的更新方法及装置
CN112953822A (zh) * 2019-12-10 2021-06-11 华为技术有限公司 一种减少路由环路的方法、装置及系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1744567A (zh) * 2005-08-22 2006-03-08 广东省电信有限公司研究院 一种实现快速路由收敛的路由器平稳重启的方法
US20060092952A1 (en) * 2004-10-13 2006-05-04 Sami Boutros System and method for reporting out-of-resources (OOR) conditions in a data network
CN101800694A (zh) * 2009-09-16 2010-08-11 福建星网锐捷网络有限公司 资源告警处理方法和路由交换设备
CN103746828A (zh) * 2013-12-17 2014-04-23 福建星网锐捷网络有限公司 一种管理网络节点的方法及装置

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6985959B1 (en) * 2000-11-01 2006-01-10 Nortel Networks Limited Constraint route dissemination using distributed route exchanges
US7639631B2 (en) * 2005-09-30 2009-12-29 Nortel Networks Limited Parallel constraint based path computation using path vector
CN100499658C (zh) * 2005-11-12 2009-06-10 华为技术有限公司 一种避免冗余Flood的方法
CN103001879B (zh) * 2012-06-29 2015-09-23 杭州华三通信技术有限公司 减少链路状态通告洪泛次数的方法及设备
CN102868619B (zh) * 2012-09-10 2015-09-23 杭州华三通信技术有限公司 一种lsa的传输方法和设备

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060092952A1 (en) * 2004-10-13 2006-05-04 Sami Boutros System and method for reporting out-of-resources (OOR) conditions in a data network
CN1744567A (zh) * 2005-08-22 2006-03-08 广东省电信有限公司研究院 一种实现快速路由收敛的路由器平稳重启的方法
CN101800694A (zh) * 2009-09-16 2010-08-11 福建星网锐捷网络有限公司 资源告警处理方法和路由交换设备
CN103746828A (zh) * 2013-12-17 2014-04-23 福建星网锐捷网络有限公司 一种管理网络节点的方法及装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
E . ROSEN ET AL.: "Using a Link State Advertisement (LSA) Options Bit to Prevent Looping in BGP/MPLS IP Virtual Private Networks (VPNs)", IETF, 30 June 2006 (2006-06-30), pages 1 - 7, XP055328117 *

Also Published As

Publication number Publication date
CN106411729A (zh) 2017-02-15
CN106411729B (zh) 2020-04-28

Similar Documents

Publication Publication Date Title
JP7389838B2 (ja) インテリアゲートウェイプロトコルフラッディング最小化
US11411853B2 (en) Link-state advertisement LSA sending method, apparatus, and system
US9699077B2 (en) Method for determining a packet forwarding path, network device, and control device
EP3454510B1 (en) Message forwarding method and apparatus
US10439880B2 (en) Loop-free convergence in communication networks
KR101629533B1 (ko) 브로드캐스트 네트워크에 대한 ｌｄｐ ｉｇｐ 동기화
US20130089094A1 (en) Method and Apparatus for Dissemination of Information Between Routers
EP2421206A1 (en) Flooding-based routing protocol having database pruning and rate-controlled state refresh
US7936667B2 (en) Building backup tunnels for fast reroute in communications networks
CN108768796B (zh) 链路故障检测方法及装置
JP2014534776A (ja) 全範囲の保護を提供するｉｐ高速リルート方式
US11805047B2 (en) Method and apparatus for controlling network traffic path
US9699073B2 (en) System and method for reducing traffic loss while using loop free alternate routes for multicast only fast reroute (MoFRR)
CN111385194B (zh) 一种网络路径收敛的方法以及相关设备
JP2013546269A (ja) ルーティング情報更新の優先順位付け
CN102325080B (zh) 一种ospf协议平滑重启方法和装置
CN110535761A (zh) 报文转发方法及装置
WO2016177136A1 (zh) 一种实现链路状态通告处理的方法及装置
CN113615132A (zh) 快速泛洪拓扑保护
US20230116548A1 (en) Route Processing Method and Related Device
WO2017092550A1 (zh) 一种域间路由方法、装置及网络侧设备
WO2017000566A1 (zh) 一种获取设备接口mru值的方法及装置
WO2017152595A1 (zh) 一种响应网络拓扑变化的方法和装置
JP5180977B2 (ja) ノード、パケット転送方法およびそのプログラム
WO2023005530A1 (zh) 报文处理方法及网络处理设备、存储介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16789130

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 16789130

Country of ref document: EP

Kind code of ref document: A1