CN115242703A - Routing communication method and system suitable for private network - Google Patents
Routing communication method and system suitable for private network Download PDFInfo
- Publication number
- CN115242703A CN115242703A CN202210663366.1A CN202210663366A CN115242703A CN 115242703 A CN115242703 A CN 115242703A CN 202210663366 A CN202210663366 A CN 202210663366A CN 115242703 A CN115242703 A CN 115242703A
- Authority
- CN
- China
- Prior art keywords
- node
- local
- message
- neighbor
- lsdb
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 57
- 238000004891 communication Methods 0.000 title claims abstract description 27
- 230000001360 synchronised effect Effects 0.000 claims abstract description 26
- 230000002457 bidirectional effect Effects 0.000 claims abstract description 25
- 230000008569 process Effects 0.000 claims abstract description 22
- 230000001960 triggered effect Effects 0.000 claims description 10
- 238000004590 computer program Methods 0.000 claims description 7
- 238000012423 maintenance Methods 0.000 claims description 5
- 230000008859 change Effects 0.000 claims description 3
- 238000004806 packaging method and process Methods 0.000 claims description 3
- 230000004083 survival effect Effects 0.000 claims description 3
- 230000001934 delay Effects 0.000 claims description 2
- 230000003993 interaction Effects 0.000 description 5
- 230000005540 biological transmission Effects 0.000 description 4
- 238000001514 detection method Methods 0.000 description 4
- 230000003111 delayed effect Effects 0.000 description 3
- 230000006978 adaptation Effects 0.000 description 2
- 238000012790 confirmation Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000004927 fusion Effects 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 230000000737 periodic effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000013478 data encryption standard Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000000638 solvent extraction Methods 0.000 description 1
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
- H04L45/026—Details of "hello" or keep-alive messages
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/54—Organization of routing tables
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a route communication method and system suitable for a private network, which comprises the following steps: the neighbor node establishes a bidirectional neighbor relation according to the HELLO message sent by the local node; completing DR election according to the priority or the node main address; if the link bandwidth is sufficient, the DR periodically sends LSADES to display a local LSDB abstract, otherwise, only periodically sends HELLO packets; when entering the synchronous LSDB process condition, sending to the neighbor node LSUPD or LSADES; the local node judges whether to be installed in a local LSDB or not according to the new or old received LSUPD message; the local node compares the received LSADES message with the local LSDB, and if the LSADES does not have the LSA abstract, the LSA abstract information is packaged into LSUPD to be sent; if the local LSDB does not have the LSA abstract, the LSADES message of the node is sent to the neighbor node; calculating a local node routing table; obtaining a redistribution routing table; and combining the local node routing table and the redistribution routing table to generate a local routing table.
Description
Technical Field
The present invention relates to the field of routing communication technologies, and in particular, to a routing communication method and system applicable to a private network.
Background
OSPF (Open short Path First) is an Interior Gateway Protocol (IGP) used for deciding a route in a single Autonomous System (AS), and calculates a Shortest Path tree by using a Shortest Path First algorithm SPF to construct a local routing table.
The OSPF protocol is a link-state protocol. Each router is responsible for discovering and maintaining the relationship with the neighbor, describes the known Link State list LSU (Link State Update) message, and learns the network topology structure in the whole autonomous system through the periodic interaction of reliable flooding and other routers. Every certain time or when the link state changes, the router regenerates the link state advertisement LSA, and advertises the new LSA through a reliable flooding mechanism so as to realize the real-time update of the route. Other routing protocols can be redistributed through the border routers of the autonomous systems, and routing information of other autonomous systems is imported, so that the routing information of the whole internet is obtained.
OSPF is divided into 5 messages: hello message, DD message, LSR message, LSU message and LSAck message.
Hello message: periodically sending for discovering and maintaining OSPF neighbor relation;
DD Packet (DataBase Description Packet): the database description message is used for describing abstract information of the local LSDB and is used for the two routers to carry out database synchronization;
LSR Packet (Link State Request Packet): a link state request message requesting the opposite side for the required LSA;
LSU message (Link State Update Packet): a link state updating message, which is used for sending the needed LSA to the opposite side or flooding the LSA updated by the opposite side;
LSAck message (Link State acknowledgement Packet): and the link state confirmation message is used for confirming the received LSA.
The OSPF protocol suffers from the following drawbacks:
1. the protocol occupies a large bandwidth, and for some special networks with limited bandwidth, the routing protocol with large size and complexity is difficult to operate.
2. The configuration is relatively complex. Due to the complexity of network area partitioning and network attributes, a high level of network knowledge is required to configure and manage OSPF networks.
Disclosure of Invention
In order to solve the problems of the defects and shortcomings of the prior art, the invention provides a routing communication method, a system and a storage medium suitable for a private network, which can effectively reduce the consumption of a routing protocol on link bandwidth resources and adapt to a network environment with wireless hybrid and wide-narrow band fusion.
In order to achieve the purpose of the invention, the technical scheme is as follows:
a routing communication method suitable for private network, said method comprising the steps of:
s1: the local node periodically sends a HELLO message, the neighbor node judges whether to establish a bidirectional neighbor relation according to the received HELLO message, and dynamic maintenance is carried out after the establishment of the bidirectional neighbor relation is determined;
s2: completing DR election according to the priority or the node main address;
s3: if the link bandwidth is sufficient, the DR periodically sends LSADS to display the local LSDB abstract, otherwise, the DR does not send the LSADS to display, and only periodically sends HELLO packets;
s4: when triggering the condition of entering the synchronous LSDB process, after entering the synchronous LSDB process, sending a link state update message LSUPD or a link state database abstract message LSADES to a neighbor node;
s5: the local node receives the LSAUPD message and judges whether the LSAUPD message is installed in a local LSDB according to the new state and the old state of the LSAUPD message;
s6: the local node receives the LSASDES message, compares the LSASDES carrying LSA abstract with the LSA abstract in the local LSDB, and if the LSA abstract which does not exist in the local LSDB exists, encapsulates the corresponding LSA abstract information into a link state update message LSUPD and sends the link state update message LSUPD; if the LSADs which does not exist in the local LSDB exists in the LSADES, the LSADES message of the node is sent to the neighbor;
s7: calculating a local node routing table by adopting a Shortest Path First (SPF) algorithm;
s8: comparing the node where the LSA of the redistribution route is located with the target address of the routing table of the local node to obtain the corresponding next hop and path cost, thereby generating the redistribution routing table;
s9: and combining the local node routing table and the redistribution routing table to generate a local routing table.
Preferably, the local node periodically sends a HELLO message for announcing the survival state of the local node; the HELLO message carries a neighbor list of the local node, a neighbor failure time interval and an LSDB identification field for determining characteristics of the local link state database.
Further, the local node judges the channel state through a neighbor list carried in the received HELLO message, if the neighbor list contains local node information, the local node is a bidirectional channel, otherwise, the local node is a unidirectional channel.
And further, when the neighbor node continuously receives the HELLO message for N1 times in the neighbor failure time interval and the neighbor list carried in the HELLO message contains the local node information, the neighbor node establishes a bidirectional neighbor relation with the local node.
Still further, when the neighbor node does not receive the HELLO packet or is not a bidirectional channel at least once within the neighbor failure time interval, deleting the link state information related to the neighbor node.
Preferably, the local node dynamically adjusts the period of sending the HELLO message, and periodically sends the HELLO message at a time interval T1 when a new neighbor is found;
when the establishment of the bidirectional neighbor relation is completed, periodically sending a HELLO message at a time interval T2; wherein, T1 is smaller than T2, T2 can be a fixed value, and can also be adjusted according to link type or bandwidth;
and if the local node finds a new neighbor node, immediately sending a HELLO message.
Preferably, DR election is done according to priority or node home address.
Further, the node with the higher priority value is DR;
when the priority is the same, the node with the larger node main address is DR.
Preferably, the condition for entering the synchronized LSDB procedure is as follows:
condition 1: adding or deleting neighbor nodes;
condition 2: link on-off state or resource change;
condition 3: receiving a link state update message LSAUPD;
condition 4: the local LSDB identification is different from the LSDB identification carried by the HELLO sent by the neighbor node;
condition 5: receiving a link state database abstract message LSADES, wherein the LSA abstract in the LSADES is not completely the same as the LSA abstract of a local LSDB;
when any one of the above conditions is satisfied, the synchronous LSDB process is entered.
Further, when any one of condition 1, condition 2 and condition 3 is triggered, the local node updates the local LSDB and delays T d After time, the changed LSA items are packaged into a link state update message LSAUPD and sent to other neighbor nodes;
when the condition 4 is triggered, packaging the summary information of all LSA entries in the local LSDB of the local node into a link state database summary message LSADES, and sending the link state database summary message LSADES to the neighbor node; if the LSDB identification of the local node is the same as the LSDB identification carried by the HELLO sent by the neighbor node, the synchronous LSDB process with the neighbor node is finished;
when the condition 5 is triggered, the local node compares the received LSADEs carrying the LSA abstract with the LSA abstract in the local LSDB, and if the LSA abstract which does not exist in the LSADBs exists in the local LSDB, the corresponding LSA abstract information is packaged into a link state update message LSUPD to be sent; and if the LSADs which does not exist in the local LSDB exists in the LSADES, transmitting the LSADES message of the node to the neighbor.
A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of a method for routing communications adapted for a private network when executing the computer program.
The invention has the following beneficial effects:
the invention provides a routing communication method suitable for a private network, which has the characteristic of light weight and reduces the bandwidth overhead of the operation of a routing protocol by simplifying protocol interaction flow, incremental updating, delayed transmission, synchronous detection, HELLO interval self-adaption and other modes.
Drawings
Fig. 1 is a flow chart of the steps of a method of routing communications according to the present invention.
Fig. 2 is an interaction diagram of the routing communication method according to the present invention.
Fig. 3 is a PNRP protocol packet format of the routing communication method according to the present invention.
Fig. 4 shows the PNRP header format of the routing communication method according to the present invention.
Fig. 5 shows the contents of a HELLO packet according to the present invention.
Fig. 6 shows the LSADES message content according to the present invention.
Fig. 7 shows lsupd message contents according to the present invention.
Detailed Description
The invention is described in detail below with reference to the drawings and the detailed description.
Abbreviations and key terms of the terms of art that may be involved in the examples are defined as follows:
OSPF Open Shortest Path First
SPF Shortest Path First algorithm Shortest Path First
IGP Interior Gateway Protocol Interior Gateway Protocol
AS Autonomous System Autonomous System
LSA Link State Advertisement Link State Advertisement
DR appoints Router Designated Router
BDR Backup Designated Router
The 3 messages involved in the embodiment have the following functions:
the neighbor handshake message HELLO is used for establishing and maintaining the neighbor relation between the nodes and detecting the LSDB synchronous state with the neighbor nodes;
link state database abstract message LSADES, which is used to describe the abstract information of local LSDB entry;
link state update message LSAUPD for transmitting LSDB item details;
example 1
In order to reduce the consumption of the Routing Protocol to the link bandwidth resources and adapt to the network environment with wireless hybrid and wide-narrow band fusion, the invention designs a Routing communication method (English: private network Routing Protocol, abbreviated as PNRP) suitable for a private network, and the method comprises the following steps:
s1: the local node periodically sends a HELLO message, the neighbor node judges whether to establish a bidirectional neighbor relation according to the received HELLO message, and dynamic maintenance is carried out after the establishment of the bidirectional neighbor relation is determined;
s2: completing DR election according to the priority or the node main address;
s3: if the link bandwidth is sufficient, the DR periodically sends LSADS to display the local LSDB abstract, otherwise, the DR does not send the LSADS to display, and only periodically sends HELLO packets;
s4: when triggering the condition of entering the synchronous LSDB process, after entering the synchronous LSDB process, sending a link state update message LSUPD or a link state database abstract message LSADES to a neighbor node;
s5: the local node receives the LSAUPD message and judges whether the LSAUPD message is installed in a local LSDB according to the new state and the old state of the LSAUPD message;
s6: the local node receives the LSADES message, compares the LSADE carrying LSA abstract with the LSA abstract in the local LSDB, if the LSA abstract without LSADE exists in the local LSDB, encapsulates the corresponding LSA abstract information into a link state update message LSUPD and sends the link state update message LSUPD; if the LSADs which does not exist in the local LSDB exists in the LSADES, the LSADES message of the node is sent to the neighbor;
s7: calculating a local node routing table by adopting a shortest path first algorithm (SPF);
s8: comparing the node where the LSA of the redistribution route is located with the target address of the routing table of the local node to obtain the corresponding next hop and path cost, thereby generating the redistribution routing table;
s9: and combining the local node routing table and the redistribution routing table to generate a local routing table.
In a specific embodiment, in step S1, a local node periodically sends a HELLO packet to notify its own survival status; the HELLO message carries a neighbor list of the local node, a neighbor failure time interval and an LSDB identification field for determining characteristics of the local link state database. The neighbor handshake message HELLO is used for establishing and maintaining neighbor relations between nodes and detecting the LSDB synchronization state with the neighbor nodes.
In a specific embodiment, the local node performs channel state judgment through a neighbor list carried in the received HELLO message, and if the neighbor list contains local node information, the local node is a bidirectional channel, otherwise, the local node is a unidirectional channel.
In a specific embodiment, when a neighbor node receives HELLO messages for n times continuously in a neighbor failure time interval and a neighbor list carried in the HELLO message contains local node information, the neighbor node establishes a bidirectional neighbor relation with the local node. The local node can establish a bidirectional neighbor relation in the case that the neighbor node receives the HELLO message n =3 times. The size of n can also be set according to specific requirements.
In a specific embodiment, when the neighbor node does not receive the HELLO packet or is not a bidirectional channel at least once within the neighbor failure time interval, deleting the link state information related to the neighbor node. In this embodiment, the expiration time interval refers to 3 HELLO transmission interval times.
In a specific embodiment, the local node dynamically adjusts the period of sending the HELLO packet, and periodically sends the HELLO packet at a time interval T1 when a new neighbor is found;
when the establishment of the bidirectional neighbor relation is completed, periodically sending a HELLO message at a time interval T2; wherein, T1 is smaller than T2, T2 can be a fixed value, and can also be adjusted according to link type or bandwidth;
and if the local node finds a new neighbor node, immediately sending a HELLO message.
In this embodiment, the period T1=2s, T2=20s for sending the HELLO packet by the local node, and the failure time interval in the HELLO packet sent by the local node is 3 times the period for sending the HELLO packet.
In one particular embodiment, DR election is done based on priority or node home address.
The node with the higher priority value is DR;
when the priorities are the same, the node with the larger node main address is DR.
In a specific embodiment, if the link bandwidth is greater than 8Mbps, DR periodically sends LSADS to show the local LSDB summary, otherwise, does not send LSADS, and only periodically sends HELLO packet.
In a specific embodiment, the condition for entering the synchronized LSDB process specifically includes the following steps:
condition 1: adding or deleting neighbor nodes;
condition 2: link on-off status or resource (e.g., bandwidth) changes;
condition 3: receiving a link state update message LSAUPD;
condition 4: the local LSDB identification is different from the LSDB identification carried by the HELLO sent by the neighbor node;
condition 5: receiving a link state database abstract message LSADES, wherein the LSA abstract in the LSADES is not identical to the LSA abstract of a local LSDB;
when any one of the above conditions is satisfied, the synchronous LSDB process is entered.
In a specific embodiment, when any one of condition 1, condition 2 and condition 3 is triggered, the local node updates the local LSDB and delaysT d After the time is not less than 100ms, the changed LSA entries are packaged into a link state update message LSAUPD and are sent to other neighbor nodes;
when the condition 4 is triggered, packaging the summary information of all LSA entries in the local LSDB of the local node into a link state database summary message LSADES, and sending the link state database summary message LSADES to the neighbor node; if the LSDB identification of the local node is the same as the LSDB identification carried by the HELLO sent by the neighbor node, the synchronous LSDB process with the neighbor node is finished;
when the condition 5 is triggered, the local node compares the received LSADEs carrying the LSA abstract with the LSA abstract in the local LSDB, and if the LSA abstract which does not exist in the LSADBs exists in the local LSDB, the corresponding LSA abstract information is packaged into a link state update message LSUPD to be sent; and if the LSADs which does not exist in the local LSDB exists in the LSADES, transmitting the LSADES message of the node to the neighbor.
The synchronization process adds, deletes or updates the local LSDB when the following conditions are triggered:
condition 1: adding or deleting neighbor nodes;
condition 2: link on-off status or resource (e.g., bandwidth) changes;
condition 3: receiving a link state update message LSAUPD;
the routing communication method applicable to the private network described in this embodiment reduces the bandwidth overhead of the operation of the routing protocol by simplifying the protocol interaction flow, incremental updating, delayed sending, synchronous detection, HELLO interval adaptation, and other ways, and has the characteristic of light weight.
Simplifying protocol interaction flow: BDR election is not carried out; the link state request and the link state confirmation ensure that the link state request and the link state confirmation are kept synchronous with LSDB of other nodes in the link through synchronous detection and a DR (digital router) periodic display LSDES (Link State data encryption Standard) mechanism; the message communication address is the same multicast address, all nodes in the interactive link can receive and process the message sent by any node, so that the DR has the function of not performing point-to-point database synchronization process with all neighbors in the link one by one, but regularly displaying LSSDES to ensure LSDB synchronization, and preferentially performing LSDB synchronization process with a new neighbor when the new neighbor is online, thereby reducing the message volume in the non-point-to-point link.
And (4) incremental updating: when the network topology changes, only the changed LSA is diffused, and the unchanged LSA is not diffused;
and (3) delayed transmission: when the local node needs to send the LSAUPD, the LSAUPD is sent in a centralized way after a period of time delay;
synchronous detection: detecting the LSBD synchronization state with the neighbor node through the neighbor LSDB identification information (the characteristic value of the LSDB) in the HELLO message;
HELLO interval adaptation: and adaptively adjusting the HELLO message sending period according to the neighbor state in the link, adopting a shorter handshake time interval when a new neighbor is found, and adopting a longer HELLO message sending period when the establishment of the bidirectional neighbor relation is completed.
The following is an example of the present invention, which can select a communication mode or change a message definition according to actual application requirements.
The route communication method PNRP is a network layer protocol, and uses an ip protocol number 203 and a multicast address 224.0.0.203 to receive and transmit messages, and the TOS value is set to be 0xE0. The PNRP packet consists of 2 parts: a fixed length header and specific content defined according to different types. As shown in fig. 3.HELLO, LSADES, LSAUPD have the same header format definition and length of 12 bytes, see fig. 4. The detailed definitions of each type of protocol are shown in fig. 5, 6 and 7.
Example 2
A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor executes the computer program to implement a method for routing communications applicable to a private network, the method comprising the steps of:
s1: the local node periodically sends a HELLO message, the neighbor node judges whether to establish a bidirectional neighbor relation according to the received HELLO message, and dynamic maintenance is carried out after the establishment of the bidirectional neighbor relation is determined;
s2: finishing DR election according to the priority or the node main address;
s3: if the link bandwidth is sufficient, the DR periodically sends LSADS to display the local LSDB abstract, otherwise, the DR does not send the LSADS to display, and only periodically sends HELLO packets;
s4: when triggering the condition of entering the synchronous LSDB process, after entering the synchronous LSDB process, sending a link state update message LSUPD or a link state database abstract message LSADES to a neighbor node;
s5: the local node receives the LSAUPD message and judges whether the LSAUPD message is installed in a local LSDB according to the new state and the old state of the LSAUPD message;
s6: the local node receives the LSADES message, compares the LSADE carrying LSA abstract with the LSA abstract in the local LSDB, if the LSA abstract without LSADE exists in the local LSDB, encapsulates the corresponding LSA abstract information into a link state update message LSUPD and sends the link state update message LSUPD; if the LSADs which does not exist in the local LSDB exists in the LSADES, the LSADES message of the node is sent to the neighbor;
s7: calculating a local node routing table by adopting a shortest path first algorithm (SPF);
s8: comparing the node where the LSA of the redistribution route is located with the target address of the routing table of the local node to obtain the corresponding next hop and path cost, thereby generating the redistribution routing table;
s9: and combining the local node routing table and the redistribution routing table to generate a local routing table.
Where the memory and processor are connected by a bus, the bus may comprise any number of interconnected buses and bridges, the buses connecting together one or more of the various circuits of the processor and the memory. The bus may also connect various other circuits such as peripherals, voltage regulators, power management circuits, etc., which are well known in the art, and therefore, will not be described any further herein. A bus interface provides an interface between the bus and the transceiver. The transceiver may be one element or a plurality of elements, such as a plurality of receivers and transmitters, providing a means for communicating with various other apparatus over a transmission medium. The data processed by the processor is transmitted over a wireless medium via an antenna, which further receives the data and transmits the data to the processor.
Example 3
A computer-readable storage medium having stored thereon a computer program which, when executed by a processor, performs a method for routing communications applicable to a private network, the method comprising the steps of:
s1: the local node periodically sends a HELLO message, the neighbor node judges whether to establish a bidirectional neighbor relation according to the received HELLO message, and dynamic maintenance is carried out after the establishment of the bidirectional neighbor relation is determined;
s2: completing DR election according to the priority or the node main address;
s3: if the link bandwidth is sufficient, the DR periodically sends LSADS to display the local LSDB abstract, otherwise, the DR does not send the LSADS to display, and only periodically sends HELLO packets;
s4: when triggering the condition of entering the synchronous LSDB process, after entering the synchronous LSDB process, sending a link state update message LSUPD or a link state database abstract message LSADES to a neighbor node;
s5: the local node receives the LSAUPD message and judges whether the LSAUPD message is installed in a local LSDB according to the new state and the old state of the LSAUPD message;
s6: the local node receives the LSADES message, compares the LSADE carrying LSA abstract with the LSA abstract in the local LSDB, if the LSA abstract without LSADE exists in the local LSDB, encapsulates the corresponding LSA abstract information into a link state update message LSUPD and sends the link state update message LSUPD; if the LSADs which does not exist in the local LSDB exists in the LSADES, the LSADES message of the node is sent to the neighbor;
s7: calculating a local node routing table by adopting a shortest path first algorithm (SPF);
s8: comparing the node where the LSA of the redistribution route is located with the target address of the routing table of the local node to obtain the corresponding next hop and path cost, thereby generating the redistribution routing table;
s9: and combining the local node routing table and the redistribution routing table to generate a local routing table.
That is, as can be understood by those skilled in the art, all or part of the steps in the method for implementing the embodiments described above may be implemented by a program instructing related hardware, where the program is stored in a storage medium and includes several instructions to enable a device (which may be a single chip, a chip, or the like) or a processor (processor) to execute all or part of the steps of the method described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk, and various media capable of storing program codes.
It should be understood that the above-described embodiments of the present invention are merely examples for clearly illustrating the present invention, and are not intended to limit the embodiments of the present invention. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the claims of the present invention.
Claims (10)
1. A routing communication method suitable for private networks is characterized in that: the method comprises the following steps:
s1: the local node periodically sends a HELLO message, the neighbor node judges whether to establish a bidirectional neighbor relation according to the received HELLO message, and dynamic maintenance is carried out after the establishment of the bidirectional neighbor relation is determined;
s2: completing DR election according to the priority or the node main address;
s3: if the link bandwidth is sufficient, the DR periodically sends LSADS to display the local LSDB abstract, otherwise, the DR does not send the LSADS to display, and only periodically sends HELLO packets;
s4: when triggering the condition of entering the synchronous LSDB process, after entering the synchronous LSDB process, sending a link state update message LSUPD or a link state database abstract message LSADES to a neighbor node;
s5: the local node receives the LSAUPD message and judges whether the LSAUPD message is installed in a local LSDB according to the new state and the old state of the LSAUPD message;
s6: the local node receives the LSASDES message, compares the LSASDES carrying LSA abstract with the LSA abstract in the local LSDB, and if the LSA abstract which does not exist in the local LSDB exists, encapsulates the corresponding LSA abstract information into a link state update message LSUPD and sends the link state update message LSUPD; if the LSADs which does not exist in the local LSDB exists in the LSADES, the LSADES message of the node is sent to the neighbor node;
s7: calculating a local node routing table by adopting a shortest path first algorithm (SPF);
s8: comparing the node where the LSA of the redistribution route is located with the target address of the routing table of the local node to obtain the corresponding next hop and path cost, thereby generating the redistribution routing table;
s9: and combining the local node routing table and the redistribution routing table to generate a local routing table.
2. The routing communication method applicable to the private network according to claim 1, wherein: step S1, a local node periodically sends a HELLO message for announcing the survival state of the local node; the HELLO message carries a neighbor list of the local node, a neighbor failure time interval and an LSDB identification field representing a characteristic value of the local link state database.
3. The routing communication method applicable to the private network according to claim 2, wherein: the local node judges the channel state through a neighbor list carried in the received HELLO message, if the neighbor list contains local node information, the local node is a bidirectional channel, otherwise, the local node is a unidirectional channel.
4. The routing communication method applicable to the private network according to claim 3, wherein: when the neighbor node continuously receives the HELLO message for N1 times in the neighbor failure time interval and the neighbor list carried in the HELLO message contains the local node information, the neighbor node establishes a bidirectional neighbor relation with the local node.
5. The routing communication method applicable to the private network according to claim 4, wherein: and when the neighbor node does not receive the HELLO message or is not a bidirectional channel at least once in the neighbor failure time interval, deleting the link state information related to the neighbor node.
6. The routing communication method applicable to the private network according to claim 1, wherein: the local node dynamically adjusts the period for sending the HELLO message, and periodically sends the HELLO message at a time interval T1 when a new neighbor is found;
when the establishment of the bidirectional neighbor relation is completed, periodically sending a HELLO message at a time interval T2; wherein, T1 is smaller than T2, T2 can be a fixed value, and can also be adjusted according to link type or bandwidth;
and if the local node finds a new neighbor node, immediately sending a HELLO message.
7. The method of claim 6, wherein: and D, completing DR election according to the priority or the node main address:
the node with the higher priority value is DR;
when the priority is the same, the node with the larger node main address is DR.
8. The routing communication method applicable to the private network according to claim 7, wherein: the conditions for entering the synchronous LSDB process are as follows:
condition 1: adding or deleting neighbor nodes;
condition 2: link on-off state or resource change;
condition 3: receiving a link state update message LSAUPD;
condition 4: the local LSDB identification is different from the LSDB identification carried by the HELLO sent by the neighbor node;
condition 5: receiving a link state database abstract message LSADES, wherein the LSA abstract in the LSADES is not completely the same as the LSA abstract of a local LSDB;
when any one of the above conditions is satisfied, the synchronous LSDB process is entered.
9. The method of claim 8, wherein:
when any one of the conditions 1, 2 and 3 is triggered, the local node updates the local LSDB and delays T d After time, the changed LSA item is packaged into a link state update message LSAEPD and sent to other nodesSending by the neighbor node;
when the condition 4 is triggered, packaging the summary information of all LSA entries in the local LSDB of the local node into a link state database summary message LSADES, and sending the link state database summary message LSADES to the neighbor node; if the LSDB identification of the local node is the same as the LSDB identification carried by the HELLO sent by the neighbor node, indicating that the synchronous LSDB flow of the neighbor node is finished;
when the condition 5 is triggered, the local node compares the received LSADEs carrying the LSA abstract with the LSA abstract in the local LSDB, and if the LSA abstract which does not exist in the LSADBs exists in the local LSDB, the corresponding LSA abstract information is packaged into a link state update message LSUPD to be sent; and if the LSADs which does not exist in the local LSDB exists in the LSADES, transmitting the LSADES message of the node to the neighbor.
10. A computer device comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein: the processor, when executing the computer program, performs the steps of the method according to any of claims 1 to 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210663366.1A CN115242703A (en) | 2022-06-13 | 2022-06-13 | Routing communication method and system suitable for private network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210663366.1A CN115242703A (en) | 2022-06-13 | 2022-06-13 | Routing communication method and system suitable for private network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115242703A true CN115242703A (en) | 2022-10-25 |
Family
ID=83669326
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210663366.1A Pending CN115242703A (en) | 2022-06-13 | 2022-06-13 | Routing communication method and system suitable for private network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115242703A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101043462A (en) * | 2007-04-20 | 2007-09-26 | 华为技术有限公司 | Method for processing link condition announcement and router |
| CN101087250A (en) * | 2007-05-11 | 2007-12-12 | 华为技术有限公司 | Establishment method and device of adjacent connection relation |
| WO2011144111A2 (en) * | 2011-05-27 | 2011-11-24 | 华为技术有限公司 | Synchronization detection method for link state database, and routing device |
-
2022
- 2022-06-13 CN CN202210663366.1A patent/CN115242703A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101043462A (en) * | 2007-04-20 | 2007-09-26 | 华为技术有限公司 | Method for processing link condition announcement and router |
| CN101087250A (en) * | 2007-05-11 | 2007-12-12 | 华为技术有限公司 | Establishment method and device of adjacent connection relation |
| WO2011144111A2 (en) * | 2011-05-27 | 2011-11-24 | 华为技术有限公司 | Synchronization detection method for link state database, and routing device |
| CN102292936A (en) * | 2011-05-27 | 2011-12-21 | 华为技术有限公司 | Synchronization detection method for link state database, and routing device |
Non-Patent Citations (1)
| Title |
|---|
| 陈泽婵: "一种轻量化的链路状态路由协议", 电子技术与软件工程 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6560654B1 (en) | Apparatus and method of maintaining timely topology data within a link state routing network | |
| EP3751801B1 (en) | Border gateway protocol for communication among software defined network controllers | |
| US8797913B2 (en) | Reduction of message and computational overhead in networks | |
| US10205681B2 (en) | Method for operating controller and switch for relieving network failure from SDN, and controller and switch therefor | |
| CN102377666B (en) | Flooding-based routing protocol having average-rate and burst-rate control | |
| US8291112B2 (en) | Selective a priori reactive routing | |
| RU2643475C2 (en) | Multi-domain relaying with routing from source based on interacting network controllers | |
| EP1989836B1 (en) | Technique for optimized routing of data streams on an ip backbone in a computer network | |
| US7391730B1 (en) | System and method for synchronizing link state databases in a network environment | |
| EP1847072B1 (en) | System for scheduling scans of interior nodes of a network domain for reachability events | |
| US20080165692A1 (en) | Method and system for opportunistic data communication | |
| CN109510769B (en) | Converged routing system suitable for wide-narrow combined network and method thereof | |
| US20190273633A1 (en) | Link state packet transmission method and routing node | |
| CN100496023C (en) | Method for transmitting link-state information | |
| SE1750815A1 (en) | Methods, System and Apparatuses for Routing Data Packets in a Network Topology | |
| CN105684362B (en) | Interworking between a first protocol entity of a stream reservation protocol and a second protocol entity of a routing protocol | |
| CN115242703A (en) | Routing communication method and system suitable for private network | |
| CN110830370B (en) | IBGP (Internet protocol gateway protocol) transmission route updating method based on OSPF (open shortest Path first) protocol | |
| CN115801654A (en) | Route notification method, path establishment method and service data transmission method | |
| US11888596B2 (en) | System and method for network reliability | |
| EP3941006B1 (en) | System and method for carrying and optimizing internet traffic over a source-selected path routing network | |
| US7957377B1 (en) | Reducing and load balancing link-state requests in OSPF | |
| CN112292838B (en) | Communication method implemented by router of autonomous system using interior gateway protocol | |
| CN109005114B (en) | System and method for fusing distributed forwarding of conventional routing and delay tolerant network | |
| CN103685037B (en) | The processing method of a kind of bridge Media Access Controlled address change and primary nodal point |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20221025 |
|
| RJ01 | Rejection of invention patent application after publication |