WO2015117412A1 - 基于isis的洪泛方法及装置 - Google Patents
基于isis的洪泛方法及装置 Download PDFInfo
- Publication number
- WO2015117412A1 WO2015117412A1 PCT/CN2014/089495 CN2014089495W WO2015117412A1 WO 2015117412 A1 WO2015117412 A1 WO 2015117412A1 CN 2014089495 W CN2014089495 W CN 2014089495W WO 2015117412 A1 WO2015117412 A1 WO 2015117412A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- lsp
- network topology
- lsps
- distribution tree
- isis
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 48
- 241000764238 Isis Species 0.000 title claims abstract 7
- ABEXEQSGABRUHS-UHFFFAOYSA-N 16-methylheptadecyl 16-methylheptadecanoate Chemical compound CC(C)CCCCCCCCCCCCCCCOC(=O)CCCCCCCCCCCCCCC(C)C ABEXEQSGABRUHS-UHFFFAOYSA-N 0.000 claims abstract 6
- 238000005417 image-selected in vivo spectroscopy Methods 0.000 claims abstract 6
- 238000012739 integrated shape imaging system Methods 0.000 claims abstract 6
- 230000008569 process Effects 0.000 claims description 13
- 238000006424 Flood reaction Methods 0.000 claims description 12
- 238000004364 calculation method Methods 0.000 claims description 9
- 230000005540 biological transmission Effects 0.000 abstract description 13
- 238000012545 processing Methods 0.000 abstract description 6
- 238000010586 diagram Methods 0.000 description 9
- 238000005516 engineering process Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000002411 adverse Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 238000013138 pruning Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/64—Hybrid switching systems
- H04L12/6418—Hybrid transport
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
-
- 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/03—Topology update or discovery by updating link state protocols
-
- 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/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/48—Routing tree calculation
Definitions
- the present invention relates to the field of communications, and in particular to a flooding method and apparatus based on an intermediate system to an intermediate system (ISIS).
- ISIS intermediate system
- ISIS Intermediate System to Intermediate System Routing Protocol
- IGP Interior Gateway Protocol
- each intermediate system Intermediate System, or IS
- LSP Link State Protocol Data Unit
- the information is sent to the network and also stores the LSPs sent by all IS devices on the network topology to form a Link State Data Base (LSDB).
- LSDB Link State Data Base
- ISIS uses the LSDB to calculate the best route to the destination address through the Shortest Path First (SPF) algorithm.
- SPF Shortest Path First
- any IS will send its own LSPs from all outbound interfaces with neighbors. After receiving an LSP from one interface, it will send it out from other interfaces. This will cause the LSPs saved by all ISs in the network to eventually reach the same propagation process. , called flooding of LSPs.
- the LSP mainly contains a large amount of IP reachability information, that is, IP prefix routing information. This information is generally stored in an LSP numbered 0, which does not affect network topology calculations.
- the link state database that needs to be advertised is relatively large.
- such networks generally require a large amount of IP reachability information to be advertised.
- the IP reachability information generated by an IS in an LSP may be sent frequently.
- the periodic update of an LSP will cause a large number of LSPs to be synchronized on the network.
- the network bandwidth resources of the LSP are also caused by the LSP.
- an IS sends the LSP on all interfaces except the receiving interface, which may cause the IS system CPU to be busy. Further, it may also be caused by the large number of LSPs being sent.
- the Hello keep-alive message cannot be sent in time to cause the neighbor to be broken.
- the embodiment of the invention provides an ISIS-based flooding method and device, so as to at least solve the problem that the LSP occupies too much resources in the related art.
- an ISIS-based flooding method including: an intermediate system (IS) in a network topology uses a pre-agreed IS in the network topology as a root, and performs a shortest path first. (SPF) algorithm to calculate a prune-free distribution tree that reaches all ISs in the network topology; the IS in the network topology floods the link state protocol packet (LSP) packets along the distribution tree pan.
- IS intermediate system
- SPF shortest path first.
- the IS in the network topology includes a pre-agreed IS in the network topology as a root.
- the IS in the network topology uses the IS with the largest system ID in the network topology as the root.
- the IS in the network topology uses a pre-agreed IS in the network topology as the root of the tree.
- the method further includes: a neighbor metric that is advertised by any non-pseudo node in the process of performing SPF calculation. Treated as 1; ignores the Overload Bit (OL) flag in the LSP message.
- OL Overload Bit
- the IS in the network topology floods the LSPs along the distribution tree, including: the IS in the network topology sends the generated LSPs from the outbound interface on the distribution tree; or the IS in the network topology
- the received LSPs generated by other ISs are sent out from the outbound interface except the receiving interface on the distribution tree.
- the IS in the network topology floods the LSPs along the distribution tree.
- the LSPs are classified into important LSPs and unimportant LSPs according to the importance.
- the IS in the network topology will not The important LSP packets are flooded along the distribution tree.
- the LSPs are classified into important LSPs and unimportant LSPs according to the importance of the LSPs.
- the IS flag is set in the ISIS protocol packet.
- the IS in the network topology generates the non-zero number and the LSP that does not contain the neighbor TLV.
- the normal flag is set to indicate that the LSP packet is a value of an unimportant LSP message.
- Setting the normal flag bit in the ISIS protocol message includes: defining the eighth bit of the fifth byte of the common header in the ISIS protocol message as the normal flag bit.
- the value of the LSP packet indicating that the LSP packet is an unimportant LSP is 1.
- the LSP packet is classified into the important LSP packet and the unimportant LSP packet according to the importance.
- the flag is also used to indicate that the LSP packet is a value of the important LSP packet.
- the value of the LSP packet indicating that the LSP packet is an important LSP is 0.
- an ISIS-based flooding device is provided on an intermediate system (IS) in a network topology, comprising: a computing module configured to pre-agreed one of the network topologies As the root of the tree, IS performs the Shortest Path First (SPF) algorithm to calculate all the ones that arrive in the network topology.
- SPF Shortest Path First
- a pruning-free distribution tree of IS a flooding module configured to flood link state protocol packet (LSP) messages along the distribution tree.
- LSP link state protocol packet
- an IS in a network topology is used as a root of a pre-agreed IS in the network topology, and an SPF algorithm is executed to calculate a pruning-free one that reaches all ISs in the network topology.
- the distribution tree; the IS in the network topology floods the LSPs along the distribution tree, and solves the problem that the LSPs occupy too many resources in the related technologies, and removes redundant transmissions on unnecessary interfaces in a large number of LSP synchronizations.
- the overall data stream load of the network is reduced, and the processing resources occupied by the IS device to send a large number of LSPs on all interfaces are reduced, and the overall performance of the IS device is improved.
- FIG. 1 is a flow chart of an ISIS-based flooding method in accordance with an embodiment of the present invention
- FIG. 2 is a structural block diagram of an ISIS-based flooding device according to an embodiment of the present invention.
- FIG. 3 is a schematic structural diagram of a common header of an original ISIS protocol packet according to a preferred embodiment of the present invention.
- FIG. 4 is a schematic structural diagram of a modified public header of an ISIS protocol packet according to a preferred embodiment of the present invention.
- FIG. 5 is a schematic flowchart of setting a G flag bit when an LSP is generated according to a preferred embodiment of the present invention
- FIG. 6 is a schematic diagram of a flooding topology of an ISIS protocol LSP packet according to a preferred embodiment of the present invention.
- FIG. 1 is a flowchart of an ISIS-based flooding method according to an embodiment of the present invention. As shown in FIG. 1, the method includes the following steps:
- Step S102 An intermediate system (IS) in the network topology uses a pre-agreed IS in the network topology as a root, and performs a shortest path first (SPF) algorithm to calculate one IS that arrives in the network topology. Unpruned distribution tree;
- Step S104 The IS in the network topology floods the link state protocol data packet (LSP) packet along the distribution tree.
- LSP link state protocol data packet
- the IS in the network topology performs the SPF algorithm according to the convention, calculates a distribution tree, and sends the LSP packet along the distribution tree, compared to each interface in the related technology that includes the ISIS neighbor.
- the flooding mode of sending LSPs on the network is used to reduce the network load and possible adverse effects of the LSPs on the network. This solves the problem of excessive LSP resources in the related technologies. Redundant transmission on the required interface reduces the overall data flow load of the network, reduces the processing resource usage of the IS device to send a large number of LSPs on all interfaces, and improves the overall performance of the IS device.
- the IS in the network topology may pre-approve the IS with the largest system identifier (System ID) in the network topology as the root of the tree.
- System ID system identifier
- the neighbor metric advertised by any non-pseudo node may be treated as 1 in the calculation process of performing the SPF algorithm; and the LSP message is ignored.
- the IS in the network topology flooding the LSP packet along the distribution tree may include: for the IS that generates the LSP packet in the network topology, the IS may send the generated LSP packet from the distribution tree.
- the outgoing interface is sent out; or, for an IS that does not generate LSPs in the network topology, the IS can send the received LSPs generated by other ISs from the outbound interface except the receiving interface on the distribution tree. Go out.
- the IS in the network topology can classify the LSPs as important LSPs and unimportant LSPs according to the importance; the IS in the network topology can along the unimportant LSPs.
- the distribution tree is flooded.
- the normal flag bit can be set in the ISIS protocol packet; when the IS in the network topology generates the non-zero number and the LSP packet that does not include the neighbor TLV, the common flag bit is set to indicate the LSP packet.
- the value of the LSP is the value of the important LSP. Otherwise, the common flag is used to indicate that the LSP is the value of the important LSP.
- the eighth bit of the fifth byte of the common header in the ISIS protocol packet may be defined as the common flag bit, and may be set to indicate that the LSP packet is an unimportant LSP packet value of 1 The value of the LSP packet is 0.
- an ISIS-based flooding device is also provided in the embodiment, which is located in an intermediate system (IS) in the network topology, and the device is configured to implement the above embodiments and preferred embodiments, and has been performed. The description will not be repeated.
- the term "module” may implement a combination of software and/or hardware of a predetermined function.
- the apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.
- FIG. 2 is a structural block diagram of an ISIS-based flooding device according to an embodiment of the present invention. As shown in FIG. 2, the device includes a computing module 22 and a flooding module 24. The following describes each module in detail:
- the calculating module 22 is configured to use a pre-agreed IS in the network topology as a root, and perform a shortest path first SPF algorithm to calculate a prune-free distribution tree that reaches all ISs in the network topology;
- the flooding module 24 is connected to the computing module 22 and configured to flood the LSP message along the distribution tree calculated by the computing module 22.
- a flooding method for an ISIS protocol LSP is provided, which operates on a network device of the ISIS, thereby reducing the network load on the ISIS protocol link state protocol data packet (LSP).
- An LSP with a non-zero number and no neighbor information is flooded by a consistent pruning distribution tree calculated by all intermediate systems in the network.
- the eighth bit of the fifth byte of the common header in the ISIS protocol packet is defined as a general (General, G) flag, which represents the LSP as general information, and the non-zero number and the LSP that does not contain the neighbor information are generated. Will be set to 1.
- An LSP with the G flag of 1 is flooded along the distribution tree. The LSP set to 0 floods according to the original protocol.
- the calculation of the distribution tree uses the intermediate system (IS) with the largest System-ID in the network as the root of the tree, and performs the SPF (Shortest Path First) algorithm. In the calculation, all non-pseudo-node neighbor metrics are considered to be 1, and the LSP packet is ignored.
- the OL (overload) flag so that a non-pruned distribution tree that reaches all ISs (intermediate systems) in the network topology can be calculated. In this way, a large number of redundant transmissions on the unnecessary interfaces in the LSP synchronization are removed; the overall data flow load of the network is reduced; and the processing resources occupied by the IS devices transmitting a large number of LSPs on all interfaces are reduced; performance.
- the solution of the preferred embodiment is also compatible with the flooding and synchronization method of the ISIS Foundation Protocol (RFC1142) LSP. This solution is suitable for a variety of ISIS-enabled devices, including routers and switches.
- a flooding method for an ISIS protocol LSP is provided.
- the basic protocol of the ISIS is modified to support the LSP flooding method of the preferred embodiment, that is, the ISIS protocol packet is used.
- the eighth bit of the fifth byte of the public header is defined as the G (normal) flag.
- any IS uses the IS with the largest System-ID in the network topology as the root of the tree, and executes the SPF algorithm to calculate a non-pseudo-distribution tree.
- the neighbor metric (metric) advertised by the node is treated as 1.
- the specific manner of flooding the LSP packet of the G flag position 1 in the LSP common header along the calculated distribution tree may be as follows:
- any 0-number LSP generated by any intermediate system (IS) in a network topology and an LSP containing neighbor information will set the G flag to 0 in the common header of the LSP message, then Sending it out from all interfaces that contain ISIS neighbors; the numbered LSP generated by other intermediate systems (IS) received from one interface and the LSP containing neighbor information, that is, the G flag in the common header of the LSP packet is 0.
- the LSP packet is sent out from other interfaces except the receiving interface that contain ISIS neighbors. In such a common header, an LSP message with a G flag of 0 is set, regardless of whether a distribution tree exists or not.
- the outbound interface on the distribution tree other than the receiving interface is sent out.
- the LSP generated by any IS in a network topology will be sent out from all interfaces containing ISIS neighbors; the LSPs generated by other ISs received from one interface , sent from other interfaces except the receiving interface that contain ISIS neighbors.
- the above ISIS protocol LSP flooding method can reduce the network load and possible adverse effects of a large number of LSPs flooding the network.
- FIG. 3 is a schematic structural diagram of a common header of an original ISIS protocol packet according to a preferred embodiment of the present invention.
- an 8-byte public header each byte is The first byte is the intra-domain routing protocol discriminator; the second byte is the length identifier; the third byte is the version/protocol ID extension; the fourth byte is the ID length, and the fifth byte is the 8th to 6-bit reserved bits and 5th to 1st-bit PDU types, the sixth byte is the version, the seventh byte is the reserved bit, and the eighth byte is the most regional address.
- the 4 is a schematic structural diagram of a modified common header of an ISIS protocol message according to a preferred embodiment of the present invention.
- the 8th bit in the fifth byte is reserved.
- the bits are defined as normal flag bits, ie G flag bits.
- a G flag of 1 indicates that the message is a normal message; a message set to 0 indicates that the message is an important message.
- the important LSP message indicates that the LSP packet affects the extension.
- the LSP packet is a LSP with a number of 0s and an LSP with a neighboring TLV.
- the LSP is a LSP with a non-zero number and an LSP with no neighbor TLV.
- the IS in the network topology is the root of the system-ID with the largest IS in the network topology.
- the SPF algorithm is used to calculate a non-pruned distribution tree.
- the neighbor metric (measurement value) advertised by any non-pseudo-node is calculated. ) treated as 1 .
- OL overload bit flag in the LSP to ensure that this distribution tree can reach the intermediate system (IS) in any network topology.
- any one of the ISs in a network topology generates its own 0-number LSP and the LSP containing the neighbor information.
- the G flag is set to 0 in the common header of the LSP message, and then it will be included. All the interfaces of the ISIS neighbor are sent out; the LSPs of the 0s generated by the other ISs and the LSPs containing the neighbor information, that is, the LSPs whose G flag is 0 in the common header of the LSP, are removed. It is sent out on the interface other than the receiving interface that contains the ISIS neighbor.
- the LSP message with the G flag bit set to 1 in this type of common header is always the same regardless of whether there is a distribution tree.
- the LSP generated by any IS in a network topology will be sent out from all interfaces containing ISIS neighbors; the LSPs generated by other ISs received from one interface , sent from other interfaces except the receiving interface that contain ISIS neighbors.
- the solution of the preferred embodiment is fully compatible with the flooding and synchronization method of the LSP of the ISIS Foundation Protocol (RFC1142).
- the IS flag can be ignored for IS that does not support the flooding mode in the preferred embodiment.
- This link state protocol packet (LSP) flooding method of the ISIS protocol has the following advantages:
- an intermediate system may send out LSPs from the owned interface, which may not be necessary because: on the one hand, the intermediate system (IS) of the other party has been and the intermediate system The other interfaces connected to the (IS) interface received the LSP packet. On the other hand, the LSP packet may have been received from other intermediate systems (IS) on the network. Therefore, the flooding mode eliminates the LSP redundancy transmission on some interfaces, and ensures that all intermediate systems on the network receive LSP packets, making LSP transmission more efficient.
- FIG. 5 is a schematic diagram of a process of setting a G flag bit during LSP generation according to a preferred embodiment of the present invention. As shown in FIG. 5, the process includes the following steps:
- Step S502 an IS (intermediate system) determines whether it is necessary to generate an LSP message; if yes, proceeds to step S504, otherwise ends the process;
- Step S504 the IS generates an LSP packet.
- Step S506 after generating its own LSP message, the IS performs an LSP that determines whether it is a non-zero number and an LSP that does not include a neighbor TLV (Type, Length, Value); if yes, the process proceeds to step S508, otherwise, the process proceeds to step S508.
- S510 ;
- Step S508 if it is a non-zero-numbered LSP and an LSP that does not include a neighbor TLV, set the G flag bit in the common header to 1, and then end the process;
- Step S510 otherwise set to 0, and then the flow ends.
- FIG. 6 is a schematic diagram of a flooding topology of an ISIS protocol LSP packet according to a preferred embodiment of the present invention.
- a network consisting of R2, R3, R4, R5, and R6, all connections represent network devices of the network. The link between them, the solid line indicates the link on the distribution tree, and the dotted line indicates the link that is not on the distribution tree. Assume that R1 joins this network topology after the network is stable.
- the intermediate system R1 After the intermediate system R1 joins the network topology, the local area network (LAN) broadcast network neighbor is established with R2, and the intermediate system R1 does not calculate the distribution tree at this time. Therefore, all the LSPs generated by R1 are in the same state. Sent on the R2 connected interface. After R2 receives the LSP of R1, the LSP of the R1 and the LSP containing the neighbor information, that is, the LSP whose G flag is 0, are sent out from the interface other than the received interface and sent to R3 and R4.
- LAN local area network
- R3 After receiving the LSP generated by R1, R3 will also send the LSP with the 0-number LSP and the LSP containing the neighbor information, that is, the G flag with the G flag, to the interface other than the received interface, and send it to R5 and R6.
- R4 After receiving the LSP generated by R1, R4 will also send the LSP with the LSP and the LSP with the neighbor information, that is, the LSP with the G flag to 0, from the interface other than the received interface, and send it to R5.
- the transmission is terminated.
- the DIS is elected between R1 and R2, and the R2 is elected as the DIS (Designated Intermediate System), and the CSNP (Complete Sequence Number Protocol Data Unit) is periodically sent.
- the CSNP includes All the LSP digest information stored in R2, after receiving R1, it finds that it does not have LSPs of R2, R3, R4, R5, and R6, and sends a PSNP (Partial Sequence Number Protocol Data Unit) to R2.
- the unit requests the LSPs, and R2 sends the LSPs of R2, R3, R4, R5, and R6 to R1.
- the LSP message database information in the entire network is consistent.
- R1, R2, R3, R4, R5, and R6 are synchronized by the LSP, and finally use the unified LSP database information, and select R2 (System-ID maximum) as the root of the tree to calculate the distribution as shown by the black solid line in the figure. tree.
- the LSP of the number 0 that is regenerated by R1 is set to 0, the LSP will be sent from the neighbors of R1 and sent to R2.
- R2 receives the LSP of R1
- the LSP of the numbered LSP of R1 and the LSP containing the neighbor information that is, the LSP whose G flag is 0, is still sent from the interface other than the received interface, and is sent to R3 and R4;
- R3, R4, R5, and R6 are all sent to the interface except the received interface until the LSP of the R1 and the LSP containing the neighbor information, that is, the LSP with the G flag is 0, until all the intermediate systems receive This LSP message is reached.
- R1 If R1 generates an LSP other than 0, and its content does not contain neighbor information, the G flag will be set to 1. At this point, it is found that the distribution tree has been calculated and will be sent along the distribution tree path shown by the solid line. , sent to R2. After receiving the LSP, R2 still sends along the distribution tree path shown by the solid line and sends it to R3 and R4. After receiving the LSP, R3 still sends and sends along the distribution tree path shown by the solid line. R5 and R6 are given; after receiving R3, it is found that there is no other interface in the distribution tree except for receiving the LSP interface, and the forwarding is terminated, and it will not be connected to R5. Forwarded on the interface. In this way, all the LSPs in Figure 6 are finally received by R1 to generate the non-zero-numbered LSP, and the synchronization state is reached.
- a storage medium in which the above software is stored, including but not limited to an optical disk, a floppy disk, a hard disk, an erasable memory, and the like.
- modules or steps of the present invention described above can be implemented by a general-purpose computing device that can be centralized on a single computing device or distributed across a network of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein.
- the steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps thereof are fabricated as a single integrated circuit module.
- the invention is not limited to any specific combination of hardware and software.
- the ISIS-based flooding method and apparatus provided by the embodiments of the present invention have the following beneficial effects: the problem that the LSP occupies too much resources in the related art is solved, and a large number of unnecessary interfaces in the LSP synchronization are removed. Redundant transmission reduces the overall data flow load of the network, reduces the processing resources occupied by the IS device to send a large number of LSPs on all interfaces, and improves the overall performance of the IS device.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Claims (11)
- 一种基于中间系统到中间系统路由协议ISIS的洪泛方法,包括:网络拓扑中的中间系统IS将所述网络拓扑中的一个预先约定的IS作为树根,执行最短路径优先SPF算法,以计算出一颗到达所述网络拓扑中所有IS的无剪枝的分发树;网络拓扑中的IS将链路状态协议数据包LSP报文沿所述分发树进行洪泛。
- 根据权利要求1所述的方法,其中,网络拓扑中的IS将所述网络拓扑中的一个预先约定的IS作为树根包括:网络拓扑中的IS将所述网络拓扑中的系统标识System ID最大的IS作为树根。
- 根据权利要求1所述的方法,其中,在网络拓扑中的IS将所述网络拓扑中的一个预先约定的IS作为树根,执行SPF算法之后,还包括:在执行SPF的计算过程中将任何非伪节点通告的邻居度量值metric当作1处理;忽略所述LSP报文中的过载位OL标志位。
- 根据权利要求1所述的方法,其中,网络拓扑中的IS将LSP报文沿所述分发树进行洪泛包括:网络拓扑中的IS将生成的LSP报文从所述分发树上的出接口发送出去;或者,网络拓扑中的IS将接收到的其他IS生成的LSP报文从所述分发树上的除接收接口以外的出接口发送出去。
- 根据权利要求1所述的方法,其中,在网络拓扑中的IS将LSP报文沿所述分发树进行洪泛包括:将LSP报文依据重要性分类为重要LSP报文和不重要LSP报文;在网络拓扑中的IS将所述不重要LSP报文沿所述分发树进行洪泛。
- 根据权利要求5所述的方法,其中,将LSP报文依据重要性分类为重要LSP报文和不重要LSP报文包括:在ISIS协议报文中设置普通标志位;当网络拓扑中的IS生成非0编号和不包含邻居TLV的LSP报文时,设置所述普通标志位为用于指示所述LSP报文为不重要LSP报文的值。
- 根据权利要求6所述的方法,其中,在ISIS协议报文中设置普通标志位包括:将ISIS协议报文中的公共头第五个字节的第八比特定义为所述普通标志位。
- 根据权利要求6所述的方法,其中,所述用于指示所述LSP报文为不重要LSP报文的值为1。
- 根据权利要求6所述的方法,其中,将LSP报文依据重要性分类为重要LSP报文和不重要LSP报文还包括:否则,设置所述普通标志位为用于指示所述LSP报文为重要LSP报文的值。
- 根据权利要求9所述的方法,其中,所述用于指示所述LSP报文为重要LSP报文的值为0。
- 一种基于中间系统到中间系统路由协议ISIS的洪泛装置,位于网络拓扑中的中间系统IS上,包括:计算模块,设置为将所述网络拓扑中的一个预先约定的IS作为树根,执行最短路径优先SPF算法,以计算出一颗到达所述网络拓扑中所有IS的无剪枝的分发树;洪泛模块,设置为将链路状态协议数据包LSP报文沿所述分发树进行洪泛。
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP14881736.4A EP3157211B1 (en) | 2014-07-18 | 2014-10-24 | Isis-based flooding method and device |
RU2017102701A RU2656709C1 (ru) | 2014-07-18 | 2014-10-24 | Способ и устройство лавинной маршрутизации на основе протокола isis |
MYPI2017000078A MY187024A (en) | 2014-07-18 | 2014-10-24 | Isis-based flooding method and device |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410345660.3A CN105282041A (zh) | 2014-07-18 | 2014-07-18 | 基于isis的洪泛方法及装置 |
CN201410345660.3 | 2014-07-18 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2015117412A1 true WO2015117412A1 (zh) | 2015-08-13 |
Family
ID=53777229
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2014/089495 WO2015117412A1 (zh) | 2014-07-18 | 2014-10-24 | 基于isis的洪泛方法及装置 |
Country Status (5)
Country | Link |
---|---|
EP (1) | EP3157211B1 (zh) |
CN (1) | CN105282041A (zh) |
MY (1) | MY187024A (zh) |
RU (1) | RU2656709C1 (zh) |
WO (1) | WO2015117412A1 (zh) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN114615198A (zh) * | 2018-01-12 | 2022-06-10 | 华为技术有限公司 | 内部网关协议洪泛最小化 |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107819726B (zh) * | 2016-09-12 | 2021-12-24 | 中兴通讯股份有限公司 | Is-is协议接口标识高效使用的方法、装置及系统 |
CN108075981B (zh) * | 2016-11-16 | 2021-04-09 | 华为技术有限公司 | 一种链路状态数据包的传输方法及路由节点 |
WO2020047549A1 (en) | 2018-08-31 | 2020-03-05 | Futurewei Technologies, Inc. | System and method to reduce flooding topology size |
CN108965141B (zh) * | 2018-09-18 | 2021-03-30 | 深圳市风云实业有限公司 | 一种多路径路由树的计算方法及装置 |
CN111030943A (zh) * | 2019-12-13 | 2020-04-17 | 迈普通信技术股份有限公司 | 一种报文的处理方法、装置、转发设备及存储介质 |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102882784A (zh) * | 2012-10-16 | 2013-01-16 | 杭州华三通信技术有限公司 | Spbm中的lsp信息泛洪方法及设备 |
CN103532840A (zh) * | 2013-10-11 | 2014-01-22 | 杭州华三通信技术有限公司 | 一种链路切换方法和装置 |
CN103546381A (zh) * | 2012-07-12 | 2014-01-29 | 华为技术有限公司 | 基于内部网关协议创建双向组播分发树的方法、装置及系统 |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6606325B1 (en) * | 1999-12-10 | 2003-08-12 | Nortel Networks Limited | Fast path forwarding of link state advertisements using multicast addressing |
CN101179488B (zh) * | 2006-11-10 | 2010-08-25 | 华为技术有限公司 | 通告自治系统边界连接信息的方法和装置 |
CN103036787B (zh) * | 2011-10-09 | 2016-09-28 | 华为技术有限公司 | 一种网络路由收敛处理方法和装置 |
US9608900B2 (en) * | 2012-08-08 | 2017-03-28 | Cisco Technology, Inc. | Techniques for flooding optimization for link state protocols in a network topology |
US9413637B2 (en) * | 2012-10-22 | 2016-08-09 | Avaya Inc. | Architecture for virtualization and distribution of routing information used in a transport network |
-
2014
- 2014-07-18 CN CN201410345660.3A patent/CN105282041A/zh active Pending
- 2014-10-24 MY MYPI2017000078A patent/MY187024A/en unknown
- 2014-10-24 WO PCT/CN2014/089495 patent/WO2015117412A1/zh active Application Filing
- 2014-10-24 EP EP14881736.4A patent/EP3157211B1/en active Active
- 2014-10-24 RU RU2017102701A patent/RU2656709C1/ru active
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103546381A (zh) * | 2012-07-12 | 2014-01-29 | 华为技术有限公司 | 基于内部网关协议创建双向组播分发树的方法、装置及系统 |
CN102882784A (zh) * | 2012-10-16 | 2013-01-16 | 杭州华三通信技术有限公司 | Spbm中的lsp信息泛洪方法及设备 |
CN103532840A (zh) * | 2013-10-11 | 2014-01-22 | 杭州华三通信技术有限公司 | 一种链路切换方法和装置 |
Non-Patent Citations (1)
Title |
---|
See also references of EP3157211A4 * |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN114615198A (zh) * | 2018-01-12 | 2022-06-10 | 华为技术有限公司 | 内部网关协议洪泛最小化 |
US11489766B2 (en) | 2018-01-12 | 2022-11-01 | Huawei Technologies Co., Ltd. | Interior gateway protocol flood minimization |
US11991074B2 (en) | 2018-01-12 | 2024-05-21 | Huawei Technologies Co., Ltd. | Interior gateway protocol flood minimization |
Also Published As
Publication number | Publication date |
---|---|
MY187024A (en) | 2021-08-26 |
CN105282041A (zh) | 2016-01-27 |
RU2656709C1 (ru) | 2018-06-06 |
EP3157211B1 (en) | 2018-11-28 |
EP3157211A4 (en) | 2017-08-02 |
EP3157211A1 (en) | 2017-04-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10673741B2 (en) | Control device discovery in networks having separate control and forwarding devices | |
US10320657B2 (en) | Device mobility in a mesh network | |
EP2548341B1 (en) | Alternate down paths for directed acyclic graph (dag) routing | |
US9325626B2 (en) | Method and apparatus to reduce cumulative effect of dynamic metric advertisement in smart grid/sensor networks | |
US8489765B2 (en) | Dynamic directed acyclic graph (DAG) adjustment | |
US8595359B2 (en) | Efficient message distribution for directed acyclic graphs | |
WO2015117412A1 (zh) | 基于isis的洪泛方法及装置 | |
EP2652905B1 (en) | Increased communication opportunities with low-contact nodes in a computer network | |
Vetriselvan et al. | Survey on the RIP, OSPF, EIGRP routing protocols | |
US9210045B2 (en) | Gravitational parent selection in directed acyclic graphs | |
EP2392158B1 (en) | Method for supporting routing decisions in a wireless mesh network and wireless mesh network | |
WO2015154420A1 (zh) | 基于isis的路由计算方法及装置 | |
WO2017084448A1 (zh) | 一种网络系统及网络运行方法 | |
WO2015154427A1 (zh) | Trill isis的路由计算方法及装置 | |
CN101909004A (zh) | 基于边缘roadm环结构的多域光网络路由方法 | |
WO2018090852A1 (zh) | 链路状态数据包的传输方法及路由节点 | |
CN105591940B (zh) | 一种trill网络分发树选择方法和trill网络节点 | |
Deshpande et al. | DISTRBUTED CACHE ARCHITECTURE FOR SCALABLE QUALIY OF SERVICS FOR DISRIBUTED NETWORKS | |
CN117957825A (zh) | 边界网关协议(bgp)-最短路径优先(spf)泛洪减少 | |
Constantinou et al. | Resilient recursive routing in communication networks | |
Rangaswamy et al. | Adaptive Routing Algorithms in Distributed Networks |
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: 14881736 Country of ref document: EP Kind code of ref document: A1 |
|
REEP | Request for entry into the european phase |
Ref document number: 2014881736 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2014881736 Country of ref document: EP |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
ENP | Entry into the national phase |
Ref document number: 2017102701 Country of ref document: RU Kind code of ref document: A |