WO2018040600A1 - 基于转发表的信息处理方法、装置及计算机可读存储介质 - Google Patents

基于转发表的信息处理方法、装置及计算机可读存储介质 Download PDF

Info

Publication number
WO2018040600A1
WO2018040600A1 PCT/CN2017/082585 CN2017082585W WO2018040600A1 WO 2018040600 A1 WO2018040600 A1 WO 2018040600A1 CN 2017082585 W CN2017082585 W CN 2017082585W WO 2018040600 A1 WO2018040600 A1 WO 2018040600A1
Authority
WO
WIPO (PCT)
Prior art keywords
keyword
address
buffer memory
memory
content
Prior art date
Application number
PCT/CN2017/082585
Other languages
English (en)
French (fr)
Inventor
胡学权
Original Assignee
深圳市中兴微电子技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 深圳市中兴微电子技术有限公司 filed Critical 深圳市中兴微电子技术有限公司
Publication of WO2018040600A1 publication Critical patent/WO2018040600A1/zh

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0877—Cache access modes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/12—Replacement control
    • G06F12/121—Replacement control using replacement algorithms
    • G06F12/123—Replacement control using replacement algorithms with age lists, e.g. queue, most recently used [MRU] list or least recently used [LRU] list
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/56—Provisioning of proxy services
    • H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/10—Providing a specific technical effect
    • G06F2212/1028—Power efficiency
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/15—Use in a specific computing environment
    • G06F2212/154—Networked environment

Definitions

  • the present invention relates to the field of communications, and in particular, to an information processing method and apparatus based on a forwarding table, and a computer readable storage medium.
  • the forwarding table is the basis for the Ethernet switch to implement fast packet forwarding.
  • the forwarding table is stored in the large-capacity memory. Therefore, all the packets must be forwarded in the forwarding table of the large-capacity memory before being forwarded. After searching, you can know where the next hop of the message is sent.
  • embodiments of the present invention are directed to an information processing method, apparatus, and computer readable storage medium based on a forwarding table.
  • An information processing method based on a forwarding table comprising:
  • the lookup request includes a first keyword for finding a request content and a first address of the search request content being located in the first memory;
  • the determining, according to the first address, whether to search in the second buffer memory or in the first memory includes:
  • the address mapping table is located in the second buffer memory, and the address mapping table stores an address of a content in the second buffer memory in the second buffer memory a mapping relationship of addresses of the content in the first memory;
  • the first address exists in the address mapping table, performing a search in the second buffer memory; if the first address does not exist in the address mapping table, then in the first memory Find it in .
  • the performing the searching in the second buffer memory comprising:
  • the search succeeds; if it is determined that the second keyword is not equal to the first keyword, the search fails.
  • the performing the searching in the first memory comprises:
  • the search succeeds; if it is determined that the third keyword is not equal to the first keyword, the search fails.
  • the method as described above, after determining that the second keyword is equal to the first keyword, further includes:
  • the weights of the contents stored in the second buffer memory are respectively multiplied by a, where a is a preset attenuation coefficient;
  • the weight of the first stored content in the second buffer memory is increased by W add , where W add is a preset incremental weight.
  • the method as described above, after determining that the second keyword is not equal to the first keyword, further includes:
  • the weights of the contents stored in the second buffer memory are respectively multiplied by a, where a is a preset attenuation coefficient.
  • the method as described above, after determining that the third keyword is equal to the first keyword, further includes:
  • W add is greater than the minimum weight
  • replace the storage content corresponding to the minimum weight with the second storage content set the weight of the second storage content to W add and update the address mapping table.
  • the method further includes:
  • the weights of the contents stored in the second buffer memory are respectively multiplied by a; wherein a is a preset attenuation coefficient.
  • the method as described above, after determining that the third keyword is not equal to the first keyword, further includes:
  • the weights of the contents stored in the second buffer memory are respectively multiplied by a; wherein a is a preset attenuation coefficient.
  • the method as described above further includes:
  • An information processing device based on a forwarding table comprising:
  • a receiving module configured to receive a forwarding table lookup request, where the lookup request includes a first keyword for finding a request content and a first address of the search request content being located in the first memory;
  • the determining module is configured to determine whether to perform a search in the second buffer memory or in the first memory according to the first address.
  • the determining module is configured to:
  • the address mapping table is located in the second buffer memory, and the address mapping table stores an address of a content in the second buffer memory in the second buffer memory a mapping relationship of addresses of the content in the first memory;
  • the first address exists in the address mapping table, performing a search in the second buffer memory; if the first address does not exist in the address mapping table, then in the first memory Find it in .
  • the device as described above further includes:
  • Obtaining a module configured to acquire, according to the address mapping table, a second address corresponding to the first address; and acquiring, according to the second address, the first storage content in the second buffer memory, according to the first storage content Obtaining a second keyword; the determining module is further configured to determine whether the second keyword is equal to the first keyword, to determine whether the search is successful;
  • the device further comprises:
  • An acquiring module configured to acquire a second storage content in the first memory according to the first address, and acquire a third keyword according to the second storage content
  • the determining module is configured to determine whether the third keyword is equal to the first keyword to determine whether the search is successful.
  • the apparatus further comprising: a processing module configured to perform one of the following:
  • the weights of the contents stored in the second buffer memory are respectively multiplied by a; the weight of the first storage content in the second buffer memory is increased by W Ad , where a is a preset attenuation coefficient, and W add is a preset incremental weight;
  • the weights of the contents stored in the second buffer memory are respectively multiplied by a; wherein a is a preset attenuation coefficient; W add and the second buffer are The minimum weight of the content stored in the memory is compared; wherein W add is a preset incremental weight; if W add is greater than the minimum weight, the storage content corresponding to the minimum weight is replaced by the second storage content, Setting the weight of the second storage content to W add and updating the address mapping table.
  • the device further includes: an acquisition module and a processing module; wherein
  • the determining module is further configured to: determine, if the third storage content in the first memory is changed, whether the third address of the third storage content in the first memory exists in the address mapping table; Whether the fifth keyword is equal to the fourth keyword; wherein the third storage content includes a fourth keyword;
  • the obtaining module is configured to: if it is determined that the third address exists in the address mapping table, obtain a fourth address corresponding to the third address according to the address mapping table; Obtaining a fourth storage content in the second buffer memory, and acquiring a fifth keyword according to the fourth storage content;
  • the processing module is configured to: if the fifth keyword is equal to the fourth keyword, update the fourth storage content in the second buffer memory to the third storage content; The fifth keyword is not equal to the fourth keyword, and the fourth storage content in the second buffer memory is deleted, and the weight of the fourth storage content is set to 0.
  • An information processing apparatus based on a forwarding table, the apparatus comprising: a processor and a memory configured to store a computer program executable on the processor,
  • processor is configured to perform the steps of the above method when the computer program is run.
  • a computer readable storage medium having stored thereon a computer program that, when executed by a processor, performs the above-described forwarding table-based information processing method.
  • the forwarding table-based information processing method, apparatus, and computer readable storage medium provided by the embodiment of the present invention receive a forwarding table lookup request, wherein the first keyword and the search request content including the search request content in the search request are located at the first The first address in the memory; determining whether to perform the search in the second buffer memory or the first memory according to the first address, thereby reducing the number of accesses of the forwarding table in the large-capacity memory and improving the search speed.
  • Embodiment 1 is a flowchart of Embodiment 1 of an information processing method based on a forwarding table according to the present invention
  • Embodiment 2 is a flowchart of Embodiment 2 of an information processing method based on a forwarding table according to the present invention
  • Embodiment 3 is a flowchart of Embodiment 3 of an information processing method based on a forwarding table according to the present invention
  • Embodiment 4 is a flowchart of Embodiment 4 of an information processing method based on a forwarding table according to the present invention
  • Embodiment 5 is a flowchart of Embodiment 5 of an information processing method based on a forwarding table according to the present invention
  • Embodiment 6 is a flowchart of Embodiment 6 of an information processing method based on a forwarding table according to the present invention
  • Embodiment 7 is a flowchart of Embodiment 7 of an information processing method based on a forwarding table according to the present invention
  • Embodiment 8 is a flowchart of Embodiment 8 of an information processing method based on a forwarding table according to the present invention
  • FIG. 9 is a schematic flowchart of an embodiment of an information processing method based on a forwarding table according to the present invention.
  • FIG. 10 is a schematic structural diagram of an embodiment of an information processing apparatus based on a forwarding table according to the present invention.
  • FIG. 1 is a flowchart of Embodiment 1 of an information processing method based on a forwarding table according to the present invention. As shown in FIG. 1, the method provided in this embodiment includes:
  • Step 101 Receive a forwarding table lookup request.
  • the first request includes a first keyword for finding the content of the request and a first address of the search request content in the first memory.
  • Step 102 Determine, according to the first address, whether to perform a search in the second buffer memory or in the first memory.
  • the second buffer memory stores a portion of the forwarding table in the first memory.
  • the first memory is an off-chip memory, which may be a memory with a relatively large storage capacity, that is, a large-capacity memory, such as several tens of megabytes. And with the development of technology, the storage capacity defined by large-capacity memory will change with the development of technology.
  • the second buffer memory is an on-chip memory (which can be understood as a cache), and can be a buffer memory with a high read/write speed, that is, a cache memory. It should be noted that with the development of technology, the read and write speed defined by the cache memory will change with the development of technology.
  • the forwarding table-based information processing method provided in this embodiment determines whether to perform the search in the second buffer memory or the first memory according to the first address included in the lookup request, thereby reducing access to the forwarding table in the large-capacity memory. The number of times and the purpose of improving the speed of the search.
  • FIG. 2 is a flowchart of Embodiment 2 of an information processing method based on a forwarding table according to the present invention. As shown in FIG. 2, the method provided in this embodiment includes:
  • Step 201 Receive a forwarding table lookup request.
  • the first request includes a first keyword for finding the content of the request and a first address of the search request content in the first memory.
  • Step 202 Determine whether the first address exists in the address mapping table; the address mapping table is located in the second buffer memory, and the address mapping table stores the address and content of the content in the second buffer memory in the second buffer memory in the first memory.
  • Step 203 If the first address exists in the address mapping table, perform a lookup in the second buffer memory.
  • the information processing method based on the forwarding table provided in this embodiment determines that the first address exists in the address mapping table, and determines that the request content is searched in the second buffer memory, thereby reducing the number of forwarding table accesses in the large-capacity memory and improving the search speed.
  • FIG. 3 is a flowchart of Embodiment 3 of an information processing method based on a forwarding table according to the present invention.
  • performing a search in the second buffer memory includes:
  • Step 301 Acquire a second address corresponding to the first address according to the address mapping table.
  • Step 302 Acquire a first stored content in a second buffer memory according to the second address.
  • Step 303 Acquire a second keyword according to the first storage content.
  • Step 304 Determine whether the second keyword is equal to the first keyword.
  • Step 305 If it is determined that the second keyword is equal to the first keyword, the search is successful.
  • a keyword (which may also be called a Key) is unique, and an address may have more than one content, after the related content is obtained according to the address, the keyword needs to be compared, only when the keyword is The same is true to show that the content is requested.
  • the method may further include:
  • Step 306 Multiply the weights of the contents stored in the second buffer memory by a; wherein a is a preset attenuation coefficient.
  • Step 307 Add a weight to the first stored content in the second buffer memory, where W add is a preset incremental weight.
  • the change of the weight is described. It is assumed that the stream numbers 0 and 1 respectively have two data packets, the stream number 2 is one data packet, and the two data packets corresponding to the stream number 0 are respectively P_00, P_01, and the stream number. The corresponding two data packets are numbered P_10 and P_11, and the corresponding data packet number of stream 2 is P_20. The order of the five data packets is P_00, P_10, P_01, P_11, and P_20.
  • P_00 arrives, the weight of stream 0 is W. Because stream 1 has no data packet, the weight is 0. Because stream 2 has no data packet, the weight is also 0.
  • P_10 arrives the weight of previous stream 0 is W.
  • the original weight of stream 0 is attenuated to W*a
  • the weight of stream 1 is W
  • the weight of stream 2 is 0.
  • the weight of previous stream 0 is W*a
  • the new weight is W+W*a 2
  • the weight of stream 1 is attenuated to W*a
  • the weight of stream 2 is 0.
  • P_11 arrives, the stream 0 is originally The weight is W+W*a 2 .
  • the weight of stream 0 is attenuated to (W+W*a 2 )*a, the original weight of stream 1 is W*a, and the new weight is W+W*.
  • a 2 stream 2 weight is 0; when P_20 arrives, the weight of the original stream 0 is (W+W*a 2 )*a, after a new packet, the stream 0 weight is attenuated to (W+W*a 2 ) *a 2 , the original weight of stream 1 is W+W*a 2 , the new weight is (W+W*a 2 )*a, and the stream 2 weight is W.
  • the information processing method based on the forwarding table provided by the embodiment obtains the corresponding content in the second buffer memory by acquiring the first address, acquires the keyword of the corresponding content, determines that the obtained content is the requested query content, and then introduces the weight.
  • the concept updates the weight of the stored content in the second buffer memory, thereby ensuring that the frequently buffered content is stored in the second buffer memory, thereby reducing the number of accesses to the forwarding table in the large-capacity memory and improving the search speed.
  • performing a search in the second buffer memory further includes:
  • Step 401 Acquire a second address corresponding to the first address according to the address mapping table.
  • Step 402 Acquire first storage content in the second buffer memory according to the second address.
  • Step 403 Acquire a second keyword according to the first stored content.
  • Step 404 Determine whether the second keyword is equal to the first keyword.
  • Step 405 If it is determined that the second keyword is not equal to the first keyword, the search fails.
  • the method may further include:
  • Step 406 Multiply the weights of the contents stored in the second buffer memory by a, where a is a preset attenuation coefficient.
  • the information processing method based on the forwarding table provided by the embodiment obtains the corresponding content in the second buffer memory by acquiring the first address, and obtains the keyword of the corresponding content to determine that the obtained content is not the requested query content, and then introduces the weight.
  • the concept updates the weight of the stored content in the second buffer memory, thereby ensuring that the frequently buffered content is stored in the second buffer memory, thereby reducing the number of accesses to the forwarding table in the large-capacity memory and improving the search speed.
  • FIG. 5 is a flowchart of Embodiment 5 of an information processing method based on a forwarding table according to the present invention. As shown in FIG. 5, the method provided in this embodiment includes:
  • Step 501 Receive a forwarding table lookup request.
  • the first request includes a first keyword for finding the content of the request and a first address of the search request content in the first memory.
  • Step 502 Determine whether the first address exists in the address mapping table; the address mapping table is located in the second buffer memory, and the address mapping table stores the content in the second buffer memory in the second buffer A mapping relationship between an address in the memory and an address of the content in the first memory.
  • Step 503 If the first address does not exist in the address mapping table, perform a lookup in the first memory.
  • the information processing method based on the forwarding table provided in this embodiment determines that the first address does not exist in the address mapping table, and determines that the request content is searched in the first memory, thereby reducing the number of forwarding table accesses in the large-capacity memory and improving the search speed.
  • FIG. 6 is a flowchart of Embodiment 6 of an information processing method based on a forwarding table according to the present invention. As shown in FIG. 6, performing the lookup in the first memory includes:
  • Step 601 Acquire second storage content in the first memory according to the first address.
  • Step 602 Acquire a third keyword according to the second storage content.
  • Step 603 Determine whether the third keyword is equal to the first keyword.
  • Step 604 If it is determined that the third keyword is equal to the first keyword, the search is successful.
  • the method may further include:
  • Step 605 Multiply the weights of the contents stored in the second buffer memory by a; wherein a is a preset attenuation coefficient.
  • Step 606 Compare W add with a minimum weight of content stored in the second buffer memory; wherein W add is a preset increment weight.
  • Step 607 If W add is greater than the minimum weight, replace the storage content corresponding to the minimum weight with the second storage content, set the weight of the second storage content to W add and update the address mapping table.
  • updating the address mapping table includes updating the address of the storage content corresponding to the minimum weight in the second buffer memory, and further including updating the address of the storage content corresponding to the minimum weight in the first memory.
  • the forwarding table-based information processing method obtains the corresponding content in the first memory by acquiring the first address, acquires the keyword of the corresponding content, determines that the obtained content is the requested query content, and introduces the concept of weight.
  • the weight of the stored content in the second buffer memory is updated, and after the weight comparison is performed, the content corresponding to the minimum weight in the second buffer memory is replaced, thereby ensuring that the frequently requested content is stored in the second buffer memory, thereby reducing the large-capacity memory.
  • FIG. 7 is a flowchart of Embodiment 7 of an information processing method based on a forwarding table according to the present invention. As shown in Figure 7, the lookup in the first memory includes:
  • Step 701 Acquire second storage content in the first memory according to the first address.
  • Step 702 Acquire a third keyword according to the second storage content.
  • Step 703 Determine whether the third keyword is equal to the first keyword.
  • Step 704 If it is determined that the third keyword is not equal to the first keyword, the search fails.
  • the method may further include:
  • Step 705 Multiply the weights of the contents stored in the second buffer memory by a; wherein a is a preset attenuation coefficient.
  • the forwarding table-based information processing method obtains the corresponding content in the first memory by acquiring the first address, acquires the keyword of the corresponding content, determines that the obtained content is not the requested query content, and introduces the concept of weight.
  • the weight of the stored content in the second buffer memory is updated to ensure that the frequently requested content is stored in the second buffer memory, thereby reducing the number of accesses of the forwarding table in the first memory and improving the search speed.
  • FIG. 8 is a flowchart of Embodiment 8 of an information processing method based on a forwarding table according to the present invention. As shown in FIG. 8, the method provided in this embodiment includes:
  • Step 801 If the third storage content in the first memory is changed, determine whether the third address of the third storage content located in the first memory exists in the address mapping table; wherein the third storage content includes the fourth keyword.
  • Step 802 If it is determined that the third address exists in the address mapping table, obtain a fourth address corresponding to the third address according to the address mapping table.
  • Step 803 Acquire a fourth storage content in the second buffer memory according to the fourth address, and acquire a fifth keyword according to the fourth storage content.
  • Step 804 Determine whether the fifth keyword is equal to the fourth keyword.
  • Step 805 If it is determined that the fifth keyword is equal to the fourth keyword, update the fourth storage content in the second buffer memory to the third storage content; if it is determined that the fifth keyword is not equal to the fourth keyword, the second buffer is The fourth stored content in the memory is deleted, and the weight of the fourth stored content is set to zero.
  • the forwarding table-based information processing method provided by the embodiment determines how to change the content in the second buffer memory when the content in the first memory changes, thereby ensuring the content and the quantity in the second buffer memory.
  • the frequently requested content in the memory is kept synchronized, which reduces the number of accesses to the forwarding table in the large-capacity memory and improves the search speed.
  • FIG. 9 is a schematic flowchart of an embodiment of an information processing method based on a forwarding table according to the present invention. As shown in FIG. 9, the method provided in this embodiment includes:
  • the lookup request includes a first keyword for finding the content of the request and a first address of the lookup request content located in the first memory;
  • the address mapping table is located in the second buffer memory, and the address mapping table stores the address of the content in the second buffer memory in the second buffer memory and the address of the content in the first memory Mapping relationship;
  • the search is successful, the weights of the content stored in the second buffer memory are respectively multiplied by a; and the weight of the first stored content in the second buffer memory is increased by W add .
  • the search fails, and the weights of the content stored in the second buffer memory are respectively multiplied by a.
  • the second storage content is obtained in the first memory according to the first address
  • the search is successful, the weights of the content stored in the second buffer memory are respectively multiplied by a; and W add is compared with the minimum weight of the content stored in the second buffer memory; If W add is greater than the minimum weight, replace the storage content corresponding to the minimum weight with the second storage content, set the weight of the second storage content to W add and update the address mapping table. If W add is less than the minimum weight, it ends.
  • the search fails, and the weight of the content stored in the second buffer memory is multiplied by a, respectively.
  • the forwarding table-based information processing method provided in this embodiment first stores the frequently requested content in the second buffer memory, and then introduces the weight concept to change the weight of the stored content according to the subsequent search request, according to the change.
  • the weight determines the replacement of the storage content, thereby ensuring that the content frequently requested in the second buffer memory can be stored all the time, thereby reducing the number of accesses of the forwarding table in the large-capacity memory and improving the search speed.
  • FIG. 10 is a schematic structural diagram of an embodiment of an information processing apparatus based on a forwarding table according to the present invention. As shown in FIG. 10, the information processing apparatus based on the forwarding table provided in this embodiment includes:
  • the receiving module 11 is configured to receive a forwarding table lookup request.
  • the first request includes a first keyword for finding the content of the request and a first address of the search request content in the first memory.
  • the determining module 12 is configured to determine whether to perform a search in the second buffer memory or in the first memory according to the first address.
  • the determining module 12 is configured to determine whether the first address exists in the address mapping table; the address mapping table is located in the second buffer memory, and the address mapping table stores the address of the content in the second buffer memory in the second buffer memory and a mapping relationship of addresses in the first memory;
  • the search is performed in the second buffer memory.
  • the information processing apparatus based on the forwarding table further includes:
  • the obtaining module 13 is configured to obtain a second address corresponding to the first address according to the address mapping table, obtain the first storage content in the second buffer memory according to the second address, and acquire the second keyword according to the first storage content;
  • the determining module 12 is further configured to determine whether the second keyword is equal to the first keyword to determine whether the search is successful.
  • the search is successful.
  • the obtaining module 13 is further configured to acquire the second storage content in the first memory according to the first address, and acquire the third keyword according to the second storage content;
  • the determining module 12 is further configured to determine whether the third keyword is equal to the first keyword to determine whether the search is successful.
  • the search is successful.
  • the information processing apparatus based on the forwarding table further includes:
  • the processing module 14 is configured to, after the search in the second buffer memory is successful, multiply the weight of the content stored in the second buffer memory by a, and increase the weight of the first storage content in the second buffer memory by W ad; , a is a preset attenuation coefficient, and W add is a preset incremental weight.
  • processing module 14 is further configured to find the height of success in the buffer memory, second buffer memory in the stored contents are multiplied by weight of a; wherein, a is the attenuation factor set in advance; the first W add Comparing the minimum weights of the contents stored in the two buffer memories; wherein W add is a preset increment weight; if W add is greater than the minimum weight, replacing the storage content corresponding to the minimum weight with the second storage content, and setting the second storage The weight of the content is W add and the address mapping table is updated.
  • the determining module 12 is further configured to: if the third storage content in the first memory is changed, determine whether the third address of the third storage content in the first memory exists in the address mapping table; determine the fifth keyword Whether it is equal to the fourth keyword; wherein the third storage content includes the fourth keyword;
  • the obtaining module 13 is further configured to: if it is determined that the third address exists in the address mapping table, obtain a fourth address corresponding to the third address according to the address mapping table; and acquire the fourth storage content in the second buffer memory according to the fourth address, according to The fourth storage content acquires the fifth keyword;
  • the processing module 14 is further configured to: if it is determined that the fifth keyword is equal to the fourth keyword, update the fourth storage content in the second buffer memory to the third storage content; if it is determined that the fifth keyword is not equal to the fourth keyword, The fourth storage content in the second buffer memory is deleted, and the weight of the fourth storage content is set to zero.
  • the forwarding table-based information processing apparatus provided in this embodiment may be configured to perform the foregoing technical solution of the forwarding table-based information processing method embodiment, and the implementation principle and the technical effect are similar, and details are not described herein again.
  • the information processing apparatus based on the forwarding table provided in the foregoing embodiment is only illustrated by the division of each of the foregoing program modules when performing processing. In actual applications, the foregoing processing may be allocated to different programs according to requirements. The module is completed, dividing the internal structure of the device into different program modules to complete all or part of the processing described above.
  • the receiving module 11, the determining module 12, the obtaining module 13, and the processing module 14 may each be a processor located in a forwarding table-based information processing device, such as a central processing unit (CPU), and a micro processing unit.
  • a forwarding table-based information processing device such as a central processing unit (CPU), and a micro processing unit.
  • CPU central processing unit
  • MPU Micro Processor Unit
  • DSP Digital Signal Processor
  • FPGA Field Programmable Gate Array
  • an embodiment of the present invention further provides an information processing apparatus based on a forwarding table, including: a processor and a memory for storing a computer program capable of running on a processor, wherein the processor is configured to run the When the computer program is executed, execute:
  • the lookup request includes a first keyword for finding the content of the request and a first address of the lookup request content located in the first memory;
  • the processor is further configured to: when the computer program is executed, execute:
  • the address mapping table is located in the second buffer memory, and the address mapping table stores an address of a content in the second buffer memory in the second buffer memory a mapping relationship of addresses of the content in the first memory;
  • the first address exists in the address mapping table, performing a search in the second buffer memory; if the first address does not exist in the address mapping table, then in the first memory Find it in .
  • the processor is further configured to execute the computer program Row:
  • the search succeeds; if it is determined that the second keyword is not equal to the first keyword, the search fails.
  • the processor is further configured to: when the computer program is executed, execute:
  • the search succeeds; if it is determined that the third keyword is not equal to the first keyword, the search fails.
  • the processor is further configured to: when the computer program is executed, execute:
  • the weights of the content stored in the second buffer memory are respectively multiplied by a, where a is a preset attenuation coefficient
  • the weight of the first stored content in the second buffer memory is increased by W add , where W add is a preset incremental weight.
  • the processor is further configured to: when the computer program is executed, execute:
  • the weights of the content stored in the second buffer memory are respectively multiplied by a, where a is a preset attenuation coefficient.
  • the processor is further configured to: when the computer program is executed, execute:
  • the weights of the content stored in the second buffer memory are respectively multiplied by a; wherein a is a preset attenuation coefficient;
  • W add is greater than the minimum weight
  • replace the storage content corresponding to the minimum weight with the second storage content set the weight of the second storage content to W add and update the address mapping table.
  • the processor is further configured to: when the computer program is executed, execute:
  • the weights of the content stored in the second buffer memory are respectively multiplied by a; wherein a is a preset attenuation coefficient.
  • the processor is further configured to: when the computer program is executed, execute:
  • embodiments of the present invention can be provided as a method, system, or computer program product. Accordingly, the present invention can take the form of a hardware embodiment, a software embodiment, or a combination of software and hardware. Moreover, the invention may be employed in one or more of its A computer program product embodied on a computer usable storage medium (including but not limited to disk storage and optical storage, etc.) containing computer usable program code.
  • a computer usable storage medium including but not limited to disk storage and optical storage, etc.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.
  • an embodiment of the present invention further provides a computer readable storage medium, where the computer program is stored, and when the computer program is executed by the processor, the information processing method based on the forwarding table of the embodiment of the present invention is executed.
  • the solution provided by the embodiment of the present invention by receiving a forwarding table lookup request, where the first request of the search request includes the first keyword of the search request content and the first address of the search request content in the first memory;
  • the second buffer memory is still in the first memory
  • the search is performed to reduce the number of accesses to the forwarding table in the large-capacity memory and to improve the search speed.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Memory System Of A Hierarchy Structure (AREA)

Abstract

本发明实施例提供一种基于转发表的信息处理方法，包括：接收转发表查找请求；根据第一地址判断是在第二缓冲存储器中还是在第一存储器中进行查找；其中，查找请求中包含查找请求内容的第一关键字和查找请求内容位于第一存储器中的第一地址。本发明实施例同时还提供一种基于转发表的信息处理装置及计算机可读存储介质。

Description

基于转发表的信息处理方法、装置及计算机可读存储介质
相关申请的交叉引用
本申请基于申请号为201610796752.2、申请日为2016年08月31日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此引入本申请作为参考。
技术领域
本发明涉及通信领域，尤其涉及一种基于转发表的信息处理方法、装置及计算机可读存储介质。
背景技术
转发表是以太网交换机实现报文快速转发的基础，现有技术中，转发表被存储在大容量存储器中，因此，所有报文在进行转发之前，都要在大容量存储器的转发表中进行查找后才能知晓报文下一跳要发往何处。
然而随着互联网用户的不断增加、内容的不断丰富，通过访问在大容量存储器中的转发表进行内容的查找往往会导致查找速度低下。
发明内容
有鉴于此，本发明实施例期望提供一种基于转发表的信息处理方法、装置及计算机可读存储介质。
本发明实施例的技术方案是这样实现的：
一种基于转发表的信息处理方法，包括：
接收转发表查找请求；其中，所述查找请求中包含查找请求内容的第一关键字和所述查找请求内容位于第一存储器中的第一地址；
根据所述第一地址判断是在第二缓冲存储器中还是在第一存储器中进行查找。
如上所述的方法，所述根据所述第一地址判断是在第二缓冲存储器中还是在第一存储器中进行查找，包括：
判断所述第一地址是否存在于地址映射表中；所述地址映射表位于所述第二缓冲存储器中，所述地址映射表存储第二缓冲存储器中的内容在第二缓冲存储器中的地址与所述内容在第一存储器中的地址的映射关系；
若所述第一地址存在于所述地址映射表中，则在所述第二缓冲存储器中进行查找；若所述第一地址不存在于所述地址映射表中，则在所述第一存储器中进行查找。
如上所述的方法，所述在所述第二缓冲存储器中进行查找，包括：
根据所述地址映射表获取所述第一地址对应的第二地址；
根据所述第二地址在所述第二缓冲存储器中获取第一存储内容；
根据所述第一存储内容获取第二关键字；
判断所述第二关键字是否等于所述第一关键字；
若判断所述第二关键字等于所述第一关键字，则查找成功；若判断所述第二关键字不等于所述第一关键字，则查找失败。
如上所述的方法，所述在所述第一存储器中进行查找，包括：
根据所述第一地址在所述第一存储器中获取第二存储内容；
根据所述第二存储内容获取第三关键字；
判断所述第三关键字是否等于所述第一关键字；
若判断所述第三关键字等于所述第一关键字，则查找成功；若判断所述第三关键字不等于所述第一关键字，则查找失败。
如上所述的方法，若判断所述第二关键字等于所述第一关键字之后，还包括：
对所述第二缓冲存储器中所存储内容的权重分别乘以a，其中a为预先设定的衰减系数；
对所述第二缓冲存储器中的所述第一存储内容的权重增加Wadd，其中Wadd为预先设定的增量权重。
如上所述的方法，若判断所述第二关键字不等于所述第一关键字之后，还包括：
对所述第二缓冲存储器中所存储内容的权重分别乘以a，其中a为预先设定的衰减系数。
如上所述的方法，若判断所述第三关键字等于所述第一关键字之后，还包括：
对所述第二缓冲存储器中所存储内容的权重分别乘以a；其中，a为预先设定的衰减系数；
将Wadd与所述第二缓冲存储器中所存储内容的最小权重进行比较；其中，Wadd为预先设定的增量权重；
若Wadd大于所述最小权重，用所述第二存储内容替换所述最小权重对应的存储内容，设置所述第二存储内容的权重为Wadd并更新所述地址映射表。
若判断所述第三关键字不等于所述第一关键字之后，所述方法还包括：
对所述第二缓冲存储器中所存储内容的权重分别乘以a；其中，a为预先设定的衰减系数。
如上所述的方法，若判断所述第三关键字不等于所述第一关键字之后，还包括：
对所述第二缓冲存储器中所存储内容的权重分别乘以a；其中，a为预先设定的衰减系数。
如上所述的方法，还包括：
若第一存储器中的第三存储内容发生改变，判断所述第三存储内容位于所述第一存储器中的第三地址是否存在于所述地址映射表中；其中，所述第三存储内容包含第四关键字；
若判断所述第三地址存在于所述地址映射表中，根据所述地址映射表获取所述第三地址对应的第四地址；
根据所述第四地址在所述第二缓冲存储器中获取第四存储内容；
根据所述第四存储内容获取第五关键字；
判断所述第五关键字是否等于所述第四关键字；
若判断所述第五关键字等于所述第四关键字，将所述第二缓冲存储器中的所述第四存储内容更新为所述第三存储内容；
若判断所述第五关键字不等于所述第四关键字，将所述第二缓冲存储器中的所述第四存储内容删除，并设置所述第四存储内容的权重为0。
一种基于转发表的信息处理装置，包括：
接收模块，配置为接收转发表查找请求；其中，所述查找请求中包含查找请求内容的第一关键字和所述查找请求内容位于第一存储器中的第一地址；
判断模块，配置为根据所述第一地址判断是在第二缓冲存储器中还是在第一存储器中进行查找。
如上所述的装置，所述判断模块配置为：
判断所述第一地址是否存在于地址映射表中；所述地址映射表位于所述第二缓冲存储器中，所述地址映射表存储第二缓冲存储器中的内容在第二缓冲存储器中的地址与所述内容在第一存储器中的地址的映射关系；
若所述第一地址存在于所述地址映射表中，则在所述第二缓冲存储器中进行查找；若所述第一地址不存在于所述地址映射表中，则在所述第一存储器中进行查找。
如上所述的装置，还包括：
获取模块，配置为根据所述地址映射表获取所述第一地址对应的第二地址；根据所述第二地址在所述第二缓冲存储器中获取第一存储内容，根据所述第一存储内容获取第二关键字；所述判断模块，还配置为判断第二关键字是否等于第一关键字，以判断是否查找成功；
或者，所述装置还包括：
获取模块，配置为根据所述第一地址在所述第一存储器中获取第二存储内容，根据所述第二存储内容获取第三关键字；
所述判断模块，配置为判断第三关键字是否等于第一关键字，以判断是否查找成功。
如上所述的装置，所述装置还包括：处理模块，配置为执行以下之一：
当在所述第二缓冲存储器中查找成功后，对所述第二缓冲存储器中所存储内容的权重分别乘以a；对所述第二缓冲存储器中的所述第一存储内容的权重增加Wad，其中，a为预先设定的衰减系数，Wadd为预先设定的增量权重；
当在所述第一存储器中查找成功后，对所述第二缓冲存储器中所存储内容的权重分别乘以a；其中，a为预先设定的衰减系数；将Wadd与所述第二缓冲存储器中所存储内容的最小权重进行比较；其中，Wadd为预先设定的增量权重；若Wadd大于所述最小权重，用所述第二存储内容替换所述最小权重对应的存储内容，设置所述第二存储内容的权重为Wadd并更新所述地址映射表。
如上所述的装置，所述装置还包括：获取模块及处理模块；其中，
所述判断模块，还配置为若第一存储器中的第三存储内容发生改变，判断所述第三存储内容位于所述第一存储器中的第三地址是否存在于所述地址映射表中；判断所述第五关键字是否等于所述第四关键字；其中，所述第三存储内容包含第四关键字；
所述获取模块，配置为若判断所述第三地址存在于所述地址映射表中，根据所述地址映射表获取所述第三地址对应的第四地址；根据所述第四地址在所述第二缓冲存储器中获取第四存储内容，根据所述第四存储内容获取第五关键字；
所述处理模块，配置为若判断所述第五关键字等于所述第四关键字，将所述第二缓冲存储器中的所述第四存储内容更新为所述第三存储内容；若判断所述第五关键字不等于所述第四关键字，将所述第二缓冲存储器中的所述第四存储内容删除，并设置所述第四存储内容的权重为0。
一种基于转发表的信息处理装置，所述装置包括：处理器和配置为存储能够在处理器上运行的计算机程序的存储器，
其中，所述处理器配置为运行所述计算机程序时，执行如上方法的步骤。
一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被处理器运行时，执行上述的基于转发表的信息处理方法。
本发明实施例提供的基于转发表的信息处理方法、装置和计算机可读存储介质，通过接收转发表查找请求，其中，查找请求中包含查找请求内容的第一关键字和查找请求内容位于第一存储器中的第一地址；根据第一地址判断是在第二缓冲存储器中还是在第一存储器中进行查找，实现了减少大容量存储器中转发表的访问次数和提高查找速度的目的。
附图说明
图1为本发明基于转发表的信息处理方法实施例一的流程图；
图2为本发明基于转发表的信息处理方法实施例二的流程图；
图3为本发明基于转发表的信息处理方法实施例三的流程图；
图4为本发明基于转发表的信息处理方法实施例四的流程图；
图5为本发明基于转发表的信息处理方法实施例五的流程图；
图6为本发明基于转发表的信息处理方法实施例六的流程图；
图7为本发明基于转发表的信息处理方法实施例七的流程图；
图8为本发明基于转发表的信息处理方法实施例八的流程图；
图9为本发明基于转发表的信息处理方法实施例流程示意图；
图10为本发明基于转发表的信息处理装置实施例的结构示意图。
具体实施方式
图1为本发明基于转发表的信息处理方法实施例一的流程图。如图1所示，本实施例提供的方法包括：
步骤101、接收转发表查找请求；其中，查找请求中包含查找请求内容的第一关键字和查找请求内容位于第一存储器中的第一地址。
步骤102、根据第一地址判断是在第二缓冲存储器中还是在第一存储器中进行查找。
换句话说，根据第一地址判断是在第二缓冲存储器中的转发表中进行查找，还是在第一存储器中的转发表中进行查找。
其中，第二缓冲存储器中存储了第一存储器中转发表的部分。
实际应用时，所述第一存储器是片外存储器，可以是指：存储容量比较大的存储器，即大容量存储器，比如：几十兆等。而且随着技术的发展，大容量存储器所定义的存储容量是会随技术的发展而变化的。
所述第二缓冲存储器是片内存储器(可以理解为cache)，可以是指读写速度较高的缓冲存储器，即高速缓冲存储器。需要说明的是：随着技术的发展，高速缓冲存储器所定义的读写速度是会随技术的发展而变化的。
本实施例提供的基于转发表的信息处理方法，根据包含在查找请求中的第一地址判断是在第二缓冲存储器中还是在第一存储器中进行查找，从而实现减少大容量存储器中转发表的访问次数和提高查找速度的目的。
图2为本发明基于转发表的信息处理方法实施例二的流程图。如图2所示，本实施例提供的方法包括：
步骤201、接收转发表查找请求；其中，查找请求中包含查找请求内容的第一关键字和查找请求内容位于第一存储器中的第一地址。
步骤202、判断第一地址是否存在于地址映射表中；地址映射表位于第二缓冲存储器中，地址映射表存储第二缓冲存储器中的内容在第二缓冲存储器中的地址与内容在第一存储器中的地址的映射关系。
步骤203、若第一地址存在于地址映射表中，则在第二缓冲存储器中进行查找。
本实施例提供的基于转发表的信息处理方法，通过判断第一地址存在于地址映射表中，确定在第二缓冲存储器中查找请求内容，从而减少大容量存储器中转发表访问次数，提高查找速度。
具体地，图3为本发明基于转发表的信息处理方法实施例三的流程图，如图3所示，在第二缓冲存储器中进行查找包括：
步骤301、根据地址映射表获取第一地址对应的第二地址。
步骤302、根据第二地址在第二缓冲存储器中获取第一存储内容。
步骤303、根据第一存储内容获取第二关键字。
步骤304、判断第二关键字是否等于第一关键字。
步骤305、若判断第二关键字等于第一关键字，则查找成功。
需要说明的是，由于关键字(也可以称为Key)是唯一的，而一个地址所对应的内容可能有多个，所以在根据地址获取相关内容后，需要比对关键字，只有当关键字相同，才能说明获取内容是请求内容。
还需要说明的是，步骤305之后，还可以包括：
步骤306、对第二缓冲存储器中所存储内容的权重分别乘以a；其中a为预先设定的衰减系数。
步骤307、对第二缓冲存储器中的第一存储内容的权重增加Wadd；其中Wadd为预先设定的增量权重。
具体地，对权重的变化进行说明，假设流号0和1分别来2个数据包，流号2来一个数据包，流号0对应的2个数据包的编号分别为P_00，P_01，流号1对应的2个数据包的编号分别为P_10，P_11，流2对应数据包的编号为P_20，这5个数据包的来的先后顺序分别为P_00，P_10，P_01，P_11，P_20。当P_00到达后，流0的权重为W，流1因为没有数据包，所以权重为0，流2因为没有数据包，所以权重也为0；当P_10到达后，先前流0的权重为W，新来一个数据包后，流0原先的权重衰减为W*a，流1的权重为W，流2权重为0；P_01到达后，先前流0的权重为W*a，新来一个包后，流0原先的权重衰减为W*a2，然后新的权重为W+W*a2，流1的权重衰减为W*a，流2权重为0；当P_11到达后，原先流0的权重为W+W*a2，新来一个数据包后，流0权重衰减为(W+W*a2)*a，流1原先的权重为W*a，新的权重为W+W*a2，流2权重为0；当P_20到达后，原先流0的权重为(W+W*a2)*a新来一个数据包后，流0权重衰减为(W+W*a2)*a2，流1原先的权重为W+W*a2，新的权重为(W+W*a2)*a，流2权重为W。
假设第二缓冲存储器中所存储内容的权重原来分别是Wodd1、 Wodd2……Woddn并假设第一存储内容的权重是Wodd2，因此，Wnew1＝Wodd1*a，Wnew2＝Wodd2*a+Wadd，……，Wnewn＝Woddn*a。
本实施例提供的基于转发表的信息处理方法，通过获取第一地址在第二缓冲存储器中获取对应的内容，获取对应内容的关键字确定获取的内容是所请求的查询内容，再引入权重的概念对第二缓冲存储器中存储内容的权重进行更新，从而保证第二缓冲存储器中存储频繁请求的内容，实现减少大容量存储器中转发表的访问次数和提高查找速度的目的。
图4为本发明基于转发表的信息处理方法实施例四的流程图，如图4所示，在第二缓冲存储器中进行查找还包括：
步骤401、根据地址映射表获取第一地址对应的第二地址。
步骤402、根据第二地址在第二缓冲存储器中获取第一存储内容。
步骤403、根据第一存储内容获取第二关键字。
步骤404、判断第二关键字是否等于第一关键字。
步骤405、若判断第二关键字不等于第一关键字，则查找失败。
还需要说明的是，步骤405后，所述方法还可以包括：
步骤406、对第二缓冲存储器中所存储内容的权重分别乘以a，其中a为预先设定的衰减系数。
本实施例提供的基于转发表的信息处理方法，通过获取第一地址在第二缓冲存储器中获取对应的内容，获取对应内容的关键字确定获取的内容不是所请求的查询内容，再引入权重的概念对第二缓冲存储器中存储内容的权重进行更新，从而保证第二缓冲存储器中存储频繁请求的内容，实现减少大容量存储器中转发表的访问次数和提高查找速度的目的。
图5为本发明基于转发表的信息处理方法实施例五的流程图。如图5所示，本实施例提供的方法包括：
步骤501、接收转发表查找请求；其中，查找请求中包含查找请求内容的第一关键字和查找请求内容位于第一存储器中的第一地址。
步骤502、判断第一地址是否存在于地址映射表中；地址映射表位于第二缓冲存储器中，地址致映射表存储第二缓冲存储器中的内容在第二缓冲 存储器中的地址与内容在第一存储器中的地址的映射关系。
步骤503、若第一地址不存在于地址映射表中，则在第一存储器中进行查找。
本实施例提供的基于转发表的信息处理方法，通过判断第一地址不存在于地址映射表中，确定在第一存储器中查找请求内容，从而减少大容量存储器中转发表访问次数，提高查找速度。
图6为本发明基于转发表的信息处理方法实施例六的流程图。如图6所示，在第一存储器中进行查找包括：
步骤601、根据第一地址在第一存储器中获取第二存储内容。
步骤602、根据第二存储内容获取第三关键字。
步骤603、判断第三关键字是否等于第一关键字。
步骤604、若判断第三关键字等于第一关键字，则查找成功。
需要说明的是，步骤604之后，还可以包括：
步骤605、对第二缓冲存储器中所存储内容的权重分别乘以a；其中，a为预先设定的衰减系数。
步骤606、将Wadd与第二缓冲存储器中所存储内容的最小权重进行比较；其中，Wadd为预先设定的增量权重。
步骤607、若Wadd大于最小权重，用第二存储内容替换最小权重对应的存储内容，设置第二存储内容的权重为Wadd并更新地址映射表。
需要说明的是，更新地址映射表包括更新将最小权重对应的存储内容在第二缓冲存储器中地址，还包括更新最小权重对应的存储内容在第一存储器中的地址。
本实施例提供的基于转发表的信息处理方法，通过获取第一地址在第一存储器中获取对应的内容，获取对应内容的关键字确定获取的内容是所请求的查询内容，再引入权重的概念对第二缓冲存储器中存储内容的权重进行更新，并在进行权重比较后，替换第二缓冲存储器中最小权重对应的内容，从而保证第二缓冲存储器中存储频繁请求的内容，实现减少大容量存储器中转发表的访问次数和提高查找速度的目的。
图7为本发明基于转发表的信息处理方法实施例七的流程图。如图7所示，在第一存储器中进行查找包括：
步骤701、根据第一地址在第一存储器中获取第二存储内容。
步骤702、根据第二存储内容获取第三关键字。
步骤703、判断第三关键字是否等于第一关键字。
步骤704、若判断第三关键字不等于第一关键字，则查找失败。
需要说明的是，在步骤704之后，还可以包括：
步骤705、对第二缓冲存储器中所存储内容的权重分别乘以a；其中，a为预先设定的衰减系数。
本实施例提供的基于转发表的信息处理方法，通过获取第一地址在第一存储器中获取对应的内容，获取对应内容的关键字确定获取的内容不是所请求的查询内容，再引入权重的概念对第二缓冲存储器中存储内容的权重进行更新，从而保证第二缓冲存储器中存储频繁请求的内容，实现减少第一存储器中转发表的访问次数和提高查找速度的目的。
图8为本发明基于转发表的信息处理方法实施例八的流程图。如图8所示，本实施例提供的方法包括：
步骤801、若第一存储器中的第三存储内容发生改变，判断第三存储内容位于第一存储器中的第三地址是否存在于地址映射表中；其中，第三存储内容包含第四关键字。
步骤802、若判断第三地址存在于地址映射表中，根据地址映射表获取第三地址对应的第四地址。
步骤803、根据第四地址在第二缓冲存储器中获取第四存储内容，根据第四存储内容获取第五关键字。
步骤804、判断第五关键字是否等于第四关键字。
步骤805、若判断第五关键字等于第四关键字，将第二缓冲存储器中的第四存储内容更新为第三存储内容；若判断第五关键字不等于第四关键字，将第二缓冲存储器中的第四存储内容删除，并设置第四存储内容的权重为0。
本实施例提供的基于转发表的信息处理方法，在第一存储器中的内容发生改变时，确定如何对第二缓冲存储器中的内容进行相应的改变，从而保证第二缓冲存储器中的内容与大量存储器中频繁请求的内容保持同步，实现减少大容量存储器中转发表的访问次数和提高查找速度的目的。
下面提供一个完整的实施例对基于转发表的信息处理方法进行说明，图9为本发明基于转发表的信息处理方法实施例流程示意图。如图9所示，本实施例提供的方法包括：
接收转发表查找请求；其中，查找请求中包含查找请求内容的第一关键字和查找请求内容位于第一存储器中的第一地址；
判断第一地址是否存在于地址映射表中；地址映射表位于第二缓冲存储器中，地址映射表存储第二缓冲存储器中的内容在第二缓冲存储器中的地址与内容在第一存储器中的地址的映射关系；
若第一地址存在于地址映射表中，则根据地址映射表获取第一地址对应的第二地址；
根据第二地址在第二缓冲存储器中获取第一存储内容；
根据第一存储内容获取第二关键字；
判断第二关键字是否等于第一关键字；
若判断第二关键字等于第一关键字，则查找成功，对第二缓冲存储器中所存储内容的权重分别乘以a；对第二缓冲存储器中的第一存储内容的权重增加Wadd。
其中，若判断第二关键字不等于第一关键字，则查找失败，对第二缓冲存储器中所存储内容的权重分别乘以a。
另外，若第一地址不存在于地址映射表中，根据第一地址在第一存储器中获取第二存储内容；
根据第二存储内容获取第三关键字；
判断第三关键字是否等于第一关键字；
若判断第三关键字等于第一关键字，则查找成功，对第二缓冲存储器中所存储内容的权重分别乘以a；将Wadd与第二缓冲存储器中所存储内容 的最小权重进行比较；若Wadd大于最小权重，用第二存储内容替换最小权重对应的存储内容，设置第二存储内容的权重为Wadd并更新地址映射表。若Wadd小于最小权重，结束。
其中，若判断第三关键字不等于第一关键字，则查找失败，对第二缓冲存储器中所存储内容的权重分别乘以a。
本实施例提供的基于转发表的信息处理方法，首先将请求频繁的内容存储在第二缓冲存储器中，再引入权重的概念根据后续的查找请求对所存储的内容的权重进行更改，根据更改后的权重决定存储内容的替换，从而保证第二缓冲存储器中能够一直存储请求频繁的内容，实现减少大容量存储器中转发表的访问次数和提高查找速度的目的。
图10为本发明基于转发表的信息处理装置实施例的结构示意图。如图10所示，本实施例提供的基于转发表的信息处理装置包括：
接收模块11，配置为接收转发表查找请求；其中，查找请求中包含查找请求内容的第一关键字和查找请求内容位于第一存储器中的第一地址。
判断模块12，配置为根据第一地址判断是在第二缓冲存储器中还是在第一存储器中进行查找。
具体地，判断模块12配置为判断第一地址是否存在于地址映射表中；地址映射表位于第二缓冲存储器中，地址映射表存储第二缓冲存储器中的内容在第二缓冲存储器中的地址与内容在第一存储器中的地址的映射关系；
若第一地址存在于地址映射表中，则在第二缓冲存储器中进行查找。
进一步地，基于转发表的信息处理装置还包括：
获取模块13，配置为根据地址映射表获取第一地址对应的第二地址；根据第二地址在第二缓冲存储器中获取第一存储内容，根据第一存储内容获取第二关键字；
判断模块12，还配置为判断第二关键字是否等于第一关键字，以判断是否查找成功。
具体地，若判断第二关键字等于第一关键字，则查找成功。
进一步地，获取模块13，还配置为根据第一地址在第一存储器中获取第二存储内容，根据第二存储内容获取第三关键字；
判断模块12，还配置为判断第三关键字是否等于第一关键字，以判断是否查找成功。
具体地，当第三关键字等于第一关键字时，查找成功。
进一步地，基于转发表的信息处理装置还包括：
处理模块14，配置为在第二缓冲存储器中查找成功后，对第二缓冲存储器中所存储内容的权重分别乘以a；对第二缓冲存储器中的第一存储内容的权重增加Wad；其中，a为预先设定的衰减系数，Wadd为预先设定的增量权重。
其中，处理模块14，还配置为在高度缓冲存储器中查找成功后，对第二缓冲存储器中所存储内容的权重分别乘以a；其中，a为预先设定的衰减系数；将Wadd与第二缓冲存储器中所存储内容的最小权重进行比较；其中，Wadd为预先设定的增量权重；若Wadd大于最小权重，用第二存储内容替换最小权重对应的存储内容，设置第二存储内容的权重为Wadd并更新地址映射表。
进一步地，判断模块12，还配置为若第一存储器中的第三存储内容发生改变，判断第三存储内容位于第一存储器中的第三地址是否存在于地址映射表中；判断第五关键字是否等于第四关键字；其中，第三存储内容包含第四关键字；
获取模块13，还配置为若判断第三地址存在于地址映射表中，根据地址映射表获取第三地址对应的第四地址；根据第四地址在第二缓冲存储器中获取第四存储内容，根据第四存储内容获取第五关键字；
处理模块14，还配置为若判断第五关键字等于第四关键字，将第二缓冲存储器中的第四存储内容更新为第三存储内容；若判断第五关键字不等于第四关键字，将第二缓冲存储器中的第四存储内容删除，并设置第四存储内容的权重为0。
本实施例提供的基于转发表的信息处理装置，可配置为执行上述基于转发表的信息处理方法实施例的技术方案，其实现原理和技术效果类似，此处不再赘述。
需要说明的是：上述实施例提供的基于转发表的信息处理装置在进行处理时，仅以上述各程序模块的划分进行举例说明，实际应用中，可以根据需要而将上述处理分配由不同的程序模块完成，即将装置的内部结构划分成不同的程序模块，以完成以上描述的全部或者部分处理。
在实际应用中，所述接收模块11、判断模块12、获取模块13和处理模块14均可由位于基于转发表的信息处理装置中的处理器比如中央处理器(Central Processing Unit，CPU)、微处理器(Micro Processor Unit，MPU)、数字信号处理器(Digital Signal Processor，DSP)或现场可编程门阵列(Field Programmable Gate Array，FPGA)等实现。
基于此，本发明实施例还提供了一种基于转发表的信息处理装置，包括：处理器和用于存储能够在处理器上运行的计算机程序的存储器，其中，所述处理器用于运行所述计算机程序时，执行：
接收转发表查找请求；其中，查找请求中包含查找请求内容的第一关键字和查找请求内容位于第一存储器中的第一地址；
根据第一地址判断是在第二缓冲存储器中还是在第一存储器中进行查找。
在一具体实施例中，所述处理器还配置为运行所述计算机程序时，执行：
判断所述第一地址是否存在于地址映射表中；所述地址映射表位于所述第二缓冲存储器中，所述地址映射表存储第二缓冲存储器中的内容在第二缓冲存储器中的地址与所述内容在第一存储器中的地址的映射关系；
若所述第一地址存在于所述地址映射表中，则在所述第二缓冲存储器中进行查找；若所述第一地址不存在于所述地址映射表中，则在所述第一存储器中进行查找。
在一具体实施例中，所述处理器还配置为运行所述计算机程序时，执 行：
根据所述地址映射表获取所述第一地址对应的第二地址；
根据所述第二地址在所述第二缓冲存储器中获取第一存储内容；
根据所述第一存储内容获取第二关键字；
判断所述第二关键字是否等于所述第一关键字；
若判断所述第二关键字等于所述第一关键字，则查找成功；若判断所述第二关键字不等于所述第一关键字，则查找失败。
在一具体实施例中，所述处理器还配置为运行所述计算机程序时，执行：
根据所述第一地址在所述第一存储器中获取第二存储内容；
根据所述第二存储内容获取第三关键字；
判断所述第三关键字是否等于所述第一关键字；
若判断所述第三关键字等于所述第一关键字，则查找成功；若判断所述第三关键字不等于所述第一关键字，则查找失败。
在一具体实施例中，所述处理器还配置为运行所述计算机程序时，执行：
若判断所述第二关键字Key等于所述第一关键字Key之后，对所述第二缓冲存储器中所存储内容的权重分别乘以a，其中a为预先设定的衰减系数；
对所述第二缓冲存储器中的所述第一存储内容的权重增加Wadd，其中Wadd为预先设定的增量权重。
在一具体实施例中，所述处理器还配置为运行所述计算机程序时，执行：
若判断所述第二关键字不等于所述第一关键字之后，对所述第二缓冲存储器中所存储内容的权重分别乘以a，其中a为预先设定的衰减系数。
在一具体实施例中，所述处理器还配置为运行所述计算机程序时，执行：
若判断所述第三关键字等于所述第一关键字之后，对所述第二缓冲存储器中所存储内容的权重分别乘以a；其中，a为预先设定的衰减系数；
将Wadd与所述第二缓冲存储器中所存储内容的最小权重进行比较；其中，Wadd为预先设定的增量权重；
若Wadd大于所述最小权重，用所述第二存储内容替换所述最小权重对应的存储内容，设置所述第二存储内容的权重为Wadd并更新所述地址映射表。
在一具体实施例中，所述处理器还配置为运行所述计算机程序时，执行：
若判断所述第三关键字不等于所述第一关键字之后，对所述第二缓冲存储器中所存储内容的权重分别乘以a；其中，a为预先设定的衰减系数。
在一具体实施例中，所述处理器还配置为运行所述计算机程序时，执行：
若第一存储器中的第三存储内容发生改变，判断所述第三存储内容位于所述第一存储器中的第三地址是否存在于所述地址映射表中；其中，所述第三存储内容包含第四关键字；
若判断所述第三地址存在于所述地址映射表中，根据所述地址映射表获取所述第三地址对应的第四地址；
根据所述第四地址在所述第二缓冲存储器中获取第四存储内容；
根据所述第四存储内容获取第五关键字；
判断所述第五关键字是否等于所述第四关键字；
若判断所述第五关键字等于所述第四关键字，将所述第二缓冲存储器中的所述第四存储内容更新为所述第三存储内容；
若判断所述第五关键字不等于所述第四关键字，将所述第二缓冲存储器中的所述第四存储内容删除，并设置所述第四存储内容的权重为0。
本领域内的技术人员应明白，本发明的实施例可提供为方法、系统、或计算机程序产品。因此，本发明可采用硬件实施例、软件实施例、或结合软件和硬件方面的实施例的形式。而且，本发明可采用在一个或多个其 中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器和光学存储器等)上实施的计算机程序产品的形式。
本发明是参照根据本发明实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
基于此，本发明实施例还提供了一种计算机可读存储介质，其上存储有计算机程序，该计算机程序被处理器运行时，执行本发明实施例的基于转发表的信息处理方法。
以上所述，仅为本发明的较佳实施例而已，并非用于限定本发明的保护范围。
工业实用性
本发明实施例提供的方案，通过接收转发表查找请求，其中，查找请求中包含查找请求内容的第一关键字和查找请求内容位于第一存储器中的第一地址；根据第一地址判断是在第二缓冲存储器中还是在第一存储器中 进行查找，实现了减少大容量存储器中转发表的访问次数和提高查找速度的目的。

Claims (16)

  1. 一种基于转发表的信息处理方法，所述方法包括：
    接收转发表查找请求；其中，所述查找请求中包含查找请求内容的第一关键字和所述查找请求内容位于第一存储器中的第一地址；
    根据所述第一地址判断是在第二缓冲存储器中还是在第一存储器中进行查找。
  2. 根据权利要求1所述的方法，其中，所述根据所述第一地址判断是在第二缓冲存储器中还是在第一存储器中进行查找，包括：
    判断所述第一地址是否存在于地址映射表中；所述地址映射表位于所述第二缓冲存储器中，所述地址映射表存储第二缓冲存储器中的内容在第二缓冲存储器中的地址与所述内容在第一存储器中的地址的映射关系；
    若所述第一地址存在于所述地址映射表中，则在所述第二缓冲存储器中进行查找；若所述第一地址不存在于所述地址映射表中，则在所述第一存储器中进行查找。
  3. 根据权利要求2所述的方法，其中，所述在所述第二缓冲存储器中进行查找，包括：
    根据所述地址映射表获取所述第一地址对应的第二地址；
    根据所述第二地址在所述第二缓冲存储器中获取第一存储内容；
    根据所述第一存储内容获取第二关键字；
    判断所述第二关键字是否等于所述第一关键字；
    若判断所述第二关键字等于所述第一关键字，则查找成功；若判断所述第二关键字不等于所述第一关键字，则查找失败。
  4. 根据权利要求2所述的方法，其中，所述在所述第一存储器中进行查找，包括：
    根据所述第一地址在所述第一存储器中获取第二存储内容；
    根据所述第二存储内容获取第三关键字；
    判断所述第三关键字是否等于所述第一关键字；
    若判断所述第三关键字等于所述第一关键字，则查找成功；若判断所述第三关键字不等于所述第一关键字，则查找失败。
  5. 根据权利要求3所述的方法，其中，若判断所述第二关键字Key等于所述第一关键字Key之后，所述方法还包括：
    对所述第二缓冲存储器中所存储内容的权重分别乘以a，其中a为预先设定的衰减系数；
    对所述第二缓冲存储器中的所述第一存储内容的权重增加Wadd，其中Wadd为预先设定的增量权重。
  6. 根据权利要求3所述的方法，其中，若判断所述第二关键字不等于所述第一关键字之后，所述方法还包括：
    对所述第二缓冲存储器中所存储内容的权重分别乘以a，其中a为预先设定的衰减系数。
  7. 根据权利要求4所述的方法，其中，若判断所述第三关键字等于所述第一关键字之后，所述方法还包括：
    对所述第二缓冲存储器中所存储内容的权重分别乘以a；其中，a为预先设定的衰减系数；
    将Wadd与所述第二缓冲存储器中所存储内容的最小权重进行比较；其中，Wadd为预先设定的增量权重；
    若Wadd大于所述最小权重，用所述第二存储内容替换所述最小权重对应的存储内容，设置所述第二存储内容的权重为Wadd并更新所述地址映射表。
  8. 根据权利要求4所述的方法，其中，若判断所述第三关键字不等于所述第一关键字之后，所述方法还包括：
    对所述第二缓冲存储器中所存储内容的权重分别乘以a；其中，a为预先设定的衰减系数。
  9. 根据权利要求2所述的方法，其中，所述方法还包括：
    若第一存储器中的第三存储内容发生改变，判断所述第三存储内容位于所述第一存储器中的第三地址是否存在于所述地址映射表中；其中，所述第三存储内容包含第四关键字；
    若判断所述第三地址存在于所述地址映射表中，根据所述地址映射表获取所述第三地址对应的第四地址；
    根据所述第四地址在所述第二缓冲存储器中获取第四存储内容；
    根据所述第四存储内容获取第五关键字；
    判断所述第五关键字是否等于所述第四关键字；
    若判断所述第五关键字等于所述第四关键字，将所述第二缓冲存储器中的所述第四存储内容更新为所述第三存储内容；
    若判断所述第五关键字不等于所述第四关键字，将所述第二缓冲存储器中的所述第四存储内容删除，并设置所述第四存储内容的权重为0。
  10. 一种基于转发表的信息处理装置，所述装置包括：
    接收模块，配置为接收转发表查找请求；其中，所述查找请求中包含查找请求内容的第一关键字和所述查找请求内容位于第一存储器中的第一地址；
    判断模块，配置为根据所述第一地址判断是在第二缓冲存储器中还是在第一存储器中进行查找。
  11. 根据权利要求10所述的装置，其中，所述判断模块配置为：
    判断所述第一地址是否存在于地址映射表中；所述地址映射表位于所述第二缓冲存储器中，所述地址映射表存储第二缓冲存储器中的内容在第二缓冲存储器中的地址与所述内容在第一存储器中的地址的映射关系；
    若所述第一地址存在于所述地址映射表中，则在所述第二缓冲存储器中进行查找；若所述第一地址不存在于所述地址映射表中，则在所述第一存储器中进行查找。
  12. 根据权利要求11所述的装置，其中，所述装置还包括：
    获取模块，配置为根据所述地址映射表获取所述第一地址对应的第二地址；根据所述第二地址在所述第二缓冲存储器中获取第一存储内容，根 据所述第一存储内容获取第二关键字；
    所述判断模块，还配置为判断第二关键字是否等于第一关键字，以判断是否查找成功；
    或者，所述装置还包括：
    获取模块，配置为根据所述第一地址在所述第一存储器中获取第二存储内容，根据所述第二存储内容获取第三关键字；
    所述判断模块，配置为判断第三关键字是否等于第一关键字，以判断是否查找成功。
  13. 根据权利要求12所述的装置，其特征在于，所述装置还包括：
    处理模块，配置为执行以下之一：
    当在所述第二缓冲存储器查找成功后，对所述第二缓冲存储器中所存储内容的权重分别乘以a；对所述第二缓冲存储器中的所述第一存储内容的权重增加Wad，其中，a为预先设定的衰减系数，Wadd为预先设定的增量权重；
    当在所述第一存储器中查找成功后，对所述第二缓冲存储器中所存储内容的权重分别乘以a；其中，a为预先设定的衰减系数；将Wadd与所述第二缓冲存储器中所存储内容的最小权重进行比较；其中，Wadd为预先设定的增量权重；若Wadd大于所述最小权重，用所述第二存储内容替换所述最小权重对应的存储内容，设置所述第二存储内容的权重为Wadd并更新所述地址映射表。
  14. 根据权利要求11所述的装置，其中，所述装置还包括：获取模块及处理模块；其中，
    所述判断模块，还配置为若第一存储器中的第三存储内容发生改变，判断所述第三存储内容位于所述第一存储器中的第三地址是否存在于所述地址映射表中；判断所述第五关键字是否等于所述第四关键字；其中，所述第三存储内容包含第四关键字；
    所述获取模块，配置为若判断所述第三地址存在于所述地址映射表中，根据所述地址映射表获取所述第三地址对应的第四地址；根据所述第四地 址在所述第二缓冲存储器中获取第四存储内容，根据所述第四存储内容获取第五关键字；
    所述处理模块，配置为若判断所述第五关键字等于所述第四关键字，将所述第二缓冲存储器中的所述第四存储内容更新为所述第三存储内容；若判断所述第五关键字不等于所述第四关键字将所述第二缓冲存储器中的所述第四存储内容删除，并设置所述第四存储内容的权重为0。
  15. 一种基于转发表的信息处理装置，所述装置包括：处理器和配置为存储能够在处理器上运行的计算机程序的存储器，
    其中，所述处理器配置为运行所述计算机程序时，执行如权利要求1至9任一项所述方法的步骤。
  16. 一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被处理器运行时，执行如权利要求1至9任一项所述的基于转发表的信息处理方法。
PCT/CN2017/082585 2016-08-31 2017-04-28 基于转发表的信息处理方法、装置及计算机可读存储介质 WO2018040600A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610796752.2 2016-08-31
CN201610796752.2A CN107797942B (zh) 2016-08-31 2016-08-31 减少大容量转发表访问次数的方法及其装置

Publications (1)

Publication Number Publication Date
WO2018040600A1 true WO2018040600A1 (zh) 2018-03-08

Family

ID=61299939

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/082585 WO2018040600A1 (zh) 2016-08-31 2017-04-28 基于转发表的信息处理方法、装置及计算机可读存储介质

Country Status (2)

Country Link
CN (1) CN107797942B (zh)
WO (1) WO2018040600A1 (zh)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030065812A1 (en) * 2001-09-28 2003-04-03 Niels Beier Tagging packets with a lookup key to facilitate usage of a unified packet forwarding cache
CN1595910A (zh) * 2004-06-25 2005-03-16 中国科学院计算技术研究所 一种网络处理器的数据包接收接口部件及其存储管理方法
CN101119313A (zh) * 2007-09-14 2008-02-06 杭州华三通信技术有限公司 一种负载分担方法和设备
CN101840374A (zh) * 2010-04-28 2010-09-22 福建星网锐捷网络有限公司 处理装置、信息查找系统及信息查找方法
CN102662908A (zh) * 2012-04-23 2012-09-12 西安电子科技大学 对片上多核系统中的高速接口进行控制的方法及系统

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030065812A1 (en) * 2001-09-28 2003-04-03 Niels Beier Tagging packets with a lookup key to facilitate usage of a unified packet forwarding cache
CN1595910A (zh) * 2004-06-25 2005-03-16 中国科学院计算技术研究所 一种网络处理器的数据包接收接口部件及其存储管理方法
CN101119313A (zh) * 2007-09-14 2008-02-06 杭州华三通信技术有限公司 一种负载分担方法和设备
CN101840374A (zh) * 2010-04-28 2010-09-22 福建星网锐捷网络有限公司 处理装置、信息查找系统及信息查找方法
CN102662908A (zh) * 2012-04-23 2012-09-12 西安电子科技大学 对片上多核系统中的高速接口进行控制的方法及系统

Also Published As

Publication number Publication date
CN107797942B (zh) 2020-11-20
CN107797942A (zh) 2018-03-13

Similar Documents

Publication Publication Date Title
US10810179B2 (en) Distributed graph database
WO2018099107A1 (zh) 一种哈希表管理的方法和装置、计算机存储介质
US9871727B2 (en) Routing lookup method and device and method for constructing B-tree structure
US8868926B2 (en) Cryptographic hash database
US9760493B1 (en) System and methods of a CPU-efficient cache replacement algorithm
JP6050503B2 (ja) 階層キャッシュを用いたメールのインデックス化および検索
US11245774B2 (en) Cache storage for streaming data
US20200201821A1 (en) Synchronization of index copies in an lsm tree file system
JP2015528603A (ja) 集約／グループ化動作：ハッシュテーブル法のハードウェア実装
TW201220197A (en) for improving the safety and reliability of data storage in a virtual machine based on cloud calculation and distributed storage environment
US9535925B2 (en) File link migration
US10909086B2 (en) File lookup in a distributed file system
US9110917B2 (en) Creating a file descriptor independent of an open operation
CN106599091B (zh) 基于键值存储的rdf图结构存储和索引方法
US11500873B2 (en) Methods and systems for searching directory access groups
JP6268116B2 (ja) データ処理装置、データ処理方法およびコンピュータプログラム
CN112579595A (zh) 数据处理方法、装置、电子设备及可读存储介质
JP2020123320A (ja) インデックスを管理するための方法、装置、設備及び記憶媒体
CN108319634B (zh) 分布式文件系统的目录访问方法和装置
EP3107010A1 (en) Data integration pipeline
US10235420B2 (en) Bucket skiplists
JP6189266B2 (ja) データ処理装置、データ処理方法及びデータ処理プログラム
WO2018040600A1 (zh) 基于转发表的信息处理方法、装置及计算机可读存储介质
US9817853B1 (en) Dynamic tier-maps for large online databases
US11249914B2 (en) System and methods of an efficient cache algorithm in a hierarchical storage system

Legal Events

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

Ref document number: 17844908

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17844908

Country of ref document: EP

Kind code of ref document: A1