CN104767687A - Methods and equipment for transmitting key route and establishing and updating route table - Google Patents
Methods and equipment for transmitting key route and establishing and updating route table Download PDFInfo
- Publication number
- CN104767687A CN104767687A CN201410003511.9A CN201410003511A CN104767687A CN 104767687 A CN104767687 A CN 104767687A CN 201410003511 A CN201410003511 A CN 201410003511A CN 104767687 A CN104767687 A CN 104767687A
- Authority
- CN
- China
- Prior art keywords
- route
- lsa
- critical path
- correspondence
- path
- 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
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method and equipment for transmitting a key route and a method and equipment for establishing and updating a route table. The method for transmitting the key route comprises the following steps: receiving a set key route; setting a key route tag on a link state advertisement (LSA) corresponding to the key route; and transmitting the key route to a corresponding open shortest path first (OSPF) network via the corresponding LSA by using a flooding mechanism. The method for establishing the route table comprises the following steps: receiving the LSA corresponding to the key route; computing a network topology and a shortest path; computing the key route; establishing a route table entry corresponding to the key route in the route table; computing a non-key route; and establishing a route table entry corresponding to the non-key route in the route table. Through adoption of the method, a key path can be converged rapidly, and message loss of the key path is prevented.
Description
Technical field
The disclosure relates to Internet Transmission, relate more specifically to a kind of propagate critical path by and set up and upgrade the method and apparatus of routing table.
Background technology
Route is after the router in network receives an IP packet, determines which adjacent router this packet is transmitted to, thus allow this packet correctly be forwarded to the process of destination according to the route table items in routing table.
Route table items in routing table can be briefly described as follows:
To the packet of destination 10.1.1.1, send to R2 router
To the packet of destination this network of 20.0.0.0, send to R3 router
Router routing table item can be briefly described as follows:
Arrive R1 router, send to R3, the down hop that is going to R1 is R3.
Arrive R2 router, send to R4, the down hop that is going to R2 is R4.
Route table items in the present invention comprises the route table items of above-mentioned two types.Wherein, the router R2 that packet will arrive, R3, R4 are called down hop (Next Hop).
The Routing Protocol of router calculates according to network topological information and generates a large amount of route table items described above, and stores in the routing table.
OSPF (Open Shortest Path First ospf) is a kind of widely used Interior Gateway Protocol (Interior Gateway Protocol, be called for short IGP), for decision-making route in single autonomous system (Autonomous System, AS).Routing convergence refers to the process that route change can be delivered in certain hour whole autonomous system, and in OSPF, the speed of routing convergence is the very important evaluation index of of high-end router.Fig. 2 shows OSPF typical use scenes in the Internet, router R1 and R2 is Autonomous System Boundary Router, AS Boundary Router ASBR (Autonomous System Border Router), they by a large amount of routing iinformations from the Internet redistribution to this autonomous system, some routing iinformation may be very important, is very crucial to some application.Suppose that all external routes from this autonomous system to the Internet are gone out by R1 in normal state, when R1 goes wrong, all routers, such as R3, R4, R5, R6, R7, need to upgrade the route table items in its routing table.Because the route table items of routing table is a lot, upgrading whole route table items needs to spend the more time, may be 10 seconds or more, make routing convergence slack-off.Internet Transmission therebetween can interrupt, and causes data message to be lost.Especially the router of some critical path goes wrong and causes long period network data to lose, and this is unacceptable concerning client.
Prior art normally when calculating the list item of routing table, calculates alternate routing list item to the solution of this problem simultaneously.But also there is the situation of the more than router failure while of possibility, cause alternate routing list item to lose efficacy.Therefore, ensure that the routing iinformation of critical path upgrades rapidly to be very important.
Summary of the invention
According to an aspect of the present disclosure, provide a kind of propagate critical path by method, comprising:
Receive arrange critical path by;
The LSA LSA of critical path by correspondence arranges crucial routing label; And
Flooding mechanism is utilized to propagate into corresponding OSPF ospf network by the LSA of correspondence critical path.
According to another aspect of the present disclosure, provide a kind of method setting up routing table, comprising:
Receive the LSA of critical path by correspondence;
Computing network topological sum shortest path;
According to critical path by the LSA of correspondence and the network topology calculated and shortest path calculate critical path by;
Set up the route table items of critical path by correspondence in the routing table;
Non-key route is calculated by the LSA outside the LSA of correspondence and the network topology calculated and shortest path according to critical path; And
Set up the route table items that non-key route is corresponding in the routing table.
According to another aspect of the present disclosure, provide a kind of method upgrading routing table, comprising:
Receive the LSA of critical path by correspondence;
Need to upgrade in response to routing table, perform and operate as follows:
Computing network topological sum shortest path
According to critical path by the LSA of correspondence and the network topology calculated and shortest path calculate critical path by;
Upgrade the route table items of the critical path in routing table by correspondence;
Non-key route is calculated by the LSA outside the LSA of correspondence and the network topology calculated and shortest path according to critical path;
The route table items that non-key route in renewal routing table is corresponding.
According to another aspect of the present disclosure, provide a kind of propagate critical path by equipment, comprising:
Receiving system, be configured to receive arrange critical path by;
Setting device, is configured to arrange crucial routing label on the LSA LSA of critical path by correspondence; And
Transmission device, is configured to critical path to utilize flooding mechanism to propagate into corresponding OSPF ospf network by the LSA of correspondence.
According to another aspect of the present disclosure, provide a kind of equipment setting up routing table, comprising:
Receiving system, is configured to receive the LSA of critical path by correspondence;
Network topology and shortest path calculation element, be configured to computing network topological sum shortest path;
Critical path by calculation element, be configured to the network topology that calculated by the LSA of correspondence and network topology and shortest path calculation element according to critical path and shortest path calculate critical path by;
Critical path, by the route table items apparatus for establishing of correspondence, is configured to set up the route table items of critical path by correspondence in the routing table;
Non-key router-level topology device, is configured to the network topology that calculated by the LSA outside the LSA of correspondence and network topology and shortest path calculation element according to critical path and shortest path calculates non-key route; And
The route table items apparatus for establishing that non-key route is corresponding, is configured to set up route table items corresponding to non-key route in the routing table.
According to another aspect of the present disclosure, provide a kind of equipment upgrading routing table, comprising:
Receiving system, is configured to receive the LSA of critical path by correspondence;
Routing table update judgment means, is configured to judge that routing table needs to upgrade;
Network topology and shortest path calculation element, be configured to computing network topological sum shortest path;
Critical path by calculation element, be configured to the network topology that calculated by the LSA of correspondence and network topology and shortest path calculation element according to critical path and shortest path calculate critical path by;
Critical path, by the route table items updating device of correspondence, is configured to upgrade the route table items of the critical path in routing table by correspondence;
Non-key router-level topology device, is configured to the network topology that calculated by the LSA outside the LSA of correspondence and network topology and shortest path calculation element according to critical path and shortest path calculates non-key route;
The route table items updating device that non-key route is corresponding, is configured to upgrade the route table items that non-key route in routing table is corresponding.
Utilize according to the method and apparatus of the above-mentioned aspect of the disclosure, can accelerate critical path by convergence, reduce critical path by upper message dropping.
Accompanying drawing explanation
In conjunction with the drawings disclosure illustrative embodiments is described in more detail, above-mentioned and other object of the present disclosure, Characteristics and advantages will become more obvious, wherein, in disclosure illustrative embodiments, identical reference number represents same parts usually.
Fig. 1 shows the block diagram of the exemplary computer system/server be suitable for for realizing disclosure execution mode;
Fig. 2 shows OSPF typical use scenes in the Internet;
Fig. 3 show according to a kind of execution mode of the disclosure a kind of propagate critical path by the flow chart of method;
Fig. 4 shows the data format of the head of LSA;
Fig. 5 shows the data format of 3 type LSA and 4 type LSA;
Fig. 6 shows the data format of 5 type LSA and 7 type LSA;
Fig. 7 diagrammatically illustrates the representation of a kind of crucial route option in the Option Field of LSA;
Fig. 8 shows the flow chart setting up the method for routing table according to a kind of execution mode of the present disclosure;
Fig. 9 shows the flow chart of the method for the renewal routing table according to a kind of execution mode of the present disclosure;
Figure 10 diagrammatically illustrate according to the propagation critical path of a disclosure execution mode by the structured flowchart of equipment;
Figure 11 diagrammatically illustrates the structured flowchart setting up the equipment of routing table according to a disclosure execution mode; And
Figure 12 diagrammatically illustrates the structured flowchart of the equipment of the renewal routing table according to a disclosure execution mode.
Embodiment
Below with reference to accompanying drawings preferred implementation of the present disclosure is described in more detail.Although show preferred implementation of the present disclosure in accompanying drawing, but should be appreciated that, the disclosure can be realized in a variety of manners and not should limit by the execution mode of setting forth here.On the contrary, provide these execution modes to be to make the disclosure more thorough and complete, and the scope of the present disclosure intactly can be conveyed to those skilled in the art.
Person of ordinary skill in the field knows, the present invention can be implemented as system, method or computer program.Therefore, the disclosure can be implemented as following form, that is: can be completely hardware, also can be software (comprising firmware, resident software, microcode etc.) completely, can also be the form that hardware and software combines, be commonly referred to as " circuit ", " module " or " system " herein.In addition, in certain embodiments, the present invention can also be embodied as the form of the computer program in one or more computer-readable medium, comprises computer-readable program code in this computer-readable medium.
The combination in any of one or more computer-readable medium can be adopted.Computer-readable medium can be computer-readable signal media or computer-readable recording medium.Computer-readable recording medium such as may be-but not limited to-the system of electricity, magnetic, optical, electrical magnetic, infrared ray or semiconductor, device or device, or combination above arbitrarily.The example more specifically (non exhaustive list) of computer-readable recording medium comprises: the combination with the electrical connection of one or more wire, portable computer diskette, hard disk, random access memory (RAM), read-only memory (ROM), erasable type programmable read only memory (EPROM or flash memory), optical fiber, Portable, compact disk read-only memory (CD-ROM), light storage device, magnetic memory device or above-mentioned any appropriate.In this document, computer-readable recording medium can be any comprising or stored program tangible medium, and this program can be used by instruction execution system, device or device or be combined with it.
The data-signal that computer-readable signal media can comprise in a base band or propagate as a carrier wave part, wherein carries computer-readable program code.The data-signal of this propagation can adopt various ways, comprises the combination of---but being not limited to---electromagnetic signal, light signal or above-mentioned any appropriate.Computer-readable signal media can also be any computer-readable medium beyond computer-readable recording medium, and this computer-readable medium can send, propagates or transmit the program for being used by instruction execution system, device or device or be combined with it.
The program code that computer-readable medium comprises can with any suitable medium transmission, comprises that---but being not limited to---is wireless, electric wire, optical cable, RF etc., or the combination of above-mentioned any appropriate.
The computer program code operated for performing the present invention can be write with one or more programming languages or its combination, described programming language comprises object oriented program language-such as Java, Smalltalk, C++, also comprises conventional process type programming language-such as " C " language or similar programming language.Program code can fully perform on the user computer, partly perform on the user computer, as one, independently software kit performs, partly part performs on the remote computer or performs on remote computer or server completely on the user computer.In the situation relating to remote computer, remote computer can by the network of any kind---comprise local area network (LAN) (LAN) or wide area network (WAN)-be connected to subscriber computer, or, outer computer (such as utilizing ISP to pass through Internet connection) can be connected to.
Below with reference to the flow chart of the method for the embodiment of the present invention, device (system) and computer program and/or block diagram, the present invention is described.Should be appreciated that the combination of each square frame in each square frame of flow chart and/or block diagram and flow chart and/or block diagram, can be realized by computer program instructions.These computer program instructions can be supplied to the processor of all-purpose computer, special-purpose computer or other programmable data processing unit, thus produce a kind of virtual machine, these computer program instructions are performed by computer or other programmable data processing unit, create the device of the function/operation specified in the square frame in realization flow figure and/or block diagram.
Also can these computer program instructions be stored in the computer-readable medium that computer or other programmable data processing unit can be made to work in a specific way, like this, the instruction be stored in computer-readable medium just produces the manufacture (manufacture) of the command device (instruction means) of the function/operation specified in a square frame comprising in realization flow figure and/or block diagram.
Also can computer program instructions be loaded on computer, other programmable data processing unit or miscellaneous equipment, make to perform sequence of operations step on computer, other programmable data processing unit or miscellaneous equipment, to produce computer implemented process, thus make the instruction performed on computer or other programmable device can provide the process of the function/operation specified in the square frame in realization flow figure and/or block diagram.
Fig. 1 shows the block diagram of the exemplary computer system/server 12 be suitable for for realizing embodiment of the present invention.The computer system/server 12 of Fig. 1 display is only an example, should not bring any restriction to the function of the embodiment of the present invention and the scope of application.
As shown in Figure 1, computer system/server 12 shows with the form of universal computing device.The assembly of computer system/server 12 can include but not limited to: one or more processor or processing unit 16, system storage 28, connects the bus 18 of different system assembly (comprising system storage 28 and processing unit 16).
Bus 18 represent in a few class bus structures one or more, comprise memory bus or Memory Controller, peripheral bus, AGP, processor or use any bus-structured local bus in multiple bus structures.For example, these architectures include but not limited to industry standard architecture (ISA) bus, MCA (MAC) bus, enhancement mode isa bus, VESA's (VESA) local bus and periphery component interconnection (PCI) bus.
Computer system/server 12 typically comprises various computing systems computer-readable recording medium.These media can be any usable mediums can accessed by computer system/server 12, comprise volatibility and non-volatile media, transportable and not transportable medium.
System storage 28 can comprise the computer system-readable medium of volatile memory form, such as random access memory (RAM) 30 and/or cache memory 32.Computer system/server 12 may further include that other is transportable/not transportable, volatile/non-volatile computer system storage medium.Only as an example, storage system 34 may be used for reading and writing not transportable, non-volatile magnetic media (Fig. 1 does not show, and is commonly referred to " hard disk drive ").Although not shown in Fig. 1, the disc driver that transportable non-volatile magnetic disk (such as " floppy disk ") is read and write can be provided for, and to the CD drive that transportable anonvolatile optical disk (such as CD-ROM, DVD-ROM or other light medium) is read and write.In these cases, each driver can be connected with bus 18 by one or more data media interfaces.Memory 28 can comprise at least one program product, and this program product has one group of (such as at least one) program module, and these program modules are configured to the function performing various embodiments of the present invention.
There is the program/utility 40 of one group of (at least one) program module 42, can be stored in such as memory 28, such program module 42 comprises---but being not limited to---operating system, one or more application program, other program module and routine data, may comprise the realization of network environment in each or certain combination in these examples.Function in program module 42 embodiment that execution is described in the invention usually and/or method.
Computer system/server 12 also can communicate with one or more external equipment 14 (such as keyboard, sensing equipment, display 24 etc.), also can make with one or more devices communicating that user can be mutual with this computer system/server 12, and/or communicate with any equipment (such as network interface card, modulator-demodulator etc.) making this computer system/server 12 can carry out communicating with other computing equipment one or more.This communication can be passed through I/O (I/O) interface 22 and carry out.Further, computer system/server 12 can also such as, be communicated by network adapter 20 and one or more network (such as local area network (LAN) (LAN), wide area network (WAN) and/or public network, internet).As shown in the figure, network adapter 20 is by bus 18 other module communication with computer system/server 12.Be understood that, although not shown, other hardware and/or software module can be used in conjunction with computer system/server 12, include but not limited to: microcode, device driver, superfluous She's processing unit, external disk drive array, RAID system, tape drive and data backup storage system etc.
The disclosure is only illustrated with OSPFv2 (being applied to the OSPF version of IPv4 network), but the thought described in the disclosure is applicable to OSPFv3 (being applied to the OSPF version of IPv6) completely, even can be applied to other Routing Protocol, such as IS-IS, BGP Routing Protocol.
Here some background knowledges are first simply introduced: OSPFv2 mono-has LSA (the Link State Advertisements of 11 types, LSA), with route table items calculate be associated mainly contain 1,2,3,4,5,7 these several types, the disclosure is mainly concerned with 1,2,3,4,5,7 type LSA.Wherein 1,2 liang of type LSA is used for describing network topology; 3 type LSA are used for describing the route between OSPF regional; 4 types are used for being described to the router routing iinformation of ASBR; 5,7 type LSA are used for describing the network route of OSPF autonomous system outside; Wherein, a route table items in the corresponding routing table of the LSA of each 3,5,7 types.The route table items of the router of the corresponding OSPF of LSA of each 4 types, the route table items of router uses when calculating 5 type LSA.
OSPF realizes the one of link-state routing protocol, runs on autonomous system inside.Each router in whole OSPF autonomous system needs the router-level topology of complete independently this locality.The router-level topology process prescription of OSPF is as follows:
Step 1: first calculate topological sum route in ospf area according to 1 type, 2 type LSA.Main use 1 type and 2 type LSA in computational process.1 type and 2 type LSA describe the link information of each router and other routers.By 1 types all in collection analysis network and 2 type LSA, just can know in whole network, which router with which router is connected, that is, each router is aware of the topology of this network.Then, this network topology is abstracted into a network diagramming, each ospf router to this network diagramming use Di Jiesitela (Dijkstra) algorithm to calculate from this router to any node (node can be router also can be network) figure, which way to go recently, the namely algorithm of the SPF (ShortPath First) of so-called calculating shortest path in OSPF.This step mainly carries out the parsing building whole shortest path trees and down hop, for step 2 below and step 3 are served.Some a small amount of routes can be calculated simultaneously.
Step 2: according to 3 types, 4 type LSA, the shortest path that each router utilizes the topological sum of network to calculate to calculate route between ospf area and to ASBR router by.Usually a large amount of routes can be calculated.
Step 3: according to 5,7 type LSA, the shortest path that each router utilizes the topological sum of network to calculate is to calculate OSPF external routes.Usually also a large amount of routes can be calculated.
In step 2 and step 3 computational process, for specific router, the storage order of LSA in LSD LSDB (Link State Database) of reception is uncertain.And in step 2 and 3 can according to LSD in LSA storage order calculate route corresponding to each LSA.Therefore, in routing table, the computation sequence of each route is uncertain, and the calculating of each route is completely independently, and the computation sequence of route is uncorrelated with route significance level.For certain paths specific, the computation sequence of each router on same path is also independently, incoherent.
When the number of routes in certain router is many especially time, crucial routing iinformation is being set up in routing order process, the last of other route may be placed at random, the calculating of its route has been caused to be also placed in last, crucial routing iinformation will be caused not calculated in time, cause the Chief Web Officer time not restrained.
The method of some quick routing iinformation convergences is had in prior art, such as increment shortest-path first algorithm (algorithms of Incremental Shortest Path First, ISPF), this algorithm is the improvement of SPF (SPF) algorithm, when path changes in region, only calculate affected part node.So this algorithm can intra-zone router-level topology in accelerating step 1, but cannot number of routes is too much in settlement steps to deal 2 and step 3 problem; Part path computing technique (Partial Route Calculation is also had in prior art, PRC), the principle of this technology is outside certain (or certain some) region or when Autonomy System-External route changes, and only calculates the route that these have changed.But this technology cannot process because intra-zone route recalculates thus causes the problem that step 2 and step 3 all recalculate.
In order to solve the problems of the technologies described above, present disclosure proposes critical path by concept, the route that namely critical path is corresponding.First disclose a kind of propagate critical path by method, Fig. 3 show according to a kind of execution mode of the disclosure a kind of propagate critical path by the flow chart of method, according to Fig. 3, in step S301, receive the critical path that arranges by; In step S302, the LSA LSA of critical path by correspondence arranges crucial routing label; And in step S303, utilize flooding mechanism to propagate into corresponding OSPF ospf network by the LSA of correspondence critical path.
Arrange critical path by mode have multiple implementation method.Such as system manager directly defines a text or marking document, lists crucial routing iinformation, then by the important route that a conversion program will be listed in text, is converted into command line interface and is loaded in ospf protocol and goes.
Such as, give the prefix of route and the length of netmask or network number and netmask in following text, these two kinds of methods are of equal value, for arrange critical path by.
30.30.30.1/24
50.50.50.2/8
80.80.80.0/24
Or
30.30.30.1 255.255.255.0
50.50.50.2 255.0.0.0
80.80.80.0 255.255.255.0
In another embodiment, can also use XML document designated key route, XML document is a straightaway descriptive language.Here by specifying routing property, these conditions being loaded in OSPF and going, when OSPF notices LSA time, can go to check these conditions, when corresponding route or LSA satisfy condition time, will crucial Route Distinguisher be set on LSA.Below provide the example of an XML document.
＜?xml version=”1.0”standalone=”yes”encoding=”UTF-8”?＞
# defines crucial routing iinformation according to the network number of route
＜virtal-route＞
＜IP＞30.30.30.1＜/IP＞
＜Netmask＞255.255.255.0＜/Netmask＞
＜/virtal-route＞
# defines crucial routing iinformation according to label value
＜virtal-route＞
＜LSA-type＞type-5＜/LSA-type＞
＜tag＞35＜/tag＞
＜/virtal-route＞
Then by the control plane of these Information application to router, as OSPF, ISIS, bgp protocol etc.
In one embodiment, can also according to the network number designated key route of route, such as use to specify 68.0.0.0 netmask to be the route of 255.0.0.0 as issued orders be critical path by
vital-route ip-address68.0.0.0255.0.0.0
In another embodiment, can also according to the type designated key route of LSA, the type of LSA can be 3,4,5,7, such as use route as corresponding in the LSA of specified type 3 of issuing orders to be all critical path by:
vital-route lsa-type type-3
In one embodiment, according to the down hop designated key route of route, 3 can also be applicable to, 4,5,7 type LSA, such as, use and specify generation 3,4 as issued orders, 5, during 7 type LSA, if the down hop of the route of correspondence is 30.30.30.2, then to produce route corresponding to corresponding LSA be critical path by:
vital-route next-hop30.30.30.2
In another embodiment, the label value that can also carry according to external routes arrange critical path by, be applicable to 5,7 type LSA, such as use as the label value of designated external route of issuing orders be 300 be set to critical path by:
vital-route external-tag300
In one embodiment, can also according to the cost of route arrange critical path by, be applicable to 3,4,5 and 7 type LSA, such as use specified circuit is 300 by cost as issued orders reason be set to critical path by:
vital-route metric300
In another embodiment, can also according to the source type of external routes arrange critical path by, be applicable to 5,7 type LSA, such as use as issue orders specified circuit by type be ISIS-L1 be set to critical path by:
vital-route route-type isis-11
Wherein parameter can be bgp, bgp-int, bgp-ext, isis-11, isis-12 etc., and these are all common route-types.
In one embodiment, can also according to setting strategy setting critical path by.Such as use as issue orders specify meet label value be 50 and the route that cost is 400 will be set to critical path by:
route-map ibm
match tag 50
match metric 400
vital-route route-map ibm
Critical path by after by use, above-mentioned at least one mode arranges, in step S301, receive the critical path that arranges by.
OSPF is the agreement of a dynamic operation, has now multi-functional switch perhaps, and the adjustment of some parameters.User issues the order of user by command line interface.Herein user by command line interface issue be critical path by condition.When 3,4,5 or 7 type LSA produce time can go check critical path by condition.If satisfied condition, in step S302, the LSA of critical path by correspondence will arrange crucial routing label.Otherwise, then crucial route option can not be set.This just increases the flow process that arranges crucial route option in the flow process of LSA generation.
On the LSA of critical path by correspondence, how to arrange each LSA of crucial routing label with the head of a LSA, ensuing part is different according to the type of LSA, provides the detailed explanation of 3,4,5,7 type LSA and the head of LSA.
OSPF LSA has its fixing message format, and Fig. 4 shows the data format of the head of LSA.Other field in Fig. 4 has concrete meaning, can not be used for expansion.But Option Field (options) may be used for expansion LSA characteristic, can arrange crucial routing label at this.
Fig. 5 shows the data format of 3 type LSA and 4 type LSA, and the two is the same, and just type field one is 3; Another is 4; Be exactly link-state identification one be in addition network number, another one is advertizing router mark, and when 4 type LSA, netmask is meaningless, is always 0.
Fig. 6 shows the data format of 5 type LSA and 7 type LSA, and the two is the same.Just type field one is 5 one is 7.Wherein Option Field (options) is at the head portion of LSA.
The head Option Field of LSA has 8, and other most of flag is all occupied.3rd is applicable to express support for multicast-capable at first, but basic nobody uses at present.So can be used for representing crucial route option with this position.16 systems represent to be exactly 0x04.Fig. 7 diagrammatically illustrates the representation of a kind of crucial route option in the Option Field of LSA.Other mode can certainly be adopted to expand, such as TLV (type, length, value) mode, wherein, TLV is that message expands common mode, and the equipment in network needs to exchange many attributes usually, when the attribute appointed of both sides exchanged to represent the attribute of transmission with identical type T (type); L (1ength), represent that the length of this attribute is how many, the space taken exactly is how many.Value (value) is exactly represent concrete numerical value.Such as also can arrange here: in LSA, type is 65536, and length is 4 bytes, value be 4 be used as arrange critical paths by mark.
The route of key defined above can be transmitted to corresponding OSPF ospf network, and how to propagate the flooding mechanism that can utilize LSA, wherein, critical path can be set up upper flag by the Option Field of the LSA of correspondence.The flooding mechanism that LSA follows OSPF transmits with synchronous between ospf neighbor, thus whole ospf network has all learned crucial routing iinformation.How inundation belongs to the general knowledge of those skilled in the art, repeats no more here.
In the disclosure, LSA propagates in the entire network, the crucial routing label carried by it make each router in network can preferentially calculate this critical path by.Individual equipment there occurs fault, needs all devices in this network all to carry out the process of this fault, be exactly all devices in network all the renewal of this route as preferential thing.
The disclosure also discloses one and sets up routing table method, and Fig. 8 shows the flow chart setting up the method for routing table according to a kind of execution mode of the present disclosure, according to Fig. 8, in step S801, receives the LSA of critical path by correspondence; In step S802, computing network topological sum shortest path; In step S803, according to critical path by the LSA of correspondence and the network topology calculated and shortest path calculate critical path by; In step S804, set up the route table items of critical path by correspondence in the routing table; In step S805, calculate non-key route according to critical path by the LSA outside the LSA of correspondence and the network topology calculated and shortest path; In step S806, set up the route table items that non-key route is corresponding in the routing table.
After critical path is utilized flooding mechanism to propagate into corresponding OSPF ospf network by method shown in Fig. 3 by the LSA of correspondence, each router receives the LSA of critical path by correspondence.These critical paths can be stored in LSD by the LSA of correspondence by router, more simple mode is that the independent database table of employing one stores the LSA of all critical paths by correspondence, like this when calculating can first from this tables of data calculate critical path by.After using said method to set up routing table, critical path is by can preferentially be calculated, then the speed of crucial routing convergence is fast, and the possibility that network message is lost reduces.How to calculate the general knowledge belonging to those skilled in the art as route, repeat no more here.
Or the foundation of routing table still uses prior art, but, be suitable for method of the present disclosure and the renewal carrying out routing table.Under same inventive concept, the invention also discloses a kind of method upgrading routing table.Fig. 9 shows the flow chart of the method for the renewal routing table according to a kind of execution mode of the present disclosure, according to Fig. 9, in step S901, receives the LSA of critical path by correspondence; In step S902, need to upgrade in response to routing table, perform and operate as follows: in step S903, computing network topological sum shortest path; In step S904, according to critical path by the LSA of correspondence and the network topology calculated and shortest path calculate critical path by; In step S905, upgrade the route table items of the critical path in routing table by correspondence; In step S906, calculate non-key route according to critical path by the LSA outside the LSA of correspondence and the network topology calculated and shortest path; In step S907, the route table items that the non-key route in renewal routing table is corresponding.
The LSA content that router receives changes or the LSA of this locality changes, and can trigger OSPF and carry out router-level topology, thus judges that the route in routing table needs to upgrade.Comprising the following two kinds situation:
(1) if LSA (i.e. 1 or 2 type LSA) changes in region, whole routes of whole routing table can be caused to rerun, comprise the calculating of route corresponding to 3,4,5 and 7 type LSA.
(2) if LSA (i.e. 3,4,5 or 7 type LSA) changes reruning of the route that causes outside region, in two kinds of situation:
A) if this ospf router achieves part path computing technique (PRC) technology, so only need to calculate corresponding route.But have an exception, the change of 4 type LSA can cause reruning of reason entry corresponding to all 5 type LSA.
B) if this ospf router does not have achievement unit sub-path computing technique to calculate, that just needs all routes all to rerun.
Then, the route newly calculated and the route of preserving before can compare by OSPF.If old routing table (entry) and new routing table (entry) different, the route illustrating in routing table needs to upgrade, just by the route that the routing update of newly calculating is old, simultaneously state information updating; If the same, then do not need to upgrade route content, only need the state information updating of route.If old routing state information is not updated, old route will be deleted.Visible, whole router-level topology needs the more time, if critical path by correspondence LSA by be stored at random LSD below time, calculate critical path by front needing to calculate a lot of non-key route.
Then, after computing network topological sum shortest path, just according to critical path by correspondence LSA calculate critical path by, the result calculated just preferentially can upgrade the route in routing table.Such as originally there were 10000 routes, were followed successively by 1,2.。。999，。。。9999,10000, now definition 9999 routes be critical path by, then when next time calculates routing table, according to 9999,1,2.。。The order computation of 10000.That is, first calculate and upgrade critical path by, then calculate and upgrade non-key route.And calculate the method for route according to LSA and still use method of the prior art, like this can when routing table update, accelerate critical path by convergence.
In one embodiment, after reception critical path occurs in routing table foundation by the step of the LSA of correspondence.That is, then when not receiving the LSA of critical path by correspondence, establish routing table, then, just receive the LSA of critical path by correspondence, judge to need routing table update.
Under same inventive concept, embodiment of the present disclosure also disclose a kind of propagate critical path by equipment, Figure 10 diagrammatically illustrate according to the propagation critical path of a disclosure execution mode by the structured flowchart of equipment 1000, according to Figure 10, equipment 1000 comprises: receiving system 1001, be configured to receive arrange critical path by; Setting device 1002, is configured to arrange crucial routing label on the LSA LSA of critical path by correspondence; And transmission device 1003, be configured to critical path to utilize flooding mechanism to propagate into corresponding OSPF ospf network by the LSA of correspondence.
In one embodiment, critical path is arranged by by the following at least one mode of use: use document designated key route; According to the network number designated key route of route; According to the type designated key route of LSA; According to the down hop designated key route of route; The label value carried according to external routes arrange critical path by; According to the cost of route arrange critical path by; According to the source type of external routes arrange critical path by; According to setting strategy setting critical path by.
In another embodiment, setting device is further configured to: arrange crucial routing label at the Option Field of the head of LSA.
Under same inventive concept, embodiment of the present disclosure also discloses a kind of equipment setting up routing table, Figure 11 diagrammatically illustrates the structured flowchart of the equipment 1100 setting up routing table according to a disclosure execution mode, according to Figure 11, equipment 1100 comprises: receiving system 1101, is configured to receive the LSA of critical path by correspondence; Network topology and shortest path calculation element 1102, be configured to computing network topological sum shortest path; Critical path by calculation element 1103, be configured to the network topology that calculated by the LSA of correspondence and network topology and shortest path calculation element according to critical path and shortest path calculate critical path by; Critical path, by the route table items apparatus for establishing 1104 of correspondence, is configured to set up the route table items of critical path by correspondence in the routing table; Non-key router-level topology device 1105, is configured to the network topology that calculated by the LSA outside the LSA of correspondence and network topology and shortest path calculation element according to critical path and shortest path calculates non-key route; And the route table items apparatus for establishing 1106 that non-key route is corresponding, be configured to set up route table items corresponding to non-key route in the routing table.
Under same inventive concept, embodiment of the present disclosure also discloses a kind of equipment upgrading routing table, Figure 12 diagrammatically illustrates the structured flowchart of the equipment 1200 of the renewal routing table according to a disclosure execution mode, according to Figure 12, equipment 1200 comprises: receiving system 1201, is configured to receive the LSA of critical path by correspondence; Routing table update judgment means 1202, is configured to judge that routing table needs to upgrade; Network topology and shortest path calculation element 1203, be configured to computing network topological sum shortest path; Critical path by calculation element 1204, be configured to the network topology that calculated by the LSA of correspondence and network topology and shortest path calculation element according to critical path and shortest path calculate critical path by; Critical path, by the route table items updating device 1205 of correspondence, is configured to upgrade the route table items of the critical path in routing table by correspondence; Non-key router-level topology device 1206, is configured to the network topology that calculated by the LSA outside the LSA of correspondence and network topology and shortest path calculation element according to critical path and shortest path calculates non-key route; The route table items updating device 1207 that non-key route is corresponding, is configured to upgrade the route table items that non-key route in routing table is corresponding.
In one embodiment, receiving system receive critical path by correspondence LSA occur in routing table set up after.
Flow chart in accompanying drawing and block diagram show system according to multiple embodiment of the present invention, the architectural framework in the cards of method and computer program product, function and operation.In this, each square frame in flow chart or block diagram can represent a part for module, program segment or a code, and a part for described module, program segment or code comprises one or more executable instruction for realizing the logic function specified.Also it should be noted that at some as in the realization of replacing, the function marked in square frame also can be different from occurring in sequence of marking in accompanying drawing.Such as, in fact two continuous print square frames can perform substantially concurrently, and they also can perform by contrary order sometimes, and this determines according to involved function.Also it should be noted that, the combination of the square frame in each square frame in block diagram and/or flow chart and block diagram and/or flow chart, can realize by the special hardware based system of the function put rules into practice or operation, or can realize with the combination of specialized hardware and computer instruction.
Be described above various embodiments of the present invention, above-mentioned explanation is exemplary, and non-exclusive, and be also not limited to disclosed each embodiment.When not departing from the scope and spirit of illustrated each embodiment, many modifications and changes are all apparent for those skilled in the art.The selection of term used herein, is intended to explain best the principle of each embodiment, practical application or the technological improvement to the technology in market, or makes other those of ordinary skill of the art can understand each embodiment disclosed herein.
Claims (12)
1. propagate critical path by a method, comprising:
Receive arrange critical path by;
The LSA LSA of critical path by correspondence arranges crucial routing label; And
Flooding mechanism is utilized to propagate into corresponding OSPF ospf network by the LSA of correspondence critical path.
2. the method for claim 1, wherein critical path is arranged by by the following at least one mode of use:
Use document designated key route;
According to the network number designated key route of route;
According to the type designated key route of LSA;
According to the down hop designated key route of route;
The label value carried according to external routes arrange critical path by;
According to the cost of route arrange critical path by;
According to the source type of external routes arrange critical path by;
According to setting strategy setting critical path by.
3. the method for claim 1, wherein arranges crucial routing label and comprises: arrange crucial routing label at the Option Field of the head of LSA on the LSA LSA of critical path by correspondence.
4. set up a method for routing table, comprising:
Receive the LSA of critical path by correspondence;
Computing network topological sum shortest path;
According to critical path by the LSA of correspondence and the network topology calculated and shortest path calculate critical path by;
Set up the route table items of critical path by correspondence in the routing table;
Non-key route is calculated by the LSA outside the LSA of correspondence and the network topology calculated and shortest path according to critical path; And
Set up the route table items that non-key route is corresponding in the routing table.
5. upgrade a method for routing table, comprising:
Receive the LSA of critical path by correspondence;
Need to upgrade in response to routing table, perform and operate as follows:
Computing network topological sum shortest path;
According to critical path by the LSA of correspondence and the network topology calculated and shortest path calculate critical path by;
Upgrade the route table items of the critical path in routing table by correspondence;
Non-key route is calculated by the LSA outside the LSA of correspondence and the network topology calculated and shortest path according to critical path;
The route table items that non-key route in renewal routing table is corresponding.
6. method as claimed in claim 5, after wherein reception critical path occurs in routing table foundation by the step of the LSA of correspondence.
7. propagate critical path by an equipment, comprising:
Receiving system, be configured to receive arrange critical path by;
Setting device, is configured to arrange crucial routing label on the LSA LSA of critical path by correspondence; And
Transmission device, is configured to critical path to utilize flooding mechanism to propagate into corresponding OSPF ospf network by the LSA of correspondence.
8. equipment as claimed in claim 7, wherein, critical path is arranged by by the following at least one mode of use:
Use document designated key route;
According to the network number designated key route of route;
According to the type designated key route of LSA;
According to the down hop designated key route of route;
The label value carried according to external routes arrange critical path by;
According to the cost of route arrange critical path by;
According to the source type of external routes arrange critical path by;
According to setting strategy setting critical path by.
9. equipment as claimed in claim 7, wherein setting device is further configured to: arrange crucial routing label at the Option Field of the head of LSA.
10. set up an equipment for routing table, comprising:
Receiving system, is configured to receive the LSA of critical path by correspondence;
Network topology and shortest path calculation element, be configured to computing network topological sum shortest path;
Critical path by calculation element, be configured to the network topology that calculated by the LSA of correspondence and network topology and shortest path calculation element according to critical path and shortest path calculate critical path by;
Critical path, by the route table items apparatus for establishing of correspondence, is configured to set up the route table items of critical path by correspondence in the routing table;
Non-key router-level topology device, is configured to the network topology that calculated by the LSA outside the LSA of correspondence and network topology and shortest path calculation element according to critical path and shortest path calculates non-key route; And
The route table items apparatus for establishing that non-key route is corresponding, is configured to set up route table items corresponding to non-key route in the routing table.
11. 1 kinds of equipment upgrading routing table, comprising:
Receiving system, is configured to receive the LSA of critical path by correspondence;
Routing table update judgment means, is configured to judge that routing table needs to upgrade;
Network topology and shortest path calculation element, be configured to computing network topological sum shortest path;
Critical path by calculation element, be configured to the network topology that calculated by the LSA of correspondence and network topology and shortest path calculation element according to critical path and shortest path calculate critical path by;
Critical path, by the route table items updating device of correspondence, is configured to upgrade the route table items of the critical path in routing table by correspondence;
Non-key router-level topology device, is configured to the network topology that calculated by the LSA outside the LSA of correspondence and network topology and shortest path calculation element according to critical path and shortest path calculates non-key route;
The route table items updating device that non-key route is corresponding, is configured to upgrade the route table items that non-key route in routing table is corresponding.
12. equipment as claimed in claim 11, wherein receiving system receive critical path by correspondence LSA occur in routing table set up after.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410003511.9A CN104767687B (en) | 2014-01-03 | 2014-01-03 | Propagate critical path by and establish and update routing table method and apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410003511.9A CN104767687B (en) | 2014-01-03 | 2014-01-03 | Propagate critical path by and establish and update routing table method and apparatus |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104767687A true CN104767687A (en) | 2015-07-08 |
| CN104767687B CN104767687B (en) | 2019-04-23 |
Family
ID=53649310
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410003511.9A Active CN104767687B (en) | 2014-01-03 | 2014-01-03 | Propagate critical path by and establish and update routing table method and apparatus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104767687B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107426097A (en) * | 2017-04-24 | 2017-12-01 | 山西大学 | A kind of intra-area routes guard method based on increment SPF |
| CN107622022A (en) * | 2016-07-13 | 2018-01-23 | 希捷科技有限公司 | Cache excess configuration in data storage device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101040487A (en) * | 2004-12-29 | 2007-09-19 | 思科技术公司 | Automatic route tagging of bgp next-hop routes in igp |
| CN101155135A (en) * | 2006-09-28 | 2008-04-02 | 华为技术有限公司 | Method and device for flooding autonomous system border router ability information |
| CN101227403A (en) * | 2008-02-21 | 2008-07-23 | 中兴通讯股份有限公司 | Route permeating method |
| CN101401083A (en) * | 2006-03-08 | 2009-04-01 | 思科技术公司 | Technique for preventing routing loops by disseminating BGP attribute information in an OSPF-configured network |
| CN101547139A (en) * | 2008-03-28 | 2009-09-30 | 华为技术有限公司 | Method and device for announcing network topology changes |
-
2014
- 2014-01-03 CN CN201410003511.9A patent/CN104767687B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101040487A (en) * | 2004-12-29 | 2007-09-19 | 思科技术公司 | Automatic route tagging of bgp next-hop routes in igp |
| CN101401083A (en) * | 2006-03-08 | 2009-04-01 | 思科技术公司 | Technique for preventing routing loops by disseminating BGP attribute information in an OSPF-configured network |
| CN101155135A (en) * | 2006-09-28 | 2008-04-02 | 华为技术有限公司 | Method and device for flooding autonomous system border router ability information |
| CN101227403A (en) * | 2008-02-21 | 2008-07-23 | 中兴通讯股份有限公司 | Route permeating method |
| CN101547139A (en) * | 2008-03-28 | 2009-09-30 | 华为技术有限公司 | Method and device for announcing network topology changes |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107622022A (en) * | 2016-07-13 | 2018-01-23 | 希捷科技有限公司 | Cache excess configuration in data storage device |
| CN107622022B (en) * | 2016-07-13 | 2023-04-14 | 希捷科技有限公司 | Cache over-provisioning in a data storage device |
| CN107426097A (en) * | 2017-04-24 | 2017-12-01 | 山西大学 | A kind of intra-area routes guard method based on increment SPF |
| CN107426097B (en) * | 2017-04-24 | 2020-06-12 | 山西大学 | Intra-domain route protection method based on increment shortest path priority |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104767687B (en) | 2019-04-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9680745B2 (en) | Multi-domain source routed forwarding based on collaborating network controllers | |
| US10833976B2 (en) | Loop detection and avoidance for segment routed traffic engineered paths | |
| CN112995029B (en) | Transmission path fault processing method, device and system | |
| US8238338B2 (en) | Interior gateway protocol summarization preserving internet protocol reachability information | |
| US7411963B2 (en) | Method for dissemination of non-routing information using the IS-IS protocol | |
| US8456982B2 (en) | System and method for fast network restoration | |
| KR102001267B1 (en) | Signaling a label switched path(lsp) tunneling model | |
| CN103841022A (en) | Method and device for building tunnel | |
| US9674072B1 (en) | Route topology discovery in data networks | |
| CN105814944B (en) | Topology Discovery based on explicit signaling | |
| CN105009523A (en) | Method and apparatus for IP/MPLS fast reroute | |
| CN103825826B (en) | The implementation method and device of a kind of dynamic routing | |
| KR101463364B1 (en) | Lookahead computation of routing information | |
| CN103888359A (en) | Route calculation method and network device | |
| US20210006485A1 (en) | Path information transmission device, path information transmission method and path information transmission program | |
| WO2013091545A1 (en) | Path display method, device and communication system during service deployment | |
| EP2991288B1 (en) | Method and device for determining next hop and distributing routing information | |
| CN103297338A (en) | Virtual private network (VPN) router advertisement method and device | |
| CN107078953A (en) | Method for scalable computer network partitioning | |
| US8750166B2 (en) | Route topology discovery in data networks | |
| US8423668B2 (en) | Link state protocol routing message containment | |
| CN104767687A (en) | Methods and equipment for transmitting key route and establishing and updating route table | |
| WO2017190675A1 (en) | Link information processing method, apparatus and system | |
| CN116527629A (en) | Address mapping method based on IPv6 inter-domain route expansion and related equipment | |
| CN106899473A (en) | The propagation leaf count information of the switching between auxiliary subsection formula tunnel and non-sectional type tunnel |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| EXSB | Decision made by sipo to initiate substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |