WO2017143733A1 - 路由器及其系统、数据库的同步方法及其装置 - Google Patents

路由器及其系统、数据库的同步方法及其装置 Download PDF

Info

Publication number
WO2017143733A1
WO2017143733A1 PCT/CN2016/094387 CN2016094387W WO2017143733A1 WO 2017143733 A1 WO2017143733 A1 WO 2017143733A1 CN 2016094387 W CN2016094387 W CN 2016094387W WO 2017143733 A1 WO2017143733 A1 WO 2017143733A1
Authority
WO
WIPO (PCT)
Prior art keywords
link state
packet
queue
message
sent
Prior art date
Application number
PCT/CN2016/094387
Other languages
English (en)
French (fr)
Inventor
何建军
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2017143733A1 publication Critical patent/WO2017143733A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • 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/302—Route determination based on requested QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/6215—Individual queue per QOS, rate or priority

Definitions

  • This document relates to, but is not limited to, the field of communications, and more particularly to a method and device for database synchronization, and a router and system thereof.
  • dynamic routing protocols are mainly divided into two types: one is a distance vector routing algorithm, and the other is a link state routing algorithm.
  • link state packets generated by the link state routing algorithm there are two types of link state packets generated by the link state routing algorithm: one is a link state packet carrying a network topology structure (referred to as a topology link state packet, for each The router generates a link state packet that describes the corresponding topology. The other is the link state packet that carries the network route (referred to as the leaf link state packet. The router generates the packet based on the topology link packet. More link state messages carrying network routes are mainly network prefix routing information. The link state packet carrying the network route is associated with the link state packet of the corresponding topology. That is, only the topology route to the specific router is calculated first, and then the network prefix routing information advertised by the specific router can be calculated.
  • Figure 1 illustrates an example of transmitting a link state message without prioritization.
  • the router 1 performs a reassignment command to introduce a large number of Border Gateway Protocol (BGP) routes.
  • Border Gateway Protocol BGP
  • the router 1 needs to send all link state packets in the database to the router 2.
  • Router 1 sends the leaf link status message (which carries the imported BGP routing information) to Router 2, but at time Tn, Router 1 sends its own topology link status message (bearing the router).
  • the network topology information pointing to Router 2 is sent to Router 2.
  • Router 2 Since Router 2 does not have the topology link state message of Router 1 before the Tn time, Router 2 cannot calculate the topology route to Router 1, and thus cannot calculate the BGP routing information advertised by Router 1 (even if Router 2 may All the BGP routing information advertised by the router 1 has been received. Only when the router 2 receives the topology link state packet of the router 1 at the time Tn, the router 2 can calculate the topology route to the router 1 to calculate the router 1 advertisement. BGP routing information.
  • the above example shows that the link state routing protocol does not distinguish between the topology link state packet and the leaf link state packet during the database synchronization process, that is, the database synchronization is performed without distinction of importance.
  • the important topology link status packets cause the advertised routing information to be calculated in a timely manner, which will greatly affect the convergence speed of the route.
  • Embodiments of the present invention provide a method and device for database synchronization, and a router and a system thereof, which can calculate the route information advertised in a link state routing protocol database synchronization process in time, thereby improving the convergence speed of the route.
  • the link state packet is divided into a topology link state packet and a leaf link state packet.
  • the neighboring router When the neighboring router synchronizes the database, the topology link state packet is synchronously completed, and the leaf link state packet is synchronized.
  • the synchronization of the topology link state packet is performed, and the completion of the leaf link state packet is:
  • a summary description is performed between the neighboring routers, and the summary description including the summary of the topology link state message is sent to the neighboring router, and the summary description including only the leaf link state packet summary is sent to the neighboring router.
  • the topology link state message requested in the link state request packet is sent to the neighboring router, and the leaf link requested in the link state request packet is sent.
  • Status packets are sent to neighboring routers;
  • the new topology link state packet is sent to the neighboring router, and the new leaf link state packet is sent to the neighboring router.
  • the sending, to the neighboring router, the summary description that includes the summary of the topology link state packet, and then sending the summary description that only includes the leaf link state packet digest to the neighboring router includes:
  • the summary description queue includes a summary description priority queue and a summary description common queue;
  • the summary description is sent to the summary description in the priority queue, and the summary description is sent to describe the summary in the normal queue.
  • the topology link state message that is requested in the link state request packet is sent to the neighboring router, and the leaf link state packet that is requested in the link state request packet is sent to the neighboring node.
  • the router includes:
  • the packet sending queue includes a priority packet sending queue and a normal packet sending queue
  • the link state packet in the priority packet sending queue is sent preferentially, and the link state packet in the normal packet sending queue is sent.
  • the sending the new topology link state packet to the neighboring router, and then sending the new leaf link state packet to the neighboring router includes:
  • the packet sending queue includes a priority packet sending queue and a normal packet sending queue
  • the new topology link status packet is added to the priority packet sending queue, and the new leaf link status packet is added to the ordinary packet sending queue.
  • the link state packet in the priority packet sending queue is sent preferentially, and the link state packet in the normal packet sending queue is sent.
  • the sending the topology link status to the neighboring router according to the received summary description includes:
  • the request queue includes a priority request queue and a normal request queue
  • the link state request message requesting the topology link state message is added to the priority request queue, and when it is determined that the link state request is required
  • the neighboring router sends a link state request message requesting the leaf topology link state message
  • the neighboring router adds the link state request message of the leaf link state message to the normal request queue.
  • the link state request message in the priority request queue is sent preferentially, and the link state request message in the normal request queue is sent.
  • the embodiment of the invention further provides a synchronization device for a router database, comprising: a distinguishing unit and a synchronization unit; wherein:
  • the distinguishing unit is configured to: divide the link state packet into a topology link state packet and a leaf link state packet;
  • the synchronization unit is configured to synchronize the completion of the topology link state packet and then complete the leaf link state message synchronously when the neighboring router synchronizes the database.
  • the synchronization unit includes a digest description generation module and a link status message sending module, where:
  • the summary description generation module is configured to establish a summary description between adjacent router databases when the neighboring router synchronizes the database
  • the link state message sending module is set to
  • the summary description including the topology link state packet summary is sent to the neighboring router, and the summary description including only the leaf link state packet digest is sent to the neighboring router; the link state request report of the neighboring router is received. And sending the topology link state message requested in the link state request message to the neighboring router, and then sending the leaf link state message requested in the link state request message to the neighboring router;
  • the new topology link state packet is sent to the neighboring router, and the new leaf link state packet is sent to the neighboring router.
  • the link state message sending module is configured to send the summary description including the topology link state message summary to the neighboring router in the following manner, and then only include the leaf link status report.
  • a summary description of the abstract is sent to the neighboring router:
  • the summary description queue includes a summary description priority queue and a summary description common queue;
  • the summary description is sent to the summary description in the priority queue, and the summary description is sent to describe the summary in the normal queue.
  • the link state packet sending module is configured to: send the topology link state packet requested in the link state request packet to the neighboring router, and then link the link state.
  • the leaf link status message requested in the request packet is sent to the neighboring router, including:
  • the packet sending queue includes a priority packet sending queue and a normal packet sending queue
  • the link state packet in the priority packet sending queue is sent preferentially, and the link state packet in the normal packet sending queue is sent.
  • the link state packet sending module is configured to send the new topology link state packet to the neighboring router in the following manner, and then send the new leaf link state packet to the neighboring router.
  • Send to neighboring routers including:
  • the packet sending queue includes a priority packet sending queue and a normal packet sending queue
  • the new topology link status packet is added to the priority packet sending queue, and the new leaf link status packet is added to the ordinary packet sending queue.
  • the link state packet in the priority packet sending queue is sent preferentially, and the link state packet in the normal packet sending queue is sent.
  • the link state packet sending module is configured to: implement, by using the following manner, the link state request packet corresponding to sending the topology link state packet to the neighboring router according to the received digest description, and then
  • the link state request message corresponding to the leaf link state packet sent to the neighboring router includes:
  • the request queue includes a priority request queue and a normal request queue
  • the link state request message requesting the topology link state message is added to the priority request queue, and when it is determined that the link state request is required
  • the neighboring router sends a link state request message requesting the leaf topology link state message
  • the neighboring router adds the link state request message of the leaf link state message to the normal request queue.
  • the link state request message in the priority request queue is sent preferentially, and the link state request message in the normal request queue is sent.
  • the embodiment of the invention also proposes a router, which comprises a synchronization device as described above.
  • the embodiment of the invention further provides a router system, the router system comprising at least two routers as described above.
  • Embodiments of the present invention also provide a computer readable storage medium storing computer executable instructions for performing any of the methods described above.
  • the embodiment of the present invention provides a database synchronization method according to an embodiment of the present invention.
  • the method and the device thereof, and the router and the system thereof, the link state routing protocol distinguishes the topology link state message and the leaf link state message in the database synchronization process, that is, distinguishes the importance of the database synchronization, and the priority synchronization affects the network.
  • the topology link state message with high importance of the topology is synchronized with other link state packets (leaf link state packets) of relatively low importance, in the case that the topology link state packets are synchronized. Thereby speeding up the convergence of the route can be accelerated.
  • FIG. 1 is a schematic diagram of an example of prioritization of a prioritized database in the related art
  • FIG. 2 is a flowchart of a method for synchronizing a router database according to an embodiment of the present invention
  • FIG. 3 is a flowchart of adding a summary description queue in a router database synchronization method according to an embodiment of the present invention
  • FIG. 4 is a flowchart of sending a summary description queue in a router database synchronization method according to an embodiment of the present invention
  • FIG. 5 is a flowchart of receiving a summary description in a router database synchronization method according to an embodiment of the present invention
  • FIG. 6 is a flowchart of sending a request queue in a router database synchronization method according to an embodiment of the present invention
  • FIG. 7 is a flowchart of receiving a request message in a router database synchronization method according to an embodiment of the present invention.
  • FIG. 8 is a flowchart of adding a message sending queue in a router database synchronization method according to an embodiment of the present invention.
  • FIG. 9 is a flowchart of sending a message sending queue in a router database synchronization method according to an embodiment of the present invention.
  • FIG. 10 is a schematic structural diagram of a router database synchronization apparatus according to an embodiment of the present invention.
  • an embodiment of the present invention provides a method for synchronizing a router database, which is applied to database synchronization of a link state routing algorithm protocol, including:
  • the link state packet generated by the link state routing algorithm is divided into a topology link state packet and a leaf link state packet.
  • link state packets generated by the link state routing algorithm There are two types of link state packets generated by the link state routing algorithm: one is a link state packet carrying a network topology (referred to as a topology link state packet), and each router generates a description corresponding to the topology.
  • the link state packet carries the link status packet of the network route (referred to as the leaf link status packet for short). Compared with the topology link packet, the router generates more links carrying the network route. Status message, mainly network prefix routing information).
  • the link state packet carrying the network route is associated with the link state packet of the corresponding topology. That is, only the topology route to the specific router is calculated first, and then the network prefix routing information advertised by the specific router can be calculated. It can be seen that the link state packet (the topology link state packet) carrying the network topology is more important than the link state packet (the leaf link state packet) carrying the network route.
  • the synchronization process includes:
  • a summary description is performed between the neighboring routers, and the summary description including the summary of the topology link state message is sent to the neighboring router, and the summary description including only the leaf link state packet summary is sent to the neighboring router.
  • the topology link state message requested in the link state request packet is sent to the neighboring router, and the leaf link requested in the link state request packet is sent.
  • Status packets are sent to neighboring routers;
  • the new topology link state packet is sent to the neighboring router, and the new leaf link state packet is sent to the neighboring router.
  • the neighboring router After the neighboring router sends the HELLO packet to establish the two-way communication, the summary of all the link state messages in the local database is formed into a summary description (that is, the summary of the link state message is characterized by a summary description) and sent to the neighboring router. Description, the neighboring router can determine the link state message that is missing from the local database of the local router.
  • a summary description may contain one or more link state message digests. If a digest description contains one or more topology link status message digests, it is sent first.
  • the summary description including the summary of the topology link state packet is sent to the neighboring router, and the summary description containing only the leaf link state packet digest is sent to the neighboring router, including:
  • the summary description queue includes a summary description priority queue and a summary description common queue; adding a summary description including a topology link status message summary to the summary description priority queue, which will only contain leaves
  • the summary description of the link state packet summary is added to the summary description common queue; the summary description is sent to describe the summary description in the priority queue, and the summary is sent to describe the summary description in the common queue.
  • the summary description in the summary description priority queue is sent to the neighboring router until the summary description priority queue is empty.
  • the processing summary describes the normal queue, and the summary is summarized. Description The summary description in the normal queue is sent to the neighboring router.
  • the topology link state message requested in the link state request packet is sent to the neighboring router, and the leaf link requested in the link state request packet is sent. Status messages are sent to neighboring routers.
  • the topology link status message that is requested in the link state request packet is sent to the neighboring router, and the leaf link state message that is requested in the link state request packet is sent to the neighboring router, including:
  • the packet sending queue includes a priority packet sending queue and a common queue.
  • the packet sending queue is added to the priority packet sending queue in the link state request packet, and the leaf link state packet requested in the link state request packet is added to the common packet.
  • the link state message in the priority packet transmission queue is sent first, and the link state message in the normal packet transmission queue is sent.
  • the link state packet in the priority packet sending queue is sent to the neighboring router until the priority packet sending queue is empty.
  • the processing is performed.
  • a normal packet sending queue sends a link state packet in the normal packet sending queue to the neighboring router. If a normal packet sending queue is processed, a new link state packet appears in the priority packet sending queue.
  • the request is sent, the current normal packet transmission queue processing is interrupted and the link state message transmission processing in the priority message transmission queue is turned.
  • the new topology link state packet is sent to the neighboring router, and the new leaf link state packet is sent to the neighboring router, including:
  • a packet sending queue is set up.
  • the packet sending queue includes a priority packet sending queue and a normal packet sending queue.
  • the new topology link state packet is added to the priority packet sending queue, and the new leaf link status report is sent.
  • the text is added to the normal packet sending queue.
  • the link state packets in the priority packet sending queue are sent preferentially, and the link state packets in the normal packet sending queue are sent.
  • the link state request packet corresponding to the topology link state packet is sent to the neighboring router according to the received summary description, and the link state request packet corresponding to the leaf link state packet is sent to the neighboring router.
  • the text includes:
  • the link state request packet of the topology link state packet is added to the priority request queue when the link state request packet of the status message is sent.
  • the link state request packet of the leaf link state packet is added to the normal request queue; the link state request packet in the priority request queue is sent preferentially, and then the normal request queue is sent. Link status request message.
  • the link status message request in the priority request queue is sent. To the neighboring router, until the priority request queue is empty; when the priority request queue is empty, the normal request queue is processed, and the link state message request in the normal request queue is sent to the neighboring router; in the process of sending the normal request queue If a new link state request occurs in the priority request queue, the current normal request queue processing is interrupted and the link state message in the priority request queue is requested to be sent.
  • determining, according to the received digest description, whether a link state request message needs to be sent to the neighboring router includes:
  • the local database does not contain the link state message digest in the received digest description, it is determined that a link state request message needs to be sent to the neighboring router; if the local database contains the link state in the received digest description The message digest determines that there is no need to send a link state request message to the neighboring router.
  • the neighboring router According to the summary description sent by the neighboring router, it is possible to determine whether the local database of the local router is missing link state packets, and according to the result, request the neighboring router to send the link state message that is missing from the database, and improve the link of the router.
  • State message database the purpose of router database synchronization.
  • a router When a router sends a link state packet to a neighboring router, there are two cases: one is to receive a link state message request from the neighboring router (Intermediate System to Intermediate System (ISIS) After receiving the complete database summary description of the neighboring routers in the System) protocol, the link state packets that are missing from the neighboring routers are sent to the neighboring routers. The other is to obtain new link state packets from other routers. Or generate a new link state message by itself. In either case, the router sends a link state packet to the neighboring router.
  • ISIS Intermediate System to Intermediate System
  • FIG. 3 is a flowchart of adding a summary description queue in a router database synchronization method according to an embodiment of the present invention.
  • the router After the router discovers the neighboring router, it will send a summary description of all link state packet digests in the local database to the neighboring router. After receiving the digest description, the neighboring router will determine whether it needs to request the link state packet from the other party. If the link state of the neighboring router is not local or the link state of the link is not new, the link state packet needs to be requested from the peer.
  • the link state packet Before sending the summary of the link state packet summary in the local database to the neighboring router, you need to add all the link state packets in the local database to the summary description queue. If the link state packet is the topology link status report. The text is added to the summary description priority queue; if the link status message is a leaf link status message, it is added to the summary to describe the normal queue.
  • FIG. 4 it is a flowchart of sending a summary description queue in a router database synchronization method according to an embodiment of the present invention.
  • the summary description is first processed to describe the summary description in the priority queue, and each summary description in the summary description priority queue is sent out. Only when all the summary descriptions in the summary description priority queue are processed, the summary description is processed normally. A summary description in the queue. This ensures that the topology link state summary information in the summary description priority queue is sent with high priority.
  • FIG. 5 it is a flowchart of receiving a summary description in a router database synchronization method according to an embodiment of the present invention.
  • Receive a summary description queue sent by the neighboring router check the summary description for each summary description in the queue, and determine whether to send a link state request message to the neighboring router according to the summary description. If the local state database does not have a link state message described by the digest, or the link state message in the link state message in the local database is not new, the link state request packet needs to be sent to the neighboring router.
  • the link state request message is added to the request queue: if the summary description is a topology link state message digest, it is added to the priority request queue; The summary description is a summary of the leaf link status message and is added to the normal request queue.
  • the router After receiving the complete summary description sent by the neighboring router (when the router sends all the summary descriptions of all link states in the local database, it will pass all the links to the neighboring router through the specific field in the summary description.
  • the summary of the status describes the sent signal. If the local database contains link status messages that are not in the complete summary description, the neighbor is adjacent. The router lacks the corresponding link state message. If the missing link state packet is a topology link state packet, it is added to the priority packet sending queue; if the missing link state packet is a leaf link state packet, it is added to the ordinary packet sending queue ( This applies only to the ISIS protocol).
  • FIG. 6 is a flowchart of sending a request queue in a router database synchronization method according to an embodiment of the present invention.
  • the link state request packet in the priority request queue is sent first, and the link state request packet in the normal request queue is processed only after all the link state request packets in the priority request queue are processed. . This ensures that the topology link state request packets in the priority request queue are sent out with high priority.
  • the normal request queue In the process of processing the normal request queue, if a new link state request message request is added to the priority request queue, the normal request queue is interrupted, and the link state request message in the priority request queue is processed. After the processing is completed, the link state request packet processing in the interrupted normal request queue is continued. This preemptive processing mode ensures that topology link state message requests are always sent with high priority.
  • FIG. 7 is a flowchart of receiving a request message in a router database synchronization method according to an embodiment of the present invention.
  • the neighboring router When receiving the link state request packet sent by the neighboring router, it processes each link state packet request in the link state request packet, and determines whether it needs to send the corresponding chain to the neighboring router according to the packet request. If the local database has a corresponding link state packet, the link state message is sent to the neighboring router.
  • the link state packet is sent to the neighboring router, it is determined whether the requested link state packet is a topology link state packet, and if the requested link state packet is a topology link state packet, it is added to The priority packet is sent to the queue; if the requested link state packet is a leaf link state packet, it is added to the normal packet transmission queue.
  • FIG. 8 is a flowchart of adding a message sending queue in a router database synchronization method according to an embodiment of the present invention.
  • FIG. 9 is a flowchart of sending a message sending queue in a router database synchronization method according to an embodiment of the present invention.
  • the link state packet sending request in the priority packet sending queue is first processed, and the link state packet in the priority packet sending queue is sent out only when all the chains in the priority packet sending queue are sent. After the process of sending a status message is completed, the link status message transmission request in the normal message transmission queue is processed. This ensures that the topology link state packets in the priority transmission queue are sent out with high processing priority.
  • the above method can be implemented by a router.
  • FIG. 10 is a schematic structural diagram of a router database synchronization apparatus according to an embodiment of the present invention.
  • the embodiment of the invention provides a synchronization device for a router database, which is applied to database synchronization of a link state routing algorithm protocol, and includes: a distinguishing unit and a synchronization unit.
  • the distinguishing unit is configured to: divide the link state message generated by the link state routing algorithm into a topology link state packet and a leaf link state packet;
  • the synchronization unit is configured to synchronize the completion of the topology link state message and then complete the leaf link state message synchronously when the neighboring router synchronizes the database; the synchronization unit includes a summary description generation module and a sending module. . among them:
  • the summary describes a generation module that is configured to establish a summary description between neighboring router databases when the neighboring router synchronizes the database.
  • the summary description including the topology link state packet summary is sent to the neighboring router, and the summary description including only the leaf link state packet digest is sent to the neighboring router; the link state request report of the neighboring router is received. And sending the topology link state message requested in the link state request message to the neighboring router, and then sending the leaf link state message requested in the link state request message to the neighboring router;
  • the new topology link state packet is sent to the neighboring router, and the new leaf link state packet is sent to the neighboring router.
  • the link state message sending module is configured to send the summary description including the topology link state message summary to the neighboring router in the following manner, and then only include the leaf link state message summary.
  • the summary description is sent to the neighboring router:
  • the summary description queue includes a summary description priority queue and a summary description common queue;
  • the summary description is sent to the summary description in the priority queue, and the summary description is sent to describe the summary in the normal queue.
  • the link state packet sending module is configured to: send the topology link state packet requested in the link state request packet to the neighboring router in the following manner, and then send the link state request report
  • the leaf link status message requested in the text is sent to the neighboring router, including:
  • the packet sending queue includes a priority packet sending queue and a normal packet sending queue
  • the link state packet in the priority packet sending queue is sent preferentially, and the link state packet in the normal packet sending queue is sent.
  • the link state message sending module is configured to send the new topology link state message to the neighboring router in the following manner, and then send the new leaf link state message to the neighboring device.
  • the router includes:
  • the packet sending queue includes a priority packet sending queue and a normal packet sending queue
  • the new topology link status packet is added to the priority packet sending queue, and the new leaf link status packet is added to the ordinary packet sending queue.
  • the link state packet in the priority packet sending queue is sent preferentially, and the link state packet in the normal packet sending queue is sent.
  • the link state packet sending module is configured to implement, in the following manner, the link state request packet corresponding to the topology link state packet sent to the neighboring router according to the received digest description, and then The link state request packet corresponding to the leaf link status packet sent by the neighboring router includes:
  • the request queue includes a priority request queue and a normal request queue
  • the link state request message requesting the topology link state message is added to the priority request queue, and when it is determined that the link state request is required
  • the neighboring router sends a link state request message requesting the leaf topology link state message
  • the neighboring router adds the link state request message of the leaf link state message to the normal request queue.
  • the link state request message in the priority request queue is sent preferentially, and the link state request message in the normal request queue is sent.
  • the summary description in the summary description priority queue is sent to the neighboring router until the summary description priority queue is empty; when the summary description priority queue is empty, The processing summary describes the normal queue, and the summary description describes the summary description in the normal queue to the neighboring router.
  • the link status message request in the priority request queue is sent to the neighboring router until the priority request queue is empty; when the priority request queue is empty, the normal request queue is processed, and the normal request is processed.
  • the link state message request in the queue is sent to the neighboring router; in the process of sending the normal request queue, if a new link state request occurs in the priority request queue, the current request queue processing is interrupted and transferred to the priority request queue. Link state message request transmission processing.
  • the link state packet in the priority packet sending queue is sent to the neighboring router until the priority packet sending queue is empty.
  • the processing is performed.
  • a normal packet sending queue sends a link state packet in the normal packet sending queue to the neighboring router. If a normal packet sending queue is processed, a new link state packet appears in the priority packet sending queue.
  • the request is sent, the current normal packet transmission queue processing is interrupted and the link state message transmission processing in the priority message transmission queue is turned.
  • the embodiment of the present invention further provides a router, which includes the synchronization device as described above, and the synchronization device is configured to synchronize a database of a link state routing algorithm protocol of the router, and includes: a distinguishing unit and a synchronization unit. among them:
  • the distinguishing unit is configured to: divide the link state message generated by the link state routing algorithm into a topology link state packet and a leaf link state packet;
  • a synchronization unit configured to synchronize the completion of the topology link state message and then complete the leaf link state message synchronously when the neighboring router synchronizes the database;
  • the synchronization unit includes a summary description generation module and a link Status message sending module. among them:
  • a summary description generation module configured to establish a summary description between the neighboring router databases and send the summary description to the neighboring router; the summary description includes all link state message digests;
  • the link state message sending module is configured to send a link state request message to the neighboring router according to the summary description.
  • An embodiment of the present invention further provides a router system, including at least two routers, where the router includes a synchronization device as described above, and the synchronization device is configured to synchronize a database of a link state routing algorithm protocol of the router, including : Distinguishing units and synchronizing units. among them:
  • the distinguishing unit is configured to: divide the link state message generated by the link state routing algorithm into a topology link state packet and a leaf link state packet;
  • a synchronization unit configured to synchronize the completion of the topology link state message and then complete the leaf link state message synchronously when the neighboring router synchronizes the database;
  • the synchronization unit includes a summary description generation module and a link Status message sending module. among them:
  • a summary description generation module configured to establish a summary description between the neighboring router databases and send the summary description to the neighboring router; the summary description includes all link state message digests;
  • the link state message sending module is configured to send a link state request message to the neighboring router according to the summary description.
  • the embodiment of the present invention has at least the following advantages:
  • a packet that is, a database synchronization that is important to distinguish importance, and a topology topology message with high importance that affects the network topology is preferentially synchronized.
  • the topology link state message is synchronized, the importance is relatively low. Synchronization of link state packets (leaf link state packets) can speed up the convergence of routes.
  • the technical solution of the present invention which is essential or contributes to the prior art, may be embodied in the form of a software product stored in a storage medium (such as ROM/RAM, disk, Light
  • a storage medium such as ROM/RAM, disk, Light
  • the disc includes a number of instructions for causing a terminal device (which may be a cell phone, a computer, a server, or a network device, etc.) to perform the methods described in various embodiments of the present invention.
  • Embodiments of the present invention also provide a computer readable storage medium storing computer executable instructions for performing any of the methods described above.
  • each module/unit in the foregoing embodiment may be implemented in the form of hardware, for example, by implementing an integrated circuit to implement its corresponding function, or may be implemented in the form of a software function module, for example, executing a program in a storage and a memory by a processor. / instruction to achieve its corresponding function.
  • the invention is not limited to any specific form of combination of hardware and software.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Computing Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

一种路由器数据库同步的方法，链路状态路由协议在数据库同步过程中，区分拓扑链路状态报文和叶子链路状态报文，即区分重要性地进行数据库同步，优先同步重要性高的拓扑链路状态报文，在拓扑链路状态报文同步完成的情况下再同步重要性相对低的叶子链路状态报文。本发明还提供的一种路由器数据库同步装置、以及路由器及其系统。

Description

路由器及其系统、数据库的同步方法及其装置 技术领域
本文涉及但不限于通信领域，尤指一种数据库同步的方法及其装置、以及路由器及其系统。
背景技术
在数据通信领域中，动态路由协议主要分为两种：一种是距离矢量路由算法，另一种是链路状态路由算法。
在链路状态路由算法中，由链路状态路由算法产生的链路状态报文主要有两种类型：一种是承载网络拓扑结构的链路状态报文(简称拓扑链路状态报文，每台路由器都会产生描述对应拓扑结构的链路状态报文)；另一种是承载网络路由的链路状态报文(简称叶子链路状态报文，相对于拓扑结构链路报文，路由器会产生更多的承载网络路由的链路状态报文，主要是网络前缀路由信息)。承载网络路由的链路状态报文关联于对应拓扑结构的链路状态报文，即只有先计算出到达特定路由器的拓扑路由，后续才能计算出特定路由器通告的网络前缀路由信息。
如图1所示。图1说明了不区分优先级地发送链路状态报文的例子。路由器1执行重分配命令引入大量的边界网关协议(BGP，Border Gateway Protocol)路由，和路由器2进行数据库同步过程中需要将数据库中所有链路状态报文发送给路由器2。在Tn时刻之前，路由器1将叶子链路状态报文(承载着引入的BGP路由信息)发送给路由器2，但在Tn时刻，路由器1才将自己产生的拓扑链路状态报文(承载着路由器1指向路由器2的网络拓扑结构信息)发送给路由器2。由于在Tn时刻之前路由器2没有路由器1的拓扑链路状态报文，所以路由器2无法计算出到达路由器1的拓扑路由，也就计算不出路由器1通告的BGP路由信息(即使此时路由器2可能已经接收到路由器1通告的所有BGP路由信息)，只有当Tn时刻路由器2接收到路由器1的拓扑链路状态报文时，路由器2才能计算出到达路由器1的拓扑路由，才能计算出路由器1通告的BGP路由信息。
通过上述例子可以看出，链路状态路由协议在数据库同步过程中，如果不区分拓扑链路状态报文和叶子链路状态报文，即不区分重要性地进行数据库同步，会出现没有接收到重要的拓扑链路状态报文而导致其通告的路由信息无法被及时计算的情况，最终会大大影响路由的收敛速度。
发明内容
以下是对本文详细描述的主题的概述。本概述并非是为了限制权利要求的保护范围。
本发明实施例提供一种数据库同步的方法及其装置、以及路由器及其系统，在链路状态路由协议数据库同步过程中能够及时计算其通告的路由信息，从而提高路由的收敛速度。
本发明实施例提出的一种路由器数据库的同步方法，包括：
将链路状态报文区分为拓扑链路状态报文和叶子链路状态报文；
在相邻路由器同步数据库时，先同步完成所述拓扑链路状态报文，再同步完成所述叶子链路状态报文。
可选地，先同步完成所述拓扑链路状态报文，再同步完成所述叶子链路状态报文包括：
建立相邻路由器数据库之间的摘要描述，先将包含拓扑链路状态报文摘要的摘要描述发送给相邻路由器，再将仅包含叶子链路状态报文摘要的摘要描述发送给相邻路由器；接收到相邻路由器的链路状态请求报文，先将链路状态请求报文中请求的拓扑链路状态报文发送给相邻路由器，再将链路状态请求报文中请求的叶子链路状态报文发送给相邻路由器；
或者，当获得或产生新的链路状态报文时，先将新的拓扑链路状态报文发送给相邻路由器，再将新的叶子链路状态报文发送给相邻路由器；
或者，当接收到来自相邻路由器的摘要描述，根据接收到的摘要描述先向相邻路由器发送拓扑链路状态报文对应的链路状态请求报文，再向相邻路由器发送叶子链路状态报文对应的链路状态请求报文；接收到来自相邻路由器的链路状态报文，根据接收到的链路状态报文更新数据库。
可选的，所述先将包含拓扑链路状态报文摘要的摘要描述发送给相邻路由器，再将仅包含叶子链路状态报文摘要的摘要描述发送给相邻路由器包括：
建立用于处理摘要描述的摘要描述队列；其中，摘要描述队列包括摘要描述优先队列和摘要描述普通队列；
将包含拓扑链路状态报文摘要的摘要描述添加到摘要描述优先队列，将仅包含叶子链路状态报文摘要的摘要描述添加到摘要描述普通队列；
优先发送摘要描述优先队列中的摘要描述，再发送摘要描述普通队列中的摘要描述。
可选的，所述先将链路状态请求报文中请求的拓扑链路状态报文发送给相邻路由器，再将链路状态请求报文中请求的叶子链路状态报文发送给相邻路由器包括：
建立报文发送队列；其中，报文发送队列包括优先报文发送队列和普通报文发送队列；
将链路状态请求报文中请求的拓扑链路状态报文添加到优先报文发送队列，将链路状态请求报文中请求的叶子链路状态报文添加到普通报文发送队列；
优先发送优先报文发送队列中的链路状态报文，再发普通报文发送队列中的链路状态报文。
可选的，所述先将新的拓扑链路状态报文发送给相邻路由器，再将新的叶子链路状态报文发送给相邻路由器包括：
建立报文发送队列；其中，报文发送队列包括优先报文发送队列和普通报文发送队列；
将新的拓扑链路状态报文添加到优先报文发送队列，将新的叶子链路状态报文添加到普通报文发送队列；
优先发送优先报文发送队列中的链路状态报文，再发普通报文发送队列中的链路状态报文。
可选的，所述根据接收到的摘要描述先向相邻路由器发送拓扑链路状态 报文对应的链路状态请求报文，再向相邻路由器发送叶子链路状态报文对应的链路状态请求报文包括：
建立请求队列；其中，请求队列包括优先请求队列和普通请求队列；
根据接收到的摘要描述确定是否需要向相邻路由器发送链路状态请求报文；
当确定需要向相邻路由器发送请求拓扑链路状态报文的链路状态请求报文时，将请求拓扑链路状态报文的链路状态请求报文添加到优先请求队列，当确定需要向相邻路由器发送请求叶子拓扑链路状态报文的链路状态请求报文时，将请求叶子链路状态报文的链路状态请求报文添加到普通请求队列；
优先发送所述优先请求队列中的链路状态请求报文，再发送所述普通请求队列中的链路状态请求报文。
本发明实施例还提出一种路由器数据库的同步装置，包括：区分单元和同步单元；其中：
所述区分单元，设置为将链路状态报文区分为拓扑链路状态报文和叶子链路状态报文；
所述同步单元，设置为在相邻路由器同步数据库时，先同步完成所述拓扑链路状态报文，再同步完成所述叶子链路状态报文。
可选地，所述同步单元包括摘要描述生成模块和链路状态报文发送模块；其中：
所述摘要描述生成模块，设置为在相邻路由器同步数据库时，建立相邻路由器数据库之间的摘要描述；
所述链路状态报文发送模块，设置为
先将包含拓扑链路状态报文摘要的摘要描述发送给相邻路由器，再将仅包含叶子链路状态报文摘要的摘要描述发送给相邻路由器；接收到相邻路由器的链路状态请求报文，先将链路状态请求报文中请求的拓扑链路状态报文发送给相邻路由器，再将链路状态请求报文中请求的叶子链路状态报文发送给相邻路由器；
或者，当获得或产生新的链路状态报文时，先将新的拓扑链路状态报文发送给相邻路由器，再将新的叶子链路状态报文发送给相邻路由器；
或者，当接收到来自相邻路由器的摘要描述，根据接收到的摘要描述先向相邻路由器发送拓扑链路状态报文对应的链路状态请求报文，再向相邻路由器发送叶子链路状态报文对应的链路状态请求报文；接收到来自相邻路由器的链路状态报文，根据接收到的链路状态报文更新数据库。
可选的，所述链路状态报文发送模块是设置为采用以下方式实现所述先将包含拓扑链路状态报文摘要的摘要描述发送给相邻路由器，再将仅包含叶子链路状态报文摘要的摘要描述发送给相邻路由器：
建立用于处理摘要描述的摘要描述队列；其中，摘要描述队列包括摘要描述优先队列和摘要描述普通队列；
将包含拓扑链路状态报文摘要的摘要描述添加到摘要描述优先队列，将仅包含叶子链路状态报文摘要的摘要描述添加到摘要描述普通队列；
优先发送摘要描述优先队列中的摘要描述，再发送摘要描述普通队列中的摘要描述。
可选的，所述链路状态报文发送模块是设置为采用以下方式实现所述先将链路状态请求报文中请求的拓扑链路状态报文发送给相邻路由器，再将链路状态请求报文中请求的叶子链路状态报文发送给相邻路由器包括：
建立报文发送队列；其中，报文发送队列包括优先报文发送队列和普通报文发送队列；
将链路状态请求报文中请求的拓扑链路状态报文添加到优先报文发送队列，将链路状态请求报文中请求的叶子链路状态报文添加到普通报文发送队列；
优先发送优先报文发送队列中的链路状态报文，再发普通报文发送队列中的链路状态报文。
可选的，所述链路状态报文发送模块是设置为采用以下方式实现所述先将新的拓扑链路状态报文发送给相邻路由器，再将新的叶子链路状态报文发 送给相邻路由器包括：
建立报文发送队列；其中，报文发送队列包括优先报文发送队列和普通报文发送队列；
将新的拓扑链路状态报文添加到优先报文发送队列，将新的叶子链路状态报文添加到普通报文发送队列；
优先发送优先报文发送队列中的链路状态报文，再发普通报文发送队列中的链路状态报文。
可选的，所述链路状态报文发送模块是设置为采用以下方式实现所述根据接收到的摘要描述先向相邻路由器发送拓扑链路状态报文对应的链路状态请求报文，再向相邻路由器发送叶子链路状态报文对应的链路状态请求报文包括：
建立请求队列；其中，请求队列包括优先请求队列和普通请求队列；
根据接收到的摘要描述确定是否需要向相邻路由器发送链路状态请求报文；
当确定需要向相邻路由器发送请求拓扑链路状态报文的链路状态请求报文时，将请求拓扑链路状态报文的链路状态请求报文添加到优先请求队列，当确定需要向相邻路由器发送请求叶子拓扑链路状态报文的链路状态请求报文时，将请求叶子链路状态报文的链路状态请求报文添加到普通请求队列；
优先发送所述优先请求队列中的链路状态请求报文，再发送所述普通请求队列中的链路状态请求报文。
本发明实施例还提出一种路由器，所述路由器包括如以上所述的同步装置。
本发明实施例还提出一种路由器系统，所述路由器系统包括至少两个如以上所述的路由器。
本发明实施例还提出了一种计算机可读存储介质，存储有计算机可执行指令，计算机可执行指令用于执行上述描述的任意一个方法。
本发明实施例与相关技术相比，本发明实施例提供的一种数据库同步的 方法及其装置、以及路由器及其系统，链路状态路由协议在数据库同步过程中，区分拓扑链路状态报文和叶子链路状态报文，即区分重要性地进行数据库同步，优先同步影响网络拓扑结构的重要性高的拓扑链路状态报文，在拓扑链路状态报文同步完成的情况下再进行重要性相对低的其它链路状态报文(叶子链路状态报文)的同步，从而可以加快路由的收敛速度。
在阅读并理解了附图和详细描述后，可以明白其他方面。
附图概述
图1为相关技术中不区分优先级数据库同步例子的示意图；
图2为本发明实施例提供的一种路由器数据库同步方法的流程图；
图3为本发明实施例提供的一种路由器数据库同步方法中添加摘要描述队列的流程图；
图4为本发明实施例提供的一种路由器数据库同步方法中发送摘要描述队列的流程图；
图5为本发明实施例提供的一种路由器数据库同步方法中接收摘要描述的流程图；
图6为本发明实施例提供的一种路由器数据库同步方法中发送请求队列的流程图；
图7为本发明实施例提供的一种路由器数据库同步方法中接收请求报文的流程图；
图8为本发明实施例提供的一种路由器数据库同步方法中添加报文发送队列的流程图；
图9为本发明实施例提供的一种路由器数据库同步方法中发送报文发送队列的流程图；
图10为本发明实施例提供的一种路由器数据库同步装置的结构示意图。
本发明的实施方式
应当理解，此处所描述的具体实施例仅仅用以解释本发明，并不用于限 定本发明。
如图2所示，本发明实施例提供一种路由器数据库同步的方法，应用于链路状态路由算法协议的数据库同步，包括：
将链路状态路由算法产生的链路状态报文区分为拓扑链路状态报文和叶子链路状态报文；
链路状态路由算法产生的链路状态报文主要有两种类型：一种是承载网络拓扑结构的链路状态报文(简称拓扑链路状态报文，每台路由器都会产生描述对应拓扑结构的链路状态报文)；另一种是承载网络路由的链路状态报文(简称叶子链路状态报文，相对于拓扑结构链路报文，路由器会产生更多的承载网络路由的链路状态报文，主要是网络前缀路由信息)。承载网络路由的链路状态报文关联于对应拓扑结构的链路状态报文，即只有先计算出到达特定路由器的拓扑路由，后续才能计算出特定路由器通告的网络前缀路由信息。可以看出，承载网络拓扑结构的链路状态报文(拓扑链路状态报文)相对要比承载网络路由的链路状态报文(叶子链路状态报文)更加重要。
在相邻路由器同步数据库时，先同步完成所述拓扑链路状态报文，再同步完成所述叶子链路状态报文。同步过程包括：
建立相邻路由器数据库之间的摘要描述，先将包含拓扑链路状态报文摘要的摘要描述发送给相邻路由器，再将仅包含叶子链路状态报文摘要的摘要描述发送给相邻路由器；接收到相邻路由器的链路状态请求报文，先将链路状态请求报文中请求的拓扑链路状态报文发送给相邻路由器，再将链路状态请求报文中请求的叶子链路状态报文发送给相邻路由器；
或者，当获得或产生新的链路状态报文时，先将新的拓扑链路状态报文发送给相邻路由器，再将新的叶子链路状态报文发送给相邻路由器；
或者，当接收到来自相邻路由器的摘要描述，根据接收到的摘要描述先向相邻路由器发送拓扑链路状态报文对应的链路状态请求报文，再向相邻路由器发送叶子链路状态报文对应的链路状态请求报文；接收到来自相邻路由器的链路状态报文，根据接收到的链路状态报文更新数据库。
以下描述同步过程。
Figure PCTCN2016094387-appb-000001
建立相邻路由器数据库之间的摘要描述并，先将所述包含拓扑链路状态报文摘要的摘要描述发送给相邻路由器，再将仅包含叶子链路状态报文摘要的摘要描述发送给相邻路由器。
相邻路由器发送HELLO报文建立双向通信后，将本地数据库中所有链路状态报文摘要形成摘要描述(即以摘要描述形式来表征链路状态报文摘要)发送给相邻路由器，通过该摘要描述，相邻路由器可以确定本地路由器的本地数据库缺少的链路状态报文。
一个摘要描述中可以包含一个或多个链路状态报文摘要，如果一个摘要描述中包含一个或多个拓扑链路状态报文摘要，则优先发送。
先将包含拓扑链路状态报文摘要的摘要描述发送给相邻路由器，再将仅包含叶子链路状态报文摘要的摘要描述发送给相邻路由器包括：
建立用于处理摘要描述的摘要描述队列；其中，摘要描述队列包括摘要描述优先队列和摘要描述普通队列；将包含拓扑链路状态报文摘要的摘要描述添加到摘要描述优先队列，将仅包含叶子链路状态报文摘要的摘要描述添加到摘要描述普通队列；优先发送摘要描述优先队列中的摘要描述，再发送摘要描述普通队列中的摘要描述。
当摘要描述优先队列不为空时，将摘要描述优先队列中的摘要描述发送给相邻路由器，直至摘要描述优先队列为空；当摘要描述优先队列为空时，处理摘要描述普通队列，将摘要描述普通队列中的摘要描述发送给相邻路由器。
Figure PCTCN2016094387-appb-000002
接收到相邻路由器的链路状态请求报文，先将链路状态请求报文中请求的拓扑链路状态报文发送给相邻路由器，再将链路状态请求报文中请求的叶子链路状态报文发送给相邻路由器。
先将链路状态请求报文中请求的拓扑链路状态报文发送给相邻路由器，再将链路状态请求报文中请求的叶子链路状态报文发送给相邻路由器包括：
建立报文发送队列；其中，报文发送队列包括优先报文发送队列和普通 报文发送队列；将链路状态请求报文中请求的拓扑链路状态报文添加到优先报文发送队列，将链路状态请求报文中请求的叶子链路状态报文添加到普通报文发送队列；优先发送优先报文发送队列中的链路状态报文，再发普通报文发送队列中的链路状态报文。
当优先报文发送队列不为空时，将优先报文发送队列中的链路状态报文发送给相邻路由器，直至优先报文发送队列为空；当优先报文发送队列为空时，处理普通报文发送队列，将普通报文发送队列中的链路状态报文发送给相邻路由器；在处理普通报文发送队列过程时，如果优先报文发送队列中出现新的链路状态报文发送请求时，中断当前普通报文发送队列处理并转向优先报文发送队列中的链路状态报文发送处理。
可选的，先将新的拓扑链路状态报文发送给相邻路由器，再将新的叶子链路状态报文发送给相邻路由器包括：
建立报文发送队列；其中，报文发送队列包括优先报文发送队列和普通报文发送队列；将新的拓扑链路状态报文添加到优先报文发送队列，将新的叶子链路状态报文添加到普通报文发送队列；优先发送优先报文发送队列中的链路状态报文，再发普通报文发送队列中的链路状态报文。
可选的，根据接收到的摘要描述先向相邻路由器发送拓扑链路状态报文对应的链路状态请求报文，再向相邻路由器发送叶子链路状态报文对应的链路状态请求报文包括：
建立请求队列；其中，请求队列包括优先请求队列和普通请求队列；根据接收到的摘要描述确定是否需要向相邻路由器发送链路状态请求报文；当确定需要向相邻路由器发送请求拓扑链路状态报文的链路状态请求报文时，将请求拓扑链路状态报文的链路状态请求报文添加到优先请求队列，当确定需要向相邻路由器发送请求叶子拓扑链路状态报文的链路状态请求报文时，将请求叶子链路状态报文的链路状态请求报文添加到普通请求队列；优先发送优先请求队列中的链路状态请求报文，再发送普通请求队列中的链路状态请求报文。
当优先请求队列不为空时，将优先请求队列中的链路状态报文请求发送 给相邻路由器，直至优先请求队列为空；当优先请求队列为空时，处理普通请求队列，将普通请求队列中的链路状态报文请求发送给相邻路由器；在发送普通请求队列过程中，如果优先请求队列中出现新的链路状态请求时，中断当前普通请求队列处理并转向优先请求队列中的链路状态报文请求发送处理。
可选的，根据接收到的摘要描述确定是否需要向相邻路由器发送链路状态请求报文包括：
如果本地数据库中没有包含接收到的摘要描述中的链路状态报文摘要，则确定需要向相邻路由器发送链路状态请求报文；如果本地数据库中包含接收到的摘要描述中的链路状态报文摘要，则确定不需要向相邻路由器发送链路状态请求报文。
由于根据相邻路由器发送的摘要描述，可以确定本地路由器的本地数据库是否缺少的链路状态报文，并依此结果向相邻路由器请求发送数据库缺少的链路状态报文，完善路由器的链路状态报文数据库，达成路由器数据库同步的目的。
路由器向相邻路由器发送链路状态报文的触发时机，存在两种情况：一种是接收到相邻路由器发来的链路状态报文请求(中间系统到中间系统(ISIS，Intermediate System to Intermediate System)协议中接收到相邻路由器完整的数据库摘要描述后，会将相邻路由器缺少的链路状态报文发送给相邻路由器)；另一种是从其他路由器得到新的链路状态报文或者自己产生新的链路状态报文。以上两种情况任一情况发生时，路由器都会向相邻路由器发送链路状态报文。
如图3所示，为本发明实施例提供的一种路由器数据库同步方法中添加摘要描述队列的流程图。
路由器发现相邻路由器后会将本地数据库中所有链路状态报文摘要形成摘要描述发送给相邻路由器，相邻路由器接收到摘要描述后会判断是否需要向对方请求链路状态报文，如果相邻路由器本地没有或者本地的链路状态报文没有对方链路状态报文新，则需要向对方请求链路状态报文。
将本地数据库中链路状态报文摘要形成摘要描述发送给相邻路由器前，需要将本地数据库中所有链路状态报文添加到摘要描述队列中，如果链路状态报文为拓扑链路状态报文，则添加到摘要描述优先队列；如果链路状态报文为叶子链路状态报文，则添加到摘要描述普通队列。
如图4所示，为本发明实施例提供的一种路由器数据库同步方法中发送摘要描述队列的流程图。
发送摘要描述队列时，首先处理摘要描述优先队列中的摘要描述，将摘要描述优先队列中的每个摘要描述发送出去，只有当摘要描述优先队列中所有摘要描述处理完成后，才处理摘要描述普通队列中的摘要描述。这样可以保证摘要描述优先队列中的拓扑链路状态摘要信息以高优先级发送出去。
因为摘要描述队列的添加是一次性完成，不存在所有链路状态摘要描述添加完成后又要添加的链路状态摘要描述，后续数据库中新添加的链路状态报文将会直接发送给相邻路由器，而不用再次添加到摘要描述队列表中。
如图5所示，为本发明实施例提供的一种路由器数据库同步方法中接收摘要描述的流程图。
接收到相邻路由器发来的摘要描述队列，检查摘要描述队列中的每一个摘要描述，根据摘要描述决定是否需要向相邻路由器发送链路状态请求报文。如果本地数据库没有摘要描述的链路状态报文或者本地数据库中的链路状态报文没有摘要描述的链路状态报文新，需要向相邻路由器发送链路状态请求报文。
当决定需要向相邻路由器发送链路状态请求报文时，将链路状态请求报文添加到请求队列中：如果摘要描述是拓扑链路状态报文摘要，则添加到优先请求队列中；如果摘要描述是叶子链路状态报文摘要，则添加到普通请求队列中。
接收到相邻路由器发来的完整摘要描述后(当路由器将本地数据库中所有链路状态的摘要描述全部发送完毕时，会通过摘要描述中的特定字段向相邻路由器传递本地已经将所有链路状态的摘要描述发送完的信号)，如果本地数据库中含有完整摘要描述中所没有的链路状态报文时，则说明对方相邻 路由器缺少相应的链路状态报文。如果缺少的链路状态报文是拓扑链路状态报文，则添加到优先报文发送队列；如果缺少的链路状态报文是叶子链路状态报文，则添加到普通报文发送队列(这个仅对ISIS协议适用)。
如图6所示，为本发明实施例提供的一种路由器数据库同步方法中发送请求队列的流程图。
发送请求队列时，首先发送优先请求队列中的链路状态请求报文，只有当优先请求队列中所有链路状态请求报文处理完成后，才开始处理普通请求队列中的链路状态请求报文。这样可以保证优先请求队列中的拓扑链路状态请求报文以高优先级发送出去。
在处理普通请求队列过程中，如果有新的链路状态请求报文请求添加至优先请求队列中，则中断普通请求队列的发送请求处理，转去处理优先请求队列中的链路状态请求报文，处理完毕后继续上一次被中断的普通请求队列中的链路状态请求报文处理。这种抢占式的处理方式可以保证拓扑链路状态报文请求始终以高优先级发送出去。
如图7所示，为本发明实施例提供的一种路由器数据库同步方法中接收请求报文的流程图。
接收到相邻路由器发来的链路状态请求报文时，会处理链路状态请求报文中的每一个链路状态报文请求，根据报文请求决定是否需要向相邻路由器发送对应的链路状态报文，如果本地数据库有对应的链路状态报文，将该链路状态报文发送给相邻路由器。
如果需要向相邻路由器发送链路状态报文时，判断请求的链路状态报文是否为拓扑链路状态报文，如果请求的链路状态报文为拓扑链路状态报文，则添加到优先报文发送队列中；如果请求的链路状态报文为叶子链路状态报文，则添加到普通报文发送队列中。
如图8所示，为本发明实施例提供的一种路由器数据库同步方法中添加报文发送队列的流程图。
从其他路由器得到新的链路状态报文或者自己产生新的链路状态报文时，需要将这些新的链路状态报文发送给相邻路由器。判断新的链路状态报文是 否为拓扑链路状态报文，如果新的链路状态报文为拓扑链路状态报文，则添加到优先报文发送队列中；如果新的链路状态报文为叶子链路状态报文，则添加到普通报文发送队列中。
如图9所示，为本发明实施例提供的一种路由器数据库同步方法中发送报文发送队列的流程图。
发送报文发送队列时，首先处理优先报文发送队列中的链路状态报文发送请求，将优先报文发送队列中的链路状态报文发送出去，只有当优先报文发送队列中所有链路状态报文发送请求处理完成后，才开始处理普通报文发送队列中的链路状态报文发送请求。这样可以保证优先发送队列中的拓扑链路状态报文以高处理优先级发送出去。
在处理普通报文发送队列过程中，如果有新的发送请求添加至优先报文发送队列中，则中断普通报文发送队列的发送请求处理，转去处理优先报文发送队列中的发送请求，处理完毕后继续上一次被中断的普通报文发送队列中的发送请求处理。这种抢占式的处理方式可以保证拓扑链路状态报文始终以高优先级发送出去。
上述方法可以通过路由器实现。
如图10所示，为本发明实施例提供的一种路由器数据库同步装置的结构示意图。
本发明实施例提供一种路由器数据库的同步装置，应用于链路状态路由算法协议的数据库同步，包括：区分单元和同步单元。
区分单元，设置为将链路状态路由算法产生的链路状态报文区分为拓扑链路状态报文和叶子链路状态报文；
同步单元，设置为在相邻路由器同步数据库时，先同步完成所述拓扑链路状态报文，然后再同步完成所述叶子链路状态报文；所述同步单元包括摘要描述生成模块和发送模块。其中：
该摘要描述生成模块，设置为在相邻路由器同步数据库时，建立相邻路由器数据库之间的摘要描述。
链路状态报文发送模块，设置为
先将包含拓扑链路状态报文摘要的摘要描述发送给相邻路由器，再将仅包含叶子链路状态报文摘要的摘要描述发送给相邻路由器；接收到相邻路由器的链路状态请求报文，先将链路状态请求报文中请求的拓扑链路状态报文发送给相邻路由器，再将链路状态请求报文中请求的叶子链路状态报文发送给相邻路由器；
或者，当获得或产生新的链路状态报文时，先将新的拓扑链路状态报文发送给相邻路由器，再将新的叶子链路状态报文发送给相邻路由器；
或者，当接收到来自相邻路由器的摘要描述，根据接收到的摘要描述先向相邻路由器发送拓扑链路状态报文对应的链路状态请求报文，再向相邻路由器发送叶子链路状态报文对应的链路状态请求报文；接收到来自相邻路由器的链路状态报文，根据接收到的链路状态报文更新数据库。
可选的，链路状态报文发送模块是设置为采用以下方式实现所述先将包含拓扑链路状态报文摘要的摘要描述发送给相邻路由器，再将仅包含叶子链路状态报文摘要的摘要描述发送给相邻路由器：
建立用于处理摘要描述的摘要描述队列；其中，摘要描述队列包括摘要描述优先队列和摘要描述普通队列；
将包含拓扑链路状态报文摘要的摘要描述添加到摘要描述优先队列，将仅包含叶子链路状态报文摘要的摘要描述添加到摘要描述普通队列；
优先发送摘要描述优先队列中的摘要描述，再发送摘要描述普通队列中的摘要描述。
可选的，链路状态报文发送模块是设置为采用以下方式实现所述先将链路状态请求报文中请求的拓扑链路状态报文发送给相邻路由器，再将链路状态请求报文中请求的叶子链路状态报文发送给相邻路由器包括：
建立报文发送队列；其中，报文发送队列包括优先报文发送队列和普通报文发送队列；
将链路状态请求报文中请求的拓扑链路状态报文添加到优先报文发送队 列，将链路状态请求报文中请求的叶子链路状态报文添加到普通报文发送队列；
优先发送优先报文发送队列中的链路状态报文，再发普通报文发送队列中的链路状态报文。
可选的，链路状态报文发送模块是设置为采用以下方式实现所述先将新的拓扑链路状态报文发送给相邻路由器，再将新的叶子链路状态报文发送给相邻路由器包括：
建立报文发送队列；其中，报文发送队列包括优先报文发送队列和普通报文发送队列；
将新的拓扑链路状态报文添加到优先报文发送队列，将新的叶子链路状态报文添加到普通报文发送队列；
优先发送优先报文发送队列中的链路状态报文，再发普通报文发送队列中的链路状态报文。
可选的，链路状态报文发送模块是设置为采用以下方式实现所述根据接收到的摘要描述先向相邻路由器发送拓扑链路状态报文对应的链路状态请求报文，再向相邻路由器发送叶子链路状态报文对应的链路状态请求报文包括：
建立请求队列；其中，请求队列包括优先请求队列和普通请求队列；
根据接收到的摘要描述确定是否需要向相邻路由器发送链路状态请求报文；
当确定需要向相邻路由器发送请求拓扑链路状态报文的链路状态请求报文时，将请求拓扑链路状态报文的链路状态请求报文添加到优先请求队列，当确定需要向相邻路由器发送请求叶子拓扑链路状态报文的链路状态请求报文时，将请求叶子链路状态报文的链路状态请求报文添加到普通请求队列；
优先发送所述优先请求队列中的链路状态请求报文，再发送所述普通请求队列中的链路状态请求报文。
当摘要描述优先队列不为空时，将摘要描述优先队列中的摘要描述发送给相邻路由器，直至摘要描述优先队列为空；当摘要描述优先队列为空时， 处理摘要描述普通队列，将摘要描述普通队列中的摘要描述发送给相邻路由器。
当优先请求队列不为空时，将优先请求队列中的链路状态报文请求发送给相邻路由器，直至优先请求队列为空；当优先请求队列为空时，处理普通请求队列，将普通请求队列中的链路状态报文请求发送给相邻路由器；在发送普通请求队列过程中，如果优先请求队列中出现新的链路状态请求时，中断当前通请求队列处理并转向优先请求队列中的链路状态报文请求发送处理。
当优先报文发送队列不为空时，将优先报文发送队列中的链路状态报文发送给相邻路由器，直至优先报文发送队列为空；当优先报文发送队列为空时，处理普通报文发送队列，将普通报文发送队列中的链路状态报文发送给相邻路由器；在处理普通报文发送队列过程时，如果优先报文发送队列中出现新的链路状态报文发送请求时，中断当前普通报文发送队列处理并转向优先报文发送队列中的链路状态报文发送处理。
本发明实施例还提供一种路由器，其包括如上所述的同步装置，所述同步装置，设置为同步上述路由器的链路状态路由算法协议的数据库，其包括：区分单元和同步单元。其中：
区分单元，设置为将链路状态路由算法产生的链路状态报文区分为拓扑链路状态报文和叶子链路状态报文；
同步单元，设置为在相邻路由器同步数据库时，先同步完成所述拓扑链路状态报文，然后再同步完成所述叶子链路状态报文；所述同步单元包括摘要描述生成模块和链路状态报文发送模块。其中：
摘要描述生成模块，设置为建立相邻路由器数据库之间的摘要描述并将所述摘要描述发送给相邻路由器；所述摘要描述包括所有链路状态报文摘要；
链路状态报文发送模块，设置为根据摘要描述向相邻路由器发送链路状态请求报文。
本发明实施例还提供一种路由器系统，包括至少两个路由器，所述路由器包括如上所述的同步装置，所述同步装置，设置为同步上述路由器的链路状态路由算法协议的数据库，其包括：区分单元和同步单元。其中：
区分单元，设置为将链路状态路由算法产生的链路状态报文区分为拓扑链路状态报文和叶子链路状态报文；
同步单元，设置为在相邻路由器同步数据库时，先同步完成所述拓扑链路状态报文，然后再同步完成所述叶子链路状态报文；所述同步单元包括摘要描述生成模块和链路状态报文发送模块。其中：
摘要描述生成模块，设置为建立相邻路由器数据库之间的摘要描述并将所述摘要描述发送给相邻路由器；所述摘要描述包括所有链路状态报文摘要；
链路状态报文发送模块，设置为根据摘要描述向相邻路由器发送链路状态请求报文。
与相关技术相比较，本发明实施例至少具有下列优点：
本发明实施例提供的一种路由器区分优先级的数据库同步的方法及其装置、以及路由器及其系统，链路状态路由协议在数据库同步过程中，区分拓扑链路状态报文和叶子链路状态报文，即区分重要性地进行数据库同步，优先同步影响网络拓扑结构的重要性高的拓扑链路状态报文，在拓扑链路状态报文同步完成的情况下再进行重要性相对低的其它链路状态报文(叶子链路状态报文)的同步，从而可以加快路由的收敛速度。
还需要说明的是，在本文中，术语“包括”、“包含”或者其任何其他变体意在涵盖非排他性的包含，从而使得包括一系列要素的过程、方法、物品或者装置不仅包括那些要素，而且还包括没有明确列出的其他要素，或者是还包括为这种过程、方法、物品或者装置所固有的要素。在没有更多限制的情况下，由语句“包括一个……”限定的要素，并不排除在包括该要素的过程、方法、物品或者装置中还存在另外的相同要素。
上述本发明实施例序号仅仅为了描述，不代表实施例的优劣。
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到上述实施例方法可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件，但很多情况下前者是更佳的实施方式。基于这样的理解，本发明的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质(如ROM/RAM、磁碟、光 盘)中，包括若干指令用以使得一台终端设备(可以是手机，计算机，服务器，或者网络设备等)执行本发明各个实施例所述的方法。
本发明实施例还提出了一种计算机可读存储介质，存储有计算机可执行指令，计算机可执行指令用于执行上述描述的任意一个方法。
本领域普通技术人员可以理解上述方法中的全部或部分步骤可通过程序来指令相关硬件(例如处理器)完成，所述程序可以存储于计算机可读存储介质中，如只读存储器、磁盘或光盘等。可选地，上述实施例的全部或部分步骤也可以使用一个或多个集成电路来实现。相应地，上述实施例中的各模块/单元可以采用硬件的形式实现，例如通过集成电路来实现其相应功能，也可以采用软件功能模块的形式实现，例如通过处理器执行存储与存储器中的程序/指令来实现其相应功能。本发明不限于任何特定形式的硬件和软件的结合。
以上所述仅为本发明的优选实施例，并非因此限制本发明的专利范围，凡是利用本发明说明书及附图内容所作的等效结构或流程变换，或直接或间接运用在其它相关的技术领域，均同理包括在本发明的专利保护范围内。
工业实用性
上述技术方案加快了路由的收敛速度。

Claims (14)

  1. 一种路由器数据库的同步方法，包括：
    将链路状态报文区分为拓扑链路状态报文和叶子链路状态报文；
    在相邻路由器同步数据库时，先同步完成所述拓扑链路状态报文，再同步完成所述叶子链路状态报文。
  2. 如权利要求1所述的同步方法，其中，所述先同步完成所述拓扑链路状态报文，再同步完成所述叶子链路状态报文包括：
    建立相邻路由器数据库之间的摘要描述，先将包含拓扑链路状态报文摘要的摘要描述发送给相邻路由器，再将仅包含叶子链路状态报文摘要的摘要描述发送给相邻路由器；接收到相邻路由器的链路状态请求报文，先将链路状态请求报文中请求的拓扑链路状态报文发送给相邻路由器，再将链路状态请求报文中请求的叶子链路状态报文发送给相邻路由器；
    或者，当获得或产生新的链路状态报文时，先将新的拓扑链路状态报文发送给相邻路由器，再将新的叶子链路状态报文发送给相邻路由器；
    或者，当接收到来自相邻路由器的摘要描述，根据接收到的摘要描述先向相邻路由器发送拓扑链路状态报文对应的链路状态请求报文，再向相邻路由器发送叶子链路状态报文对应的链路状态请求报文；接收到来自相邻路由器的链路状态报文，根据接收到的链路状态报文更新数据库。
  3. 如权利要求2所述的同步方法，其中，所述先将包含拓扑链路状态报文摘要的摘要描述发送给相邻路由器，再将仅包含叶子链路状态报文摘要的摘要描述发送给相邻路由器包括：
    建立用于处理摘要描述的摘要描述队列；其中，摘要描述队列包括摘要描述优先队列和摘要描述普通队列；
    将包含拓扑链路状态报文摘要的摘要描述添加到摘要描述优先队列，将仅包含叶子链路状态报文摘要的摘要描述添加到摘要描述普通队列；
    优先发送摘要描述优先队列中的摘要描述，再发送摘要描述普通队列中的摘要描述。
  4. 如权利要求2所述的同步方法，其中，所述先将链路状态请求报文中请求的拓扑链路状态报文发送给相邻路由器，再将链路状态请求报文中请求的叶子链路状态报文发送给相邻路由器包括：
    建立报文发送队列；其中，报文发送队列包括优先报文发送队列和普通报文发送队列；
    将链路状态请求报文中请求的拓扑链路状态报文添加到优先报文发送队列，将链路状态请求报文中请求的叶子链路状态报文添加到普通报文发送队列；
    优先发送优先报文发送队列中的链路状态报文，再发普通报文发送队列中的链路状态报文。
  5. 如权利要求2所述的同步方法，其中，所述先将新的拓扑链路状态报文发送给相邻路由器，再将新的叶子链路状态报文发送给相邻路由器包括：
    建立报文发送队列；其中，报文发送队列包括优先报文发送队列和普通报文发送队列；
    将新的拓扑链路状态报文添加到优先报文发送队列，将新的叶子链路状态报文添加到普通报文发送队列；
    优先发送优先报文发送队列中的链路状态报文，再发普通报文发送队列中的链路状态报文。
  6. 如权利要求2所述的同步方法，其中，所述根据接收到的摘要描述先向相邻路由器发送拓扑链路状态报文对应的链路状态请求报文，再向相邻路由器发送叶子链路状态报文对应的链路状态请求报文包括：
    建立请求队列；其中，请求队列包括优先请求队列和普通请求队列；
    根据接收到的摘要描述确定是否需要向相邻路由器发送链路状态请求报文；
    当确定需要向相邻路由器发送请求拓扑链路状态报文的链路状态请求报文时，将请求拓扑链路状态报文的链路状态请求报文添加到优先请求队列，当确定需要向相邻路由器发送请求叶子拓扑链路状态报文的链路状态请求报 文时，将请求叶子链路状态报文的链路状态请求报文添加到普通请求队列；
    优先发送所述优先请求队列中的链路状态请求报文，再发送所述普通请求队列中的链路状态请求报文。
  7. 一种路由器数据库的同步装置，包括：区分单元和同步单元；其中：
    所述区分单元，设置为将链路状态报文区分为拓扑链路状态报文和叶子链路状态报文；
    所述同步单元，设置为在相邻路由器同步数据库时，先同步完成所述拓扑链路状态报文，再同步完成所述叶子链路状态报文。
  8. 如权利要求7所述的同步装置，其中，所述同步单元包括摘要描述生成模块和链路状态报文发送模块；其中：
    所述摘要描述生成模块，设置为在相邻路由器同步数据库时，建立相邻路由器数据库之间的摘要描述；
    所述链路状态报文发送模块，设置为
    先将包含拓扑链路状态报文摘要的摘要描述发送给相邻路由器，再将仅包含叶子链路状态报文摘要的摘要描述发送给相邻路由器；接收到相邻路由器的链路状态请求报文，先将链路状态请求报文中请求的拓扑链路状态报文发送给相邻路由器，再将链路状态请求报文中请求的叶子链路状态报文发送给相邻路由器；
    或者，当获得或产生新的链路状态报文时，先将新的拓扑链路状态报文发送给相邻路由器，再将新的叶子链路状态报文发送给相邻路由器；
    或者，当接收到来自相邻路由器的摘要描述，根据接收到的摘要描述先向相邻路由器发送拓扑链路状态报文对应的链路状态请求报文，再向相邻路由器发送叶子链路状态报文对应的链路状态请求报文；接收到来自相邻路由器的链路状态报文，根据接收到的链路状态报文更新数据库。
  9. 如权利要求8所述的同步装置，其中，所述链路状态报文发送模块是设置为采用以下方式实现所述先将包含拓扑链路状态报文摘要的摘要描述发送给相邻路由器，再将仅包含叶子链路状态报文摘要的摘要描述发送给相邻 路由器：
    建立用于处理摘要描述的摘要描述队列；其中，摘要描述队列包括摘要描述优先队列和摘要描述普通队列；
    将包含拓扑链路状态报文摘要的摘要描述添加到摘要描述优先队列，将仅包含叶子链路状态报文摘要的摘要描述添加到摘要描述普通队列；
    优先发送摘要描述优先队列中的摘要描述，再发送摘要描述普通队列中的摘要描述。
  10. 如权利要求8所述的同步装置，其中，所述链路状态报文发送模块是设置为采用以下方式实现所述先将链路状态请求报文中请求的拓扑链路状态报文发送给相邻路由器，再将链路状态请求报文中请求的叶子链路状态报文发送给相邻路由器包括：
    建立报文发送队列；其中，报文发送队列包括优先报文发送队列和普通报文发送队列；
    将链路状态请求报文中请求的拓扑链路状态报文添加到优先报文发送队列，将链路状态请求报文中请求的叶子链路状态报文添加到普通报文发送队列；
    优先发送优先报文发送队列中的链路状态报文，再发普通报文发送队列中的链路状态报文。
  11. 如权利要求8所述的同步装置，其中，所述链路状态报文发送模块是设置为采用以下方式实现所述先将新的拓扑链路状态报文发送给相邻路由器，再将新的叶子链路状态报文发送给相邻路由器包括：
    建立报文发送队列；其中，报文发送队列包括优先报文发送队列和普通报文发送队列；
    将新的拓扑链路状态报文添加到优先报文发送队列，将新的叶子链路状态报文添加到普通报文发送队列；
    优先发送优先报文发送队列中的链路状态报文，再发普通报文发送队列中的链路状态报文。
  12. 如权利要求8所述的同步装置，其中，所述链路状态报文发送模块是设置为采用以下方式实现所述根据接收到的摘要描述先向相邻路由器发送拓扑链路状态报文对应的链路状态请求报文，再向相邻路由器发送叶子链路状态报文对应的链路状态请求报文包括：
    建立请求队列；其中，请求队列包括优先请求队列和普通请求队列；
    根据接收到的摘要描述确定是否需要向相邻路由器发送链路状态请求报文；
    当确定需要向相邻路由器发送请求拓扑链路状态报文的链路状态请求报文时，将请求拓扑链路状态报文的链路状态请求报文添加到优先请求队列，当确定需要向相邻路由器发送请求叶子拓扑链路状态报文的链路状态请求报文时，将请求叶子链路状态报文的链路状态请求报文添加到普通请求队列；
    优先发送所述优先请求队列中的链路状态请求报文，再发送所述普通请求队列中的链路状态请求报文。
  13. 一种路由器，所述路由器包括如权利要求7至12任一项所述的同步装置。
  14. 一种路由器系统，所述路由器系统包括至少两个如权利要求13所述的路由器。
PCT/CN2016/094387 2016-02-25 2016-08-10 路由器及其系统、数据库的同步方法及其装置 WO2017143733A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610105544.3A CN107124361A (zh) 2016-02-25 2016-02-25 路由器及其系统、数据库的同步方法及其装置
CN201610105544.3 2016-02-25

Publications (1)

Publication Number Publication Date
WO2017143733A1 true WO2017143733A1 (zh) 2017-08-31

Family

ID=59685807

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/094387 WO2017143733A1 (zh) 2016-02-25 2016-08-10 路由器及其系统、数据库的同步方法及其装置

Country Status (2)

Country Link
CN (1) CN107124361A (zh)
WO (1) WO2017143733A1 (zh)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108111423B (zh) * 2017-12-28 2020-11-17 迈普通信技术股份有限公司 流量传输管理方法、装置及网络分路设备
CN109542982A (zh) * 2018-11-28 2019-03-29 福建南威软件有限公司 数据库之间数据交换优先调度的方法

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030218988A1 (en) * 2002-05-21 2003-11-27 Min-Ho Han Network for transferring active packet and method for employing same
CN1889520A (zh) * 2006-07-25 2007-01-03 华为技术有限公司 一种基于ospf的路由信息更新方法和网络设备
CN1929443A (zh) * 2006-09-15 2007-03-14 清华大学 一种低负载、可靠的链路状态路由协议洪泛方法
CN101316229A (zh) * 2007-06-01 2008-12-03 华为技术有限公司 对链路状态广播进行同步的方法与路由器
CN103236990A (zh) * 2013-05-13 2013-08-07 杭州华三通信技术有限公司 一种路由信息同步的方法和设备

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030218988A1 (en) * 2002-05-21 2003-11-27 Min-Ho Han Network for transferring active packet and method for employing same
CN1889520A (zh) * 2006-07-25 2007-01-03 华为技术有限公司 一种基于ospf的路由信息更新方法和网络设备
CN1929443A (zh) * 2006-09-15 2007-03-14 清华大学 一种低负载、可靠的链路状态路由协议洪泛方法
CN101316229A (zh) * 2007-06-01 2008-12-03 华为技术有限公司 对链路状态广播进行同步的方法与路由器
CN103236990A (zh) * 2013-05-13 2013-08-07 杭州华三通信技术有限公司 一种路由信息同步的方法和设备

Also Published As

Publication number Publication date
CN107124361A (zh) 2017-09-01

Similar Documents

Publication Publication Date Title
US11863624B2 (en) Fast propagation of recent transactions over a blockchain network
EP3035611B1 (en) System and method for distance-based interest forwarding
US20130070753A1 (en) Consistent updates for packet classification devices
EP1972127B1 (en) Virtual networks
US20200267074A1 (en) Secure route identification method and apparatus
WO2022036764A1 (en) Method and apparatus for protecting stateful service function paths
EP2947845A1 (en) Border property validation for named data networks
EP3337093B1 (en) Optimizing information related to a route and/or a next hop for multicase traffic
US7539191B1 (en) System and method for securing route processors against attack
US8347353B1 (en) Addressing security in asymmetrical networks
WO2019196562A1 (zh) 报文处理方法、装置、存储介质及处理器
WO2017161340A1 (en) Systems and methods for sharing network information
US11088937B1 (en) System and method for synchronized route update
CN116633934A (zh) 负载均衡方法、装置、节点及存储介质
WO2017143733A1 (zh) 路由器及其系统、数据库的同步方法及其装置
US20110170448A1 (en) Management of routing topology in a network
WO2014029287A1 (zh) 隧道负荷分担方法及装置
WO2021000619A1 (zh) 报文转发方法及装置
US9998807B2 (en) Method and apparatus for establishing trail network
WO2016184012A1 (zh) 一种优先收发hello报文的方法及路由设备
CN110830370A (zh) 一种基于ospf协议的ibgp传递路由更新方法
CN113014481B (zh) 传输链路状态通告的方法、装置、设备及存储介质
CN105721320B (zh) 链路状态通告信息同步实现方法、装置及系统
CN115996198A (zh) 链路状态信息的处理方法、装置、网络设备及存储介质
CN102957609A (zh) 消息路由的方法与装置

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16891183

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 16891183

Country of ref document: EP

Kind code of ref document: A1