Information processing method, device, and storage medium

Abstract

The present application discloses an information processing method. The method comprises: a second device obtains first information, wherein the first information is used for instructing the second device to delay publishing an adjacency state between the second device and a first device, or is used for instructing the second device and / or the first device to delay switching a neighbor state machine to the adjacency state, and the second device is a neighboring device of the first device; and the second device delays publishing the adjacency state between the second device and the first device, or delays switching the neighbor state machine to the adjacency state. The present application also discloses a first device, a second device, and a computer-readable storage medium.

Description

Information processing method, device and storage medium

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims priority to Chinese patent application No. 202311013824.8 filed in China on August 11, 2024, the entire contents of which are incorporated herein by reference. Technical Field

[0003] The present application relates to, but is not limited to, the field of communications, and in particular to an information processing method, a first device, a second device computer-readable storage medium, and a program product. Background Art

[0004] A network is typically composed of multiple routing devices, which work together to forward user data. A routing device (e.g., routing device A) can use the sequence number (Seqnum) in the Link-State Advertisement (LSA) from another routing device (e.g., routing device B) in the Link State Database (LSDB) to perform routing calculations, thereby determining the routing path for the user data. For example, routing device A calculates that the user data can reach the destination address (e.g., address D) via routing device B.

[0005] However, when routing devices use Seqnum in LSAs for route calculation, errors may occur in the route calculation results, resulting in the calculation of routing paths that should not exist, creating routing black holes and affecting user data forwarding.

[0006] Summary of the Invention

[0007] The embodiments of the present application provide an information processing method, a first device, a second device, and a computer-readable storage medium, which solve the routing black hole problem in the related art.

[0008] In a first aspect, an embodiment of the present application provides an information processing method, applied to a first device, the method comprising:

[0009] Sending first information to a second device; wherein the first information is used to instruct the second device to delay publishing the adjacent status of the second device and the first device, or to instruct the second device and / or the first device to delay switching the neighbor state machine to the adjacent state; the second device is a neighbor device of the first device.

[0010] In a second aspect, an embodiment of the present application provides an information processing method, applied to a second device, the method comprising:

[0011] Obtaining first information; wherein the first information is used to instruct the second device to delay publishing the adjacency status of the second device and the first device, or to instruct the second device and / or the first device to delay switching the neighbor state machine to the adjacency state; the second device is a neighbor device of the first device;

[0012] Delay publishing the adjacency status of the second device and the first device, or delay switching the neighbor state machine to the adjacency state.

[0013] In a third aspect, an embodiment of the present application provides a first device, wherein the first device includes:

[0014] A first sending module is used to send first information to a second device; wherein the first information is used to instruct the second device to delay publishing the adjacent status of the second device and the first device, or to instruct the second device and / or the first device to delay switching the neighbor state machine to the adjacent state; the second device is a neighbor device of the first device.

[0015] In a fourth aspect, an embodiment of the present application provides a second device, the second device including:

[0016] a second processing module, configured to obtain first information; wherein the first information is used to instruct the second device to delay publishing the adjacency status of the second device and the first device, or to instruct the second device and / or the first device to delay switching the neighbor state machine to the adjacency state; and the second device is a neighbor device of the first device;

[0017] The second processing module is further configured to delay publishing the adjacency status of the second device and the first device, or delay switching the neighbor state machine to the adjacency state.

[0018] In a fifth aspect, an embodiment of the present application provides a first device, the first device comprising:

[0019] A first memory, configured to store executable instructions;

[0020] The first processor is configured to implement the above-mentioned information processing method when executing the executable instructions stored in the first memory.

[0021] In a sixth aspect, an embodiment of the present application provides a second device, the second device including:

[0022] a second memory for storing executable instructions;

[0023] The second processor is configured to implement the above-mentioned information processing method when executing the executable instructions stored in the second memory.

[0024] In a seventh aspect, an embodiment of the present application provides a computer-readable storage medium for storing a computer program, which enables a computer to execute the above-mentioned information processing method.

[0025] Through the above technical solution, the second device in the present application can control itself to delay the release of the adjacent status with the first device through the first information it obtains, or control itself to delay switching the neighbor state machine to the adjacent state, thereby delaying the time for its own routing calculation; in this way, in the scenario after the first device fails and is restarted, in the process of the first device and the second device re-establishing the adjacent relationship and synchronizing the database, the second device delays its own routing calculation time through the first information, so that the first device has sufficient time to synchronize its newly generated LSA to the second device, and the sequence number in the LSA is greater than the sequence number of the LSA remaining in the LSDB of the second device; then, the second device can perform routing calculation based on the sequence number in the newly generated LSA, thereby solving the problem in the related art that when the routing device uses the Seqnum in the LSA for routing calculation, the routing calculation result may be erroneous, and a routing path that should not exist may be calculated, resulting in a routing black hole, affecting user data forwarding, greatly reducing the probability of user data forwarding failure, thereby ensuring network reliability. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] FIG1 is a schematic diagram of a flow chart of interaction based on the OSPF protocol provided in the related art;

[0027] FIG2 is a schematic flowchart of an information processing method according to an embodiment of the present application;

[0028] FIG3 is a schematic diagram of a TLV data format provided in an embodiment of the present application;

[0029] FIG4 is a schematic diagram of another TLV data format provided in an embodiment of the present application

[0030] FIG5 is a second schematic flow chart of the information processing method provided in an embodiment of the present application;

[0031] FIG6 is a second schematic flow chart of the information processing method provided in an embodiment of the present application;

[0032] FIG7 is a second schematic flow chart of the information processing method provided in an embodiment of the present application;

[0033] FIG8 is a schematic block diagram of the structure of a first device provided in an embodiment of the present application;

[0034] FIG9 is a schematic block diagram of the structure of a second device provided in an embodiment of the present application;

[0035] FIG10 is a schematic structural diagram of a first device provided in an embodiment of the present application;

[0036] FIG11 is a schematic structural diagram of a second device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0037] The following will clearly and completely describe the technical solutions in the embodiments of the present application in conjunction with the drawings in the embodiments of the present application. Here, the "another" or "yet another" mentioned in the description of the drawings does not refer to a specific embodiment. The various embodiments of the present application can be combined with each other without conflict.

[0038] It should be understood that the “embodiments of the present application” or “the aforementioned embodiments” mentioned throughout the specification mean that the specific features, structures or characteristics related to the embodiments are included in at least one embodiment of the present application. Therefore, “in the embodiments of the present application” or “in the aforementioned embodiments” appearing throughout the specification do not necessarily refer to the same embodiment. In addition, these specific features, structures or characteristics can be combined in one or more embodiments in any suitable manner. In the various embodiments of the present application, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application. The serial numbers of the above-mentioned embodiments of the present application are for description only and do not represent the advantages and disadvantages of the embodiments.

[0039] Before explaining this application, here is an explanation of the routing protocol in the related art:

[0040] An Interior Gateway Protocol (IGP) is a protocol used to exchange routing information between gateways (hosts and routers) within an autonomous network. IGPs include distance vector routing protocols and link-state routing protocols. Open Shortest Path First (OSPF) is a link-state routing protocol that uses the Shortest Path First (SPF) algorithm. Each router is responsible for discovering and maintaining relationships with its neighbors. It describes its known neighbor list and link information through Link State Update (LSU) messages. Through reliable flooding, it periodically interacts with other routers within the autonomous system (AS) to learn the network topology of the entire AS. Routers at the AS boundary also inject routing information from other ASes, thereby obtaining routing information for the entire Internet. LSAs are regenerated at specific intervals or when link status changes. Routers advertise these new LSAs through a flooding mechanism, enabling real-time routing updates. OSPF is a widely used dynamic routing protocol with advantages such as fast convergence of routing changes, no routing loops, support for variable-length subnet masks (VLSM) and summarization, and hierarchical regionalization. When OSPF is used in a network, most routes are automatically calculated and generated by the protocol, eliminating the need for manual configuration by network administrators. When the network topology changes, the protocol automatically calculates and corrects routes, greatly facilitating network management.

[0041] Figure 1 is a flow chart of interaction based on the OSPF protocol provided in the related art. Among them, the network includes Router A and Router B; Router A's local routing loopback address is 10.1.1.1 / 32; if Router A restarts abnormally (Restarting), Router A enters the neighbor relationship closed (Down) state from the adjacency state, that is, the Full state. In this state, the process has not exchanged information with any neighbor and is waiting to enter the Init state; this is the initial stage of the neighbor session, indicating that no Hello data packet is received from the neighbor router within the neighbor failure time interval. After the restart, Router A's local route 10.1.1.1 is deleted. Router B is in the Full state, which indicates that the link state database is synchronized. The link state database synchronization process is completed, and a complete adjacency relationship is formed between the Router and the neighbor. After Router A Restarting, Router A and Router B start to synchronize the database and perform the following steps:

[0042] Step 101: Router A sends a 1-way Hello message to Router B.

[0043] It should be noted that Router A sends a 1-way Hello message to Router B to establish a relationship with Router B. When Router B receives the 1-way Hello message, Router B enters the Initialization (Init) state.

[0044] Step 102: Router B sends a 2-way Hello message to Router A.

[0045] It should be noted that when Router A receives the 2-way Hello message sent by Router B, the 2-way Hello message contains Router B's router identity (ID); if Router A and Router B do not need to form an adjacency relationship, the neighbor state machine remains in this state. If Router A and Router B need to form an adjacency relationship, Router B enters the exchange initialization (Exstart) state.

[0046] Step 103: Router A sends a 2-way Hello message to Router B.

[0047] Note that after Router B receives the 2-way Hello message from Router A, which contains Router A's router ID, the neighbor state machine remains in this state if Router A and Router B do not need to form an adjacency. If Router A and Router B do need to form an adjacency, Router A enters the Exstart state.

[0048] It should be noted that the Router negotiates in the Exstart state to determine how to ensure stable and effective transmission during the subsequent database synchronization process.

[0049] It should be noted that Hello messages are periodically sent to discover and maintain OSPF neighbor relationships.

[0050] Step 104: Router A and Router B exchange database description messages.

[0051] It should be noted that after the neighbor state of the Router changes to the Exstart state, the Router starts sending Database Description (DD) messages to the neighbor. DD messages describe the local LSDB summary information and are used for database synchronization between the two devices.

[0052] In some embodiments of the present application, when Router A's neighbor state changes to ExStart, Router A sends its first DD message. This message declares Router A as the Master. When Router B's neighbor state changes to ExStart, Router B sends its first DD message. After Router A receives this message, it changes the neighbor state from ExStart to Exchange. When Router A's neighbor state changes to Exchange, Router A sends a new DD message. After Router B receives this message, it changes the neighbor state from ExStart to Exchange.

[0053] It should be noted that in the Exchange state, the router and its neighbors send DD messages containing link state information summaries to each other; after the master-slave relationship negotiation is completed, they start exchanging DD messages.

[0054] Step 105: Router A and Router B exchange request messages.

[0055] Step 106: Router A and Router B exchange update messages.

[0056] During steps 105 and 106, after Router A sends a message to Router B and completes sending the request message, Router A's neighbor state changes to Loading. After Router B sends a message to Router A and completes sending the request message, Router B's neighbor state changes to Loading. The Loading state indicates that the routers have completed DD message exchange. Furthermore, Router B sends a message to Router A. After receiving this message, Router B changes the neighbor state to Full.

[0057] It should be noted that after the local request queue of Router B is cleared, the neighbor state changes to Full state, and a new Router LSA is generated. This LSA contains the adjacency relationship between B and A.

[0058] Step 107: Router A sends a Request (Seq: N) message to Router B.

[0059] It should be noted that Router A sends a Link State Request message to Router B. This message is used to request specific link state information; for example, requesting the sequence number (Seqnum, or Seq) of the LSA in Router B's LSDB, such as N.

[0060] Step 108: Router B sends an Update (Seq: N, with the stub link 10.1.1.1) message to Router A.

[0061] It should be noted that Router B sends a Link State Update message to Router A. The message includes detailed link state information, such as the LSA sequence number (Seqnum, or Seq), such as N; and the message carries Router A's local route 10.1.1.1 (with the stub link 10.1.1.1).

[0062] It should be noted that after Router A receives the Update message, the neighbor status of Router A changes from Loading to Full.

[0063] Step 109: Router A sends a "Self, re-originate" (Seq: N+1, without the stub link 10.1.1.1) message to Router B.

[0064] It should be noted that after Router A receives the Update message from Router B, it discovers that the message contains an LSA it generated. The sequence number (Seqnum, or Seq) of this LSA, for example, N, is greater than the LSA instance in the local database. Therefore, Router A initiates the re-origination process and publishes the LSA with the sequence number increased by 1, for example, N+1, to Router B. This message does not contain Router A's local route 10.1.1.1 (without the stub link 10.1.1.1).

[0065] It should be noted that if Router B performs route calculation after step 109, Router B can determine that the route 10.1.1.1 is unreachable, and the black hole is eliminated.

[0066] It should be noted that if Router B performs route calculation during steps 107 to 109, it will believe that the route 10.1.1.1 is reachable, but in fact the route no longer exists after Router A restarts, which means a route blackhole is generated. That is, a route calculation blackhole phenomenon will occur in steps 107 to 109.

[0067] FIG2 is a flow chart of an information processing method provided in an embodiment of the present application. As shown in FIG2 , the method is applied to a second device, and the method includes:

[0068] Step 201: Obtain first information.

[0069] The first information is used to instruct the second device to delay publishing the adjacent status of the second device and the first device, or to instruct the second device and / or the first device to delay switching the neighbor state machine to the adjacent state; the second device is a neighbor device of the first device.

[0070] In the embodiment of the present application, the adjacency state may also be referred to as the Full state. It can be understood that the OSPF neighbor state reaches the Full state. In this state, OSPF completes database synchronization and the SPF calculation node is reachable.

[0071] In the embodiment of the present application, delay may also be referred to as inhibition, suspension, suppress, etc.

[0072] In the embodiment of the present application, the second device corresponding to the first device may be one or more.

[0073] The device here can be a router. The first device and the second device can be referred to in various ways. For example, the first device can be referred to as the starting router, and the second device can be referred to as the starting router's neighbor(s). Devices can include mobile devices such as mobile phones, tablets, laptops, personal digital assistants (PDAs), cameras, wearable devices, and in-vehicle devices, as well as fixed devices such as desktop computers.

[0074] In an embodiment of the present application, the first information can be implemented in multiple forms. One implementation method is: the first information can be one or more specific bits in a message. If the bit exists, then after the second device obtains the first information, it will delay the release of the adjacent status of the second device and the first device when entering the Full state according to the indication of the bit. Another implementation method is: the first information can be the value of one or more specific bits in a message. When the value of the specific one or more bits is the first information, after the second device obtains the first information, it will delay the release of the adjacent status of the second device and the first device when entering the Full state according to the indication of the bit. For example, the first information is an SA-bit set. The above are just two feasible implementation methods. In actual situations, there may be multiple possible implementations.

[0075] In the embodiment of the present application, the first information is used to instruct the neighboring device to delay publishing the adjacency status between the restarting device and the neighboring device, that is, the first information can inhibit the neighboring device from publishing the adjacency relationship between the neighboring device and the restarting device.

[0076] In the embodiment of the present application, the neighbor state machine includes the following states: initial state, two-way adjacency (2-WAY) state, initialization state, exchange state, loading state, full state, and neighbor relationship closed state.

[0077] In the embodiment of the present application, the second device includes a neighboring device directly connected to the first device and a neighboring device remotely connected to the first device.

[0078] In the embodiments of the present application, the first device and the second device are valid neighbors on a point-to-point link or in a broadcast network, and can ultimately form a valid adjacency relationship. If the first device and the second device are devices in a broadcast network, the first device can be a designated router (DR) or a backup designated router (BDR).

[0079] It should be noted that a DR is a designated router in a broadcast, multi-access network; a BDR is a backup designated router in a broadcast, multi-access network. All neighbors in a broadcast network synchronize LSA entries only with the DR / BDR, thus reducing OSPF traffic. In broadcast network scenarios, adjacencies are suppressed by the DR / BDR.

[0080] In the embodiment of the present application, “get” can be understood as “make”, “generate”, “get / receive”, “receive”, and “determine”.

[0081] Step 202: Delay publishing the adjacency status of the second device and the first device, or delay switching the neighbor state machine to the adjacency state.

[0082] In the embodiment of the present application, there are multiple ways to implement the delayed release of the first information obtained by the second device:

[0083] For example, after the second device obtains the first information, it may be possible to immediately delay publishing the adjacency status between the second device and the first device.

[0084] For another example, receiving the first information is only one factor in the second device's decision to delay publishing the adjacency status between the second device and the first device. The second device must also determine whether other requirements are met, such as whether the device has entered the Full state. If the device determines that the device has entered the Full state, then publishing the adjacency status between the second device and the first device may be delayed. Alternatively, if the device determines that the device has not entered the Full state, then the device may simply record receipt of the first information and subsequently delay publishing the information when the device enters the Full state.

[0085] For another example, after receiving the first information, the second device does not immediately perform the delayed release operation, but may perform other operations or make other judgments before performing the delayed release operation.

[0086] An embodiment of the present application discloses an information processing method, a first device, a second device, and a computer-readable storage medium, the method comprising: the second device obtains first information; wherein the first information is used to instruct the second device to delay publishing the adjacent status of the second device and the first device, or to instruct the second device and / or the first device to delay switching the neighbor state machine to the adjacent state; the second device is a neighbor device of the first device; the second device delays publishing the adjacent status of the second device and the first device, or delays switching the neighbor state machine to the adjacent state. That is to say, in the present application, the second device can control itself to delay the release of the adjacent status with the first device through the first information it obtains, or control itself to delay switching the neighbor state machine to the adjacent state, thereby delaying the time for its own routing calculation; in this way, in the scenario after the first device fails and is restarted, in the process of the first device and the second device re-establishing the adjacent relationship and synchronizing the database, the second device delays its own routing calculation time through the first information, so that the first device has sufficient time to synchronize its newly generated LSA to the second device, and the sequence number in the LSA is greater than the sequence number of the LSA remaining in the LSDB of the second device; then, the second device can perform routing calculation based on the sequence number in the newly generated LSA, thereby solving the problem in the related art that when the routing device uses the Seqnum in the LSA for routing calculation, the routing calculation result may be incorrect, and a routing path that should not exist may be calculated, resulting in a routing black hole, affecting user data forwarding, greatly reducing the probability of user data forwarding failure, thereby ensuring the reliability of the network.

[0087] It should be noted that before a device in the network unexpectedly restarts, LSAs will remain in the LSDB of the device's neighboring devices. Here, the remaining LSAs include but are not limited to the Router LSA type, but also include other types of LSAs. After the device restarts, when the device re-establishes the adjacency relationship with the neighboring device and synchronizes the database, the neighboring device may generate a routing black hole when performing routing calculations based on these remaining LSAs. Therefore, the present application delays the routing calculation time of the neighboring device, giving the restarting device sufficient time to synchronize its newly generated LSAs with the neighboring device, so that the neighboring device can perform routing calculations after receiving the newly generated LSAs. In this way, the routing black hole problem can be solved.

[0088] In the embodiment of the present application, step 201, obtaining the first information, can be implemented through step A1 or step A2:

[0089] Step A1: Receive first information sent by a first device.

[0090] The first information is used to instruct the second device to delay publishing the adjacent status of the second device and the first device, or to instruct the second device and / or the first device to delay switching the neighbor state machine to the adjacent state; the second device is a neighbor device of the first device.

[0091] In an embodiment of the present application, a first device sends first information to a second device; and the second device receives the first information sent by the first device.

[0092] In the embodiment of the present application, the first device may correspond to one or more second devices. When there are multiple second devices, the first device sends corresponding first information to each of the multiple second devices, instructing each second device to delay publishing the adjacency status between the second device and the first device. The second device receives the first information sent by the first device.

[0093] Here, the first information can be implemented in multiple forms. One implementation method is: the first information can be one or more specific bits in a message. If the bit exists, then after the second device receives the first information, it will delay the release of the adjacent status of the second device and the first device when entering the Full state according to the indication of the bit. Another implementation method is: the first information can be the value of one or more specific bits in a message. When the value of the specific one or more bits is the first information, after the second device receives the first information, it will delay the release of the adjacent status of the second device and the first device when entering the Full state according to the indication of the bit. For example, the first information is an SA-bit set. The above are just two feasible implementation methods. In actual situations, there may be multiple possible implementations.

[0094] In some embodiments, a first device sends a Hello message carrying first information to a second device. Here, the first device encapsulates the first information in a type-length-value (TLV) data block in the Hello message, and sends the Hello message encapsulated with the first information to the second device.

[0095] In some embodiments, a second device receives a Hello message sent by a first device and carrying first information. Here, the second device receives a Hello message sent by the first device and encapsulating the first information; wherein the first information is encapsulated in a type-length-value data block in the Hello message; wherein the TLV data block includes at least one of the following: a type 1 option and flags TLV data block; a type 19 reverse metric TLV data block; the first information includes an nth bit added to the type 1 option and flags TLV data block or the type 19 reverse metric TLV data block, such as an SA-bit; and n is a positive integer.

[0096] It should be noted that the TLV data block includes a type value field, a length value field, and an identification field; the identification field includes identification information, such as SA-bit, that is, the first information.

[0097] It should be noted that the TLVs carrying the SA bit include:

[0098] The undefined SA-bit is added to the Type 1 Option and Flags TLV described in OSPF-related protocol specifications, such as RFC5613.

[0099] The undefined SA-bit is added to the Type 19 Reverse Metric TLV described in OSPF-related protocol specifications, such as RFC9339.

[0100] FIG3 is a schematic diagram of a TLV data format provided in an embodiment of the present application; FIG4 is a schematic diagram of another TLV data format provided in an embodiment of the present application.

[0101] As shown in Figure 3, the length value field in the TLV is 4; the value of the type field is 1; the TLV also includes an Extended Options and Flags field; this application adds a to-be-defined flag SA-bit in the Extended Options and Flags field; wherein, in the Extended Options Bit of the Extended Options and Flags field, 0x00000001 corresponds to LR-bit, 0x00000002 corresponds to RS-bit, 0x00000004 corresponds to I-bit, 0x00000008 corresponds to F-bit, 0x00000010 corresponds to B-bit, 0x00000020 corresponds to FR-bit, and to be determined (TBD) corresponds to SA-bit.

[0102] As shown in Figure 4, the length value field in the TLV is 4; the value of the type field is 19; the TLV also includes an MTID field, a Flags field, and a Reverse Metric field; wherein the MTID field is used to characterize the multi-topology identifier of the link; the Reverse Metric field carries the value or offset of the RM to replace or add to the provided link metric. This application adds a to-be-defined tag SA-bit to the Flags field; wherein, in the Flags field, 0x00000001 corresponds to the H-bit, 0x00000002 corresponds to the O-bit, and TBD corresponds to the SA-bit.

[0103] In some embodiments, the first device sends a database description message carrying the first information to the second device, and the second device receives the database description message carrying the first information sent by the first device.

[0104] In the embodiment of the present application, the method of sending the first information includes: in-band, out-of-band, media, signaling, data, message, control plane, user plane, etc.

[0105] Step A2: When it is detected that the neighbor state machine of the first device switches to the exchange initialization state, and the local database of the second device contains the link state advertisement sent by the first device, and the link state advertisement includes the adjacency status between the second device and the first device, the second device generates first information.

[0106] In an embodiment of the present application, when the second device, i.e., the neighboring device, detects that the first device, i.e., the restarting device, enters the exchange initialization (ExStart) state, the neighboring device checks the local database. If the local database contains an LSA corresponding to the restarting device, such as Router LSA, Network-LSA, Summary-LSA, Autonomous System Border Router (ASBR)-summary-LSA, and Network Security Situation Awareness (Not-So-Stubby Area, NSSA)-LSA, and the LSA publishes the adjacency relationship between the restarting device and the neighboring device, i.e., the adjacency state, then the second device generates the first information; further, the second device can send the first information to the first device, so that the first device can delay switching the neighbor state machine to the adjacency state; or, the second device directly delays switching its own neighbor state machine to the adjacency state based on the first information.

[0107] It should be noted that when the second device detects that the first device has entered the ExStart state, including when the second device determines that it has entered the ExStart state, it can be determined that the first device has entered the ExStart state; or when the second device obtains from the first device certain information used to characterize that the first device has entered the ExStart state, it can be determined that the first device has entered the ExStart state.

[0108] In some embodiments, the method provided by the embodiments of the present application includes the following:

[0109] Step B1: The second device obtains second information.

[0110] The second information is used to instruct the second device to publish the adjacency status between the second device and the first device, or to instruct the second device and / or the first device to switch the neighbor state machine to the adjacency state.

[0111] Here, the second information can be implemented in multiple forms. One implementation method is: the second information can be one or more specific bits in a certain message. If the bit exists, then after the second device obtains the second information, it will publish the adjacent status of the second device and the first device according to the indication of the bit when entering the Full state. Another implementation method is: the second information can be the value of one or more specific bits in a certain message. When the value of the specific one or more bits is the second information, after the second device obtains the second information, it will publish the adjacent status of the second device and the first device according to the indication of the bit when entering the Full state. For example, the second information is SA-bit clear. The above are just two feasible implementation methods. In actual situations, there may be multiple possible implementations.

[0112] In the embodiment of the present application, if the first information and the second information represent the value of one or more specific bits, the first information and the second information may be different values.

[0113] In the embodiments of the present application, if the first information and the second information represent one or more specific bits in a message, the first information may be the same as or different from the second information. If at least one of the first information and the second information contains multiple bits, the first information may not overlap with the second information, may completely overlap with it, or may partially overlap with it.

[0114] In the embodiment of the present application, “get” can be understood as “make”, “generate”, “get / receive”, “receive”, and “determine”.

[0115] It should be noted that the content indicated by the second information may be opposite to the content indicated by the first information; in some embodiments of the present application, the first information is suppression information, and the second information is information for releasing the suppression.

[0116] In some embodiments, the solutions to be protected by this application include the following:

[0117] Start the timer; when the timer times out or the timer is canceled, the second device cancels the operation of delaying the release of the neighbor status of the second device and the first device.

[0118] The timer here can be started by the first device or the second device; in the scenario where the timer is started for the first device, the timer can be started when the first device sends the first information to the second device, and when the first device determines that the timer has timed out or the timer is canceled, it sends to the second device information to instruct the second device to cancel the operation of delaying the release of the adjacent status of the second device and the first device.

[0119] In the scenario where the timer is turned on for the second device, when the second device generates the first information, the timer can be turned on, and when the second device determines that the timer has expired or the timer has been canceled, the second device cancels the operation of delaying the release of the adjacent status of the second device and the first device.

[0120] Here, the timer timeout period can be set uniformly or preset by the user according to the actual application scenario. This application does not make any specific restrictions on the timeout period.

[0121] In the embodiment of the present application, the timer can be set in the first device or in the second device.

[0122] In the embodiment of the present application, when database synchronization is completed between the first device and the second device, the second device obtains the second information.

[0123] In the embodiment of the present application, when the first device regenerates a new link state advertisement, the second device cancels the operation of delaying the release of the adjacency status between the second device and the first device.

[0124] Here, the second device can detect the local database of the first device to determine whether the first device regenerates a new link state announcement; or the second device can detect its own local database to determine whether the first device will send a regenerated link state announcement to the second device; as long as the second device detects that the first device regenerates a new link state announcement in the local database of the first device, or the second device detects that the first device regenerates a new link state announcement in its own local database, the second device cancels the operation of delaying the release of the adjacency status between the second device and the first device.

[0125] In the embodiment of the present application, step B1, the second device obtaining the second information, can be implemented through step B11 or step B12:

[0126] Step B11: The second device receives the second information sent by the first device.

[0127] The second information is used to instruct the second device to publish the adjacency status between the second device and the first device, or to instruct the second device and / or the first device to switch the neighbor state machine to the adjacency state.

[0128] In an embodiment of the present application, a first device sends second information to a second device; and the second device receives the second information sent by the first device. Here, the second information can be implemented in multiple ways. One implementation is that the second information can be one or more specific bits in a message. If the bit exists, the first device sends the second information to the second device. After the second device receives the second information, it publishes the adjacency status of the second device and the first device according to the indication of the bit when entering the Full state. Another implementation is that the second information can be the value of one or more specific bits in a message. When the value of the one or more specific bits is the second information, the first device sends the second information to the second device. After the second device receives the second information, it publishes the adjacency status of the second device and the first device according to the indication of the bit when entering the Full state. For example, the second information is SA-bit clear. The above are just two feasible implementations. In actual situations, there may be multiple possible implementations.

[0129] In the embodiment of the present application, the first device sends a Hello message carrying the second information to the second device. The second device receives the Hello message carrying the second information sent by the first device.

[0130] In the embodiment of the present application, the first device sends a database description message carrying the second information to the second device, and the second device receives the database description message carrying the second information sent by the first device.

[0131] In an embodiment of the present application, after the first device is started or restarted, the timer is started; when the timer times out or the timer is canceled (for example, the timer is stopped by manual intervention), the first device sends a second message to the second device.

[0132] Here, the timer timeout period can be set uniformly or preset by the user according to the actual application scenario. This application does not make any specific restrictions on the timeout period.

[0133] In the embodiment of the present application, when database synchronization is completed between the first device and the second device, the first device sends the second information to the second device.

[0134] In the embodiment of the present application, when the first device regenerates a new link state advertisement, the first device sends second information to the second device.

[0135] In the embodiment of the present application, the second information is sent in the following ways: in-band, out-of-band, media, signaling, data, message, control plane, user plane, etc.

[0136] It should be noted that the Hello message carrying the first information and the Hello message carrying the second information can be either 1-way or 2-way Hello messages. They can be the same type of message. For example, both can be 1-way Hello messages. The Hello message carrying the first information can be a 1-way Hello message carrying a certain tag, while the Hello message carrying the second information can be a 1-way Hello message without the tag. The tag is used to suppress the advertisement of adjacency between the neighboring device and the restarting device.

[0137] It should be noted that the database description message carrying the first information and the database description message carrying the second information can be of the same type. For example, the database description message carrying the first information can be a database description reply message carrying a certain flag, while the database description message carrying the second information can be a database description reply message without the flag. The flag is used to suppress the advertisement of the adjacency between the neighboring device and the restarting device.

[0138] Step B12: When database synchronization is completed between the first device and the second device, the second device generates second information.

[0139] Figure 5 is a flowchart of an information processing method provided by an embodiment of the present application. The network includes Router A and Router B; Router A's local routing loopback address is 10.1.1.1 / 32; if Router A abnormally restarts, Router A enters the neighbor relationship Down state from the Full state, while Router B remains in the Full state. After Router A restarts, the process of reestablishing the adjacency relationship between Router A and Router B and performing database synchronization includes the following steps:

[0140] Step 501: Router A sends a 1-way Hello message carrying first information to Router B.

[0141] The 1-way Hello message carries first information, such as an SA-bit, which is used to instruct Router B to delay advertising the adjacency status between Router B and Router A; and simultaneously starts a timer.

[0142] This application can refer to the description in the Intermediate System to Intermediate System (IS-IS) protocol RFC8706, and carry tag information in the restart TLV. In accordance with the OSPF protocol RFC5613, the first information, namely tag information, which can also be called SA bit, is carried in the link-local signaling (LLS) of the Hello message. The tag information identifies the device that receives the Hello message carrying the tag information and suppresses the publication of its adjacency relationship with the restarting device; until a Hello message with the tag information cleared is received.

[0143] Here, the neighboring device suppressing the advertisement of the adjacency relationship between the neighboring device and the restarting device includes the neighboring device delaying the advertisement of the adjacency status between the neighboring device and the restarting device.

[0144] It should be noted that when the device suppresses the publication of its adjacency relationship with the restarting device, the neighbor state of the device can be normally migrated to the Full state; that is, the suppression scheme of this application is synchronized with the previous protocol interaction of the device, and the suppression scheme does not affect the local behavior of the device, such as the routing calculation.

[0145] It should be noted that Router A sets a timer after startup. Before the timer expires, it sends a Hello message with the SA bit. After the timer expires or the database synchronization between Router A and its neighbor is complete, Router A sends a Hello message without the SA bit.

[0146] It should be noted that after Router B receives the Hello message carrying the SA bit, it sets the adjacency relationship with Router A to the suppress state and suppresses the advertisement of the corresponding adjacency relationship in LSAs.

[0147] Step 502: Router B sends a 2-way Hello message to Router A.

[0148] Step 503: Router A sends a 2-way Hello message to Router B.

[0149] Step 504: Router A and Router B exchange DD messages.

[0150] Step 505: Router A and Router B exchange Request messages.

[0151] Step 506: Router A and Router B exchange Update messages.

[0152] In this embodiment of the present application, when Router B reaches the Full state or generates a Router LSA / Network LSA, if Router B sets the adjacency to the suppress state, the adjacency between Router B and Router A is not advertised. If Router B does not set the adjacency to the suppress state, neighbor state transition and Router LSA / Network LSA generation proceed normally.

[0153] Step 507: Router A sends a Request (Seq: N) message to Router B.

[0154] Step 508: Router B sends an Update (Seq: N, with the stub link 10.1.1.1) message to Router A.

[0155] In the embodiment of the present application, when Router A receives the LSA updated by Router B, it finds that the LSA is generated by itself and is newer than the local database, so it regenerates the LSA.

[0156] Step 509: Router A sends a "Self, re-originate" (Seq: N+1, without the stub link 10.1.1.1) message to Router B.

[0157] It should be noted that, since Router B suppresses advertising the adjacency between Router B and Router A (suppresses advertising B->A) during steps 507 to 509, 10.1.1.1 is still unreachable through Router A.

[0158] Step 510: Router A sends a 1-way Hello message carrying second information to Router B.

[0159] In this embodiment of the present application, after database synchronization is complete or a timer expires, Router A sends a 1-way Hello message carrying second information instructing Router B to advertise the adjacency status between Router B and Router A. For example, this message is a 1-way Hello message with the SA-bit cleared. After receiving the 1-way Hello message with the SA-bit cleared, Router B exits the suppressed state, transitions to the neighbor state normally, and advertises the adjacency between Router B and Router A (Advertise B->A).

[0160] Figure 6 is a flow chart of an information processing method provided by an embodiment of the present application. The network includes Router A and Router B; Router A's local routing loopback address is 10.1.1.1 / 32; if Router A abnormally restarts, Router A enters the neighbor relationship Down state from the Full state, while Router B remains in the Full state. After Router A restarts, the process of reestablishing the adjacency relationship between Router A and Router B and performing database synchronization includes the following steps:

[0161] Step 601: Router A sends a 1-way Hello message to Router B.

[0162] Step 602: Router B sends a 2-way Hello message to Router A.

[0163] Step 603: Router A sends a 2-way Hello message to Router B, and Router B generates first information.

[0164] In this embodiment of the present application, when Router B enters the ExStart state, it checks its local database. If a Router LSA generated by Router A exists, and the LSA publishes the adjacency relationship between Router B and Router A, it is considered to have entered the adjacency publication suppression state and generates a first message. Here, the first message is used to instruct Router B to delay publishing the adjacency status between Router B and Router A.

[0165] In the embodiment of the present application, a timer Timer is started to record the sequence number N of the LSA (start timer, record seqnum N).

[0166] Step 604: Router A and Router B exchange DD messages.

[0167] Step 605: Router A and Router B exchange Request messages.

[0168] Step 606: Router A and Router B exchange Update messages.

[0169] Step 607: Router A sends a Request (Seq: N) message to Router B.

[0170] Step 608: Router B sends an Update (Seq: N, with the stub link 10.1.1.1) message to Router A.

[0171] In the embodiment of the present application, when Router A receives the LSA updated by Router B, it finds that it is generated by itself and is newer than the local database, so it regenerates the LSA.

[0172] Step 609: Router A sends a "Self, re-originate" (Seq: N+1, without the stub link 10.1.1.1) message to Router B, and Router B generates a second message.

[0173] In the embodiment of the present application, when Router B's timer expires or a refresh LSA with sequence number Seqnum of N+1 is received from Router A (Timer expire or receive Isa with N+1), Router B generates second information, where the second information is used to instruct Router B to publish the adjacency status between Router B and Router A; Router B exits the suppression state based on the second information, performs neighbor state machine migration normally, and generates Router LSA / Network LSA.

[0174] In an embodiment of the present application, after Router B senses that the adjacency state with Router A has reached the ExStart state, it checks the local database. If the Router LSA generated by Router A exists in the local database, and the LSA publishes the adjacency relationship between Router A and Router B, the local timer controller is started, or the sequence number Seqnum N of the Router LSA in the database is recorded. Before the timer expires or before the peer Router LSA with the sequence number Seqnum N+1 is received, the publication of the adjacency relationship between Router B and Router A is suppressed.

[0175] Figure 7 is a flow chart of an information processing method provided by an embodiment of the present application. The network includes Router A and Router B; the local routing loopback address of Router A is 10.1.1.1 / 32; if Router A is abnormally restarting, Router A enters the neighbor relationship Down state from the full adjacency state, and Router B is in the full adjacency state. The present application can suppress the migration of the neighbor state machine between Router A and Router B to ensure that the neighbor state machine can normally migrate to the Full state after the restart device refreshes the LSA. For example, by suppressing the restart device from sending a DD message carrying the M-bit; the specific process is shown in Figure 7, and the method includes:

[0176] Step 701: Router A sends a 1-way Hello message to Router B.

[0177] Step 702: Router B sends a 2-way Hello message to Router A.

[0178] Step 703: Router A sends a 2-way Hello message to Router B.

[0179] Step 704: Router A and Router B exchange DD packets.

[0180] Step 705: Router A sends a DD message carrying the first information to Router B.

[0181] In an embodiment of the present application, when Router A exchanges DD messages with Router B, Router A sends the last DD message, and Router A sends to Router B a DD message carrying first information for instructing Router A and / or Router A to delay switching the neighbor state machine to the adjacent state, such as a DD message carrying an M-bit. Router B receives the DD message carrying the M-bit, suppresses the migration of its neighbor state machine, and causes the neighbor state to remain in the Exchange state.

[0182] Step 706: Router A sends a Request (Seq: N) message to Router B.

[0183] Step 707: Router B sends an Update (Seq: N, with the stub link 10.1.1.1) message to Router A.

[0184] In the embodiment of the present application, when Router A receives the LSA updated by Router B, it finds that the LSA is generated by itself and is newer than the local database, so it regenerates the LSA.

[0185] Step 708: Router A sends a "Self, re-originate (Seq: N+1, without the stub link 10.1.1.1)" message to Router B.

[0186] Step 709: Router A sends a DD message carrying the second information to Router B.

[0187] In an embodiment of the present application, after database synchronization is completed or the timer times out, Router A sends a DD message carrying second information for instructing Router A and / or Router A to switch the neighbor state machine to the adjacent state, for example, sending a DD message with the M-bit cleared; after Router B receives the message, it continues the neighbor state machine migration.

[0188] An embodiment of the present application provides a first device, which can be applied to an information processing method provided in an embodiment of the present application. As shown in FIG8 , the first device 8 includes:

[0189] The first sending module 801 is used to send first information to the second device; wherein the first information is used to instruct the second device to delay publishing the adjacent status of the second device and the first device, or to instruct the second device and / or the first device to delay switching the neighbor state machine to the adjacent state; the second device is a neighbor device of the first device.

[0190] In other embodiments of the present application, the first sending module 801 is further configured to send second information to the second device;

[0191] The second information is used to instruct the second device to publish the adjacency status between the second device and the first device, or to instruct the second device and / or the first device to switch the neighbor state machine to the adjacency state.

[0192] In other embodiments of the present application, the first sending module 801 is further configured to send a Hello message carrying the first information to the second device; or send a database description message carrying the first information to the second device.

[0193] In other embodiments of the present application, the first sending module 801 is further configured to send a Hello message carrying the second information to the second device; or send a database description message carrying the second information to the second device.

[0194] In other embodiments of the present application, the first processing module 802 is configured to encapsulate the first information in a TLV data block in the Hello message;

[0195] The first sending module 801 is further configured to send a Hello message encapsulating the first information to the second device.

[0196] In other embodiments of the present application, the TLV data block includes at least one of the following: a type 1 option and flag TLV data block; a type 19 reverse metric TLV data block; the first information includes the nth bit added in the type 1 option and flag TLV data block, or the type 19 reverse metric TLV data block; n is a positive integer.

[0197] In other embodiments of the present application, the first processing module 802 is further configured to start a timer after the first device is started or restarted;

[0198] The first sending module 801 is further configured to send second information to the second device when the timer times out, or the timer is canceled, or database synchronization is completed between the first device and the second device, or the first device regenerates a new link state announcement.

[0199] It should be noted that the implementation process of the steps performed by the processing module in this embodiment can refer to the implementation process of the information processing method provided in the embodiment of the present application, and will not be repeated here.

[0200] An embodiment of the present application provides a second device, which can be applied to an information processing method provided in the embodiment corresponding to FIG. 2 . As shown in FIG. 9 , the second device 9 includes:

[0201] A second processing module 901 is configured to obtain first information, wherein the first information is configured to instruct the second device to delay publishing the adjacency status of the second device and the first device, or to instruct the second device and / or the first device to delay switching the neighbor state machine to the adjacency state; the second device is a neighbor device of the first device;

[0202] The second processing module 901 is configured to delay publishing the adjacency status of the second device and the first device, or delay switching the neighbor state machine to the adjacency state.

[0203] In other embodiments of the present application, the second receiving module 902 is configured to receive first information sent by the first device;

[0204] The second processing module 901 is used to generate first information when it is detected that the neighbor state machine of the first device switches to the exchange initialization state, and the link state announcement sent by the first device exists in the local database of the second device, and the link state announcement includes the adjacency status between the second device and the first device.

[0205] In other embodiments of the present application, the second processing module 901 is also used to obtain second information; wherein the second information is used to instruct the second device to publish the adjacent status of the second device and the first device, or to instruct the second device and / or the first device to switch the neighbor state machine to the adjacent state.

[0206] In other embodiments of the present application, the second receiving module 902 is further configured to receive second information sent by the first device;

[0207] The second processing module 901 is further configured to generate second information when database synchronization is completed between the first device and the second device.

[0208] In other embodiments of the present application, the second receiving module 902 is further configured to receive a Hello message carrying the first information sent by the first device; or receive a database description message carrying the first information sent by the first device.

[0209] In other embodiments of the present application, the second receiving module 902 is further configured to receive a Hello message carrying the second information sent by the first device; or receive a database description message carrying the second information sent by the first device.

[0210] In other embodiments of the present application, the second receiving module 902 is further configured to receive a Hello message sent by the first device and encapsulated with the first information; wherein the first information is encapsulated in a TLV data block in the Hello message.

[0211] In other embodiments of the present application, the TLV data block includes at least one of the following: a type 1 option and flag TLV data block; a type 19 reverse metric TLV data block; the first information includes the nth bit added in the type 1 option and flag TLV data block, or the type 19 reverse metric TLV data block; n is a positive integer.

[0212] In other embodiments of the present application, the second processing module 901 is also used to start a timer; and / or; when the timer times out or the timer is canceled, or the database synchronization is completed between the first device and the second device, or the first device regenerates a new link state announcement, the second device cancels the operation of delaying the publication of the adjacent status of the second device and the first device.

[0213] It should be noted that the implementation process of the steps executed by the processing module in this embodiment can refer to the implementation process of the information processing method provided in the embodiment corresponding to Figure 2, and will not be repeated here.

[0214] An embodiment of the present application provides a first device, which can be applied to an information processing method provided in an embodiment of the present application. As shown in FIG10 , the first device 10 (the first device 10 in FIG10 corresponds to the first device 8 in FIG8 ) includes:

[0215] A first processor 1001, a first memory 1002 and a first communication bus 1003, wherein:

[0216] The first communication bus 1003 is used to implement communication connection between the first processor 1001 and the first memory 1002 .

[0217] The first processor 1001 is configured to execute the information processing program stored in the first memory 1002 to implement the following steps:

[0218] Sending first information to a second device; wherein the first information is used to instruct the second device to delay publishing the adjacent status of the second device and the first device, or to instruct the second device and / or the first device to delay switching the neighbor state machine to the adjacent state; the second device is a neighbor device of the first device.

[0219] In other embodiments of the present application, the first processor 1001 is configured to execute the information processing program stored in the first memory 1002 to implement the following steps:

[0220] Sending second information to the second device; wherein the second information is used to instruct the second device to publish the adjacent state of the second device and the first device, or to instruct the second device and / or the first device to switch the neighbor state machine to the adjacent state.

[0221] In other embodiments of the present application, the first processor 1001 is configured to execute the information processing program stored in the first memory 1002 to implement the following steps:

[0222] Sending a Hello message carrying the first information to the second device;

[0223] or,

[0224] Send a database description message carrying the first information to the second device.

[0225] In other embodiments of the present application, the first processor 1001 is configured to execute the information processing program stored in the first memory 1002 to implement the following steps:

[0226] Sending a Hello message carrying second information to the second device;

[0227] or,

[0228] Send a database description message carrying the second information to the second device.

[0229] In other embodiments of the present application, the first processor 1001 is configured to execute the information processing program stored in the first memory 1002 to implement the following steps:

[0230] Encapsulating the first information in a TLV data block in the Hello message;

[0231] Send a Hello message encapsulating the first information to the second device.

[0232] In other embodiments of the present application, the TLV data block includes at least one of the following: a type 1 option and flag TLV data block; a type 19 reverse metric TLV data block; the first information includes the nth bit added in the type 1 option and flag TLV data block, or the type 19 reverse metric TLV data block; n is a positive integer.

[0233] In other embodiments of the present application, the first processor 1001 is configured to execute the information processing program stored in the first memory 1002 to implement the following steps:

[0234] After the first device is started or restarted, start the timer;

[0235] and / or,

[0236] When the timer times out, or the timer is canceled, or the database synchronization between the first device and the second device is completed, or the first device regenerates a new link state advertisement, the second information is sent to the second device.

[0237] The method provided in the embodiment of the present application can be directly embodied as a combination of software modules executed by the first processor 1001. The software module can be located in a storage medium, and the storage medium is located in the first memory 1002. The first processor 1001 reads the executable instructions included in the software module in the first memory 1002 and completes the method provided in the embodiment of the present application in combination with the necessary hardware.

[0238] In some embodiments of the present application, the first processor 1001 may be an integrated circuit chip having signal processing capabilities, such as a general-purpose processor, a digital signal processor (DSP), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc., wherein the general-purpose processor may be a microprocessor or any conventional processor, etc.

[0239] It should be noted that the implementation process of the steps executed by the first processor in this embodiment can refer to the implementation process in the information processing method provided in the embodiment of the present application, and will not be repeated here.

[0240] An embodiment of the present application provides a second device, which can be applied to an information processing method provided in the embodiment corresponding to FIG. 2 . As shown in FIG. 11 , the second device 11 (the second device 11 in FIG. 11 corresponds to the second device 9 in FIG. 9 ) includes:

[0241] A second processor 1101, a second memory 1102, and a second communication bus 1103, wherein:

[0242] The second communication bus 1103 is used to implement communication connection between the second processor 1101 and the second memory 1102 .

[0243] The second processor 1101 is configured to execute the information processing program stored in the second memory 1102 to implement the following steps:

[0244] Obtaining first information; wherein the first information is used to instruct the second device to delay publishing the adjacency status of the second device and the first device, or to instruct the second device and / or the first device to delay switching the neighbor state machine to the adjacency state; the second device is a neighbor device of the first device;

[0245] Delay publishing the adjacency status of the second device and the first device, or delay switching the neighbor state machine to the adjacency state.

[0246] In other embodiments of the present application, the second processor 1101 is configured to execute the information processing program stored in the second memory 1102 to implement the following steps:

[0247] receiving first information sent by a first device;

[0248] Or, when it is detected that the neighbor state machine of the first device switches to the exchange initialization state, and the link state announcement sent by the first device exists in the local database of the second device, and the link state announcement includes the adjacency status between the second device and the first device, the first information is generated.

[0249] In other embodiments of the present application, the second processor 1101 is configured to execute the information processing program stored in the second memory 1102 to implement the following steps:

[0250] Obtaining second information; wherein the second information is used to instruct the second device to publish the adjacent state of the second device and the first device, or to instruct the second device and / or the first device to switch the neighbor state machine to the adjacent state.

[0251] In other embodiments of the present application, the second processor 1101 is configured to execute the information processing program stored in the second memory 1102 to implement the following steps:

[0252] receiving second information sent by the first device; or generating second information when database synchronization is completed between the first device and the second device.

[0253] In other embodiments of the present application, the second processor 1101 is configured to execute the information processing program stored in the second memory 1102 to implement the following steps:

[0254] Receive a Hello message carrying the first information sent by the first device; or receive a database description message carrying the first information sent by the first device.

[0255] In other embodiments of the present application, the second processor 1101 is configured to execute the information processing program stored in the second memory 1102 to implement the following steps:

[0256] receiving a Hello message carrying second information sent by the first device;

[0257] Or, receive a database description message carrying the second information sent by the first device.

[0258] In other embodiments of the present application, the second processor 1101 is configured to execute the information processing program stored in the second memory 1102 to implement the following steps:

[0259] A Hello message encapsulated with first information and sent by a first device is received; wherein the first information is encapsulated in a TLV data block in the Hello message.

[0260] In other embodiments of the present application, the TLV data block includes at least one of the following: a type 1 option and flag TLV data block; a type 19 reverse metric TLV data block; the first information includes the nth bit added in the type 1 option and flag TLV data block, or the type 19 reverse metric TLV data block; n is a positive integer.

[0261] In other embodiments of the present application, the second processor 1101 is configured to execute the information processing program stored in the second memory 1102 to implement the following steps:

[0262] Start the timer;

[0263] and / or;

[0264] When the timer times out or is canceled, or database synchronization is completed between the first device and the second device, or the first device regenerates a new link state announcement, the second device cancels the operation of delaying the release of the adjacency status between the second device and the first device.

[0265] The method provided in the embodiment of the present application can be directly embodied as a combination of software modules executed by the second processor 1101. The software module can be located in a storage medium, and the storage medium is located in the second memory 1102. The second processor 1101 reads the executable instructions included in the software module in the second memory 1102 and combines with the necessary hardware to complete the method provided in the embodiment of the present application.

[0266] In some embodiments of the present application, the second processor 1101 may be an integrated circuit chip having signal processing capabilities, such as a general-purpose processor, a DSP, or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc., wherein the general-purpose processor may be a microprocessor or any conventional processor, etc.

[0267] It should be noted that the implementation process of the steps executed by the second processor in this embodiment can refer to the implementation process of the information processing method provided in the embodiment corresponding to Figure 2, and will not be repeated here.

[0268] An embodiment of the present application provides a computer-readable storage medium, which stores one or more programs. The one or more programs can be executed by one or more processors to implement the implementation process of the information processing method provided in the embodiment of the present application, which will not be repeated here.

[0269] It should be noted that the description of the above storage medium and device embodiments is similar to the description of the above method embodiments and has similar beneficial effects as the method embodiments. For technical details not disclosed in the storage medium and device embodiments of this application, please refer to the description of the method embodiments of this application for understanding.

[0270] The above-mentioned computer storage medium / memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), a magnetic random access memory (FRAM), a flash memory (Flash Memory), a magnetic surface memory, an optical disc, or a compact disc read-only memory (CD-ROM); it can also be various terminals including one or any combination of the above-mentioned memories, such as mobile phones, computers, tablet devices, personal digital assistants, etc.

[0271] It should be understood that the “one embodiment” or “an embodiment” or “an embodiment of the present application” or “the aforementioned embodiment” or “some embodiments” or “some implementation methods” mentioned throughout the specification means that the specific features, structures or characteristics related to the embodiment are included in at least one embodiment of the present application. Therefore, “in one embodiment” or “in an embodiment” or “an embodiment of the present application” or “the aforementioned embodiment” or “some embodiments” or “some implementation methods” appearing throughout the specification do not necessarily refer to the same embodiment. In addition, these specific features, structures or characteristics can be combined in one or more embodiments in any suitable manner. It should be understood that in the various embodiments of the present application, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application. The serial numbers of the embodiments of the present application mentioned above are for description only and do not represent the advantages and disadvantages of the embodiments.

[0272] In the several embodiments provided in this application, it should be understood that the disclosed devices and methods can be implemented in other ways. The device embodiments described above are merely schematic. For example, the division of units is merely a logical function division. In actual implementation, there may be other division methods, such as: multiple units or components can be combined, or can be integrated into another system, or some features can be ignored or not executed. In addition, the coupling, direct coupling, or communication connection between the components shown or discussed can be through some interfaces, and the indirect coupling or communication connection of devices or units can be electrical, mechanical or other forms.

[0273] The units described above as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units; they may be located in one place or distributed across multiple network units; some or all of the units may be selected according to actual needs to achieve the purpose of the scheme of this embodiment.

[0274] In addition, all functional units in the embodiments of the present application can be integrated into one processing unit, or each unit can be a separate unit, or two or more units can be integrated into one unit; the above-mentioned integrated units can be implemented in the form of hardware or in the form of hardware plus software functional units.

[0275] The methods disclosed in the several method embodiments provided in this application can be arbitrarily combined without conflict to obtain new method embodiments. The features disclosed in the several product embodiments provided in this application can be arbitrarily combined without conflict to obtain new product embodiments.

[0276] The features disclosed in the several method or device embodiments provided in this application can be arbitrarily combined without conflict to obtain new method embodiments or device embodiments.

[0277] Those skilled in the art will understand that all or part of the steps of implementing the above-mentioned method embodiments can be completed by hardware related to program instructions, and the aforementioned program can be stored in a computer-readable storage medium. When the program is executed, it executes the steps of the above-mentioned method embodiments; and the aforementioned storage medium includes: mobile storage devices, ROM, disks or optical disks, and other media that can store program codes.

[0278] Alternatively, if the above-mentioned integrated unit of the present application is implemented in the form of a software function module and sold or used as an independent product, it can also be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application is essentially or the part that contributes to the relevant technology can be embodied in the form of a software product, which is stored in a storage medium and includes a number of instructions for a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the methods of each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as mobile storage devices, ROMs, magnetic disks, or optical disks.

[0279] It is worth noting that the drawings in the embodiments of the present application are only for illustrating the schematic positions of the various components on the terminal device and do not represent the actual positions in the terminal device. The actual positions of the various components or areas may be changed or offset accordingly according to actual conditions (for example, the structure of the terminal device), and the proportions of different parts of the terminal device in the drawings do not represent the actual proportions.

[0280] The above is merely an embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection of the claims.

Claims

1. An information processing method, characterized in that: Applied to a first device, the method includes: Sending the first information to the second device; The first information is used to instruct the second device to delay publishing the neighbor status of the second device and the first device, or to instruct the second device and / or the first device to delay switching the neighbor state machine to the neighbor state; the second device is a neighbor device of the first device.

2. The method according to claim 1, characterized in that The method further comprises: sending second information to the second device; The second information is used to instruct the second device to publish the adjacency state between the second device and the first device, or to instruct the second device and / or the first device to switch the neighbor state machine to the adjacency state.

3. The method according to claim 1 or 2, characterized in that: The sending the first information to the second device includes: Sending a Hello message carrying the first information to the second device; or, Send a database description message carrying the first information to the second device.

4. The method according to claim 2, characterized in that: The sending the second information to the second device includes: Sending a Hello message carrying the second information to the second device; or, Send a database description message carrying the second information to the second device.

5. The method according to claim 3, characterized in that: The sending a Hello message carrying the first information to the second device includes: Encapsulating the first information in a TLV data block in the Hello message; Send a Hello message encapsulating the first information to the second device.

6. The method according to claim 5, characterized in that The TLV data block includes at least one of the following: a type 1 option and flag TLV data block; a type 19 reverse metric TLV data block; The first information includes the nth bit added in the type 1 option and flag TLV data block, or the type 19 reverse metric TLV data block; n is a positive integer.

7. The method according to any one of claims 2, 4-6, characterized in that: The method further comprises: After the first device is started or restarted, starting a timer; and / or, The sending the second information to the second device includes: The second information is sent to the second device in any of the following situations: the timer times out, the timer is canceled, the database synchronization between the first device and the second device is completed, and the first device regenerates a new link state notification.

8. An information processing method, characterized in that: Applied to the second device, the method includes: Obtaining first information; wherein the first information is used to instruct the second device to delay publishing the adjacency state of the second device and the first device, or to instruct the second device and / or the first device to delay switching the neighbor state machine to the adjacency state; the second device is a neighbor device of the first device; Delay publishing the adjacency state of the second device and the first device, or delay switching the neighbor state machine to the adjacency state.

9. The method according to claim 8, characterized in that The obtaining of the first information includes: receiving first information sent by the first device; or, Upon detecting that the neighbor state machine of the first device switches to the exchange initialization state and the local The first information is generated when the link state advertisement sent by the first device exists in the database and the link state advertisement includes the adjacency state between the second device and the first device.

10. The method according to claim 8 or 9, characterized in that: The method further comprises: obtaining second information; The second information is used to instruct the second device to publish the adjacency state between the second device and the first device, or to instruct the second device and / or the first device to switch the neighbor state machine to the adjacency state.

11. The method according to claim 10, characterized in that The obtaining of the second information comprises: receiving second information sent by the first device; or, When database synchronization is completed between the first device and the second device, the second information is generated.

12. The method according to claim 9, characterized in that The receiving the first information sent by the first device includes: Receiving a Hello message carrying the first information sent by the first device; or, Receive a database description message carrying the first information sent by the first device.

13. The method according to claim 11, characterized in that The receiving the second information sent by the second device includes: Receiving a Hello message carrying second information sent by the first device; or, Receive a database description message carrying the second information sent by the first device.

14. The method according to claim 12, characterized in that The receiving a Hello message carrying the first information and sent by the first device includes: Receive a Hello message encapsulated with the first information and sent by the first device; wherein the first information is encapsulated in a TLV data block in the Hello message.

15. The method according to claim 14, characterized in that The TLV data block includes at least one of the following: a type 1 option and flag TLV data block; a type 19 reverse metric TLV data block; The first information includes the nth bit added in the type 1 option and flag TLV data block, or the type 19 reverse metric TLV data block; n is a positive integer.

16. The method according to any one of claims 8 to 15, characterized in that: The method further comprises: Start the timer; and / or; When the timer times out or is canceled, or the database synchronization between the first device and the second device is completed, or the first device regenerates a new link state announcement, the second device cancels the operation of delaying the publication of the adjacent status of the second device and the first device.

17. A first device, characterized in that: The first device comprises: A first sending module, used to send first information to a second device; The first information is used to instruct the second device to delay publishing the neighbor status of the second device and the first device, or to instruct the second device and / or the first device to delay switching the neighbor state machine to the neighbor state; the second device is a neighbor device of the first device.

18. A second device, characterized in that: The second device comprises: a second processing module, configured to obtain first information; wherein the first information is used to instruct the second device to delay publishing the adjacency state of the second device and the first device, or to instruct the second device and / or the first device to delay switching the neighbor state machine to the adjacency state; and the second device is a neighbor device of the first device; The second processing module is further configured to delay publishing the adjacency state between the second device and the first device, or delay switching the neighbor state machine to the adjacency state.

19. A first device, characterized in that: The first device comprises: A first memory, used to store executable instructions; The first processor is configured to implement the information processing method according to any one of claims 1 to 7 when executing the executable instructions stored in the first memory.

20. A second device, characterized in that: The second device comprises: A second memory, used for storing executable instructions; The second processor is configured to implement the information processing method according to any one of claims 8 to 16 when executing the executable instructions stored in the second memory.

21. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores one or more programs, and the one or more programs can be executed by one or more processors to implement the information processing method as described in any one of claims 1 to 7, or the information processing method as described in any one of claims 8 to 16.

22. A computer program product, characterized in that The computer program product includes computer instructions, which are stored in a computer-readable storage medium and are suitable for being read and executed by a processor, so that a computer device having the processor executes the method according to any one of claims 1 to 7 or the method according to any one of claims 8 to 16.

Images