CN115499361A - Routing data processing method and device, storage medium and processor - Google Patents
Routing data processing method and device, storage medium and processor Download PDFInfo
- Publication number
- CN115499361A CN115499361A CN202210908710.9A CN202210908710A CN115499361A CN 115499361 A CN115499361 A CN 115499361A CN 202210908710 A CN202210908710 A CN 202210908710A CN 115499361 A CN115499361 A CN 115499361A
- Authority
- CN
- China
- Prior art keywords
- routing
- router
- information
- neighbor
- relation
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application discloses a method and a device for processing routing data, a storage medium and a processor. The method comprises the following steps: acquiring routing information needing to be transmitted from a first routing area to a second routing area through a boundary router; after the routing information is marked, the routing information is stored in a second routing database of a local second routing area, wherein the second routing database is used for routing a boundary router and a second router; sending neighbor information of the boundary router and the second router to the first router; receiving routing relation information generated by the first router according to the neighbor information, wherein the routing relation information is used for representing the relation between the first router and the second router; and issuing the routing relation information and the routing information to the second router. The problem that routing permeation of a border router in the related technology needs to depend on a fragmentation carrier, and under the condition that the fragmentation carrier is insufficient, routing learning is incomplete, and routing forwarding abnormity is easily caused is solved.
Description
Technical Field
The present application relates to the field of data communication, and in particular, to a method and an apparatus for processing routing data, a storage medium, and a processor.
Background
IS-IS part of the connectionless Network Service CLNS (connection Less Network Service) in the OSI (Open System Interconnection) protocol stack defined by the international standard ISO. The IS-IS belongs to an interior gateway routing protocol and IS used in an autonomous system. The IS-IS a link state Protocol, IS very similar to an OSPF (Open Shortest Path First) Protocol in a TCP/IP (Transmission Control Protocol/Internet Protocol) network, and performs routing calculation using a Shortest Path First algorithm. The ISIS protocol is commonly used for operator IP networks or enterprise level routers.
The ISIS router may be an L1 router, an L2 router, or both types of L1/2 routers. The L1 router is similar to a non-backbone internal router in the OSPF protocol, while the L2 router is similar to a backbone router in the OSPF protocol, and likewise, the L1/2 router is similar to an ABR router (area border router) in the OSPF protocol. The L1/2 router is connected with the L1 router and the L2 router. These L1/2 routers must maintain both an L1 link state database and an L2 link state database. In general, a routing domain of an IS-IS can contain a plurality of Level-1 areas, but only one Level-2 area (composed of all L2 routers and L1/2 routers). Different Level-1 areas are not connected, routing information in the Level-1 areas is reported to the Level-2 areas through Level-1-2 routers, and the phenomenon is called L1 into L2 routing penetration in the ISIS protocol.
Under a certain networking, a large number of routes are introduced into the ISIS or route penetration is performed on the ISIS protocol from L1 to L2, and when the LSP (Link-State Packet, LSP) fragments (00-ff, 256 at most) generated by the local system address system-id are not enough to carry route prefix information, route forwarding is abnormal due to insufficient fragments, the LSDBs between devices are not synchronized, and the number of routes is inconsistent. In a networking test of technicians or a use scene of a client, the problem that the route information on certain equipment is not completely learned under a large number of routes can be solved through the idea of the invention, and the condition of ISIS route loss under the specific combination environment can be solved.
Aiming at the problems that in the related art, the route penetration of the border router needs to depend on a fragmentation carrier, and under the condition of insufficient fragmentation carrier, the route learning is incomplete, and the route forwarding abnormity is easily caused, an effective solution is not provided at present.
Disclosure of Invention
The present application mainly aims to provide a method and a system for processing routing data, so as to solve the problems that in the related art, the route penetration of a border router needs to depend on a fragmented carrier, and under the condition that the fragmented carrier is insufficient, the route learning is incomplete, and the route forwarding abnormality is easily caused.
In order to achieve the above object, according to an aspect of the present application, there is provided a processing method of routing data, including: acquiring routing information required to be transmitted from a first routing area to a second routing area through a boundary router, wherein the first routing area comprises at least one first router having a neighbor relation with the boundary router, and the second routing area comprises at least one second router having a neighbor relation with the boundary router; after marking the routing information, storing the routing information in a second routing database of a local second routing area, wherein the second routing database is used for routing the border router and the second router; sending the neighbor information of the border router and the second router to the first router; receiving routing relation information generated by the first router according to the neighbor information, wherein the routing relation information is used for representing the relation between the first router and the second router; and issuing the routing relation information and the routing information to the second router.
Optionally, the obtaining the routing information that needs to be transmitted from the first routing area to the second routing area includes: determining a routing information identifier which needs to be transmitted from a first routing area to a second routing area; and acquiring corresponding routing information from a first routing database of a local first routing area according to the routing information identifier, wherein the routing information is acquired from a first router in the first routing area.
Optionally, sending the neighbor information of the border router and the second router to the first router includes: sending a message containing the neighbor information to the first router; the first router is configured to add the neighbor information to the routing information according to the packet, and generate the routing relationship information.
Optionally, after sending the message including the neighbor information to the first router, the method further includes: determining whether neighbor information having a neighbor relation only with the second router exists in the neighbor information; and sending a message containing the neighbor information to the first router under the condition that the neighbor information only has a neighbor relation with the second router exists in the neighbor information.
Optionally, the message is a handshake message for establishing and maintaining a neighbor relation by a user; and the first router extracts the identifier of the second router according to the handshake message, adds the identifier into a preset field of information description of the neighbor relation of the first router, and generates the routing relation information.
Optionally, the issuing the routing relationship information and the routing information to the second router includes: storing the routing information in the second routing database; and copying the routing relation information and the routing information stored in the second routing database to the second router, wherein the second router carries out routing operation according to the routing relation information and the routing information.
Optionally, the first routing area and the second routing area are all routing areas of the same routing protocol, and the routing protocol is a link state routing protocol.
To achieve the above object, according to another aspect of the present application, there is provided a processing apparatus for routing data. The device comprises: an obtaining module, configured to obtain, by a border router, routing information that needs to be transmitted from a first routing area to a second routing area, where the first routing area includes at least one first router that has a neighbor relation with the border router, and the second routing area includes at least one second router that has a neighbor relation with the border router; a storage module, configured to store the marked routing information in a second routing database in a local second routing area, where the second routing database is used for routing the border router and the second router; a sending module, configured to send neighbor information of the border router and the second router to the first router; a receiving module, configured to receive routing information generated by the first router according to the neighbor information, where the routing relationship information is used to characterize a relationship between the first router and the second router; and the issuing module is used for issuing the routing relation information and the routing information to the second router.
According to another aspect of the present application, there is also provided a computer-readable storage medium storing a program, wherein the program executes the processing method of routing data described in any one of the above.
According to another aspect of the present application, there is also provided an electronic device, comprising one or more processors and a memory for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors are caused to implement the method for processing routing data of any one of the above.
According to the method and the device, the routing information needing to be transmitted from the first routing area to the second routing area is obtained through the boundary router; after the routing information is marked, the routing information is stored in a second routing database of a local second routing area; sending neighbor information of the boundary router and the second router to the first router; receiving routing relation information generated by the first router according to the neighbor information; and issuing the routing relation information routing information to the second router. The method comprises the steps of determining and copying a route permeated from a first router to a second router, sending the route to the first router, sensing the neighbor relation between a boundary router and the second router, and iterating out the route relation between the first router and the second router, so that the route learning of the first router and the second router is ensured, and the route is not limited to the carrying capacity of a fragment carrier of the boundary router. The method and the device realize the technical effects of carrying out the route learning of the first router and the second router without using a fragment carrier, improving the efficiency and the accuracy of the route learning, and avoid the problems of incomplete route learning and abnormal forwarding caused by more route data. Further, the problems that in the related art, the route penetration of the border router needs to depend on the fragmentation carrier, and under the condition that the fragmentation carrier is insufficient, the route learning is incomplete, and the route forwarding abnormity is easily caused are solved.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this application, are included to provide a further understanding of the application, and the description of the exemplary embodiments of the application are intended to be illustrative of the application and are not intended to limit the application. In the drawings:
fig. 1 is a flowchart of a processing method for routing data according to an embodiment of the present application;
fig. 2 is a schematic diagram of a scenario of a route missing problem according to an embodiment of the present application;
fig. 3 is a flowchart of a routing data processing method according to an embodiment of the present application;
fig. 4 is a flowchart of an L1 role router iterative neighbor relation provided according to an embodiment of the present application;
fig. 5 is a schematic diagram of a routing data processing apparatus according to an embodiment of the present application;
fig. 6 is a schematic diagram of a processing device for routing data according to an embodiment of the present application;
fig. 7 is a schematic diagram of an electronic device provided according to an embodiment of the present application.
Detailed Description
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
In order to make the technical solutions better understood by those skilled in the art, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only partial embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
It should be noted that the terms "first," "second," and the like in the description and claims of this application and in the accompanying drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It should be understood that the data so used may be interchanged under appropriate circumstances such that embodiments of the application described herein may be used. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
It should be noted that the relevant information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data for presentation, analyzed data, etc.) referred to in the present disclosure are information and data authorized by the user or sufficiently authorized by each party. For example, an interface is provided between the system and the relevant user or organization, before obtaining the relevant information, an obtaining request needs to be sent to the user or organization through the interface, and after receiving the consent information fed back by the user or organization, the relevant information is obtained.
Examples
The present invention is described below with reference to preferred implementation steps, and fig. 1 is a flowchart of a processing method for routing data according to an embodiment of the present application, as shown in fig. 1, the method includes the following steps:
step S101, obtaining routing information which needs to be transmitted from a first routing area to a second routing area through a boundary router, wherein the first routing area comprises at least one first router which has a neighbor relation with the boundary router, and the second routing area comprises at least one second router which has a neighbor relation with the boundary router;
step S102, after marking the routing information, storing the routing information in a second routing database of a local second routing area, wherein the second routing database is used for routing the border router and the second router;
step S103, sending the neighbor information of the border router and the second router to the first router;
step S104, receiving routing relation information generated by the first router according to the neighbor information, wherein the routing relation information is used for representing the relation between the first router and the second router;
step S105, the routing relation information is issued to the second router.
Through the steps, the routing information which needs to be transmitted from the first routing area to the second routing area is obtained through the boundary router; after the routing information is marked, the routing information is stored in a second routing database of a local second routing area; sending neighbor information of the boundary router and the second router to the first router; receiving routing relation information generated by the first router according to the neighbor information; and issuing the routing relation information and the routing information to the second router. The method comprises the steps of determining and copying a route permeated from a first router to a second router, sending the route to the first router, sensing the neighbor relation between a boundary router and the second router, iterating the relation between the first router and the second router, and further ensuring the route learning of the first router and the second router without being limited to the carrying capacity of a fragment carrier of the boundary router. The method and the device realize the technical effects of carrying out the route learning of the first router and the second router without using a fragment carrier, improving the efficiency and the accuracy of the route learning, and avoid the problems of incomplete route learning and abnormal forwarding caused by more route data. Further, the problems that in the related art, the route penetration of the border router needs to depend on the fragmentation carrier, and under the condition that the fragmentation carrier is insufficient, the route learning is incomplete, and the route forwarding abnormity is easily caused are solved.
The executing body of the above steps may be the above border router, or a third party device for managing and controlling the above border router, the third party device having data processing and data operation capability, and may be a server, a processor, a calculator, and the like. The border router may be understood as a router on the adjacent border of two adjacent routing areas, i.e., the first routing area L1 and the second routing area L2, and the border router may have a neighbor relationship with the first router of the first routing area, and may perform routing transmission. And the router also has a neighbor relation with a second router of the second routing area and can carry out routing transmission. Routing data from the first routing area to the second routing area, however, requires infiltration through the border router. However, when the amount of the permeated routing data is large, the problem that the two paths of routing data needing permeation cannot be carried may be caused by the link state packet fragmentation with a fixed data capacity, so that the routing learning is incomplete, the synchronous data of the routing database is inconsistent, and the routing forwarding is abnormal.
The routing information transmitted from the first routing area to the second routing area is the routing information that needs to permeate from the first router of the first routing area to the second router of the second routing area. The routing information may be in the form of a link state packet. And generating a link state packet by using the routing information needing infiltration, so that the link state packet is convenient to store and forward.
The link state packet may be a link state packet that is learned from the first router and carries routing information of the first router, and in a default case, because a second router in a neighbor relation of the second routing area exists in the partial link state packet, the partial link state packet needs to penetrate into a database of the second routing area of the border router, so that the partial link state packet can be issued to the routing information of the second routing area. Therefore, in this embodiment, the routing information is marked, copied, and stored in the second routing database of the second routing area local to the border router.
The sending of the neighbor information of the border router and the second router to the first router may be performed in a message form, for example, an IIH message. The first router adds a new group of intermediate system neighbor relations in a link state packet LSP describing the neighbor relations of the first router according to the neighbor information, and the new group of intermediate system neighbor relations indicate the relations between the first router and a second router which is corresponding to the boundary router and has the first neighbor relations.
Optionally, sending the neighbor information of the border router and the second router to the first router includes: sending a message containing neighbor information to a first router; the first router is used for adding the neighbor information into the routing information according to the message to generate routing relation information.
The first router sends a link state packet LSP containing neighbor information to the boundary router L1/2, stores the link state packet LSP in a first routing database L1LSDB of a first routing area local to the boundary router L1/2, and copies the link state packet LSP into a second routing database L2LSDB of a second routing area. That is, the routing relationship information is the link state packet LSP which is sent by the first router and contains the neighbor information.
And then, executing routing calculation through the existing SPF algorithm, and performing routing permeation and other routing calculation between the first router and the second router.
Optionally, the obtaining of the routing information that needs to be transmitted from the first routing area to the second routing area includes: determining a routing information identifier which needs to be transmitted from a first routing area to a second routing area; and according to the routing information identification, acquiring corresponding routing information from a first routing database of a local first routing area, wherein the routing information is acquired from a first router in the first routing area.
Since the border router needs to perform routing with both the routers in the first routing area and the routers in the second routing area, two databases are provided on the border router, which are the first routing database and the second routing database, respectively. The first routing database stores information related to routing with a first routing device of a first routing area.
The routing information identifier may be an identifier of the routing information, such as a number. After determining the routing information identifier that needs to be transmitted from the first routing area to the second routing area, the corresponding routing information is obtained from the first routing database of the local first routing area according to the routing information identifier. The routing information here may also be understood as a link state packet LSP carrying first router route prefix information stored in the first routing database L1 LSDB.
Optionally, after sending the packet containing the neighbor information to the first router, the method further includes: determining whether neighbor information having a neighbor relation with only the second router exists in the neighbor information; and under the condition that the neighbor information only having the neighbor relation with the second router exists in the neighbor information, sending the message containing the neighbor information to the first router.
As shown in fig. 4, after receiving the neighbor information, the first router first determines whether there is neighbor information that only characterizes the second router in the second routing area. If so, the border router L1/2 forwards the information for transmitting the neighbor to the first router. The first router receives the cache and extracts the neighbor information in the message. The neighbor information is then added to a link state packet LSP describing the neighbor relation of the first router to indicate the relationship between the first router and a second router having the first neighbor relation corresponding to the border router.
Optionally, the message is a handshake message for establishing and maintaining a neighbor relation for a user; and the first router extracts the identifier of the second router according to the handshake message, and adds the identifier into a preset field of the information description of the neighbor relation of the first router to generate the routing relation information.
The identity of the second router, i.e., the system id, may be used to characterize the second router having a neighbor relationship in the second routing area. In other words, a second router with neighbor relation can be determined according to the system id. And adding the identification system id into a preset field of the information description of the neighbor relation of the first router to generate routing relation information.
Optionally, the issuing the routing relationship information and the routing information to the second router includes: storing the routing relationship information and the routing information in a second routing database; and copying the routing information and the routing information stored in the second routing database to a second router, wherein the second router carries out routing operation according to the routing relation information and the routing information.
In the process of issuing the routing relation information and the routing information, the boundary router can synchronize with a local database of the second router through the local second routing database, and then synchronize the routing relation information and the routing information into the second router. For subsequent routing operations.
Optionally, the first routing area and the second routing area are all routing areas of the same routing protocol, and the routing protocol is a link state routing protocol ISIS protocol.
It should be noted that the steps illustrated in the flowcharts of the figures may be performed in a computer system such as a set of computer-executable instructions and that, although a logical order is illustrated in the flowcharts, in some cases, the steps illustrated or described may be performed in an order different than here.
It should be noted that the present application also provides an alternative embodiment, which is described in detail below.
The present embodiment provides a method and an apparatus for avoiding route loss based on an ISIS protocol (link state routing protocol to Intermediate System). The method is suitable for a certain networking scenario (a specific neighbor relation is established between ISIS), where there are a large number of ISIS routes (> 3w pieces), fig. 2 is a schematic diagram of a route loss problem scenario provided by an embodiment of the present application, and as shown in fig. 2, due to default route penetration between an ISIS first route database L1LSDB (Link State data Base) and a second route database L2LSDB, the LSDBs are not synchronized, and further a route loss situation is caused. The embodiment belongs to the ISIS routing technology of IGP (interior gateway protocol) in the field of digital communication. In the ISIS protocol, permeation in two directions is performed, wherein one direction is performed by default, namely the direction from the first routing area L1 to the second routing area L2; the other is that the command is required to configure, and the penetration in the direction from the second routing area L2 to the first routing area L1, and the problem to be solved by the embodiment is that the first direction from the first routing area L1 to the second routing area L2 is performed by default.
Fig. 3 is a flowchart of a method for processing routing data according to an embodiment of the present application, and as shown in fig. 3, the technical solution is as follows:
1. determining an LSP which needs to be subjected to default penetration from a first routing area L1 to a second routing area L2;
2. copying and marking the LSP needing to be permeated, and putting the LSP into a local second routing database L2 LSDB;
3. informing the neighbor information of the local second routing area L2 to a neighbor first router of the first routing area L1, informing the neighbor relation of the local second routing area L2 of the neighbor first router L1, iterating the neighbor first router to generate a new LSP (containing L2 neighbor relation), showing the relation with the L2 neighbor router of the boundary router L1/2, and sending the LSP back to the L1/2 boundary router;
4. and synchronizing the routing database LSDB with the equipment establishing the neighbor relation of the L2-level peer only, and executing routing calculation by the equipment according to the LSDB information. In a specific manner, as shown in fig. 4, fig. 4 is a flowchart of a first router iterating a neighbor relation provided according to an embodiment of the present application.
Fig. 5 is a schematic diagram of a routing data processing apparatus provided in an embodiment of the present application, and the embodiment further provides a routing data processing apparatus, including: the device comprises a determining module, a copying module, an updating module and a sending/receiving module.
The determining module: determining LSP-id in a second routing database L2LSDB needing to penetrate from a first routing area L1 to a second routing area on a boundary router (L1/2 level);
and determining the ISIS LSP to be permeated in the first routing database L1-LSDB. Here, the LSP to be permeated is an LSP which is learned by the L1/2 border routing device from the neighboring first router and carries L1 routing information, and in a default case, this part of L1 LSP needs to permeate into the L2-LSDB database because of the existence of the second router in the L2 neighbor relationship, so that this part of routing information can be issued into ISIS whole network routing information.
A copying module: copying the LSP needing to be permeated and storing the LSP into a second routing database L2 LSDB;
and copying the LSP to be permeated, and setting an identifier for the copied LSP to indicate that the part of LSP is a copy of the L1 LSP to be issued to the second routing area. Here, the routing device may retrieve the LSP to be infiltrated from the local database based on the particular identification.
An update module: sending the L2 neighbor relation established with the local to the L1 neighbor;
the L1 neighbor first router adds a group of new intermediate system neighbor TLV values to the LSP describing the neighbor relation according to the received L2 IIH message sent by the L1/2 boundary router, which indicates the relation between the L1 neighbor first router and the L2 neighbor second router of the L1/2 boundary router, and the LSP is sent back to the L1LSDB of the first routing database of the L1/2 boundary router and is copied to the L2LSDB of the second routing database.
A transmission/reception module: the LSP is used for sending the copied LSP to the neighbor node of the routing equipment;
synchronization between LSDB link state databases is done in a conventional manner by the snppdu in ISIS. An L2 link state database of the L1/2 router equipment receives a copied LSP, wherein the copied LSP comprises information carrying L1 routing prefix information and indicating an iterative neighbor relation between the L1 router and the L2 router. Furthermore, the L2 router has the routing prefix and the iterative relationship information of L1, that is, ISIS routing calculation can be performed according to the SPF algorithm (short Path First algorithm — Shortest Path First algorithm).
The embodiment of the present application further provides a processing device for routing data, and it should be noted that the processing device for routing data of the embodiment of the present application may be used to execute the processing method for routing data provided in the embodiment of the present application. The following describes a processing apparatus for routing data according to an embodiment of the present application.
Fig. 6 is a schematic diagram of a processing apparatus for routing data according to an embodiment of the present application, where, as shown in fig. 6, the apparatus includes: an acquisition module 60, a storage module 62, a sending module 64, a receiving module 66, and a distribution module 68, which are described in detail below.
An obtaining module 60, configured to obtain, by a border router, routing information that needs to be transmitted from a first routing area to a second routing area, where the first routing area includes at least one first router having a neighbor relationship with the border router, and the second routing area includes at least one second router having a neighbor relationship with the border router; a storage module 62, connected to the obtaining module 60, configured to store the marked routing information in a second routing database of the local second routing area, where the second routing database is used for routing between the border router and the second router; a sending module 64 connected to the storage module 62, configured to send neighbor information of the border router and the second router to the first router; a receiving module 66, connected to the sending module 64, configured to receive routing relationship information generated by the first router according to the neighbor information, where the routing relationship information is used to represent a relationship between the first router and the second router; and the issuing module 68 is connected to the receiving module 66, and is configured to issue the routing relationship information routing information to the second router.
The processing device for routing data provided by the embodiment of the application acquires the routing information which needs to be transmitted from the first routing area to the second routing area through the boundary router; after the routing information is marked, the routing information is stored in a second routing database of a local second routing area; sending neighbor information of the boundary router and the second router to the first router; receiving routing relation information generated by the first router according to the neighbor information; and issuing the routing relation information and the routing information to the second router. The method comprises the steps of determining and copying a route permeated from a first router to a second router, sending the route to the first router, sensing the neighbor relation between a boundary router and the second router, iterating the relation between the first router and the second router, and further ensuring the route learning of the first router and the second router without being limited to the carrying capacity of a fragment carrier of the boundary router. The method and the device realize the technical effects of carrying out the route learning of the first router and the second router without using a fragment carrier, improving the efficiency and the accuracy of the route learning, and avoid the problems of incomplete route learning and abnormal forwarding caused by more route data. Further, the problems that in the related art, the route penetration of the border router needs to depend on the fragmentation carrier, and under the condition that the fragmentation carrier is insufficient, the route learning is incomplete, and the route forwarding abnormity is easily caused are solved.
The processing device of the routing data comprises a processor and a memory, wherein the acquiring module 60, the storing module 62, the sending module 64, the receiving module 66, the issuing module 68 and the like are all stored in the memory as program units, and the processor executes the program units stored in the memory to realize corresponding functions.
The processor comprises a kernel, and the kernel calls the corresponding program unit from the memory. The kernel can be set to be one or more than one, and the problems that in the related technology, the route penetration of the border router needs to depend on the fragmentation carrier, and under the condition that the fragmentation carrier is insufficient, the route learning is incomplete, and the route forwarding abnormity is easily caused are solved by adjusting the kernel parameters.
The memory may include volatile memory in a computer readable medium, random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM), including at least one memory chip.
An embodiment of the present invention provides a computer-readable storage medium on which a program is stored, the program implementing a processing method of routing data when executed by a processor.
The embodiment of the invention provides a processor, which is used for running a program, wherein a processing method of routing data is executed when the program runs.
Fig. 7 is a schematic diagram of an electronic device according to an embodiment of the present application, and as shown in fig. 7, an embodiment of the present application provides an electronic device 70, which includes a processor, a memory, and a program stored in the memory and running on the processor, and when the processor executes the program, the processor implements any of the steps of the method.
The device in the application can be a server, a PC, a PAD, a mobile phone and the like.
The present application further provides a computer program product adapted to perform a program for initializing any of the above method steps when executed on a processing device for routing data.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). The memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising a … …" does not exclude the presence of another identical element in a process, method, article, or apparatus that comprises the element.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The above are merely examples of the present application and are not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (10)
1. A processing method of routing data is characterized by comprising the following steps:
acquiring routing information required to be transmitted from a first routing area to a second routing area through a boundary router, wherein the first routing area comprises at least one first router having a neighbor relation with the boundary router, and the second routing area comprises at least one second router having a neighbor relation with the boundary router;
after the routing information is marked, storing the routing information in a second routing database of a local second routing area, wherein the second routing database is used for routing the boundary router and the second router;
sending the neighbor information of the border router and the second router to the first router;
receiving routing relation information generated by the first router according to the neighbor information, wherein the routing relation information is used for representing the routing relation between the first router and the second router;
and issuing the routing relation information and the routing information to the second router.
2. The method of claim 1, wherein obtaining routing information that needs to be transferred from the first routing area to the second routing area comprises:
determining a routing information identifier which needs to be transmitted from a first routing area to a second routing area;
and acquiring corresponding routing information from a first routing database of a local first routing area according to the routing information identifier, wherein the routing information is acquired from a first router in the first routing area.
3. The method of claim 2, wherein sending the neighbor information of the border router and the second router to the first router comprises:
sending a message containing the neighbor information to the first router;
the first router is used for adding the neighbor information into the routing information according to the message to generate routing relation information.
4. The method of claim 3, wherein after sending the packet containing the neighbor information to the first router, the method further comprises:
determining whether neighbor information having a neighbor relation only with the second router exists in the neighbor information;
and sending a message containing the neighbor information to the first router under the condition that the neighbor information only has a neighbor relation with the second router exists in the neighbor information.
5. The method of claim 3, wherein the message is a handshake message for a user to establish and maintain a neighbor relation;
and the first router extracts the identifier of the second router according to the handshake message, adds the identifier into a preset field of information description of the neighbor relation of the first router, and generates the routing relation information.
6. The method of claim 3, wherein publishing the routing relationship information and the routing information to the second router comprises:
storing the routing relationship information and the routing information in the second routing database;
and copying the routing relation information and the routing information stored in the second routing database to the second router, wherein the second router carries out routing operation according to the routing relation information and the routing information.
7. The method according to any of claims 1 to 6, wherein the first routing area and the second routing area are all routing areas of the same routing protocol, and wherein the routing protocol is a link state routing protocol.
8. A processing apparatus for routing data, comprising:
an obtaining module, configured to obtain, by a border router, routing information that needs to be transmitted from a first routing area to a second routing area, where the first routing area includes at least one first router that has a neighbor relation with the border router, and the second routing area includes at least one second router that has a neighbor relation with the border router;
a storage module, configured to store the marked routing information in a second routing database of a local second routing area, where the second routing database is used for routing the border router and the second router;
a sending module, configured to send neighbor information of the border router and the second router to the first router;
a receiving module, configured to receive routing relationship information generated by the first router according to the neighbor information, where the routing relationship information is used to characterize a relationship between the first router and the second router;
and the issuing module is used for issuing the routing relation information and the routing information to the second router.
9. A computer-readable storage medium characterized by storing a program for executing the processing method of routing data according to any one of claims 1 to 7.
10. An electronic device comprising one or more processors and memory storing one or more programs, wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the method of processing routing data of any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210908710.9A CN115499361B (en) | 2022-07-29 | 2022-07-29 | Processing method and device of route data, storage medium and processor |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210908710.9A CN115499361B (en) | 2022-07-29 | 2022-07-29 | Processing method and device of route data, storage medium and processor |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115499361A true CN115499361A (en) | 2022-12-20 |
| CN115499361B CN115499361B (en) | 2023-08-04 |
Family
ID=84466750
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210908710.9A Active CN115499361B (en) | 2022-07-29 | 2022-07-29 | Processing method and device of route data, storage medium and processor |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115499361B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101179488A (en) * | 2006-11-10 | 2008-05-14 | 华为技术有限公司 | Method and device for notifying autonomic system boundary linkage information |
| CN101312438A (en) * | 2007-05-24 | 2008-11-26 | 华为技术有限公司 | Router and route updating method thereof |
| CN101371150A (en) * | 2006-01-18 | 2009-02-18 | 思科技术公司 | Dynamic protection against failure of a head-end node of one or more TE-LSPs |
| CN104935513A (en) * | 2015-04-30 | 2015-09-23 | 杭州华三通信技术有限公司 | Method and apparatus of clearing link state advertisement |
| US20170195214A1 (en) * | 2014-07-01 | 2017-07-06 | Zte Corporation | ISIS-Based Routing Calculation Method And Device |
-
2022
- 2022-07-29 CN CN202210908710.9A patent/CN115499361B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101371150A (en) * | 2006-01-18 | 2009-02-18 | 思科技术公司 | Dynamic protection against failure of a head-end node of one or more TE-LSPs |
| CN101179488A (en) * | 2006-11-10 | 2008-05-14 | 华为技术有限公司 | Method and device for notifying autonomic system boundary linkage information |
| CN101312438A (en) * | 2007-05-24 | 2008-11-26 | 华为技术有限公司 | Router and route updating method thereof |
| US20170195214A1 (en) * | 2014-07-01 | 2017-07-06 | Zte Corporation | ISIS-Based Routing Calculation Method And Device |
| CN104935513A (en) * | 2015-04-30 | 2015-09-23 | 杭州华三通信技术有限公司 | Method and apparatus of clearing link state advertisement |
Non-Patent Citations (1)
| Title |
|---|
| ALEX ZININ; ABHAY ROY;LIEM NGUYEN; CISCO SYSTEMS;: "OSPF Out-of-band LSDB resynchronization draft-ietf-ospf-oob-resync-01.txt", IETF * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115499361B (en) | 2023-08-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11128611B2 (en) | Method for determining path computation element and communications device | |
| US8817798B2 (en) | Constraining topology size and recursively calculating routes in large networks | |
| US6968393B1 (en) | Method and apparatus for an attribute oriented routing update | |
| US7978631B1 (en) | Method and apparatus for encoding and mapping of virtual addresses for clusters | |
| US7991864B2 (en) | Network element discovery using a network routing protocol | |
| CN105847158B (en) | Method and system for processing routing data | |
| US11711281B2 (en) | Methods and network devices for detecting and resolving abnormal routes | |
| CN112491636A (en) | Data processing method and device and computer storage medium | |
| CN112822106A (en) | Segment routing service processing method, device, source node and storage medium | |
| CN106059917B (en) | Routing information processing method and device | |
| US20210281507A1 (en) | Parameter notification and obtaining methods and devices, and storage medium | |
| Alotaibi et al. | Multidomain sdn-based gateways and border gateway protocol | |
| EP3461079A1 (en) | Path establishment method and device, and network node | |
| CN109831378B (en) | Message timeout response method and device | |
| CN115499361B (en) | Processing method and device of route data, storage medium and processor | |
| US9665441B2 (en) | Method and system for packet redundancy removal | |
| EP4311311A1 (en) | Traffic message forwarding method, and client, controller and storage medium | |
| JP4365869B2 (en) | ROUTE INFORMATION CHANGE METHOD, ROUTE INFORMATION CHANGE DEVICE, AND ROUTE INFORMATION CHANGE PROGRAM | |
| CN109921989B (en) | BGP logical topology generation method and equipment | |
| US9876736B2 (en) | Dual stack root based mLDP tree merge | |
| CN114584558A (en) | Cloud edge cooperative distributed API gateway system and API calling method | |
| US10992573B2 (en) | Multi-layer LSP control method and apparatus | |
| CN111865786B (en) | Method and apparatus for propagating link markers | |
| CN109756487B (en) | Authentication method, device, equipment and storage medium | |
| CN111106982B (en) | Information filtering method and device, electronic equipment and storage medium |
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 |