ARP (Address Resolution Protocol) table item synchronization method, frame type equipment, main control board and storage medium

Abstract

The invention provides an ARP (Address Resolution Protocol) table item synchronization method, frame type equipment, a main control board and a storage medium. According to the embodiment of the invention, when the service board inquires that the ARP table item corresponding to the next-hop IP address of the service message is invalid, the main control board receives the slot identifier of the service board and the service message, and inquires the ARP table item corresponding to the next-hop IP address of the service message, so that the valid ARP table item is sent to the service board corresponding to the slot identifier; according to the technical scheme, the service messages subsequently sent to the same next hop of IP address can be forwarded locally on the service board, the computing resource consumption of the main control board for processing service forwarding is reduced, the core control function can be executed more stably, and the risk of service message packet loss caused by bandwidth limitation is reduced.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of data transmission, and in particular to an ARP entry synchronization method, a chassis device, a main control board and a storage medium. BACKGROUND

[0002] In a data transmission chassis device, a main control board undertakes control plane management responsibilities, including route protocol calculation and global entry maintenance; a service board is responsible for data plane processing, performing service packet forwarding and security policy application.

[0003] When the service board detects that a local ARP entry is invalid in a forwarding process, the service board needs to send a service packet to the main control board for forwarding, but there is a transmission channel speed limit between the service board and the main control board, and packet loss problems are likely to occur when a large amount of service traffic is sent. SUMMARY

[0004] To overcome the above problems in the prior art, the present specification provides an ARP entry synchronization method, a chassis device, a main control board and a storage medium.

[0005] To achieve the above object, one or more embodiments of the present specification provide the technical solutions as follows:

[0006] According to a first aspect of an embodiment of the present specification, an ARP entry synchronization method is provided, applied to a main control board in a chassis device, and comprising:

[0007] When the service board queries that a local ARP entry corresponding to a next hop IP address of a service packet is invalid, receiving a service board slot identifier and the service packet sent by the service board, the service packet carrying a destination IP address;

[0008] According to the destination IP address, determining the next hop IP address of the service packet, querying the local ARP entry corresponding to the next hop IP address of the service packet, and if the ARP entry is valid, sending the ARP entry to the service board corresponding to the slot identifier, so that the service board updates the local APR entry by using the received ARP entry;

[0009] Storing the slot identifier and the next hop IP address of the sent ARP entry in association, and recording the number of times of association storage;

[0010] When the number of times of association storage reaches a threshold, generating alarm information for the associated storage slot identifier and next hop IP address.

[0011] According to a second aspect of an embodiment of the present specification, a chassis device is provided, comprising: a main control board and at least one service board plugged into the chassis device;

[0012] The service board is configured to query a local ARP entry corresponding to the next-hop IP address of the service packet, and when the ARP entry is invalid, send the slot identifier of the service board and the service packet to the master board, the service packet carrying a destination IP address; and when receiving the ARP entry issued by the master board, update the local ARP entry;

[0013] The master board is configured to determine the next-hop IP address of the service packet according to the destination IP address, query an ARP entry corresponding to the next-hop IP address of the service packet, if the ARP entry is valid, send the ARP entry to the service board corresponding to the slot identifier, and store the slot identifier and the next-hop IP address of the sent ARP entry in association, and record the number of times of association storage; when the number of times of association storage reaches a threshold, generate an alarm information for the slot identifier and the next-hop IP address stored in association.

[0014] According to a third aspect of the embodiments of the present specification, a master board is provided, the master board is arranged in a frame device; the frame device further comprises at least one service board; the master board is connected with each of the service boards; the master board comprises a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor implements the method according to the first aspect when executing the program.

[0015] According to a fourth aspect of the embodiments of the present specification, a computer readable storage medium is provided, and the computer readable storage medium stores a computer program, the program is executable by a processor to implement the method according to the first aspect.

[0016] The technical solutions provided by the embodiments of the present specification can include the following beneficial effects:

[0017] When the service board queries that the ARP entry corresponding to the next-hop IP address of the service packet is invalid, the master board receives the slot identifier of the service board and the service packet, and queries the ARP entry corresponding to the next-hop IP address of the service packet, so as to send the valid ARP entry to the service board corresponding to the slot identifier, so that the subsequent service packet sent to the same next-hop IP address can be forwarded locally on the service board, reducing the consumption of computing resources of the master board in processing service forwarding, enabling it to more stably perform core control functions, and reducing the risk of packet loss of service packets due to bandwidth limitations. Moreover, when the number of times of association storage reaches a threshold, an alarm information is generated for the slot identifier and the next-hop IP address stored in association, so as to locate abnormal problems in the ARP entry synchronization process, thereby improving the reliability of service packet transmission and the maintainability of the device. BRIEF DESCRIPTION OF DRAWINGS

[0018] Figure 1 is a flow diagram of an ARP entry synchronization method according to an example embodiment of the present application;

[0019] Figure 2 is a flow diagram of step S102 according to an example embodiment of the present application;

[0020] Figure 3 is a flow diagram of an ARP entry synchronization method according to another example embodiment of the present application;

[0021] Figure 4 is a structural diagram of a frame device according to an example embodiment of the present application;

[0022] Figure 5 is a structural diagram of a master board according to an example embodiment of the present application. DETAILED DESCRIPTION

[0023] The example embodiments will now be described in detail with reference to the drawings. Like reference numerals refer to like elements throughout. The following detailed description is not intended to restrict the examples to any one or more specific embodiments. Rather, the examples are intended to cover all alternatives, modifications, and equivalents fairly falling within the scope of the application as the same is defined by the appended claims.

[0024] The terminology used in the present application is for the purpose of describing particular embodiments only and is not intended to be limiting of the present application. As used in the description of the application and the appended claims, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It also will be understood that the term "and / or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.

[0025] It is to be understood that the singular forms "a", "an", and "the" include plural referents unless the context clearly dictates otherwise. It is to be understood that the term "and / or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.

[0026] The data transmission frame device is a modular network device, which is composed of a case, a main control board, a service board, a switching board, a backplane bus and the like. Among them, the main control board as the control core bears the key functions. It is responsible for the control plane management of the whole system, including the dynamic interaction of the routing protocol, the maintenance of the global ARP table (address resolution protocol table) and the issuance of the device configuration strategy. Therefore, the main control board is directly related to the topology convergence speed and the policy execution accuracy of the whole network, and the tasks executed by the main control board require the main control board to have stable computing resources and real-time response capability. The service board as the execution unit of the data plane focuses on the forwarding and service function processing of network traffic. The built-in special forwarding chip can efficiently perform operations such as security policy checking and application layer service scheduling, but the local ARP table of the service board is only a cached copy of the global ARP table, and its effectiveness depends on the continuous synchronization of the main control board.

[0027] When the service board needs to forward service packets carrying user actual services, it generally needs to query the routing table according to the destination IP address in the service packet to determine the next hop IP address, and then resolve the next hop IP address to a physical MAC address according to the ARP table to complete data encapsulation and forwarding. However, the process of the service board reporting the service packet to the main control board is prone to packet loss. The applicant found through a large number of experimental researches that the reason for packet loss is that in the above-mentioned traditional scheme, if the local ARP table entry of the service board is invalid, the service packet will be forced to interrupt the normal forwarding path and be uploaded to the main control board for forwarding processing through the backplane bus. However, this design has the following disadvantages:

[0028] Firstly, the main control board should focus on control plane management and handle core control functions such as routing protocol calculation, but frequent forwarding of service packets will continuously consume its limited computing resources, resulting in a decline in the stability of core control functions. Secondly, the transmission channel connecting the main control board and the service board has a physical bandwidth limit. When a large-scale service packet needs to be uploaded to the main control board for centralized forwarding due to ARP table entry invalidity, packet loss may occur due to physical bandwidth limitation. Moreover, under the existing mechanism, it is difficult for operation and maintenance personnel to distinguish between incidental network fluctuations and persistent device / link faults, resulting in low fault troubleshooting efficiency. If there is a persistent device / link fault, the above-mentioned resource invasion and packet loss problems are more likely to occur, which seriously affects the maintainability of the device and the reliability of service packet transmission.

[0029] The simultaneous existence of the above problems forms a closed-loop dilemma: the outdated local ARP table in the service board increases the frequency of invalidation of the service board forwarding function, inducing channel congestion; and the fault characteristics hidden by channel congestion make it difficult for operation and maintenance personnel to find the root cause of the fault.

[0030] Therefore, the present application proposes an ARP table entry synchronization mechanism which can guarantee the forwarding capability of the service board and accurately troubleshoot faults.

[0031] Next, the embodiments of the present specification are described in detail.

[0032] As Figure 1 shown, Figure 1 is a flowchart of an ARP entry synchronization method according to an exemplary embodiment of the present specification, which is applied to a master board in a data transmission frame device, including the following steps:

[0033] S100: When the service board queries that the local ARP entry corresponding to the next hop IP address of the service message is invalid, receiving the service board slot identification and the service message sent by the service board. Wherein, the service message carries a destination IP address.

[0034] When the forwarding task of the service message needs to be executed, if the service board cannot find the ARP entry matching the next hop IP address of the service message in its local ARP table, that is, the ARP entry corresponding to the next hop IP address of the service message is invalid. The invalid state of the ARP entry usually comes from two situations: one is that the MAC address corresponding to the next hop IP address has never been learned, and the other is that the cached ARP entry is cleared. At this time, the service board will send the service board slot identification and the service message carrying the destination IP address to the master board. Wherein, the service board slot identification is the number used to physically locate the position of the service board in the frame device.

[0035] Specifically, the service board can send the service message and the service board slot identification to the master board in turn. When the ARP entry corresponding to the next hop IP address of the service message is invalid, the service board will first send the service message itself to the master board, which contains its destination IP address, which is the core information necessary for the master board to subsequently query and ARP analysis. At the same time, the service board will generate and send an ARP entry invalid notification to the service board. The ARP entry invalid notification includes the slot identification and the destination IP address, and the purpose is to indicate that the ARP entry corresponding to the service message is currently invalid through the destination IP address. In order to accurately locate the source of the problem, the notification must include the slot identification of the service board itself, so that the master board can clearly know which physical position of the service board encounters the ARP invalid problem.

[0036] Therefore, the information received by the master board can include two parts: one is the original service message to be processed, and the other is the ARP entry invalid notification which clearly identifies the source of the fault. The master board obtains the destination IP address of the service message by analyzing the received service message, and extracts the service board slot identification and identifies the ARP invalidity of the service message corresponding to the destination IP address from the received ARP entry invalid notification.

[0037] For example, when the service board with slot identification of 3 processes a video stream message with destination IP address of 10.1.1.100, it is determined according to the routing table that the next hop IP address should be 192.168.1.1. However, since there is no MAC address record corresponding to the IP address 192.168.1.1 in the local ARP table, it is determined that the ARP entry is invalid.

[0038] S102: Determine the next hop IP address of the service message according to the destination IP address, query the local ARP entry corresponding to the next hop IP address of the service message, and if the ARP entry is valid, send the ARP entry to the service board corresponding to the slot identification, so that the service board updates the local APR entry by using the received ARP entry.

[0039] After receiving the slot identification and the service message, and parsing the destination IP address of the service message, the master control board determines the next hop IP address of the service message by querying the routing table. The destination IP address points to the final recipient (such as a server IP address), and the next hop IP address is the first transit node (such as a neighboring router interface IP address) to which the service board sends the service message to the final recipient.

[0040] It can be understood that if the service board does not need a transit node to send the service message to the final recipient, i.e., the service board is directly connected to the final recipient, the next hop IP address is the same as the destination IP address. It should be noted that in the case where the service board is directly connected to the final recipient, the service board still needs to obtain the ARP entry corresponding to the IP address of the final recipient, and then obtain the MAC address of the final recipient, in order to send the service message to the final recipient on the directly connected physical network.

[0041] After determining the next hop IP address of the service message, the master control board retrieves the ARP entry corresponding to the next hop IP in the global ARP table stored in the master control board. If the ARP entry is valid, the ARP entry is immediately sent to the service board corresponding to the slot identification. In this way, the service board can update the local ARP table after receiving the ARP entry, i.e., the ARP entry is synchronized, and subsequent service messages with the same next hop IP address can be directly forwarded by the service board.

[0042] For example, after parsing the service message, the master control board obtains the next hop IP address 192.168.1.1 consistent with the previous example, and queries the global ARP table accordingly. If there is a valid ARP entry (such as 192.168.1.1→00:1A:2B:3C:4D:5E), it is sent to the service board with slot 3.

[0043] S104: Store the slot identification and the next hop IP address of the sent ARP entry in association, and record the number of times of association storage.

[0044] After sending the ARP entry to the service board corresponding to the slot identifier, the main control board associates the slot identifier with the sent next-hop IP address and records the number of times this association is stored. Essentially, this step establishes a "physical location-logical address" key combination and records the number of times this key combination is triggered.

[0045] It is understood that when the slot identifier and the next-hop IP address of the sent ARP entry are associated and stored for the first time, the number of association storages can be initialized to 1, and the number of association storages will increase each time this step is triggered.

[0046] For example, the stored data can be represented as:

[0047] {slot:3,IP:192.168.1.1,times:4}, the stored data can be interpreted as the service board with slot identifier 3 experiencing a total of 4 failure events for the next-hop IP 192.168.1.1.

[0048] S106: When the number of times the associated storage is reached reaches the threshold, an alarm message is generated for the slot identifier and next-hop IP address of the associated storage.

[0049] When the number of associated storage occurrences corresponding to a combination key (slot identifier + next-hop IP address) reaches a preset threshold, the main control board automatically generates an alarm message. Based on the stored data, the alarm message can carry the slot identifier, next-hop IP address, and the number of associated storage occurrences. The slot identifier is used to locate the hardware responsibility domain of the service board; the next-hop IP address is used to locate logical fault points, such as abnormal ARP entries corresponding to a specific gateway; and the number of associated storage occurrences is used to quantify the severity of the problem, distinguishing between intermittent fluctuations and persistent faults. In this way, maintenance personnel can precisely execute interventions; if slot identifiers are concentrated, the hardware status of the service board is checked; if next-hop IP addresses are concentrated, the uplink and ARP entry aging mechanism are checked for optimization, etc.

[0050] For example, if the threshold for triggering the generation of alarm information is set to 5, then when the data stored in the above example is updated from {slot:3,IP:192.168.1.1,times:4} to {slot:3,IP:192.168.1.1,times:5}, an alarm message will be generated for the service board with slot identifier 3 and the next-hop IP address 192.168.1.1. It is understood that this invention does not need to limit the range of this threshold value.

[0051] Therefore, as Figure 1The ARP entry synchronization method shown here, when the service board finds an invalid ARP entry corresponding to the next-hop IP address of a service packet, receives the slot identifier and service packet from the service board via the main control board, and queries the ARP entry corresponding to the next-hop IP address of the service packet. The valid ARP entry is then sent to the service board corresponding to the slot identifier, enabling subsequent service packets destined for the same next-hop IP address to be forwarded locally on the service board. This reduces the computational resource consumption of the main control board in handling service forwarding, allowing it to execute core control functions more stably and reducing the risk of packet loss due to bandwidth limitations. Furthermore, by generating alarm information for the slot identifier and next-hop IP address of the associated storage when the number of associated storage attempts reaches a threshold, abnormal problems occurring during ARP entry synchronization are located, thereby improving the reliability of service packet transmission and the maintainability of the equipment.

[0052] In one or more embodiments of this specification, the slot identifier and the next-hop IP address of the sent ARP entry, as well as the number of associated storage entries, are stored in a linked list.

[0053] In high-concurrency scenarios of data transmission chassis devices, ARP entry synchronization is triggered frequently, requiring frequent execution of the aforementioned "association and storage of slot identifiers and next-hop IP addresses, and recording the number of times they are associated and stored." The memory usage of the stored data varies greatly. If a fixed amount of memory is pre-allocated using lists, arrays, or other methods, a dilemma arises: insufficient reserved space necessitates emergency expansion under sudden traffic surges, causing processing delays; excessive reserved space leads to idle storage and resource waste.

[0054] In this embodiment, the slot identifier, the next-hop IP address of the sent ARP entry, and the number of associated storage entries are stored in a linked list. The linked list stores data through discrete nodes, each node containing a data field (storing the aforementioned slot identifier, next-hop IP address, and number of associated storage entries) and a pointer field (pointing to adjacent nodes). When a new associated storage record of a slot identifier and next-hop IP is added, an independent memory node can be dynamically allocated in this linked list; when a memory node becomes old and needs to be deleted, the memory corresponding to the node is immediately released.

[0055] In one or more embodiments of this specification, the ARP entry synchronization method further includes:

[0056] Delete the slot identifier and next-hop IP address of the associated storage that has reached the first preset storage duration, as well as the number of times the associated storage has been deleted.

[0057] The storage duration is initialized after each recording of the associated storage.

[0058] In a dynamically changing network environment, high-frequency ARP entry synchronization operations can pose dual challenges to memory resources and alarm accuracy. When service boards repeatedly trigger entry failures due to network fluctuations, the main control board continuously records the slot identifier, next-hop IP address, and number of associated storage entries. If historical data is not cleared in a timely manner, it will continuously consume the main control board's memory resources. Furthermore, if the number of associated storage entries for the associated storage slot identifier and next-hop IP address does not increase within a first preset time period, it can be assumed that the service board corresponding to the slot identifier has synchronized the ARP entry corresponding to the next-hop IP address, i.e., the service board's ARP entry has been restored to validity. However, if the number of associated storage entries is not cleared after the service board's ARP entry has been restored to validity, the number of associated storage entries may continue to accumulate in subsequent services, leading to the erroneous generation of alarm information.

[0059] In this embodiment, each time the number of associated storage entries is recorded, the storage duration corresponding to the data in that associated storage entry is initialized, so that the storage duration always represents the time from the most recent failure to the current time. If a service board experiences continuous failures for a specific next-hop IP, the storage duration is reset to zero each time the number of associated storage entries increases, ensuring that the entry is continuously and effectively monitored. Once the service board successfully synchronizes the ARP entry, the recording of associated storage entries is no longer triggered, and the storage duration accumulates naturally. When the storage duration is detected to exceed a first preset duration, the slot identifier and next-hop IP address of the associated storage, as well as the number of associated storage entries, are automatically deleted.

[0060] In one or more embodiments of this specification, the main control board sends the ARP entry to the service board corresponding to the slot identifier, including:

[0061] If the slot identifier is not associated with the next-hop IP address of the ARP entry, or if the slot identifier is associated with the next-hop IP address of the ARP entry and the storage time reaches the second preset time, then the main control board will send the ARP entry to the service board corresponding to the slot identifier.

[0062] The storage duration is initialized after each recording of the associated storage.

[0063] After the main control board sends a valid ARP entry to the service board, the service board needs to go through processes such as parsing, verification, and writing to the local cache before it becomes effective. Therefore, there is a processing delay in synchronizing ARP entries on the service board. If service packets with the same next-hop IP arrive again during this period, the service board will still determine that the ARP entry is invalid because it has not yet become effective, and repeatedly trigger the process of sending it to the main control board. This will lead to the main control board sending the same ARP entry at a high frequency, consuming the bandwidth of the channel between the main control board and the service board, and exacerbating the risk of packet loss.

[0064] Therefore, in this embodiment, the storage duration is reset each time the association count is updated, so that the storage duration always represents the time from the most recent failure to the current time. Based on the storage duration, a time-sensitive distribution control logic is added before sending the ARP entry to the service board corresponding to the slot identifier.

[0065] Please see Figure 2 , Figure 2 A flowchart illustrating step S102 of an embodiment of this specification is shown.

[0066] In this embodiment, step S102 includes:

[0067] S1021: Determine the next-hop IP address of the service packet based on the destination IP address, and query the local ARP table entry corresponding to the next-hop IP address of the service packet.

[0068] S1022: Determine if the ARP entry is valid. If it is, proceed to step S1023.

[0069] S1023: Determine whether the slot identifier and the next-hop IP address are already associated and stored. If yes, proceed to step S1024; otherwise, proceed to step S1025.

[0070] S1024: Determine if the storage duration has reached the second preset duration. If so, proceed to step S1025.

[0071] S1025: Send the ARP entry to the service board corresponding to the slot identifier.

[0072] Specifically, this time-sensitive distribution control logic includes two conditions. Condition one is that the slot identifier and the next-hop IP address of the ARP entry are not stored together. This ensures that when a new key combination (i.e., a combination of a slot identifier and a next-hop IP address that has not been previously stored together) is detected for the first time, sending the ARP entry to the service board corresponding to the slot identifier is allowed, ensuring a rapid response and avoiding delays in normal synchronization. Condition two is that the slot identifier and the next-hop IP address of the ARP entry are stored together for a storage duration that reaches a second preset duration. This also allows sending the ARP entry to the service board corresponding to the slot identifier. The second preset duration is less than the aforementioned first preset duration; for example, the second preset duration is 5 seconds, and the first preset duration is 30 seconds. It is understood that the purpose of this embodiment is to determine that the ARP entry failure of the service board is due to a high probability that the failure is caused by processing delays preventing the service board from synchronizing the ARP entry. Therefore, the transmission of the ARP entry to the service board corresponding to the slot identifier is intercepted. Thus, the second preset time in this embodiment is equivalent to a suppression time window to avoid sending service packets carrying the same next-hop IP address to the same service board too frequently, reducing the bandwidth usage of the main control board to service board channel and lowering the probability of packet loss.

[0073] like Figure 3 As shown, Figure 3 This is a flowchart illustrating an ARP entry synchronization method according to another exemplary embodiment of this specification. The method is applied to the main control board in a chassis device and includes:

[0074] S100: When the service board finds that the ARP entry corresponding to the next-hop IP address of the service packet is invalid, it receives the service board slot identifier and the service packet sent by the service board, the service packet carrying the destination IP address.

[0075] S102: Determine the next-hop IP address of the service packet based on the destination IP address, query the ARP entry corresponding to the next-hop IP address of the service packet, and if the ARP entry is valid, send the ARP entry to the service board corresponding to the slot identifier so that the service board can synchronize its local ARP table according to the received ARP entry.

[0076] S104: Associate the slot identifier with the next-hop IP address of the sent ARP entry and store the association, and record the number of times the association is stored.

[0077] S105: Delete the slot identifier and next-hop IP address of the associated storage that has reached the first preset storage duration, as well as the number of times the associated storage has been deleted.

[0078] S106: When the number of times the associated storage is reached reaches the threshold, an alarm message is generated for the slot identifier and next-hop IP address of the associated storage.

[0079] The slot identifier, the next-hop IP address of the ARP entry sent, and the number of associated storage entries are stored in a linked list.

[0080] In this preferred embodiment, the storage duration is initialized after each recording of the associated storage count. When the main control board stores the slot identifier, next-hop IP address, and association count in a linked list, the linked list structure serves as the storage carrier, and each node in the linked list also stores an update timestamp as a time attribute. The update timestamp is the benchmark for measuring the aforementioned storage duration—each time the association count is updated, the node's update timestamp is reset to the current system time, effectively equipping the node with a repeatedly resettable timer. This design gives the linked list a dynamic lifecycle: continuously active failures keep the node active, while the restoration of normal business drives the node to naturally disappear.

[0081] In this scenario, linked lists demonstrate their adaptability to high-frequency deletion operations. When periodically checking storage duration, it is only necessary to sequentially traverse the nodes in the linked list and perform deletion on nodes whose last update time exceeds a first preset duration. The data structure of linked lists makes their deletion operation highly efficient; it only requires unlinking the pointers of the target node from its adjacent nodes, instantly releasing the memory it occupies back to the resource pool.

[0082] Furthermore, the on-demand memory allocation feature of linked lists is particularly important in the face of network contingencies. When routing oscillations cause a batch of ARP failures on the service boards, the main control board can dynamically create tens of thousands of nodes per second to record the anomalies; once the network stabilizes, the main control board can quickly clean up expired nodes. No redundant memory needs to be reserved throughout the process, and core protocol calculations are never interrupted. This ability to scale in real time with fault fluctuations ensures that the main control board's memory resources are always precisely matched to actual needs.

[0083] The above describes one or more embodiments of the ARP entry synchronization method provided in this specification. Based on the same idea, this specification also provides corresponding chassis devices, such as... Figure 4 As shown. Figure 4 This diagram illustrates a chassis-type device provided in this specification. Essentially, this chassis-type device is a physical implementation of the first aspect of the method in terms of hardware architecture. Through a modular division of labor and collaboration mechanism between the main control board and the service board, this chassis-type device transforms the methodological process into a physically deployable technical solution.

[0084] Specifically, the frame-type device includes: a main control board 401 and at least one service board 402 plugged into the frame-type device;

[0085] The service board 402 is used to query the local ARP entry corresponding to the next-hop IP address of the service packet. When the ARP entry is invalid, it sends the service board slot identifier and the service packet to the main control board 401. The service packet carries the destination IP address. When it receives the ARP entry issued by the main control board 401, it updates the local ARP entry.

[0086] The main control board 401 is used to determine the next-hop IP address of the service packet based on the destination IP address, query the ARP entry corresponding to the next-hop IP address of the service packet, and if the ARP entry is valid, send the ARP entry to the service board 402 corresponding to the slot identifier; and associate and store the slot identifier and the next-hop IP address of the sent ARP entry, and record the number of times the association storage is performed; when the number of association storage reaches a threshold, generate alarm information for the associated and stored slot identifier and next-hop IP address.

[0087] In this embodiment, when the ARP entry corresponding to the next-hop IP address of a service packet is invalid as determined by the service board 402, the service board slot identifier and the service packet are sent to the main control board 401. The main control board 401 then queries the ARP entry corresponding to the next-hop IP address of the service packet and sends the valid ARP entry to the service board 402 corresponding to the slot identifier. This allows the service board 402 to synchronously receive the ARP entries, enabling subsequent service packets destined for the same next-hop IP address to be forwarded locally on the service board 402. This reduces the computational resource consumption of the main control board 401 in processing service forwarding, allowing it to execute core control functions more stably and reducing the risk of packet loss due to bandwidth limitations. Furthermore, the main control board 401 generates alarm information for the associated storage slot identifier and next-hop IP address when the number of associated storage attempts reaches a threshold, thus locating anomalies during ARP entry synchronization and improving the reliability of service packet transmission and the maintainability of the equipment.

[0088] In one implementation, the slot identifier, the next-hop IP address of the sent ARP entry, and the number of associated storage entries are stored in a linked list.

[0089] In one implementation, the main control board 401 is further configured to delete the slot identifier and next-hop IP address of the associated storage that has reached a storage duration of a first preset duration, as well as the number of times the associated storage has been recorded. The storage duration is initialized after each recording of the number of times the associated storage has been recorded.

[0090] In one implementation, sending the ARP entry to the service board 402 corresponding to the slot identifier includes: if the slot identifier is not associated with the next-hop IP address of the ARP entry, or if the slot identifier is associated with the next-hop IP address of the ARP entry and the storage time reaches a second preset time, then sending the ARP entry to the service board 402 corresponding to the slot identifier is executed. The storage time is initialized after each recording of the association storage count.

[0091] This instruction manual also provides Figure 5 The diagram shows a schematic structure of a main control board. Figure 5 The main control board 501 is disposed in a chassis device; the chassis device also includes at least one service board 502; the main control board 501 is connected to each of the service boards 502; the main control board 501 includes a processor, an internal bus, a network interface, memory, and non-volatile memory, and may also include other hardware required by the services. The processor reads the corresponding computer program from the non-volatile memory into memory and then runs it to achieve the above. Figure 1 The ARP entry synchronization method described above.

[0092] This specification also provides a computer-readable storage medium storing a computer program that, when executed by a processor, performs the above-described functions. Figure 1 Provides ARP entry synchronization methods.

[0093] Computer-readable media, including both permanent and non-permanent, removable and non-removable media, can store information using any method or technology. Information can be computer-readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, disk storage, quantum memory, graphene-based storage media or other magnetic storage devices, or any other non-transferable medium that can be used to store information accessible by a computing device. As defined herein, computer-readable media does not include transient computer-readable media, such as modulated data signals and carrier waves.

[0094] The embodiments of the subject matter and functional operation described in this specification can be implemented in the following ways: digital electronic circuits, tangibly embodied computer software or firmware, computer hardware including the structures disclosed in this specification and their structural equivalents, or combinations thereof. Embodiments of the subject matter described in this specification can be implemented as one or more computer programs, i.e., one or more modules of computer program instructions encoded on a tangible, non-transitory program carrier for execution by a data processing apparatus or for controlling the operation of a data processing apparatus. Alternatively or additionally, the program instructions may be encoded on artificially generated propagation signals, such as machine-generated electrical, optical, or electromagnetic signals, which are generated to encode information and transmit it to a suitable receiving device for execution by the data processing apparatus. The computer storage medium may be a machine-readable storage device, a machine-readable storage substrate, a random or serial access memory device, or combinations thereof.

[0095] The processing and logic flow described in this specification can be executed by one or more programmable computers that execute one or more computer programs to perform corresponding functions by operating on input data and generating output. The processing and logic flow can also be executed by dedicated logic circuitry—such as FPGAs (Field-Programmable Gate Arrays) or ASICs (Application-Specific Integrated Circuits), and the device can also be implemented as dedicated logic circuitry.

[0096] Suitable computers for executing computer programs include, for example, general-purpose and / or special-purpose microprocessors, or any other type of central processing unit. Typically, the central processing unit receives instructions and data from read-only memory and / or random access memory. The basic components of a computer include a central processing unit for implementing or executing instructions and one or more memory devices for storing instructions and data. Typically, a computer will also include one or more mass storage devices for storing data, such as disks, magneto-optical disks, or optical disks, or the computer will be operatively coupled to such mass storage devices to receive data from or transfer data to them, or both. However, a computer is not required to have such devices. Furthermore, a computer can be embedded in another device, such as a mobile phone, a personal digital assistant (PDA), a mobile audio or video player, a game console, a global positioning system (GPS) receiver, or a portable storage device such as a universal serial bus (USB) flash drive, to name a few.

[0097] Computer-readable media suitable for storing computer program instructions and data include all forms of non-volatile memory, media, and memory devices, such as semiconductor memory devices (e.g., EPROM, EEPROM, and flash memory devices), magnetic disks (e.g., internal hard disks or removable disks), magneto-optical disks, and CD-ROM and DVD-ROM disks. Processors and memory may be supplemented by or incorporated into dedicated logic circuitry.

[0098] While this specification contains numerous specific implementation details, these should not be construed as limiting the scope of any invention or the scope of the claims, but rather are primarily intended to describe features of specific embodiments of a particular invention. Certain features described in the various embodiments herein may also be implemented in combination in a single embodiment. Conversely, various features described in a single embodiment may also be implemented separately in various embodiments or in any suitable sub-combination. Furthermore, while features may function in certain combinations as described above and even initially claimed in this way, one or more features from a claimed combination may be removed from that combination in some cases, and a claimed combination may refer to a sub-combination or a variation thereof.

[0099] Similarly, although the operations are depicted in a specific order in the accompanying drawings, this should not be construed as requiring these operations to be performed in the specific order shown or sequentially, or requiring all illustrated operations to be performed to achieve the desired result. In some cases, multitasking and parallel processing may be advantageous. Furthermore, the separation of various system modules and components in the above embodiments should not be construed as requiring such separation in all embodiments, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.

[0100] Thus, specific embodiments of the subject matter have been described. Other embodiments are within the scope of the appended claims. In some cases, the actions recited in the claims may be performed in a different order and still achieve the desired result. Furthermore, the processes depicted in the drawings are not necessarily shown in a specific order or sequence to achieve the desired result. In some implementations, multitasking and parallel processing may be advantageous.

[0101] The above description is merely a preferred embodiment of this application and is not intended to limit this application. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this application should be included within the scope of protection of this application.

Claims

1. A data transmission frame device, characterized in that, include: A main control board and at least one service board are plugged into the frame-type device; The service board is used to query the local ARP table entry corresponding to the next-hop IP address of the service packet. When the ARP table entry is invalid, the service board slot identifier and the service packet are sent to the main control board. The service packet carries the destination IP address. And when receiving an ARP entry from the main control board, update the local ARP entry; The main control board is used to determine the next-hop IP address of the service packet based on the destination IP address, query the ARP entry corresponding to the next-hop IP address of the service packet, and if the ARP entry is valid, send the ARP entry to the service board corresponding to the slot identifier; and associate and store the slot identifier and the next-hop IP address of the sent ARP entry, and record the number of times the association and storage are performed. When the number of associated storage visits reaches a threshold, an alarm message is generated for the slot identifier and next-hop IP address of the associated storage.

2. The frame-type equipment according to claim 1, characterized in that, The main control board is also used to create a linked list, in which the slot identifier, the next-hop IP address of the sent ARP entry, and the number of associated storage entries are stored.

3. The frame-type equipment according to claim 1, characterized in that, The main control board is also used to delete the slot identifier and next-hop IP address of the associated storage that has reached the first preset storage duration, as well as the number of times the associated storage has been deleted.

4. The frame-type equipment according to claim 1, characterized in that, Sending the ARP entry to the service board corresponding to the slot identifier includes: if the slot identifier is not associated with the next-hop IP address of the ARP entry, or if the slot identifier is associated with the next-hop IP address of the ARP entry and the storage time reaches a second preset time, then sending the ARP entry to the service board corresponding to the slot identifier is executed.

5. A method for synchronizing ARP entries, characterized in that, The method is applied to the main control board in a frame-type device, including: When the service board finds that the local ARP entry corresponding to the next-hop IP address of the service packet is invalid, it receives the service board slot identifier and the service packet sent by the service board, the service packet carrying the destination IP address; The next-hop IP address of the service packet is determined based on the destination IP address. The local ARP entry corresponding to the next-hop IP address of the service packet is queried. If the ARP entry is valid, the ARP entry is sent to the service board corresponding to the slot identifier so that the service board can update its local ARP entry using the received ARP entry. The slot identifier and the next-hop IP address of the sent ARP entry are associated and stored, and the number of times the association is stored is recorded; When the number of associated storage visits reaches a threshold, an alarm message is generated for the slot identifier and next-hop IP address of the associated storage.

6. The ARP entry synchronization method according to claim 5, characterized in that, The slot identifier, the next-hop IP address of the ARP entry sent, and the number of associated storage entries are stored in a linked list.

7. The ARP entry synchronization method according to claim 5, characterized in that, Also includes: Delete the slot identifier and next-hop IP address of the associated storage that has reached the first preset storage duration, as well as the number of times the associated storage has been deleted.

8. The ARP entry synchronization method according to claim 5, characterized in that, Sending the ARP entry to the service board corresponding to the slot identifier includes: If the slot identifier is not associated with the next-hop IP address of the ARP entry, or if the slot identifier is associated with the next-hop IP address of the ARP entry and the storage time reaches the second preset time, then the ARP entry is sent to the service board corresponding to the slot identifier.

9. A main control board, characterized in that, The main control board is disposed in a chassis device; the chassis device further includes at least one service board; the main control board is connected to each of the service boards; the main control board includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the method as described in any one of claims 5-8.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the program is executed by a processor, it implements the steps of the method according to any one of claims 5-8.

Images