Table entry processing method and device

Abstract

The embodiment of the invention provides a table entry processing method and device. The method includes the following steps: according to header information of a received message, generating an identification number; according to the identification number, searching a corresponding table entry chain table; judging whether the identification number corresponding to the received message is matched with that corresponding to a current table entry; if the identification number corresponding to the received message is matched with that corresponding to the current table entry, judging whether the current table entry needs aging; if the current table entry needs aging, updating a table entry field in the current table entry and corresponding update time; if the current table entry does not need aging, updating the update time corresponding to the current table entry; if the identification number corresponding to the received message is not matched with that corresponding to the current table entry, judging whether the current table entry needs aging; if the current table entry needs aging, deleting the current table entry, and using the next table entry as the current table entry till traversal of all table entries is finished; and if the current table entry does not need aging, using the next table entry as the current table entry till traversal of all the table entries is finished. The method avoids the calculation amount of large-scale timer queue management, reduces useless expenses brought by regular traversal, and improving forwarding performance and equipment throughput.

Description

technical field [0001] The present invention relates to the field of data processing, and in particular, to a table item processing method and device. Background technique [0002] In network devices such as firewalls, routers, and gateways, it is necessary to create large-scale (session) session tables or connection information tables, forwarding tables, etc. On high-end network devices, these table entries need to be as many as several million, or even tens of millions entries to support the concurrent Internet access and control requirements of a large number of users. For the purposes of resource recovery and reuse and security control, a timeout mechanism is needed to delete entries that are inactive beyond a limited period of time, so that resources can be recovered for new connected services or disconnected. [0003] The commonly used aging mechanism for entries is the timer overtime mechanism. When creating an entry, a corresponding timer is dynamically started and ...

AI Technical Summary

Problems solved by technology

The problem with this mechanism is that the length of the scan interval is difficult to quantify. If the scan interval is too short, unnecessary calculations will be added. The entries of the specifications all need an aging mechanism, and all of them are traversed periodically, which increases a lot of unnecessary calculations

Images