CN114884910A - Dynamic management method for super-large memory data - Google Patents
Dynamic management method for super-large memory data Download PDFInfo
- Publication number
- CN114884910A CN114884910A CN202210640467.7A CN202210640467A CN114884910A CN 114884910 A CN114884910 A CN 114884910A CN 202210640467 A CN202210640467 A CN 202210640467A CN 114884910 A CN114884910 A CN 114884910A
- Authority
- CN
- China
- Prior art keywords
- multicast
- mode
- management
- linked list
- information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/09—Mapping addresses
- H04L61/25—Mapping addresses of the same type
- H04L61/2503—Translation of Internet protocol [IP] addresses
- H04L61/255—Maintenance or indexing of mapping tables
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9015—Buffering arrangements for supporting a linked list
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a dynamic management method of oversized memory data, which realizes the rapid search and dynamic change of the memory data and meets the requirement of line speed by indexing an index value and combining a bidirectional chain table and a key value, is suitable for scenes such as exchanger message multicast replication and the like, meets the requirements of rapidness, high efficiency, convenience for management and the like, is particularly suitable for the requirements of addition, deletion and updating during message multicast replication, and has the utilization efficiency of memory space.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a dynamic management method for ultra-large memory data.
Background
The switch is extremely widely applied in the communication field, with the increasing requirements of industry and the Internet of things on 5G, multicast is a mode of message sending, and multicast replication is an important means for realizing multi-user transmission, so that the performance of the switch is reflected. But the multicast replication has extremely high requirements on the delay accuracy, the multicast replication comprises a linked list replication mode, and the list items in the linked list replication mode are newly added, deleted and changed.
The prior method for managing the multicast replication information is to establish a large array and realize the method by managing the array, but the method has low realization efficiency, needs to traverse the table entries when inquiring certain existing multicast replication information and does not meet the requirement of low time delay of exchange. If a certain data is deleted, only the data space can be abandoned, which results in great waste of memory. The traditional way to process the vacant entry is "bubble-squeezing", i.e. the entries below the vacant entry are shifted upwards in sequence, but for the switching service, it is equivalent to configuring several registers, and the delay is not acceptable.
As shown in fig. 1 below, the multicast replication refers to querying an index table according to a multicast id, and configuring a corresponding configuration table according to the queried index value. The configuration table entry comprises a port number, a next hop address and the like, the multicast replication information passes through a linked list mode, and if the address of the table entry is equal to the address of the next hop, the multicast id replication information configuration is finished.
The configuration table items are divided into 3 modes, which correspond to the multicast replication mode, wherein the first mode occupies 1 table item, the second mode continuously occupies two table items, and the third mode continuously occupies 4 table items. When a certain table entry is deleted, many fragmented vacant table entries may exist, and because of the requirement of continuous table entries, the table entry may not be fully utilized and the problem of line speed may not be achieved. Meanwhile, the traditional way of processing the vacant entry is to "squeeze bubbles", that is, the entries below the vacant entry are sequentially shifted upwards, but for the switching service, it is equivalent to configuring several registers, and the delay is unacceptable.
In order to solve the defects of the prior art, the invention provides a dynamic management method of oversized memory data, which realizes the rapid search and dynamic change of the memory data and meets the requirement of line speed by indexing an index value and combining a bidirectional chain table and a key value, is suitable for scenes such as exchanger message multicast replication and the like, meets the requirements of rapidness, high efficiency, convenient management and the like, is particularly suitable for the requirements of adding, deleting and updating during message multicast replication, and has the utilization efficiency of memory space.
Disclosure of Invention
In order to solve the defects in the prior art, the invention provides a dynamic management method of oversized memory data, which realizes the rapid search and dynamic change of the memory data and meets the requirement of line speed by indexing the index value and combining the bidirectional chain table and the key value, is suitable for scenes such as exchanger message multicast replication and the like, meets the requirements of rapidness, high efficiency, convenient management and the like, is particularly suitable for the requirements of adding, deleting and updating during message multicast replication, and simultaneously has the service efficiency of memory space.
In order to achieve the purpose, the invention adopts the following technical scheme.
In an embodiment of the present invention, a method for dynamically managing super-large memory data is provided, where the method includes the following steps:
s1, dividing the configuration table into 3 areas according to the multicast copy mode, wherein different areas can be connected in series;
s2 dynamically creating a management linked list composed of two-way linked lists;
s3, when a new multicast copy information is added, the management chain table and the configuration table need to be added with nodes;
s4, when deleting the multicast replication information, the node deletion processing is carried out on the management chain table and the configuration table;
when the multicast copy information is changed in S5, the corresponding change processing is performed according to the copy mode of the changed entry.
Further, the configuration table entry is divided into 3 regions, which correspond to the multicast replication mode.
Further, the key of the management linked list consists of a multicast id, a mode number and a port number; the management linked list associates the list item head address of the configuration list through indexes.
Further, the multicast replication information includes a multicast id, a port number, a replication mode, and the like.
Further, when the management linked list executes the newly added multicast copy information, the node of the management linked list needs to be newly added, the multicast copy information is added to the linked list, and meanwhile, the key value is determined through the multicast id + the mode number + the port number.
Further, a key value is calculated according to the multicast replication information, and the nodes of the management linked list are quickly inquired through the key value.
Preferably, if the table entry of the corresponding area of a certain copy mode of the configuration table exceeds the waterline, adding a new table entry to the adjacent mode table entry space; so as to ensure the continuity and space utilization of the mode table entry configuration and ensure the linear speed of the copying capability.
Furthermore, according to the position of the deleting node in the management linked list, the indexes before and after the configuration list are maintained.
Further, according to the deleted multicast replication information, firstly, the area of the deleted node in the configuration table entry is judged according to the multicast replication mode, then, the index number is searched in the index table according to the multicast id, the node needing to be deleted in the configuration table is searched according to the index number, the corresponding node is deleted, and the last entry of the multicast replication mode is filled in the deleted vacancy.
Further, the changing of the multicast replication information includes changing in a same mode and changing in different modes, and specifically includes: the same mode change directly modifies the information in the nodes in the management chain table and the table items in the configuration table; the change processing of different modes requires deleting the table entries of the mode before the change and adding new table entries of the mode after the change.
The method has the advantages that the method for dynamically managing the oversized memory data is provided for solving the problems in the prior art of data processing, the method for quickly searching and dynamically changing the memory data and meeting the requirement of line speed is realized by indexing the index value and combining the method of the bidirectional chain table and the key value, the method is suitable for scenes such as exchanger message multicast replication and the like, meets the requirements of quickness, high efficiency, convenience in management and the like, is particularly suitable for the requirements of addition, deletion and updating during message multicast replication, and simultaneously has the service efficiency of memory space.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts. In the drawings:
FIG. 1 is a multicast replication index table and configuration table of the background of the invention;
FIG. 2 is a schematic flow chart of the implementation of the present invention;
FIG. 3 is a structure diagram of a management linked list according to one embodiment of the present invention;
FIG. 4 is a flow chart of newly added copy information according to the first embodiment of the present invention;
FIG. 5 is a flow of deleting duplicate information according to one embodiment of the present invention;
fig. 6 is a flow of changing copy information according to a first embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the embodiments of the present invention are further described in detail below with reference to the accompanying drawings. The following embodiments are only used to more clearly illustrate the system method and technical solution of the present invention, and the protection scope of the present application is not limited thereby.
According to the implementation mode of the invention, the invention provides a dynamic management method of super-large memory data, which realizes the rapid search and dynamic change of the memory data and meets the requirement of line speed by indexing the index value and combining the bidirectional chain table and the key value, is suitable for the scenes of switch message multicast replication and the like, meets the requirements of rapidness, high efficiency, convenient management and the like, is particularly suitable for the requirements of adding, deleting and updating during message multicast replication, and has the use efficiency of memory space.
The principles and spirit of the present invention are explained in detail below with reference to several representative embodiments of the invention.
FIG. 2 is a process flow diagram of a method for dynamic management of hyper-memory data. As shown in fig. 2, the method comprises the steps of:
s1, dividing the configuration table into 3 areas according to the multicast copy mode, wherein different areas can be connected in series;
in specific implementation, the configuration table entry is divided into 3 regions, which correspond to the multicast replication mode.
S2 dynamically creating a management linked list composed of two-way linked lists;
in specific implementation, the key of the management linked list consists of a multicast id, a mode number and a port number; the management linked list associates the first address of the configuration list through an index;
s3, when a new multicast copy information is added, the management chain table and the configuration table need to be added with nodes;
specifically, the multicast replication information includes a multicast id, a port number, a replication mode, and the like.
And when the management linked list executes the newly added multicast copy information, nodes of the newly added management linked list are required to be added, the multicast copy information is added to the linked list, and meanwhile, a key value is determined through the multicast id + mode number + port number.
In specific implementation, a new multicast copy information is added, if the management linked list is the first node, the multicast id is determined to add the first copy information, and an index table and a configuration table are required to be configured; if the management list is not the first node, only the configuration table is needed.
Preferably, if the table entry of the corresponding area of a certain copy mode of the configuration table exceeds the waterline, adding a new table entry to the adjacent mode table entry space; so as to ensure the continuity and space utilization of the mode table entry configuration and ensure the linear speed of the copying capability.
S4, when deleting the multicast duplication information, the node deletion process is carried out to the management chain table and the configuration table;
specifically, a key value is calculated according to the multicast replication information, and the nodes of the management linked list are quickly inquired through the key value.
And in specific implementation, front and back indexes of the configuration table are maintained according to the position of the deletion node in the management linked list.
In specific implementation, according to the deleted multicast replication information, the area of the deletion information in the configuration table entry is judged according to the replication mode, then the index number is found according to the multicast id, the node needing to be deleted is found according to the index number, the corresponding node is deleted, and the last table entry in the mode is filled in the deleted vacancy.
S5 changes the multicast copy information, and carries out the corresponding change process according to the mode of the copy table item.
In specific implementation, the changing of the multicast replication information includes changing in a same mode and changing in a different mode, and specifically includes: the same mode change directly modifies the information in the nodes in the management chain table and the table items in the configuration table; the change processing of different modes requires deletion of the table entry of the mode before the change and addition of the table entry of the mode after the change.
It should be noted that although the operations of the method of the present invention have been described in the above embodiments and the accompanying drawings in a particular order, this does not require or imply that these operations must be performed in this particular order, or that all of the operations shown must be performed, to achieve the desired results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions.
For a more clear explanation of the above method for dynamically managing huge memory data, a specific embodiment is described below, however, it should be noted that this embodiment is only for better describing the present invention, and should not be construed as an undue limitation to the present invention.
The first embodiment is as follows:
a dynamic management method for super large memory data mainly relates to three tables: a management linked list of the control plane; the forwarding plane includes an index table and a configuration table (both ram tables).
The forwarding process of multicast replication: and searching the index table through the multicast id to find the initial address of the configuration table, and then copying the information of the serial configuration table.
The specific implementation steps are as follows:
s1, dividing the configuration table into 3 areas according to the multicast copy mode, wherein different areas can be connected in series;
the configuration table items are divided into 3 modes, which correspond to the multicast replication mode, wherein the first mode occupies 1 table item, the second mode continuously occupies two table items, and the third mode continuously occupies 4 table items.
S2 dynamically creates a management linked list, as shown in figure 3,
the management linked list is a linked list created by software management multicast copy information, and is a bidirectional linked list, and each node comprises:
mul _ id: multicast id;
num _ index: configuring the first address of the table entry of the index;
port: a port number;
table _ addr: a node address;
key: the key value is used for quick searching;
mode: the table entry modes are divided into 3 types;
pre _ addr: the forward address of the node;
next _ addr: the backward address of the node;
s3, when a new multicast copy information is added, the management chain table and the configuration table need to be added with nodes;
the multicast comprises a multicast id, a port number, a copy mode and the like;
adding a new multicast copy information, if the management linked list is the first node, indicating that the multicast id adds the first copy information and needs to configure an index table and a configuration table; if the management linked list is not the first node, only the configuration table is needed.
When adding new multicast copy information, the processing flow of managing the linked list and configuration is shown in fig. 4, and the specific flow is as follows:
1) judging whether a multicast id exists or not according to the multicast replication information;
2) if the multicast id already exists, adding a node of a management linked list; if the multicast id does not exist, the multicast id is newly added in the index table;
3) judging the area of the configuration table entry according to the copy mode;
4) newly adding table entries of a configuration table;
5) if the configured list item exceeds the regional waterline, the list item is moved, and the information and the configuration list in the management linked list are maintained; if not, quitting and ending the newly added process.
The initial table entry configuration ranges of different mode allocations and the configuration range of each mode is continuous, but the waterline can be adjusted and moved as needed.
As shown in fig. 1, if the table entry in a corresponding area of a multicast copy mode of the configuration table exceeds the waterline, adding an entry to the adjacent mode table entry space; the reason for the movement is to ensure the continuity and space utilization of the mode table entry configuration and ensure the line speed of the replication capability.
The process of managing the linked list includes: adding nodes of a management linked list, adding multicast copy information to the linked list, and determining a key value through a multicast id + mode number + port number;
the processing flow of the configuration table comprises the following steps:
when the user uses the system, firstly, the required copying mode is selected, namely, the corresponding different areas are selected; judging the area, and configuring the information to the tail of the area of the corresponding multicast configuration table;
the management linked list is processed by software, the configuration list is processed by hardware, and the area division is performed by aiming at the division of hardware list items (namely ram lists). The management linked list of the software stores each field in the management linked list according to the data issued by the user in turn, and then configures corresponding items for the hardware.
S4, when deleting the multicast replication information, the node deletion processing is carried out on the management chain table and the configuration table; the specific processing flow is shown in fig. 5;
1. calculating a key value according to the multicast replication information, and quickly querying the nodes of the management linked list through the key value;
2. deleting the current node of the management chain, and maintaining the front and back indexes of the configuration table according to the positions (chain head, chain middle and chain tail) of the deleted information;
if the first node is the chain head, deleting the first node of the management linked list, and modifying the index table of the multicast id;
if the deleted node is the first node, the multicast id does not need to be copied, the index table needs to be released, and the index table points to a default configuration table item, namely the multicast id cannot be copied; the deleted non-first node indicates that the multicast id still needs to be copied without modifying the index table.
If the link end is the link end, deleting the end node of the management linked list;
if the node is in the chain, deleting the current node of the management chain table, and not displaying the relation of the forward and backward nodes of the deleted node.
3. And (3) processing of a configuration table:
according to the deleted copy information, firstly judging the region of the delete information in the configuration table entry according to the multicast copy mode, then searching the index number in the index table according to the multicast id, searching the node needing to be deleted in the configuration table entry according to the index number, deleting the corresponding node, and filling the last table entry of the mode in the deleted vacancy.
S5 changes the multicast copy information, and carries out the corresponding change process according to the mode of the copy table item.
The specific processing flow is shown in fig. 6:
firstly, according to a copy mode, the change of the same mode and the change of different modes are divided;
the same mode change processing is simpler, and the information in the nodes in the management linked list and the table entries in the configuration table are directly modified; only the changed field is directly replaced by the field before the change, and the next-hop field is not required to be changed;
the change processing of different modes needs to consider the table item deletion of the mode before the change and the table item addition of the mode after the change, and the specific processing is as follows:
1. deleting nodes before change in the management linked list and deleting list items of the configuration list;
2. filling the vacant entries by moving the last entry of the pre-configuration mode (i.e. the copy mode corresponding to the deleted configuration entry, the corresponding area);
3. if the node before change is the multicast chain head, modifying the index table of the resistance ratio id;
4. and maintaining the information of the changed nodes, and simultaneously adding the table entries of the changed modes.
When the management linked list is maintained correctly, configuring the corresponding data domain information to a multicast configuration table; the data domain information is a field contained in the management linked list node and is a software management table item. The multicast configuration table is the configuration table above and is a table item realized by hardware; the management chain table firstly distributes the field of the next hop through software, and then configures the information such as the contained port number and the like into the configuration table.
The method for dynamically managing the oversized memory data has the advantages that the method for dynamically managing the oversized memory data is provided for solving the problems in the prior art of data processing, the method for quickly searching and dynamically changing the memory data and meeting the requirement of line speed is realized by indexing the index value and combining the bidirectional chain table and the key value, the method is suitable for scenes such as exchanger message multicast replication and the like, meets the requirements of quickness, high efficiency, convenience in management and the like, is particularly suitable for the requirements of adding, deleting and updating during message multicast replication, and is also suitable for the utilization efficiency of memory space.
The applicant of the present invention has made detailed description and description of the embodiments of the present invention with reference to the drawings, which are included in the specification, the embodiments of the present invention are merely preferred embodiments of the present invention, and the detailed description is only for the purpose of helping the reader to better understand the spirit of the present invention, and not for limiting the scope of the present invention, but rather, any improvement or modification made based on the spirit of the present invention should fall within the scope of the present invention.
Claims (9)
1. A method for dynamically managing super-large memory data is characterized by comprising the following steps:
s1, dividing the configuration table into 3 areas according to the multicast copy mode, wherein different areas can be connected in series;
s2 dynamically creating a management linked list composed of two-way linked lists;
s3, when a new multicast copy information is added, the management chain table and the configuration table need to be added with nodes;
s4, when deleting the multicast replication information, the node deletion processing is carried out on the management chain table and the configuration table;
when the multicast replication information is changed in S5, a corresponding change process is performed according to the multicast replication mode of the change entry.
2. The method of claim 1, wherein the method comprises the steps of: the configuration table entry is divided into 3 regions corresponding to the multicast replication mode.
3. The method of claim 1, wherein the method comprises the steps of: the key of the management linked list consists of multicast id + mode number + port number; the management linked list associates the list item head address of the configuration list through indexes.
4. The method of claim 1, wherein the method comprises the steps of: the multicast replication information comprises multicast id, port number and replication mode.
5. The method of claim 1, wherein the method comprises the steps of: and when the management linked list executes the newly added multicast copy information, nodes of the newly added management linked list are required to be added, the multicast copy information is added to the linked list, and meanwhile, a key value is determined through the multicast id + mode number + port number.
6. The method of claim 1, wherein the method comprises the steps of: and calculating a key value according to the multicast replication information, and quickly querying the nodes of the management linked list through the key value.
7. The method of claim 1, wherein the method comprises the steps of: and maintaining the front and back indexes of the configuration table according to the position of the deletion node in the management linked list.
8. The method of claim 1, wherein the method comprises the steps of: according to the deleted multicast replication information, firstly judging the area of the deleted node in the configuration table entry according to the multicast replication mode, then searching the index number in the index table according to the multicast id, searching the node needing to be deleted in the configuration table according to the index number, deleting the corresponding node, and filling the last entry of the multicast replication mode to the deleted vacancy.
9. The method of claim 1, wherein the method comprises the steps of: the method for changing the multicast replication information includes the following steps: the same mode change directly modifies the information in the nodes in the management chain table and the table items in the configuration table; the change processing of different modes requires deleting the table entries of the mode before the change and adding new table entries of the mode after the change.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210640467.7A CN114884910B (en) | 2022-06-08 | 2022-06-08 | Dynamic management method for ultra-large memory data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210640467.7A CN114884910B (en) | 2022-06-08 | 2022-06-08 | Dynamic management method for ultra-large memory data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114884910A true CN114884910A (en) | 2022-08-09 |
| CN114884910B CN114884910B (en) | 2023-06-16 |
Family
ID=82679039
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210640467.7A Active CN114884910B (en) | 2022-06-08 | 2022-06-08 | Dynamic management method for ultra-large memory data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114884910B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101047649A (en) * | 2007-04-05 | 2007-10-03 | 华为技术有限公司 | Method and equipment for transmitting data flow |
| CN101276334A (en) * | 2007-03-29 | 2008-10-01 | 上海新跃仪表厂 | Linked list implementing method for quickly searching data |
| CN101534477A (en) * | 2009-04-23 | 2009-09-16 | 杭州华三通信技术有限公司 | List item management method and device |
| US20170262368A1 (en) * | 2016-03-14 | 2017-09-14 | Shenzhen Skyworth-Rgb Electronic Co., Ltd. | Linked-list-based method and device for application caching management |
| CN112506814A (en) * | 2020-11-17 | 2021-03-16 | 合肥康芯威存储技术有限公司 | Memory, control method thereof and memory system |
-
2022
- 2022-06-08 CN CN202210640467.7A patent/CN114884910B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101276334A (en) * | 2007-03-29 | 2008-10-01 | 上海新跃仪表厂 | Linked list implementing method for quickly searching data |
| CN101047649A (en) * | 2007-04-05 | 2007-10-03 | 华为技术有限公司 | Method and equipment for transmitting data flow |
| CN101534477A (en) * | 2009-04-23 | 2009-09-16 | 杭州华三通信技术有限公司 | List item management method and device |
| US20170262368A1 (en) * | 2016-03-14 | 2017-09-14 | Shenzhen Skyworth-Rgb Electronic Co., Ltd. | Linked-list-based method and device for application caching management |
| CN112506814A (en) * | 2020-11-17 | 2021-03-16 | 合肥康芯威存储技术有限公司 | Memory, control method thereof and memory system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114884910B (en) | 2023-06-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102484610B (en) | Routing table construction method and device and routing table lookup method and device | |
| CN112118186B (en) | Exchange chip routing table entry storage method, forwarding method and configuration method | |
| JP3881663B2 (en) | Packet classification apparatus and method using field level tree | |
| CN102045412A (en) | Method and equipment for carrying out compressed storage on internet protocol version (IPv)6 address prefix | |
| CN1319325C (en) | Method of finding route table item using ltsh chain table | |
| CN101414973B (en) | Method and apparatus for transmitting data packet | |
| CN105791455B (en) | Processing method and device for TCAM space | |
| CN105119834A (en) | Source address and destination address combined searching method based on composite trie tree structure | |
| CN108322394A (en) | Routing table is established, searched, deleting and Status Change method and apparatus | |
| CN101534477A (en) | List item management method and device | |
| WO2011100924A2 (en) | Method and device for adding, searching for and deleting key in hash table | |
| CN114884910B (en) | Dynamic management method for ultra-large memory data | |
| CN102833164B (en) | Implementation method, implementation device and switching device of policy-based routing | |
| CN114884877B (en) | IPv6 route searching method combining hash table and HOT | |
| CN109582640A (en) | A kind of data deduplication storage method, device and storage medium based on sliding window | |
| US7593953B1 (en) | Table lookup mechanism for address resolution | |
| US20030023581A1 (en) | Method and system for performing a longest prefix match search | |
| CN101510837A (en) | Ethernet bridge equipment, method and equipment for migrating polymerization mouth address | |
| CN101616090A (en) | A kind of partition tree node resource method and device | |
| CN100358288C (en) | Method for processing five-membered stream group in network equipment | |
| CN116132384A (en) | Multicast replication method and device for cross-chip flow processing unit | |
| CN111819552B (en) | Access control list management method and device | |
| Abada et al. | A novel path selection and recovery mechanism for MANETs P2P file sharing applications | |
| CN100366023C (en) | Device for searching route | |
| CN114880297A (en) | Distributed data deduplication method and system based on fingerprints |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |