CN115499361B - Processing method and device of route data, storage medium and processor - Google Patents
Processing method and device of route data, storage medium and processor Download PDFInfo
- Publication number
- CN115499361B CN115499361B CN202210908710.9A CN202210908710A CN115499361B CN 115499361 B CN115499361 B CN 115499361B CN 202210908710 A CN202210908710 A CN 202210908710A CN 115499361 B CN115499361 B CN 115499361B
- 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.)
- Active
Links
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 processing method and device of routing data, a storage medium and a processor. The method comprises the following steps: acquiring routing information required to be transmitted from a first routing area to a second routing area through a 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 between the boundary router and the second router; transmitting neighbor information of the boundary router and the second router to the first router; receiving routing relation information generated by a first router according to neighbor information, wherein the routing relation information is used for representing the relation between the first router and a second router; and issuing the routing relation information and the routing information to a second router. The method solves the problems that the route penetration of the boundary router in the related technology is required to depend on the slicing carrier, and the route learning is incomplete and the route forwarding abnormality is easy to be caused under the condition of insufficient slicing carrier.
Description
Technical Field
The present invention relates to the field of data communications, and in particular, to a method and apparatus for processing routing data, a storage medium, and a processor.
Background
IS-IS part of connectionless network service CLNS (Counection Less Network Service) in the OSI (Open System Interconnection open systems interconnection) protocol stack defined by the international standard ISO. IS-IS belongs to an interior gateway routing protocol for use within autonomous systems. IS-IS a link state protocol, very similar to the OSPF (open shortest path first ) protocol in TCP/IP (Transmission Control Protocol/Internet Protocol, transmission control protocol/internet protocol) networks, which uses a shortest path first algorithm for route calculation. ISIS protocols are 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. Typically, a routing domain of an IS-IS may contain multiple Level-1 regions, but only one Level-2 region (consisting of all L2 routers and L1/2 routers). The different Level-1 areas are not connected, and the routing information in the Level-1 area is notified to the Level-2 area through a Level-1-2 router, which phenomenon is called L1 intoL 2 route penetration in the ISIS protocol.
Under a certain networking, a large amount of routes are introduced into an ISIS or in the process of carrying out route permeation on an ISIS protocol from L1 to L2, when the LSP (Link-State Packet, LSP) fragments (00-ff, at most 256) generated by a local system address system-id are insufficient to bear route prefix information, LSDB among devices is not synchronous due to the insufficient fragments, and the number of routes is inconsistent, so that the route forwarding is abnormal. In the networking test of technicians or the use scene of clients, the problem of incomplete route information learning on a certain device under a large number of routes can be solved.
Aiming at the problems that route penetration of a boundary router in the related technology depends on a slicing carrier, route learning is incomplete and route forwarding abnormality is easy to cause under the condition of insufficient slicing carrier, no effective solution is proposed at present.
Disclosure of Invention
The main purpose of the present application is to provide a method and a system for processing route data, so as to solve the problem that in the related art, route penetration of a border router needs to depend on a slicing carrier, and under the condition of insufficient slicing carrier, route learning is incomplete, and route forwarding abnormality is easy to be caused.
To achieve the above object, according to one aspect of the present application, there is provided a method for processing routing data, including: obtaining routing information 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 with a neighbor relation with the boundary router, and the second routing area comprises at least one second router with 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 boundary router and the second router; transmitting 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.
Optionally, obtaining routing information that needs to be transferred from the first routing area to the second routing area includes: determining a routing information identity that 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: transmitting 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 only having a neighbor relation 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 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 for the user; the first router extracts the identifier of the second router according to the handshake message, and adds the identifier to a preset field of the information description of the neighbor relation of the first router to generate the routing relation information.
Optionally, issuing the routing relation 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 performs routing operation according to the routing relation information and the routing information.
Optionally, the first routing area is transmitted to the second routing area in a routing area 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: the system comprises an acquisition module, a first routing area and a second routing area, wherein the acquisition module is used for acquiring routing information which needs to be transmitted from the first routing area to the second routing area through a boundary router, 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; the storage module is used for marking the routing information and then 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; the sending module is used for sending the neighbor information of the boundary router and the second router to the first router; the receiving module is used for receiving the route information generated by the first router according to the neighbor information, wherein the route relation information is used for representing the relation 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 performs the method of processing routing data as set forth in any one of the above.
According to another aspect of the present application, there is also provided an electronic device including one or more processors and a memory for 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 for processing routing data according to any one of the above.
According to the method and the device, the route information which needs to be transmitted from the first route area to the second route area is acquired through the boundary router; after marking the route information, storing the route information in a second route database of a local second route area; transmitting neighbor information of the boundary router and the second router to the first router; receiving routing relation information generated by a first router according to neighbor information; and publishing the routing relation information routing information to the second router. The route permeated by the first router to the second router is determined and copied and sent to the first router, the neighbor relation between the boundary router and the second router is perceived, the route relation between the first router and the second router is iterated out, and further route learning of the first router and the second router is guaranteed, and the route learning is not limited to the loading capacity of the fragmented carrier of the boundary router. The method and the device have the advantages that the fragmenting carrier is not used for route learning of the first router and the second router, the efficiency and the accuracy of route learning are improved, and the problems of incomplete route learning and abnormal forwarding caused by more route data are avoided. The method solves the problems that route penetration of the boundary router in the related technology is required to depend on the slicing carrier, and route learning is incomplete and route forwarding abnormality is easy to cause under the condition of insufficient slicing carrier.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application, illustrate and explain the application and are not to be construed as limiting the application. In the drawings:
fig. 1 is a flowchart of a method for processing routing data according to an embodiment of the present application;
FIG. 2 is a schematic diagram of a route miss problem scenario provided according to an embodiment of the present application;
FIG. 3 is a flow chart of a routing data processing method provided according to an embodiment of the present application;
FIG. 4 is a flow chart of iterative neighbor relationships for an L1 role router provided in accordance with embodiments of the present application;
FIG. 5 is a schematic diagram of a routing data processing apparatus provided 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 according to an embodiment of the present application.
Detailed Description
It should be noted that, in the case of no conflict, the embodiments and features in the embodiments may be combined with each other. The present application will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
In order to make the present application solution better understood by those skilled in the art, the following description will be made in detail and with reference to the accompanying drawings in the embodiments of the present application, it is apparent that the described embodiments are only some embodiments of the present application, not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art based on the embodiments herein without making any inventive effort, shall fall within the scope of the present application.
It should be noted that the terms "first," "second," and the like in the description and claims of the present application and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate in order to describe the embodiments of the present application described herein. 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, related information (including, but not limited to, user equipment information, user personal information, etc.) and data (including, but not limited to, data for presentation, analyzed data, etc.) related to the present disclosure are information and data authorized by a user or sufficiently authorized by each party. For example, an interface is provided between the system and the relevant user or institution, before acquiring the relevant information, the system needs to send an acquisition request to the user or institution through the interface, and acquire the relevant information after receiving the consent information fed back by the user or institution.
Examples
The present invention will be described with reference to preferred implementation steps, and fig. 1 is a flowchart of a method for processing routing data according to an embodiment of the present application, as shown in fig. 1, where the method includes the following steps:
step S101, obtaining route information required to be transmitted from a first route area to a second route area through a boundary router, wherein the first route area comprises at least one first router with a neighbor relation with the boundary router, and the second route area comprises at least one second router with a neighbor relation with the boundary router;
step S102, after marking the route information, storing the route information in a second route database of a local second route area, wherein the second route database is used for routing between a boundary router and a second router;
step S103, neighbor information of the boundary router and the second router is sent to the first router;
step S104, receiving route relation information generated by the first router according to the neighbor information, wherein the route relation information is used for representing the relation between the first router and the second router;
step S105, the routing information of the routing relation information is issued to the second router.
Through the steps, the route information which needs to be transmitted from the first route area to the second route area is acquired through the boundary router; after marking the route information, storing the route information in a second route database of a local second route area; transmitting neighbor information of the boundary router and the second router to the first router; receiving routing relation information generated by a first router according to neighbor information; and issuing the routing relation information and the routing information to a second router. The relation between the first router and the second router is iterated out by determining and copying the router permeated by the first router to the second router and sending the router to the first router and perceiving the neighbor relation between the boundary router and the second router, so that the route learning of the first router and the second router is ensured, and the capacity of the fragmented carriers of the boundary router is not limited any more. The method and the device have the advantages that the fragmenting carrier is not used for route learning of the first router and the second router, the efficiency and the accuracy of route learning are improved, and the problems of incomplete route learning and abnormal forwarding caused by more route data are avoided. The method solves the problems that route penetration of the boundary router in the related technology is required to depend on the slicing carrier, and route learning is incomplete and route forwarding abnormality is easy to cause under the condition of insufficient slicing carrier.
The main body of execution of the steps may be the border router, or a third party device for managing and controlling the border router, where the third party device has the capability of data processing and data operation, and may be a server, a processor, a calculator, etc. The border router may be understood as two adjacent routing areas, and routers on adjacent borders of the first routing area L1 and the second routing area L2, where the border router may have a neighbor relation with a 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 perform routing transmission. But the routing data from the first routing area to the second routing area needs to be infiltrated by the border router. When the border router performs route penetration from the first router to the second router, the link state packet fragmentation of the border router is needed, but when the amount of the penetrated route data is large, the link state packet fragmentation with fixed data load may generate the problem that two pieces of route data needing penetration cannot be carried, thereby causing incomplete route learning, inconsistent synchronous data of a route database and abnormal route forwarding.
The above-mentioned routing information transferred from the first routing area to the second routing area, that is, the routing information required 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 link state packets according to the routing information to be permeated, so that the link state packets are convenient to store and forward.
The link state packet may be a link state packet that is learned from the first router and carries the routing information of the first router, and in the default case, the part of the link state packet needs to be permeated into the database of the second routing area of the border router because of the existence of the second router of the neighbor relation of the second routing area, so that the part of the routing information can be published into the routing information of the second routing area. Therefore, the embodiment marks and copies the routing information and stores the routing information in the second routing database of the second routing area local to the border router.
The above-mentioned neighbor information of the border router and the second router is sent to the first router, and may be sent in a message form, for example, an IIH message. According to the neighbor information, the first router adds a new set of intermediate system neighbor relations in a link state packet LSP describing the neighbor relation of the first router, and the relation between the first router and a second router corresponding to the boundary router and having the first neighbor relation is indicated.
Optionally, sending the neighbor information of the border router and the second router to the first router includes: transmitting a message containing neighbor information to a first router; the first router is used for adding neighbor information into the routing information according to the message to generate routing relation information.
The first router sends the link state packet LSP containing neighbor information to the boundary router L1/2, and the link state packet LSP is stored in a first routing database L1LSDB of a first routing area local to the boundary router L1/2 and is also copied into a second routing database L2LSDB of a second routing area. Namely, the routing relationship information is a link state packet LSP including neighbor information sent by the first router.
The routing relationship information and the routing information are published to the second router, so that the routing prefix and the iterative relationship information of the first router exist in the second router, then the routing calculation is performed through the existing SPF algorithm, and the routing infiltration and other routing calculation are performed between the first router and the second router.
Optionally, obtaining routing information that needs to be transferred from the first routing area to the second routing area includes: determining a routing information identity that 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 identification, wherein the routing information is acquired from a first router in the first routing area.
The border router needs to be routed with routers of the first routing area and the second routing area, so that two databases, namely the first routing database and the second routing database, are arranged on the border router. The first routing database stores information related to routing with a first routing device of the first routing area.
The route information identifier may be an identifier of route information, such as a number. After determining that the route information identifier needs to be transmitted from the first route area to the second route area, obtaining corresponding route information from a first local route database of the first route area according to the route information identifier. The routing information here may also be understood as a link state packet LSP carrying the first router routing prefix information stored in the first routing database L1 LSDB.
Optionally, after sending the message containing the neighbor information to the first router, the method further includes: determining whether neighbor information only having a neighbor relation with the second router exists in the neighbor information; and sending the message containing the neighbor information to the first router under the condition that the neighbor information only has the neighbor relation with the second router exists in the neighbor information.
As shown in fig. 4, after receiving the neighbor information, the first router first determines whether there is neighbor information that characterizes only the second router in the second routing area. If so, the border router L1/2 forwards the neighbor information for transmission to the first router. The first router receives the cache and extracts neighbor information in the message. The neighbor information is then added to the link state packet LSP describing the neighbor relationship of the first router to indicate the relationship between the first router and a corresponding second router having the first neighbor relationship to the border router.
Optionally, the message is a handshake message for establishing and maintaining a neighbor relation for the user; 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 route relation information.
The identification of the second router, i.e., the system id, may be used to characterize a second router having a neighbor relation in a second routing area. In other words, two second routers with neighbor relationships can be determined from the system ids described above. The identification system id is added to a preset field of an information description of the neighbor relation of the first router, and the routing relation information is generated.
Optionally, the issuing the routing relation 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 performs routing operation according to the routing relation information and the routing information.
In the process of releasing the routing relation information and the routing information, the boundary router can synchronize with a local database of the second router through a local second routing database, so that the routing relation information and the routing information are synchronized into the second router. For subsequent routing operations.
Optionally, the first routing area is transmitted to the second routing area in the same routing protocol, and the routing protocol is the 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 other than that illustrated herein.
It should be noted that this application also provides an alternative embodiment, and the following detailed description of this embodiment is provided.
The present embodiment provides a method and apparatus for avoiding route deletion based on ISIS protocol (link state routing protocol Intermediate System to Intermediate System). In a specific networking scenario (specific neighbor relation is established between ISIS), a large number of ISIS routes (> 3 w) exist, and fig. 2 is a schematic diagram of a route missing problem scenario provided according to an embodiment of the present application, as shown in fig. 2, because an ISIS first route database L1LSDB (link state database Link State Date Base) performs default route penetration between second route databases L2LSDB, the LSDBs are not synchronized, and thus a route missing situation is caused. This embodiment belongs to ISIS routing technology of IGP routing protocol (interior gateway protocol) types in the several-way field. The ISIS protocol has two directions of penetration, one is performed by default, that is, the direction from the first routing area L1 to the second routing area L2; the other is to be configured by a command, and penetration in the direction from the second routing area L2 to the first routing area L1 is performed by default in the direction from the first routing area L1 to the second routing area L2.
Fig. 3 is a flowchart of a routing data processing method according to an embodiment of the present application, as shown in fig. 3, a technical solution is specifically as follows:
1. determining LSP needing default penetration from a first routing area L1 to a second routing area L2;
2. copying and marking LSP to be permeated, and putting the LSP to a local second routing database L2 LSDB;
3. the neighbor information of the local second routing region L2 is notified to the neighbor first router of the first routing region L1, the neighbor first router L1 is notified of the neighbor relation of the local second routing region L2, the neighbor first router iterates out a new LSP (comprising the L2 neighbor relation), the relation between the new LSP and the L2 neighbor router of the boundary router L1/2 is indicated, and the new LSP is sent back to the L1/2 boundary router;
4. synchronization of the routing database LSDB is performed with a device that establishes an L2-level-only peer neighbor relation, which performs routing calculations based on LSDB information. Detailed description as shown in fig. 4, fig. 4 is a flowchart of a first 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, and the embodiment further provides a routing data processing apparatus, including: the system comprises a determining module, a copying module, an updating module and a transmitting/receiving module.
And a determination module: determining on the border router (L1/2 level) the LSP-ids in the second routing database L2LSDB that need to be infiltrated from the first routing area L1 to the second routing area;
an ISIS LSP to be infiltrated in the first routing database L1-LSDB is determined. Here, the LSP to be infiltrated, that is, the LSP carrying the L1 routing information learned by the L1/2 border routing device from the neighboring first router, the part of L1 LSP is infiltrated into the L2-LSDB database by default because of the existence of the second router of the L2 neighbor relation, so that the part of routing information can be published into the ISIS whole network routing information.
And (3) a replication module: copying LSP to be permeated and storing in the 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 released into the second routing area. Here, the routing device may retrieve the LSPs to be infiltrated from the local database based on the specific identification.
And an updating module: the L2 neighbor relation established with the local is sent to the L1 neighbor;
the L1 neighbor first router adds a group of new intermediate system neighbor TLV values to LSP describing neighbor relation according to the received L2 IIH message sent by the L1/2 boundary router, and 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 first routing database L1LSDB of the L1/2 boundary router and is copied to the second routing database L2 LSDB.
A transmission/reception module: for sending the replicated LSPs to neighbor nodes of the routing device;
synchronization between LSDB link-state databases is done in a conventional manner by the snppdu in ISIS. The L2 link state database of the L1/2 router device receives a replicated LSP that includes information carrying L1 routing prefix information and identifying iterative neighbor relationships between L1 routers and L2 routers. Furthermore, the L2 router has the routing prefix and the iteration relation information of L1, i.e. ISIS routing calculation can be performed according to the SPF algorithm (Shortest Path First algorithm-shortest path first algorithm).
The embodiment of the application also provides a processing device for routing data, and it should be noted that the processing device for routing data in the embodiment of the application can be used for executing the processing method for routing data provided in the embodiment of the application. The following describes a processing device for routing data provided in 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, as shown in fig. 6, where the device includes: the device is described in detail below as the acquisition module 60, the storage module 62, the transmission module 64, the reception module 66, and the distribution module 68.
An obtaining module 60, configured to obtain, by using 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 relation with the border router, and the second routing area includes at least one second router having a neighbor relation with the border router; the storage module 62 is connected to the obtaining module 60, and is configured to mark the routing information and 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 between the border router and the second router; a transmitting module 64, connected to the storage module 62, for transmitting the neighbor information of the border router and the second router to the first router; a receiving module 66, connected to the sending module 64, for receiving 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 a publishing module 68, coupled to the receiving module 66, for publishing the routing information to the second router.
The processing device of the routing data obtains the routing information which needs to be transmitted from the first routing area to the second routing area through the boundary router; after marking the route information, storing the route information in a second route database of a local second route area; transmitting neighbor information of the boundary router and the second router to the first router; receiving routing relation information generated by a first router according to neighbor information; and issuing the routing relation information and the routing information to a second router. The relation between the first router and the second router is iterated out by determining and copying the router permeated by the first router to the second router and sending the router to the first router and perceiving the neighbor relation between the boundary router and the second router, so that the route learning of the first router and the second router is ensured, and the capacity of the fragmented carriers of the boundary router is not limited any more. The method and the device have the advantages that the fragmenting carrier is not used for route learning of the first router and the second router, the efficiency and the accuracy of route learning are improved, and the problems of incomplete route learning and abnormal forwarding caused by more route data are avoided. The method solves the problems that route penetration of the boundary router in the related technology is required to depend on the slicing carrier, and route learning is incomplete and route forwarding abnormality is easy to cause under the condition of insufficient slicing carrier.
The processing device of the routing data comprises a processor and a memory, wherein the acquisition module 60, the storage 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 includes a kernel, and the kernel fetches the corresponding program unit from the memory. The core can be provided with one or more cores, and the problem that route permeation of the boundary router in the related technology is required to depend on the slicing carrier, and route learning is incomplete and route forwarding abnormality is easy to cause under the condition of insufficient slicing carrier is solved by adjusting core parameters.
The memory may include volatile memory, random Access Memory (RAM), and/or nonvolatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM), among other forms in computer readable media, the memory including at least one memory chip.
The embodiment of the invention provides a computer readable storage medium, on which a program is stored, which when executed by a processor, implements a method of processing routing data.
The embodiment of the invention provides a processor, which is used for running a program, wherein the program runs to execute a processing method of routing data.
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, where the device includes a processor, a memory, and a program stored on the memory and executable on the processor, and the processor implements steps of any one of the methods described above when executing the program.
The device in the present application may be a server, PC, PAD, mobile phone, etc.
The present application also provides a computer program product adapted to perform a program initialized with any of the above-mentioned method steps when executed on a processing device for routing data.
It will be appreciated by those skilled in the art that 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 flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations 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 one typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include volatile memory in a computer-readable medium, random Access Memory (RAM) and/or nonvolatile memory, etc., such as Read Only Memory (ROM) or flash RAM. 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 storage media for a computer 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 disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. Computer-readable media, as defined herein, does not include transitory computer-readable media (transmission media), such as modulated data signals and carrier waves.
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 one … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises an element.
It will be appreciated by those skilled in the art that 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 foregoing is merely exemplary of the present application and is not intended to limit the present application. Various modifications and changes may be made to the present application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc. which are within the spirit and principles of the present application are intended to be included within the scope of the claims of the present application.
Claims (10)
1. A method for processing routing data, comprising:
obtaining routing information 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 with a neighbor relation with the boundary router, and the second routing area comprises at least one second router with 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 boundary router and the second router;
transmitting 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 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 a first routing area to a second routing area comprises:
determining a routing information identity that 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 transmitting the neighbor information of the border router and the second router to the first router comprises:
transmitting 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 routing relationship information.
4. A method according to claim 3, wherein after sending a message containing the neighbor information to the first router, the method further comprises:
determining whether neighbor information only having a neighbor relation 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 neighbor relation with the second router exists in the neighbor information.
5. A method according to claim 3, wherein the message is a handshake message for establishing and maintaining a neighbor relation for the user;
the first router extracts the identifier of the second router according to the handshake message, and adds the identifier to a preset field of the information description of the neighbor relation of the first router to generate the routing relation information.
6. The method of claim 3, wherein publishing the routing relationship information and the routing information into 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 performs 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 is transferred to the second routing area in a same routing protocol, and wherein the routing protocol is a link state routing protocol.
8. A processing apparatus for routing data, comprising:
the system comprises an acquisition module, a first routing area and a second routing area, wherein the acquisition module is used for acquiring routing information which needs to be transmitted from the first routing area to the second routing area through a boundary router, 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;
the storage module is used for marking the routing information and then 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;
the sending module is used for sending the neighbor information of the boundary router and the second router to the first router;
the receiving module is used for receiving the route relation information generated by the first router according to the neighbor information, wherein the route relation information is used for representing the relation 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 storing a program, wherein the program performs the method of processing routing data according to any one of claims 1 to 7.
10. An electronic device comprising one or more processors and a memory for 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 CN115499361A (en) | 2022-12-20 |
| CN115499361B true 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 (4)
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105323163A (en) * | 2014-07-01 | 2016-02-10 | 中兴通讯股份有限公司 | Routing calculation method and device based on ISIS |
-
2022
- 2022-07-29 CN CN202210908710.9A patent/CN115499361B/en active Active
Patent Citations (4)
| 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 |
| 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 .2001,全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115499361A (en) | 2022-12-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7978631B1 (en) | Method and apparatus for encoding and mapping of virtual addresses for clusters | |
| US20190124018A1 (en) | Cloud resource processing method and physical node | |
| CN105721311B (en) | Method and system for updating link state information | |
| US6968393B1 (en) | Method and apparatus for an attribute oriented routing update | |
| US8817798B2 (en) | Constraining topology size and recursively calculating routes in large networks | |
| US10484271B2 (en) | Data universal forwarding plane for information exchange | |
| US7991864B2 (en) | Network element discovery using a network routing protocol | |
| US9959156B2 (en) | Interest return control message | |
| US20160234188A1 (en) | Method for determining path computation element and communications device | |
| CN111934996B (en) | Message transmission method and device | |
| US20170359260A1 (en) | Content object return messages in a content centric network | |
| US20210368006A1 (en) | Request response method, device, and system applied to bit torrent system | |
| US20160164952A1 (en) | Systems and Methods For Information Centric Networking | |
| EP3166263B1 (en) | Routing calculation method and device for trill isis | |
| EP3422643A1 (en) | Method and apparatus for sending message | |
| US20170180307A1 (en) | Global Contact-Point Registry for Peer Network Devices | |
| WO2021103821A1 (en) | Method and apparatus for processing forwarding entry | |
| CN115499361B (en) | Processing method and device of route data, storage medium and processor | |
| CN109831378B (en) | Message timeout response method and device | |
| CN105978699A (en) | Trace feature across the network (depth & breadth)-wise | |
| JP4365869B2 (en) | ROUTE INFORMATION CHANGE METHOD, ROUTE INFORMATION CHANGE DEVICE, AND ROUTE INFORMATION CHANGE PROGRAM | |
| US9876736B2 (en) | Dual stack root based mLDP tree merge | |
| CN109921989B (en) | BGP logical topology generation method and equipment | |
| WO2019242459A1 (en) | Node switching method, network node, network system, and storage medium | |
| US20200296032A1 (en) | Multi-layer lsp control method and apparatus |
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 |