CN109005121A - A kind of route computing method and device - Google Patents

A kind of route computing method and device Download PDF

Info

Publication number
CN109005121A
CN109005121A CN201810973396.6A CN201810973396A CN109005121A CN 109005121 A CN109005121 A CN 109005121A CN 201810973396 A CN201810973396 A CN 201810973396A CN 109005121 A CN109005121 A CN 109005121A
Authority
CN
China
Prior art keywords
routing
lsp
routing iinformation
filtering
routing device
Prior art date
Legal status (The legal status 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 status listed.)
Granted
Application number
CN201810973396.6A
Other languages
Chinese (zh)
Other versions
CN109005121B (en
Inventor
彭家军
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
New H3C Information Technologies Co Ltd
Original Assignee
New H3C Technologies Co Ltd
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 New H3C Technologies Co Ltd filed Critical New H3C Technologies Co Ltd
Priority to CN201810973396.6A priority Critical patent/CN109005121B/en
Publication of CN109005121A publication Critical patent/CN109005121A/en
Application granted granted Critical
Publication of CN109005121B publication Critical patent/CN109005121B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • H04L45/021Ensuring consistency of routing table updates, e.g. by using epoch numbers

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The disclosure provides a kind of route computing method and device, and first routing device can be made to receive the LSP that secondary route equipment is sent, and secondary route equipment and the first routing device are is-is neighbor;If it is determined that the routing iinformation that the LSP is carried is filtering routing, then filter identification is added for the routing iinformation;According to the route table items of the local updating route information local for being not added with filter identification;The LSP is broadcasted later, so that route table items of the is-is neighbor routing device of this routing device according to the LSP updating route information itself carried, so that other routing devices be made also to be filtered to the routing iinformation.Therefore the disclosure, which can solve, carries out the obstructed problem of flow caused by router-level topology for the routing iinformation of filtering, optimizes router-level topology result.

Description

A kind of route computing method and device
Technical field
This disclosure relates to field of communication technology more particularly to a kind of route computing method and device.
Background technique
IS-IS (Intermediate System-to-Intermediate System, Intermediate System-to-Intermediate System) Belong to IGP (Interior Gateway Protocol, Interior Gateway Protocol), for inside autonomous system.IS-IS is a kind of Link-state protocol carries out router-level topology using SPF (Shortest Path First, shortest path first) algorithm.
IS-IS is typically split into multiple regions in routed domain, and a router, each router are at least disposed in each region Safeguard a corresponding LSDB (Link State DataBase, link state database), whole LSPDU comprising the region (Link State Protocol Data Unit, Link State Protocol Data Unit, abbreviation LSP).Each IS (Intermediate System, intermediate system) can all generate a LSP.Include whole link states letter in the IS in LSP Breath, IS can calculate the network topology of IS-IS using SPF algorithm, generate the route table items of oneself according to the LSP in LSDB.
Summary of the invention
In view of this, the disclosure provides a kind of route computing method and device to solve infeasible paths in the prior art The problem of as optimal path.
Specifically, the disclosure is achieved by the following technical solution:
The disclosure provides a kind of route computing method, and the method is applied to first routing device, which comprises
The LSP that secondary route equipment is sent is received, secondary route equipment and the first routing device are is-is neighbor;
If it is determined that the routing iinformation that the LSP is carried is filtering routing, then filter identification is added for the routing iinformation;
According to the route table items of the local updating route information local for being not added with filter identification;
The LSP is broadcasted, so that the is-is neighbor routing device of this routing device is believed according to the routing that the LSP is carried Breath updates the route table items of itself.
Based on identical design, the disclosure provides a kind of router-level topology device, which is characterized in that described device is applied to the One routing device, described device include:
Receiving unit, for receiving the LSP of secondary route equipment transmission, secondary route equipment is with the first routing device Is-is neighbor;
Identify unit, for if it is determined that the LSP carry routing iinformation be filtering routing, then add for the routing iinformation Add filter identification;
Updating unit, for the route table items according to the local updating route information local for being not added with filter identification;
First retransmission unit, for broadcasting the LSP, so that the is-is neighbor routing device of this routing device is according to institute State the route table items of the updating route information itself of LSP carrying.
Based on identical design, the disclosure also provides a kind of computer readable storage medium, the computer-readable storage Dielectric memory contains computer program, and any step of route computing method is realized when the computer program is executed by processor Suddenly.
Based on identical design, the disclosure also provides a kind of computer equipment, and the computer equipment includes memory, place Manage device, communication interface and communication bus;Wherein, the memory, processor, communication interface are carried out by the communication bus Mutual communication;
The memory, for storing computer program;
The processor, for executing the computer program stored on the memory, described in the processor executes The either step of route computing method is realized when computer program.
It can be seen that the disclosure can make first routing device receive the LSP that secondary route equipment is sent, the second tunnel It is is-is neighbor by equipment and the first routing device;If it is determined that the routing iinformation that the LSP is carried is filtering routing, then for The routing iinformation adds filter identification;According to the route table items of the local updating route information local for being not added with filter identification; The LSP is broadcasted later, so that the routing iinformation that the is-is neighbor routing device of this routing device is carried according to the LSP is more The newly route table items of itself, so that other routing devices be made also to be filtered to the routing iinformation.Compared with the prior art, this public affairs Open the filtering routing iinformation that routing device can be made to know other routing devices, so as to solve by the routing iinformation of filtering into The obstructed problem of flow caused by row router-level topology, optimizes router-level topology result.
Detailed description of the invention
Fig. 1 is the IS-IS networking schematic diagram in a kind of illustrative embodiments of the disclosure;
Fig. 2 is a kind of process flow diagram of one of illustrative embodiments of disclosure route computing method;
Fig. 3 is the router-level topology interaction diagrams in a kind of illustrative embodiments of the disclosure;
The building-block of logic of router-level topology device in a kind of illustrative embodiments of Fig. 4 disclosure;
A kind of building-block of logic of one of illustrative embodiments of Fig. 5 disclosure computer equipment.
Specific embodiment
Referring to FIG. 1, be IS-IS networking schematic diagram, wherein router Router A, Router B, Router C, RouterD and Router E establishes is-is neighbor relationship on the chain road being connected to each other, it is assumed that the two of Router C connection A network segment is respectively 17.1.1.0/24,17.1.2.0/24, and the LSDB of IS-IS networking is recorded in the routing iinformation of the two network segments In, make routing device Router A, Router B, Router C, Router D and the available packet of Router E in networking LSP containing the routing iinformation, so that routing device calculates optimal path by SPF algorithm according to the routing iinformation in LSP.Such as Next-hop for the Router A above-mentioned two network segments routing calculated is respectively Router D and Router B, wherein false If the path between Router A to Router C, is optimal by Router B, therefore the 17.1.1.0/ on Router A It is Router B's that 24 and 17.1.2.0/24 routing, which is preferably next-hop,.There is corresponding access 17.1.1.0/ on Router A When the customer flow of 24 and 17.1.2.0/24 network segment, the path of flow reaches on Router C by Router B and can be just Really access destination address.
If certain user configuration IS-IS routing policy on Router B, do not allow to reach user's stream of 17.1.1.0/24 Amount is gone out by the device forwards, i.e., falls the routing local filter of 17.1.1.0/24.But in Router D and Router E On with no restrictions, therefore in fact flow still can by Router D and Router E reach Router C on, thus correctly Access 17.1.1.0/24 network segment.Due to not perceived in routing policy of the Router A equipment to Router B, IS-IS The 17.1.1.0/24 and 17.1.2.0/24 routing that LSDB in networking is saved are constant.Passed through according to the routing iinformation in LSDB The next-hop of Router A remains as Router B in the calculated 17.1.1.0/24 routing of SPF algorithm, therefore destination address is 17.1.1.0/24 flow still can be forwarded in Router B when reaching Router A, and Router B is according to local road The flow of the 17.1.1.0/24 is abandoned by strategy, it is all unreachable so as to cause the flow of 17.1.1.0/24.
It can be seen that in existing IS-IS network, if there are when mulitpath between two routing devices, if its In any routing device be configured with routing, it is unreachable to make one in above-mentioned mulitpath, and other routing devices do not need this In the case where routing, routing configuration situation in entire IS-IS network is known since this routing device does not perceive mechanism, Preferred path can be calculated according to the SPF algorithm that is routed through of itself, but the very possible preferred routing of infeasible paths, thus Cause flow forwarding obstructed.
Of the existing technology in order to solve the problems, such as, the disclosure provides a kind of route computing method and device, can make One routing device receives the LSP that secondary route equipment is sent, and secondary route equipment and the first routing device are is-is neighbor; If it is determined that the routing iinformation that the LSP is carried is filtering routing, then filter identification is added for the routing iinformation;Not according to local Add the route table items of the updating route information local of filter identification;The LSP is broadcasted later, so that the IS- of this routing device IS neighbours' routing device is according to the route table items of the LSP updating route information itself carried, to make other routing devices Also the routing iinformation is filtered.Therefore the disclosure, which can solve, carries out stream caused by router-level topology for the routing iinformation of filtering Obstructed problem is measured, router-level topology result is optimized.Compared with the prior art, the disclosure can make routing device know other roads It is obstructed so as to solve flow caused by the routing iinformation progress router-level topology by filtering by the filtering routing iinformation of equipment Problem optimizes router-level topology result.
Referring to FIG. 2, be a kind of process flow diagram of one of illustrative embodiments of disclosure route computing method, The method is applied to first routing device, which comprises
Step 201 receives the LSP that secondary route equipment is sent, and secondary route equipment and the first routing device are IS-IS Neighbours;
In the present embodiment, the first routing device in IS-IS networking and secondary route equipment can be established on the link Is-is neighbor relationship, wherein secondary route equipment can incite somebody to action if secondary route equipment is in the routing iinformation that filtering has been locally located The routing iinformation of the filtering is added in LSP, then the LSP is broadcast to secondary route equipment in the IS of secondary route equipment Is-is neighbor routing device, i.e. first routing device, if secondary route equipment there is also other is-is neighbor routing devices, Then other routing devices can also receive the LSP.Therefore first routing device can receive the LSP letter of secondary route equipment transmission It ceases, the routing iinformation of secondary route equipment filtering is carried in the LSP.
Step 202, if it is determined that the LSP carry routing iinformation be filtering routing, then added for the routing iinformation Filter mark;
In one embodiment, the disclosure increases new CLV (Code/Length/Value, a class in the LSP Type length numerical value) field, wherein Code value represent the routing whether be filtering routing iinformation, such as when coding code value be When 204, the routing iinformation of filtering is represented, then after first routing device receives LSP, is further judged in the CLV field in the LSP Code value whether be preset value (such as code value be 204), if so, determining that the routing iinformation that the LSP is carried is filtering Routing;If not, it is determined that the routing iinformation that the LSP is carried is not filtering routing.
It can be the routing letter of local record when first routing device determines the routing iinformation comprising filtering in LSP Breath addition filter identification for indicating that the routing iinformation is filtering routing iinformation, and ignores this in subsequent calculating optimal path Routing iinformation.
As one embodiment, first routing device can also further parse the prefix class in the LSP in CLV field Type-word section illustrates that the prefix types of the routing iinformation in the LSP are Internet protocol when the prefix types field is 0 Fourth edition IPv4 prefix;When the prefix types field is 1, illustrate that the prefix types of the routing iinformation in the LSP are mutual Networking protocol sixth version IPv6 prefix;Then the routing iinformation carried in the LSP is parsed according to the prefix types.
Specifically, the length Length value in CLV represents the length of numerical value Value field, and range is 2~255; Value value is specific routing iinformation, wherein the first byte can be prefix types field, when the extreme lower position 0 of first character section When, it indicates that the prefix is IPv4 prefix, when first character section extreme lower position 1, indicates that the prefix is IPv6 prefix;From second word The value that section starts filling is IPv4 prefix addresses+mask or the address IPv6+mask-length.First routing device can be according to parsing IPv4 prefix or IPv6 prefix out parses the specific routing iinformation in Value value.
Step 203, according to the route table items of the local updating route information local for being not added with filter identification;
In the present embodiment, after first routing device is the routing iinformation addition filter identification in LSP, available The routing iinformation that ground is not added with filter identification carries out router-level topology and obtains new route table items, updates local route table items, from And exclude the infeasible paths in local route table items.
Step 204, the broadcast LSP, so that the is-is neighbor routing device of this routing device is carried according to the LSP Updating route information itself route table items.
In the present embodiment, after the routing device is added filter identification by first routing device, which can be passed through It is broadcast to the is-is neighbor routing device of first routing device, when so that other routing devices receiving the LSP, according to the first via Respectively the route table items of itself and continue to be forwarded to respective neighbor device according to filtering routing update by the method for equipment, thus The routing device of the whole network can be made all to know the filtering routing iinformation, avoid the routing iinformation of filtering from participating in routing forwarding and calculate. It should be noted that first routing device should in spot broadcasting since the secondary route equipment is the transmitting terminal of the LSP LSP to first routing device is-is neighbor when, even if secondary route equipment and first routing device are is-is neighbor relationships, But according to the mechanism of flooding, which will not be forwarded back to secondary route equipment.
As one embodiment, when route filtering strategy has been locally located in first routing device, then this routing can be set The routing iinformation of standby upper filtering is added in the LSP of this routing device, sends this by flooding for the LSP of this routing device The is-is neighbor routing device of routing device, so that the routing device for receiving the LSP handles the LSP according to the method described above.
Therefore the disclosure can be when certain routing device in flow forward-path filters out routing iinformation, by should Routing iinformation is added in the CLV be encapsulated in LSP after flooded in IS-IS network, solve other routing devices after receiving LSP It analyses the routing iinformation of the filtering in the LSP and the routing iinformation is avoided to participate in router-level topology, so that routing be made to be sieved from source Choosing avoids inaccessible routing from participating in router-level topology, so that it is reachable to guarantee that flow walks other paths.
It should be noted that the router-level topology function that the disclosure provides can be the additional function of existing routing device, First routing device can enable the router-level topology function of this routing device by way of transmitting order to lower levels row.When the first via by When equipment enables the router-level topology function, aforesaid operations can be executed, realize route filtering;When first routing device is not enabled on road When by computing function, if then first routing device receives the LSP of other routing devices transmission, the LSP can not be handled, directly Connect other is-is neighbor routing devices that the LSP is forwarded to this routing device.Even if therefore first routing device does not make The LSP received still can be transmitted to other neighbor devices by computing function by energy circuit, to allow neighbor device enabled The purpose of route filtering is realized in the case where router-level topology function.
For the objects, technical solutions and advantages of the disclosure are more clearly understood, below based on the networking structure of Fig. 1, lead to Fig. 3 is crossed to be described in further detail the scheme of the disclosure.
Fig. 3 is referred to, is the interaction diagrams of routing device in embodiment of the disclosure, including:
Is-is neighbor relationship is established between step 301, Router A and Router B, Router A enables the routing meter Calculate function;
Step 302, enabled routing policy filters out certain IS-IS routing iinformation in IS-IS on Router A When (17.1.1.0/24), it is filled by the routing iinformation (17.1.1.0/24) filtered out that IS-IS internal interface is got In CLV, it is 204 that wherein the CLV, which is Code, the minimum position Bit 0 of the first character section in the VALUE in the CLV, and indicating should Routing iinformation is the routing iinformation of IPv4, while the CLV being encapsulated into the LSP of Router A generation;
Step 303 floods the LSP to the is-is neighbor Router B of Router A;
After IS-IS receives the LSP in step 304, Router B, whether the IS-IS for detecting this equipment first is enabled Router-level topology function is not parsed and is handled to the LSP if being not enabled on the function, is only flooded and is given other IS-IS neighbour It occupies, such as RouterC.
If step 305 detects that RouterB enables the router-level topology function, which is parsed, is obtained To the routing iinformation (17.1.1.0/24) in the CLV of information of neighbor nodes and Code=204, which is increased and is filtered Mark, the routing iinformation with the mark are not involved in the router-level topology of this routing device;It carries out an ISPF to calculate, to variation Routing iinformation preferably and refreshes route table items again;The LSP is flooded and gives other neighbours, such as RouterC.
The disclosure, which realizes, flexibly to specify certain particular router in IS-IS network to support the function, set routing It is standby can or the routing iinformation that filters out of other routing devices, to avoid carrying out inaccessible routing into router-level topology, and The CLV is flooded and gives other neighbours;And other do not support that the IS-IS router of the function does not parse the CLV, but being capable of normal flood It is general to give other neighbours, support the IS-IS router of the function not influence other.
Based on identical design, the disclosure also provides a kind of router-level topology device, the device can by software realization, It can be realized by way of hardware or software and hardware combining.Taking software implementation as an example, the router-level topology device conduct of the disclosure Device on one logical meaning is to be read computer program instructions corresponding in memory by the CPU of device where it After run.
Referring to FIG. 4, being a kind of one of illustrative embodiments of disclosure router-level topology device 400, described device Applied to first routing device, from logic level, the logical construction of the device 400 includes:
Receiving unit 401, for receiving the LSP of secondary route equipment transmission, secondary route equipment is with the first via by setting Standby is is-is neighbor;
Identify unit 402, for if it is determined that the LSP carry routing iinformation be filtering routing, then be the routing believe Breath addition filter identification;
Updating unit 403, for the route table items according to the local updating route information local for being not added with filter identification;
First retransmission unit 404, for broadcasting the LSP so that the is-is neighbor routing device of this routing device according to The route table items for the updating route information itself that the LSP is carried.
As one embodiment, the mark unit 402, specifically for judging the code value in the LSP in CLV field It whether is preset value, if so, determining that the routing iinformation that the LSP is carried is filtering routing;If not, it is determined that the LSP takes The routing iinformation of band is not filtering routing.
As one embodiment, described device further include:
Resolution unit 405, for parsing the prefix types field in the LSP in CLV field, when the prefix types word When section is 0, the prefix types of the routing iinformation in the LSP are IPv4 prefix;It is described when the prefix types field is 1 The prefix types of routing iinformation in LSP are IPv6 prefix;The routing letter carried in the LSP is parsed according to the prefix types Breath.
As one embodiment, described device further include:
Second retransmission unit 406, sets for the routing iinformation for the filtering being arranged on this routing device to be added to this routing In standby LSP, the LSP of this routing device is broadcast to the is-is neighbor routing device of this routing device, so that the neighbours road By equipment according to the route table items of the LSP updating route information itself carried.
Based on identical design, the disclosure also provides a kind of computer equipment, as shown in figure 5, the computer equipment packet Include memory 51, processor 52, communication interface 53 and communication bus 54;Wherein, the memory 51, processor 52, communication Interface 53 carries out mutual communication by the communication bus 54;
The memory 51, for storing computer program;
The processor 52, for executing the computer program stored on the memory 51, the processor 52 is held The either step for the route computing method that the embodiment of the present disclosure provides is realized when the row computer program.
The disclosure also provides a kind of computer readable storage medium, which is characterized in that the computer readable storage medium It is inside stored with computer program, the router-level topology that the embodiment of the present disclosure provides is realized when the computer program is executed by processor The either step of method.
Each embodiment in this specification is all made of relevant mode and describes, same and similar portion between each embodiment Dividing may refer to each other, and each embodiment focuses on the differences from other embodiments.Especially for computer For equipment and the embodiment of computer readable storage medium, since it is substantially similar to the method embodiment, so the ratio of description Relatively simple, the relevent part can refer to the partial explaination of embodiments of method.
In conclusion the disclosure can make first routing device receive the LSP that secondary route equipment is sent, secondary route is set Standby is is-is neighbor with the first routing device;If it is determined that the routing iinformation that the LSP is carried is filtering routing, then it is described Routing iinformation adds filter identification;According to the route table items of the local updating route information local for being not added with filter identification;Later Broadcast the LSP so that the updating route information that is carried according to the LSP of the is-is neighbor routing device of this routing device from The route table items of body, so that other routing devices be made also to be filtered to the routing iinformation.Therefore the disclosure can solve mistake The routing iinformation of filter carries out the obstructed problem of flow caused by router-level topology, optimizes router-level topology result.Compared to existing skill Art, the disclosure can make routing device know the filtering routing iinformations of other routing devices, so as to solve the road of filtering The obstructed problem of flow caused by router-level topology is carried out as information, optimizes router-level topology result.
The function of each unit and the realization process of effect are specifically detailed in the above method and correspond to step in above-mentioned apparatus Realization process, details are not described herein.
For device embodiment, since it corresponds essentially to embodiment of the method, so related place is referring to method reality Apply the part explanation of example.The apparatus embodiments described above are merely exemplary, wherein described be used as separation unit The unit of explanation may or may not be physically separated, and component shown as a unit can be or can also be with It is not physical unit, it can it is in one place, or may be distributed over multiple network units.It can be according to actual The purpose for needing to select some or all of the modules therein to realize application scheme.Those of ordinary skill in the art are not paying Out in the case where creative work, it can understand and implement.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all in essence of the invention Within mind and principle, any modification, equivalent substitution, improvement and etc. done be should be included within the scope of the present invention.

Claims (10)

1. a kind of route computing method, which is characterized in that the method is applied to first routing device, which comprises
The Link State Protocol Data Unit LSP that secondary route equipment is sent is received, secondary route equipment is with the first via by setting Standby is Intermediate System-to-Intermediate System is-is neighbor;
If it is determined that the routing iinformation that the LSP is carried is filtering routing, then filter identification is added for the routing iinformation;
According to the route table items of the local updating route information local for being not added with filter identification;
The LSP is broadcasted, so that the routing iinformation that the is-is neighbor routing device of this routing device is carried according to the LSP is more The newly route table items of itself.
2. the method according to claim 1, wherein whether the routing iinformation for determining that the LSP is carried is filtering Routing, comprising:
Judge whether the coding code value in the LSP in Type Length numerical value CLV field is preset value, if so, determining institute The routing iinformation for stating LSP carrying is filtering routing;If not, it is determined that the routing iinformation that the LSP is carried is not filtering routing.
3. the method according to claim 1, wherein determining that the routing iinformation that the LSP is carried is filtering routing Afterwards, the method also includes:
The prefix types field in the LSP in CLV field is parsed, when the prefix types field is 0, in the LSP The prefix types of routing iinformation are Internet protocol fourth edition IPv4 prefix;When the prefix types field is 1, the LSP In routing iinformation prefix types be Internet protocol sixth version IPv6 prefix;
The routing iinformation carried in the LSP is parsed according to the prefix types.
4. the method according to claim 1, wherein the method also includes:
The routing iinformation for the filtering being arranged on this routing device is added in the LSP of this routing device, by this routing device LSP is broadcast to the is-is neighbor routing device of this routing device, so that neighbours' routing device was carried according to the LSP The route table items of updating route information itself.
5. a kind of router-level topology device, which is characterized in that described device is applied to first routing device, and described device includes:
Receiving unit, for receive secondary route equipment transmission Link State Protocol Data Unit LSP, secondary route equipment with The first routing device is Intermediate System-to-Intermediate System is-is neighbor;
Identify unit, for if it is determined that the LSP carry routing iinformation be filtering routing, then added for the routing iinformation Filter mark;
Updating unit, for the route table items according to the local updating route information local for being not added with filter identification;
First retransmission unit, for broadcasting the LSP, so that the is-is neighbor routing device of this routing device is according to the LSP The route table items of the updating route information of carrying itself.
6. device according to claim 5, which is characterized in that
The mark unit, specifically for judging whether the code value in the LSP in CLV field is preset value, if so, really The routing iinformation that the fixed LSP is carried is filtering routing;If not, it is determined that the routing iinformation that the LSP is carried is not filtering road By.
7. device according to claim 5, which is characterized in that described device further include:
Resolution unit, for parsing the prefix types field in the LSP in CLV field, when the prefix types field is 0 When, the prefix types of the routing iinformation in the LSP are IPv4 prefix;When the prefix types field is 1, in the LSP Routing iinformation prefix types be IPv6 prefix;The routing iinformation carried in the LSP is parsed according to the prefix types.
8. device according to claim 5, which is characterized in that described device further include:
Second retransmission unit, for the routing iinformation for the filtering being arranged on this routing device to be added to the LSP of this routing device In, the LSP of this routing device is broadcast to the is-is neighbor routing device of this routing device, so that neighbours' routing device According to the route table items of the LSP updating route information itself carried.
9. a kind of computer readable storage medium, which is characterized in that be stored with computer in the computer readable storage medium Program, the step of claim 1-4 any the method is realized when the computer program is executed by processor.
10. a kind of computer equipment, which is characterized in that the computer equipment include memory, processor, communication interface and Communication bus;Wherein, the memory, processor, communication interface carry out mutual communication by the communication bus;
The memory, for storing computer program;
The processor, for executing the computer program stored on the memory, the processor executes the calculating The step of claim 1-4 any the method is realized when machine program.
CN201810973396.6A 2018-08-24 2018-08-24 Route calculation method and device Active CN109005121B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810973396.6A CN109005121B (en) 2018-08-24 2018-08-24 Route calculation method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810973396.6A CN109005121B (en) 2018-08-24 2018-08-24 Route calculation method and device

Publications (2)

Publication Number Publication Date
CN109005121A true CN109005121A (en) 2018-12-14
CN109005121B CN109005121B (en) 2021-06-29

Family

ID=64593875

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810973396.6A Active CN109005121B (en) 2018-08-24 2018-08-24 Route calculation method and device

Country Status (1)

Country Link
CN (1) CN109005121B (en)

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101207555A (en) * 2006-12-18 2008-06-25 中兴通讯股份有限公司 Method for automatically clearing over loading bit in the course of avoiding path black hole
CN101272393A (en) * 2008-05-14 2008-09-24 杭州华三通信技术有限公司 Routing computing method and network node based on link condition routing protocol
CN101699800A (en) * 2009-11-04 2010-04-28 杭州华三通信技术有限公司 Method for storing neighbor information and device thereof
CN101984596A (en) * 2010-11-04 2011-03-09 北京星网锐捷网络技术有限公司 Method, device and routing equipment for avoiding black holes
CN102761493A (en) * 2012-07-26 2012-10-31 杭州华三通信技术有限公司 Multicast routing item updating method and device of multilink transparent internet
CN103532872A (en) * 2012-07-03 2014-01-22 杭州华三通信技术有限公司 Method for reducing link state packet flooding and router
CN103685035A (en) * 2012-09-26 2014-03-26 深圳市腾讯计算机系统有限公司 Routing update method, switch and system
US20140146821A1 (en) * 2012-11-28 2014-05-29 Telefonaktiebolaget L M Ericsson (Publ) Method and apparatus for protocol data unit synchronization in an is-is system
CN105227458A (en) * 2014-07-01 2016-01-06 中兴通讯股份有限公司 The route computing method of TRILL ISIS and device
CN105814945A (en) * 2013-10-17 2016-07-27 瑞典爱立信有限公司 VPNv4 route control for LTE X2 SON using import route maps and outbound route filtering

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101207555A (en) * 2006-12-18 2008-06-25 中兴通讯股份有限公司 Method for automatically clearing over loading bit in the course of avoiding path black hole
CN101272393A (en) * 2008-05-14 2008-09-24 杭州华三通信技术有限公司 Routing computing method and network node based on link condition routing protocol
CN101699800A (en) * 2009-11-04 2010-04-28 杭州华三通信技术有限公司 Method for storing neighbor information and device thereof
CN101984596A (en) * 2010-11-04 2011-03-09 北京星网锐捷网络技术有限公司 Method, device and routing equipment for avoiding black holes
CN103532872A (en) * 2012-07-03 2014-01-22 杭州华三通信技术有限公司 Method for reducing link state packet flooding and router
CN102761493A (en) * 2012-07-26 2012-10-31 杭州华三通信技术有限公司 Multicast routing item updating method and device of multilink transparent internet
CN103685035A (en) * 2012-09-26 2014-03-26 深圳市腾讯计算机系统有限公司 Routing update method, switch and system
US20140146821A1 (en) * 2012-11-28 2014-05-29 Telefonaktiebolaget L M Ericsson (Publ) Method and apparatus for protocol data unit synchronization in an is-is system
CN105814945A (en) * 2013-10-17 2016-07-27 瑞典爱立信有限公司 VPNv4 route control for LTE X2 SON using import route maps and outbound route filtering
CN105227458A (en) * 2014-07-01 2016-01-06 中兴通讯股份有限公司 The route computing method of TRILL ISIS and device

Also Published As

Publication number Publication date
CN109005121B (en) 2021-06-29

Similar Documents

Publication Publication Date Title
US11962496B2 (en) Method for establishing segment routing for IPv6 tunnel
US8942106B2 (en) Method and apparatus for route optimization enforcement and verification
US9800493B2 (en) Routing messages in a computer network using deterministic and probalistic source routes
US8572225B2 (en) Technique for graceful shutdown of a routing protocol in a network
US7889655B2 (en) Techniques for detecting loop-free paths that cross routing information boundaries
US8374092B2 (en) Technique for protecting against failure of a network element using multi-topology repair routing (MTRR)
Rakheja et al. Performance analysis of RIP, OSPF, IGRP and EIGRP routing protocols in a network
US9300569B2 (en) Compressing data packet routing information using bloom filters
CN110401599B (en) Data packet processing method and device, storage medium and electronic device
US9455903B2 (en) Recording packet routes using bloom filters
WO2020113214A1 (en) System and method to recover from link or node failure in a network
EP3567814B1 (en) Method for updating routing in network, network device and system
EP3229393B1 (en) Error code information transfer method, network device and communication system
US11805046B2 (en) Border gateway protocol (BGP) for routing policy distribution
EP4398538A1 (en) Routing advertisement method, path establishment method, service data transmission method and autonomous system border router
CN108881295A (en) For detecting and solving the method and the network equipment of anomalous routes
US20030126284A1 (en) Relating to auto-tunnelling in a heterogeneous network
US20090109862A1 (en) Method for Reducing Fault Detection Time in a Telecommunication Network
CN109005121A (en) A kind of route computing method and device
Cisco ignore-lsp-errors to show tarp blacklisted-adjacencies
Cisco Configuring Integrated IS-IS
US11811611B2 (en) System and method for backup flooding topology split
US20030120804A1 (en) Auto-tunnelling in a heterogeneous network
US20140269737A1 (en) System, method and apparatus for lsp setup using inter-domain abr indication
Talaulikar RFC 9552: Distribution of Link-State and Traffic Engineering Information Using BGP

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20230612

Address after: 310052 11th Floor, 466 Changhe Road, Binjiang District, Hangzhou City, Zhejiang Province

Patentee after: H3C INFORMATION TECHNOLOGY Co.,Ltd.

Address before: 310052 Changhe Road, Binjiang District, Hangzhou, Zhejiang Province, No. 466

Patentee before: NEW H3C TECHNOLOGIES Co.,Ltd.