A data processing method, device and computer readable storage medium

By obtaining and querying the offset address of ICN packets, the problem of low ICN packet query efficiency in the ICN network is solved, and more efficient data processing and transmission is achieved.

CN110399539BActive Publication Date: 2024-11-12ZTE CORP
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN201810356463.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2018-04-19
Publication Date
2024-11-12
Estimated Expiration
2038-04-19

AI Technical Summary

Technical Problem

The query efficiency of ICN packets in the ICN network is low, resulting in low network transmission efficiency and degradation of performance.

Method used

By obtaining the offset address corresponding to the ICN packet, querying the records pointed to by the offset address, data processing is performed based on the query results, and the storage address or forwarding information of the ICN packet is stored to avoid repeated retrieval and improve query efficiency.

Benefits of technology

It improves the query efficiency of ICN packets in the ICN network, reduces the performance impact of the forwarding plane repeatedly searching in multiple table entries, and improves the search efficiency of nodes.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN110399539B_ABST
    Figure CN110399539B_ABST
Patent Text Reader

Abstract

The embodiment of the present invention discloses a data processing method, the method comprising: obtaining a first offset address corresponding to a first ICN packet; querying a record pointed to by the first offset address, and performing data processing according to the query result; wherein the record pointed to by the first offset address is used to store the storage address of the second ICN packet or the forwarding information of the second ICN packet when a second ICN packet corresponding to the first ICN packet is stored locally. The embodiment of the present invention also discloses a data processing device and a computer-readable storage medium.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of communication technology, and in particular to a data processing method, device, and computer-readable storage medium. Background Art

[0002] Information-Centric Networking (ICN) is a new Internet communication architecture. As a new Internet communication model centered on data content and oriented towards user needs, ICN completely breaks the existing network architecture based on TCP / IP technology. This architecture builds the communication model on the basis of identification data. By adopting a content requester-driven communication mode, it fundamentally changes the encapsulation structure and addressing method of IP packets, which is conducive to cross-region switching of mobile communication devices and reduces communication latency. It solves the problems of the inability to cope with high-speed mobile communications, exhaustion of IP address space, low network transmission efficiency, and poor security under the traditional Internet architecture.

[0003] The various data processed by the ICN forwarding plane include two types of ICN packets: interest packets and data packets. The ICN forwarding plane needs to search whether there is a data packet requested by the interest packet, or search whether there is an interest requesting a data packet.

[0004] Currently, the query efficiency of ICN packets in the ICN network is low. Summary of the invention

[0005] To solve the above technical problems, the embodiments of the present invention are intended to provide a data processing method, device and computer-readable storage medium to solve the problem of low query efficiency of ICN packets in an ICN network in the prior art.

[0006] To achieve the above object, the technical solution of the embodiment of the present invention is implemented as follows:

[0007] In a first aspect, the present invention provides a data processing method, which is applied to a node in an information center network ICN, and the method comprises:

[0008] Obtain a first offset address corresponding to the first ICN packet;

[0009] Querying the record pointed to by the first offset address, and performing data processing according to the query result;

[0010] The record pointed to by the first offset address is used to store the storage address of the second ICN packet or the forwarding information of the second ICN packet when the second ICN packet corresponding to the first ICN packet is stored locally.

[0011] In a second aspect, the present invention provides a data processing method, which is applied to a node in an information center network ICN, and the method comprises:

[0012] Acquire a first ICN packet, where the first ICN packet is an Interest packet or a Data packet;

[0013] Determine, according to the positioning function, a position of a flag bit corresponding to the first ICN packet in the index unit;

[0014] According to the position of the flag bit corresponding to the first ICN packet, query or set the value of the flag bit corresponding to the first ICN packet;

[0015] The value of the flag bit in the index unit is used to indicate whether an Interest packet and / or Data packet corresponding to the flag bit is stored locally.

[0016] In a third aspect, the present invention provides a data processing device, the device comprising a processor and a memory for storing a computer program that can be run on the processor,

[0017] Wherein, when the processor is used to run the computer program, it executes the steps of any data processing method described in the first aspect, or executes the steps of any data processing method described in the second aspect.

[0018] In a fourth aspect, the present invention provides a computer-readable storage medium, on which a data processing program is stored, and when the data processing program is executed by a processor, the steps of any data processing method described in the first aspect are implemented, or when the data processing program is executed by a processor, the steps of any data processing method described in the second aspect are implemented.

[0019] In an embodiment of the present invention, a data processing method provided by an embodiment of the present invention obtains a first offset address corresponding to a first ICN packet; queries the record pointed to by the first offset address, and performs data processing according to the query result; wherein the record pointed to by the first offset address is used to store the storage address of the second ICN packet or the forwarding information of the second ICN packet when a second ICN packet corresponding to the first ICN packet is stored locally, thereby improving the query efficiency of ICN packets in the ICN network. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] Figure 1A This is a schematic diagram of the working mechanism of the ICN forwarding plane when receiving an Interest packet;

[0021] Figure 1B This is a schematic diagram of the search order of the ICN forwarding plane when receiving an Interest packet;

[0022] Figure 2AThis is a schematic diagram of the working mechanism of the ICN forwarding plane when receiving a Data packet;

[0023] Figure 2B This is a schematic diagram of the retrieval order of the ICN forwarding plane when receiving a Data packet;

[0024] Figure 3 1 is a flow chart of a data processing method according to an embodiment of the present invention;

[0025] Figure 4A This is a structural diagram 1 of a node according to an embodiment of the present invention. ;

[0026] Figure 4B This is a second structural diagram of a node according to an embodiment of the present invention.

[0027] Figure 5 Schematic diagram 1 of the interactive process of the data processing method according to an embodiment of the present invention;

[0028] Figure 6 Schematic diagram 2 of the interactive process of the data processing method according to an embodiment of the present invention;

[0029] Fig. 7A The interactive process diagram of the data processing method according to the embodiment of the present invention is as follows Figure 3 ;

[0030] Figure 7B Schematic diagram 4 of the interactive process of the data processing method according to an embodiment of the present invention;

[0031] Figure 7C The interactive process diagram of the data processing method according to the embodiment of the present invention is as follows Figure 5 ;

[0032] Figure 8 FIG2 is a flow chart of a data processing method according to an embodiment of the present invention;

[0033] Fig. 9 The data processing method of the present invention is shown in FIG. Figure 3 ;

[0034] Fig.10 The figure is a schematic diagram of the structure of a data processing device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0035] The technical solutions in the embodiments of the present invention will be described clearly and completely below in conjunction with the accompanying drawings in the embodiments of the present invention.

[0036] The technical solution provided by the embodiment of the present invention can be applied to the structural design field of a router located in a forwarding plane in an ICN. Before introducing the data processing method provided by the embodiment of the present invention, an overall description of the application scenario of the data processing method provided by the embodiment of the present invention is first given.

[0037] In order to fundamentally solve the inherent deficiencies of the network communication model based on TCP / IP technology, three data structures can be deployed on the forwarding plane of the information center network ICN: Content Store (CS), Pending Interest Table (PIT) and Forwarding Information Base (FIB), where PIT is used to store the forwarding information of the Interest packet, which may include, for example, the identifier of the Data packet requested by the Interest packet, the information of the requesting node requesting the Data packet, etc. CS is used to store Data packets. ICN uses these three data structures to realize content sharing and intelligent forwarding, reduce network load, and improve the data transmission rate in the ICN network.

[0038] The working mechanisms of CS and PIT in the forwarding plane are very similar. Figure 1A This is a schematic diagram of the working mechanism of the ICN forwarding plane when receiving an Interest packet; Figure 1B This is a schematic diagram of the search order of the ICN forwarding plane when receiving an Interest packet; Figure 2A This is a schematic diagram of the working mechanism of the ICN forwarding plane when receiving a Data packet; Figure 2B The figure is a schematic diagram of the retrieval order of the ICN forwarding plane when receiving a Data packet.

[0039] like Figure 1A As shown, after the Interest packet reaches the port of the forwarding plane, the processing steps of the forwarding plane may include:

[0040] Step S101, receiving an Interest packet.

[0041] Step S102, search CS to determine whether the Data packet requested by the Interest packet is stored in CS, if so, execute S103, if not, execute S104.

[0042] Step S103: according to the forwarding information of the Interest packet, the Data packet corresponding to the Interest packet is sent to the requesting node.

[0043] Step S104: search the PIT to determine whether the Interest packet is stored in the PIT.

[0044] Step S105: adding the forwarding information of the Interest packet to the PIT.

[0045] Step S106: Update the forwarding information of the Interest packet in the PIT.

[0046] like Figure 1B As shown, in the working mechanism involving CS and PIT in the forwarding plane, after the Interest packet arrives at a port of the forwarding plane, the forwarding plane first searches the CS memory, see S102a, and then searches the PIT table, see S104a.

[0047] like Figure 2A As shown, after the data packet arrives at the port of the forwarding plane, the processing steps of the forwarding plane may include:

[0048] Step S201, receiving a Data packet.

[0049] Step S202, search the PIT to determine whether the Interest packet requesting the Data is stored in the PIT, if so, execute S203, if not, execute S205.

[0050] Step S203: according to the forwarding information of the Interest packet, the Data packet is sent to the requesting node.

[0051] Step S204: Cache the Data packet in the CS.

[0052] Step S205: discard the Data packet.

[0053] like Figure 1B As shown, in the working mechanism involving CS and PIT in the forwarding plane, after the Data packet arrives at the forwarding plane, the forwarding plane first retrieves the PIT table and then caches the Data packet in the CS memory.

[0054] This repeated retrieval process ensures the accuracy of the retrieval, but the repeated retrieval process will affect the working performance of the forwarding plane. In this regard, the technical solution provided by the embodiment of the present invention can solve the problem that the forwarding plane of the ICN needs to repeatedly retrieve data from multiple entries during the working process.

[0055] The data processing method provided by the embodiment of the present invention is described in detail below. In the embodiment of the present invention, both the Interest packet and the Data packet can be referred to as an ICN packet, and the technical solution provided by the embodiment of the present invention can be applied to the scenario where a node performs corresponding data processing after receiving any ICN packet in the Interest packet or the Data packet.

[0056] Embodiment 1

[0057] The embodiment of the present invention provides a data processing method, and the execution subject of the embodiment of the present invention may be a node in an ICN. Exemplarily, the node may be a router. The embodiment of the present invention may be applied to a scenario in which, after receiving a first ICN packet, the node obtains relevant information of a second ICN packet corresponding to the first ICN packet. Figure 3 FIG1 is a flow chart of a data processing method according to an embodiment of the present invention. Figure 3 As shown, the steps of the embodiment of the present invention may include:

[0058] Step S301: Obtain a first offset address corresponding to a first ICN packet.

[0059] Step S302, query the record pointed to by the first offset address corresponding to the first ICN packet, and perform data processing according to the query result, wherein the record pointed to by the first offset address can be used to store the storage address of the second ICN packet or the forwarding information of the second ICN packet when the second ICN packet corresponding to the first ICN packet is stored locally.

[0060] In an embodiment of the present invention, a first offset address corresponding to a first ICN packet is first obtained, and then the record pointed to by the first offset address corresponding to the first ICN packet is queried, and data processing is performed according to the query result, wherein the record pointed to by the first offset address can be used to store the storage address of the second ICN packet or the forwarding information of the second ICN packet when a second ICN packet corresponding to the first ICN packet is stored locally; it can be seen that there is a mapping relationship between the offset address and the ICN packet, and the record pointed to by the offset address is the forwarding information or the storage address, so that when the first ICN packet is an Interest packet or a Data packet, and the second ICN packet is a Data packet or an Interest packet, it is only necessary to find the first offset address according to the first ICN packet, which can avoid the problem caused by repeated retrieval of nodes in the ICN when receiving the Interest packet or the Data packet, thereby improving the retrieval efficiency of the node.

[0061] In an embodiment of the present invention, before the above-mentioned obtaining of the offset address corresponding to the first ICN packet, it may include: receiving the first ICN packet. In an embodiment of the present invention, the first ICN packet may be an Interest packet or a Data packet. If the first ICN packet is an Interest packet, the second ICN packet corresponding to the first ICN packet may be a Data packet requested by the first ICN packet. If the first ICN packet is a Data packet, the second ICN packet corresponding to the first ICN packet may be an Interest packet requesting the first ICN packet.

[0062] In the embodiment of the present invention, the querying of the record pointed to by the first offset address and the data processing according to the query result may include:

[0063] If the first ICN packet is an Interest packet, query whether the record pointed to by the first offset address stores the storage address of the second ICN packet, and the second ICN packet is the Data packet requested by the first ICN packet; if the storage address of the second ICN packet is stored in the record pointed to by the first offset address, read the second ICN packet from the storage space pointed to by the storage address of the second ICN packet, and return the second ICN packet according to the forwarding information of the first ICN packet; and / or,

[0064] If the first ICN packet is a Data packet, query whether the record pointed to by the first offset address stores the forwarding information of the second ICN packet, and the second ICN packet is an Interest packet requesting the first ICN packet; if the record pointed to by the first offset address stores the forwarding information of the second ICN packet, return the first ICN packet according to the forwarding information of the second ICN packet.

[0065] In an embodiment of the present invention, the following implementation methods may be used to obtain the first offset address corresponding to the first ICN packet. In one implementation method of obtaining the first offset address, if the first ICN packet is an Interest packet, the above-mentioned obtaining the first offset address corresponding to the first ICN packet may include: obtaining the identifier of the Data packet requested by the first ICN packet; obtaining the first offset address according to the identifier of the Data packet requested by the first ICN packet. In another implementation method of obtaining the first offset address, if the first ICN packet is a Data packet, the above-mentioned obtaining the first offset address corresponding to the first ICN packet may include: obtaining the identifier of the first ICN packet; obtaining the first offset address according to the identifier of the first ICN packet. In other embodiments of the present invention, the above two implementation methods of obtaining the first offset address may also be used in combination. It should be noted that the forwarding information of the Interest packet may include the identifier of the requested Data packet, and the identifier of the Data packet may be the name of the Data packet. Exemplarily, the name of the Data packet may be " / ndn / UA / maps" or the like.

[0066] In an embodiment of the present invention, the record pointed to by the first offset address may be a record in a record table, for example, the first offset address may be an address identifier of a storage space of each record in the record table. After receiving the first ICN packet, the node obtains the first offset address corresponding to the first ICN packet and queries the record in the record table according to the first offset address, thereby obtaining relevant information of the second ICN packet corresponding to the first ICN packet, thereby improving the retrieval efficiency of the node.

[0067] In an example of an implementation of the record table, if the first ICN packet is an Interest packet and the second ICN packet is a Data packet requested by the Interest packet, the record pointed to by the first offset address corresponding to the first ICN packet can be used to store the storage address of the second ICN packet when the second ICN packet is stored locally. For example, the first offset address corresponding to Interest1 can be offset address 11, the first offset address corresponding to Interest2 can be offset address 12, the first offset address corresponding to Interest3 can be offset address 13, the Data packet requested by Interest1 is Data1, the Data packet requested by Interest2 is Data2, and the Data packet requested by Interest3 is Data3. Table 1 is Example 1 of the record table.

[0068] Table 1

[0069]

[0070] Among them, the storage address of Data1 can be stored in the record pointed to by offset address 11, and the storage address of Data2 can be stored in the record pointed to by offset address 12. Since the node does not currently store Data3 corresponding to Interest3, the storage address of Data3 may not be currently stored in the record pointed to by offset address 13. In other embodiments of the present invention, when the node receives Data3 and caches Data3 in CS, the storage address of Data3 in CS can be stored in the record pointed to by offset address 13 in the record table. With this implementation, the problem caused by repeated retrieval can be avoided when receiving the Interest packet, and the retrieval efficiency of the node can be improved.

[0071] In an example of another implementation of the record table, if the first ICN packet is a Data packet, and the second ICN packet is an Interest packet requesting the first ICN packet, the record pointed to by the first offset address can be used to store the forwarding information of the second ICN packet when the second ICN packet is stored locally. For example, the first offset address corresponding to Data1 can be offset address 21, the first offset address corresponding to Data2 can be offset address 22, the first offset address corresponding to Data3 can be offset address 23, the Interest packet requesting Data1 is Interest1, the Interest packet requesting Data2 is Interest2, and the Interest packet requesting Data3 is Interest3. Table 2 is Example 2 of the record table.

[0072] Table 2

[0073] Offset Address Forwarding information of Interest packet Offset address 21 Interest1's forwarding information Offset address 22 Interest2's forwarding information Offset address 23 -

[0074] Among them, the record pointed to by offset address 21 stores the forwarding information of Interest1, and the record pointed to by offset address 22 stores the forwarding information of Interest2. Therefore, the record pointed to by offset address 23 does not store the forwarding information of Interest3, which can indicate that the node has not currently received Interest3. In other embodiments of the present invention, when the node receives Interest3, the forwarding information of Interest3 can be stored in the record pointed to by offset address 13 in the record table. With this implementation, the problem caused by repeated retrieval can be avoided when receiving the Data packet, and the retrieval efficiency of the node can be improved.

[0075] In other embodiments of the present invention, the first offset address corresponding to the first ICN packet may be the same as the second offset address corresponding to the second ICN packet. When the first offset address corresponding to the first ICN packet is the same as the second offset address corresponding to the second ICN packet, the record pointed to by the first offset address corresponding to the first ICN packet can actually also be used to store the storage address of the first ICN packet or the forwarding information of the first ICN packet after the first ICN packet is stored locally. For example, the record table can also adopt the following implementation.

[0076] When the first ICN packet is an Interest packet and the second ICN packet is a Data packet, the record pointed to by the first offset address can be used to store the storage address of the second ICN packet when the second ICN packet is stored locally, and to store forwarding information of the first ICN packet when the first ICN packet is stored locally.

[0077] When the first ICN packet is a Data packet and the second ICN packet is an Interest packet, the record pointed to by the first offset address can be used to store forwarding information of the second ICN packet when the second ICN packet is stored locally, and to store the storage address of the first ICN packet when the first ICN packet is stored locally.

[0078] Exemplarily, Interest1 and Data1 may correspond to the same first offset address, i.e., offset address 11, Interest2 and Data2 may correspond to the same first offset address, i.e., offset address 12, and Interest3 and Data3 may correspond to the same first offset address, i.e., offset address 13. Table 3 is Example 3 of the record table. When Data2 is not currently stored and forwarding information of Interest3 is not stored, the content recorded in the record table may be as shown in Table 3.

[0079] Table 3

[0080] Offset Address Forwarding information of Interest packet The storage address of the Data packet in CS Offset address 11 Interest1's forwarding information Data1 storage address Offset address 12 Interest2's forwarding information - Offset address 13 - Data3 storage address

[0081] It should be noted that, in the record table shown in Table 3, the relevant information of the Data packet corresponding to the Interest packet is stored in the record pointed to by the offset address corresponding to the Interest packet. At the same time, the relevant information of the Interest packet corresponding to the Data packet is also stored in the record pointed to by the offset address corresponding to the Data packet. Therefore, when a node receives a first ICN packet, either an Interest packet or a Data packet, it can obtain the relevant information of the corresponding second ICN packet by searching the same record table, such as forwarding information, storage address, or whether to store the second ICN packet. By adopting this implementation method, problems caused by repeated retrieval can be avoided when receiving Interest packets and Data packets, thereby improving the retrieval efficiency of the node.

[0082] In other embodiments of the present invention, after obtaining the first offset address, the steps of the embodiments of the present invention may further include: writing the forwarding information or storage address of the first ICN packet into the record pointed to by the first offset address.

[0083] For example, the querying of the record pointed to by the first offset address and performing data processing according to the query result may also include:

[0084] When the first ICN packet is an Interest packet, if the storage address of the second ICN packet is not stored in the record pointed to by the first offset address, updating the forwarding information of the first ICN packet stored in the record pointed to by the first offset address; and / or,

[0085] When the first ICN packet is a Data packet, if the record pointed to by the first offset address stores forwarding information of the second ICN packet, the first ICN packet is cached, and the storage address of the first ICN packet is written into the record pointed to by the first offset address.

[0086] In an embodiment of the present invention, a combination of the above two implementation methods for obtaining the first offset address can be used as another implementation method for obtaining the first offset address corresponding to the first ICN packet. Using the implementation method of the combination of the above implementation methods for obtaining the first offset address to obtain the first offset address corresponding to the first ICN packet can ensure that the first ICN packet and the second ICN packet correspond to the same offset address. In other words, the offset address corresponding to the first ICN packet determined according to the above combination method and the second offset address corresponding to the second ICN packet corresponding to the first ICN packet.

[0087] In an embodiment of the present invention, a combination of the above examples is used to determine the first offset address. Since the first ICN packet and the second ICN packet corresponding to the first ICN packet correspond to the same first offset address, when the node receives either the Interest packet or the Data packet as the first ICN packet, it can obtain the corresponding second ICN packet by searching the same record table.

[0088] In other embodiments of the present invention, after obtaining the first offset address corresponding to the first ICN packet and storing the forwarding information or storage address of the first ICN packet in the record pointed to by the first offset address, the method may further include the following steps:

[0089] Obtain a third offset address corresponding to the third ICN packet;

[0090] Querying the record pointed to by the third offset address, and performing data processing according to the query result;

[0091] Wherein, when the third offset address is the same as the first offset address, querying the record pointed to by the third offset address and performing data processing according to the query result may include:

[0092] If the first ICN is an Interest packet, and the third ICN packet is a Data packet requested by the first ICN, it is found that the forwarding information of the first ICN packet is stored in the record pointed to by the third offset address, and the third ICN packet is returned according to the forwarding information of the first ICN packet found.

[0093] If the first ICN is a Data packet, and the third ICN packet is an Interest packet requesting the first ICN request, the storage address of the first ICN packet is stored in the record pointed to by the first offset address, and the first ICN packet is read from the storage space pointed to by the storage address of the first ICN packet found, and the first ICN packet read is returned according to the forwarding information of the third ICN packet.

[0094] In other embodiments of the present invention, the methods of step S301 to step S302 may be executed by an off-chip memory in the node, and details of the relevant technical solutions may refer to the descriptions in other embodiments.

[0095] Moreover, the technical solution provided by the embodiment of the present invention is that the record pointed to by the first offset address is used to store the storage address of the second ICN packet or the forwarding information of the second ICN packet when the second ICN packet corresponding to the first ICN packet is stored locally, and is also used to store the storage address of the first ICN packet or the forwarding information of the first ICN packet after the first ICN packet is stored locally. This can avoid the problems caused by repeated retrieval of nodes in the ICN when both Interest packets and Data packets are received, thereby improving the retrieval efficiency of nodes.

[0096] Embodiment 2

[0097] Based on any of the methods shown in the above embodiments, an embodiment of the present invention also provides an implementation method for obtaining a first offset address corresponding to a first ICN packet. In an embodiment of the present invention, a preset positioning function can also be used to obtain the first offset address corresponding to the first ICN packet. The positioning function can be used to determine the position of the flag bit corresponding to the input ICN packet in the index unit.

[0098] For example, the step of obtaining the first offset address corresponding to the first ICN packet may include:

[0099] (1) According to the positioning function, determine the position of the flag bit corresponding to the first ICN packet in the index unit.

[0100] (2) Determine a first offset address corresponding to the first ICN packet according to a position of a flag bit corresponding to the first ICN packet.

[0101] Exemplarily, the positioning function may be K hash functions, the index unit may include M flag bits, and after receiving the first ICN packet, the node inputs the identifier of the first ICN packet into the K positioning functions respectively to obtain K positions. Then the first offset address may be an M-bit address, wherein the values ​​of the flag bits of the K positions obtained according to the identifier of the first ICN packet are all set to 1, and the values ​​of the flag bits other than the K positions are set to 0.

[0102] For example, when K is 3 and M is 6, the flag bits corresponding to the first ICN packet may be 2, 4, and 5. Then the first offset address may be 010110, where the 2nd, 4th, and 5th bits are 1, and the 1st, 3rd, and 6th bits are 0.

[0103] In other embodiments of the present invention, the value of the flag bit in the index unit can be used to indicate whether the Interest packet and / or Data packet corresponding to the flag bit is stored locally.

[0104] Embodiment 3

[0105] An embodiment of the present invention further provides a structure of an ICN node, which can be used to execute the data processing method provided in any of the above embodiments. Figure 4A Schematic diagram 1 of the structure of a node in an embodiment of the present invention. Among them, an integrated compressed interest cache 400 (Pending Interest Table and Content Store via Compressed Mapping Bloom filter, CMaPIT&CS) can be set in the node, CMaPIT&CS can be a memory with processing capabilities, CMaPIT&CS can also be called a joint storage structure, which includes an on-chip memory unit 41 (On-chip memory) and an off-chip memory unit (off-chip memory) 42. In other embodiments of the present invention, the on-chip memory unit 41 can use a high-speed memory, and the off-chip memory unit can use a low-speed memory.

[0106] In an embodiment of the present invention, a compressed mapping Bloom filter (CoMBF) 411 can be deployed on the on-chip storage unit 41 to implement data retrieval and indexing, and the data stored in the compressed mapping Bloom filter can also be called an index unit. CoMBF 411 can be composed of two parts: a compressed Bloom filter (Compressed Bloom filter) 4111 containing m bits, and a mapping array (MA) 4112 containing j bits, wherein the structure of MA 4112 and Compressed Bloom filter 4111 can be the same, and both can be in the form of a bit array. In other embodiments of the present invention, CoMBF can also be composed of three parts: a Bloom filter (Bloom filter) 4113, a compression unit (Compresses Unit) and MA 4112. Figure 4B FIG2 is a schematic diagram of a structure of a node according to an embodiment of the present invention. The compression unit may be used to realize perceptual compression of a flag bit.

[0107] In an embodiment of the present invention, a counting bloom filter (CBF) 421 data structure corresponding to CoMBF 4111 can be deployed on the off-chip storage unit 42 to implement data update and deletion. In addition, a packet store (Packet Store) 422 can be deployed on the off-chip storage unit 42 to store the forwarding information of the PIT and the storage location of the Data packet in the CS memory to implement the integration of the PIT table index structure and the CS memory index structure. In other embodiments of the present invention, the Packet Store can be a static memory. In other embodiments of the present invention, the PacketStore 222 can store the PIT 4221 and the CS 4222.

[0108] In the embodiment of the present invention, the Packet Store may be used to store data in the PIT and the CS, and the record pointed to by the first offset address may be a record in the PIT.

[0109] In the embodiment of the present invention, CoMBF 411 may represent a set S containing n elements, where S={x 1 ,x 2 ,x 3 ,...,x n}, used to implement the basic function of element retrieval, that is, to determine whether a data element is in the data set represented by CoMBF. At the same time, the data compression function of Compressed Bloom filter 4111 can effectively reduce the amount of data transmission in the network. By transmitting the bit array of Compressed Bloom filter in the network, CoMBF411 can have network data transmission and data sharing functions.

[0110] In other embodiments of the present invention, when an Interest packet arrives at the forwarding plane, the name of the Interest packet can be first input into CMaPIT&CS. Then, an exact string match is performed on the name of the Interest packet in CoMBF. If there is a matching entry in CoMBF, the Packet Store is accessed according to the offset address output by CoMBF. Subsequently, it is checked whether the corresponding record in the Packet Store records a pointer to the CS memory. If there is a pointer to the CS memory, it means that the CS contains a Data packet corresponding to the Interest packet, and the Data packet can be read. If there is no pointer to the CS memory, the Interest packet forwarding information of the record in the Packet Store is updated, and the arrival of the Data packet is waited.

[0111] When the Data packet arrives at the forwarding plane, the name of the Data packet is first entered into CMaPIT&CS. Subsequently, an exact string matching operation is performed on the name of the Data packet in CoMBF. If there is a matching entry in CoMBF, the Packet Store is accessed according to the offset address output by CoMBF, the forwarding information of the corresponding Interest packet is read, and the Data packet is returned. At the same time, the storage location of the Data packet in the CS memory is recorded in the Packet Store. If there is no matching entry in CoMBF, the Data packet is directly discarded.

[0112] Embodiment 4

[0113] Based on any of the data processing methods shown in the above embodiments, an embodiment of the present invention further provides a data processing method. Figure 5 Schematic diagram 1 of the interactive process of the data processing method according to the embodiment of the present invention. As shown in the figure, the execution subject of the embodiment of the present invention may be an on-chip storage unit and an off-chip storage unit, and the steps of the embodiment of the present invention may include:

[0114] Step S501: an on-chip storage unit receives a first ICN packet.

[0115] The first ICN packet may be an Interest packet or a Data packet.

[0116] Step S502: The on-chip storage unit obtains a first offset address corresponding to the first ICN packet.

[0117] The first offset address may be obtained by using any of the methods described in the above embodiments.

[0118] Step S503: the on-chip storage unit sends a first offset address corresponding to the first ICN packet to the off-chip storage unit.

[0119] Step S504: the off-chip storage unit queries the record pointed to by the first offset address.

[0120] Step S505: the off-chip storage unit determines whether the record pointed to by the first offset address contains relevant information of the second ICN packet corresponding to the first ICN packet. If so, execute S506.

[0121] Step S506: The off-chip storage unit sends relevant information of the second ICN packet.

[0122] Step S507: the on-chip storage unit performs data processing according to the related information of the first ICN packet and the second ICN packet.

[0123] For other technical solution details and technical effects of the embodiments of the present invention, please refer to the descriptions in other embodiments.

[0124] In other embodiments of the present invention, before step S502, the on-chip storage unit may determine whether there is a matching index entry, and if so, the step of obtaining the first offset address corresponding to the first ICN packet is performed. Figure 6 FIG2 is a second interactive flow diagram of the data processing method according to an embodiment of the present invention. Figure 6 As shown, the steps of the embodiment of the present invention may include:

[0125] Step S601: an on-chip storage unit receives a first ICN packet.

[0126] Step S602: the on-chip storage unit determines whether there is a matching index entry. If so, execute S603.

[0127] The embodiment of the present invention provides two implementation methods for determining whether there is a matching index entry.

[0128] In the first implementation method of determining whether there is a matching index entry provided by an embodiment of the present invention, if the first ICN packet is a Data packet and the second ICN packet is an Interest packet, then the determination whether there is an index entry that matches the identifier of the first ICN packet may include: determining the position of a flag bit corresponding to the first ICN packet in the index unit according to a positioning function, wherein the value of the flag bit in the index unit is used to indicate whether a Data packet corresponding to the flag bit is stored locally; querying the value of the flag bit corresponding to the first ICN packet; if the value of the flag bit corresponding to the first ICN packet is valid, determining that there is an index entry that matches the identifier of the first ICN packet.

[0129] In the first implementation method of determining whether there is a matching index entry provided in an embodiment of the present invention, if the first ICN packet is an Interest packet and the second ICN packet is a Data packet requested by the first ICN packet, then the above determination whether there is an index entry that matches the identifier of the first ICN packet may include: determining, according to a positioning function, the position of a flag bit corresponding to the second ICN packet corresponding to the first ICN packet in the index unit; querying the value of the flag bit corresponding to the second ICN packet; if the value of the flag bit corresponding to the second ICN packet is valid, determining that there is an index entry that matches the identifier of the first ICN packet.

[0130] In the second implementation of determining whether there is a matching index entry provided by the embodiment of the present invention, an index entry table may be used to determine whether there is an index entry corresponding to the ICN packet.

[0131] Table 4 is an example of an index entry table provided in an embodiment of the present invention. Each index entry may include multiple attributes, such as an identifier of the index entry, an Interest package corresponding to the index entry, whether an Interest package corresponding to the index entry is stored locally, a Data package corresponding to the index entry, whether a Data package corresponding to the index entry is stored locally, and other attributes. The identifier of the index entry may be the number of the index entry, or may be a combination of a Data package and an Interest package corresponding to the index entry. It should be noted that, in the index entry table, a first ICN package and a second ICN package corresponding to the first ICN package may correspond to index entries with the same identifier. In other words, a Data package and an Interest package requesting the Data package may correspond to index entries with the same identifier.

[0132] Table 4

[0133]

[0134] As shown in Table 4, Data1 and Interest1 requesting Data1 may correspond to index entry 1, Data2 and Interest2 requesting Data2 may correspond to index entry 2, Data3 and Interest3 requesting Data3 may correspond to index entry 3, the Interest packages stored in the node include Interest1 and Interest2, and the Data packages stored in the node include Data2 and Data3.

[0135] Based on the index entry table shown in Table 4, the above-mentioned determination of whether there is an index entry matching the identifier of the first ICN packet may include:

[0136] If the first ICN packet is a Data packet and the second ICN packet is an Interest packet, determine whether the index entry corresponding to the first ICN packet indicates that the second ICN packet is stored locally, that is, determine whether the attribute "whether an Interest package corresponding to the index entry is stored locally" is yes. If so, determine that there is an index entry that matches the identifier of the first ICN packet.

[0137] If the first ICN packet is an Interest packet and the second ICN packet is the Data packet requested by the first ICN packet, determine whether the index entry corresponding to the first ICN packet indicates that the second ICN packet is stored locally, that is, determine whether the attribute "whether the Data package corresponding to the index entry is stored locally" is yes. If so, determine that there is an index entry that matches the identifier of the first ICN packet.

[0138] In other embodiments of the present invention, the attribute values ​​of the above-mentioned "whether the Data package corresponding to the index entry is stored locally" attribute and "whether the Interest package corresponding to the index entry is stored locally" attribute can be expressed in the form of numerical values, for example, "1" or "valid" can be used to represent "yes", and "0" or "invalid" can be used to represent "no". The embodiments of the present invention are not limited to this.

[0139] Step S603: the on-chip storage unit obtains a first offset address corresponding to the first ICN packet.

[0140] Step S604: the on-chip storage unit sends a first offset address corresponding to the first ICN packet to the off-chip storage unit.

[0141] Step S605: the off-chip storage unit queries the record pointed to by the first offset address.

[0142] Step S606: The off-chip storage unit determines whether the record pointed to by the first offset address contains relevant information of the second ICN packet corresponding to the first ICN packet. If so, execute S607.

[0143] Step S607: The off-chip storage unit sends the relevant information of the second ICN packet to the on-chip storage unit.

[0144] Step S608: The on-chip storage unit performs data processing according to the related information of the first ICN packet and the second ICN packet.

[0145] In the embodiment of the present invention, it should be noted that the above step S602 is equivalent to a trigger condition for obtaining the first offset address corresponding to the first ICN packet in step S603. That is, the step of obtaining the first offset address corresponding to the first ICN packet can be performed when there is an index entry matching the identifier of the first ICN packet.

[0146] The index entry may be such data: (1) if the first ICN package is stored locally, the index entry corresponding to the first ICN package records "ICN1 is available locally", (2) if the second ICN package is stored locally, the index entry corresponding to the second ICN package records "ICN2 is available locally", (3) the index entries corresponding to the first ICN package and the second ICN package are the same index entry.

[0147] In other embodiments of the present invention, the index entry corresponding to the ICN packet may be determined according to the identifier of the ICN packet. For example, the position of the flag bit determined according to the identifier of the ICN packet is used as the identifier of the index entry in the index entry table.

[0148] Exemplarily, the structure of the index entry table may be similar to the structure of the record table pointed to by the offset address.

[0149] In the embodiment of the present invention, steps S601 and S603 to S608 are similar to steps S501 to S507.

[0150] The embodiment of the present invention further provides a data processing method, wherein the first ICN packet may be an Interest1 packet, and the second ICN packet corresponding to the first ICN packet may be Data1. Fig. 7A The interactive process diagram of the data processing method according to the embodiment of the present invention is as follows Figure 3 .like Fig. 7A As shown, the steps of the data processing method provided by the embodiment of the present invention may include:

[0151] Step S7101, the on-chip storage unit receives Interest1.

[0152] Step S7102, the on-chip storage unit determines whether there is a matching index entry, and if so, executes S7103.

[0153] For this step, please refer to the description of S602.

[0154] Step S7103, the on-chip storage unit obtains the offset address 11 corresponding to Interest1.

[0155] Step S7104: the on-chip storage unit sends the offset address 11 corresponding to Interest1 to the off-chip storage unit.

[0156] Step S7105, the off-chip storage unit queries the record pointed to by the offset address 11.

[0157] Step S7106, the off-chip storage unit determines whether the storage address of Data1 requested by Interest1 exists in the record pointed to by offset address 11. If so, Data1 is read and S7107 is executed. If not, S7109 is executed.

[0158] Step S7107, the off-chip storage unit sends Data1.

[0159] Step S7108, the on-chip storage unit returns Data1 according to the forwarding information of Interest1.

[0160] Step S7109, the off-chip storage unit writes the forwarding information of Interest1 into the record pointed to by the offset address 11.

[0161] For other technical solution details and technical effects of the embodiments of the present invention, please refer to the descriptions in other embodiments.

[0162] The embodiment of the present invention further provides a data processing method, wherein the first ICN packet may be a Data1 packet, and the second ICN packet corresponding to the first ICN packet may be an Interest1. Figure 7B FIG4 is a fourth interactive flow diagram of the data processing method according to an embodiment of the present invention. Figure 7B As shown, the steps of the data processing method provided by the embodiment of the present invention may include:

[0163] Step S7201, the on-chip storage unit receives Data1.

[0164] Step S7202, the on-chip storage unit determines whether there is a matching index entry, if so, execute S7203, if not, execute S7210.

[0165] For this step, please refer to the description of S602.

[0166] Step S7203, the on-chip storage unit obtains the offset address 21 corresponding to Data1.

[0167] Step S7204, the on-chip storage unit sends the offset address 21 corresponding to Data1 to the off-chip storage unit.

[0168] Step S7205, the off-chip storage unit queries the record pointed to by the offset address 21.

[0169] Step S7206, the off-chip storage unit determines whether the forwarding information of Interest1 requesting Data1 exists in the record pointed to by the offset address 21. If so, the forwarding information of Interest1 is read and S7207 and S7209 are executed. If not, S7210 is executed.

[0170] Step S7207: the off-chip storage unit sends forwarding information of Interest1 to the on-chip storage unit.

[0171] Step S7208, the on-chip storage unit returns Data1 according to the forwarding information of Interes1.

[0172] Step S7209: The off-chip storage unit caches Data1 and writes the storage address of Data1 into the record pointed to by offset address 21.

[0173] Step S7209: the off-chip storage unit sends indication information for indicating that there is no forwarding information of Interest1.

[0174] Step S7210, the on-chip storage unit discards Data1.

[0175] For other technical solution details and technical effects of the embodiments of the present invention, please refer to the descriptions in other embodiments.

[0176] exist Fig. 7A Based on the method shown, the embodiment of the present invention also provides a data processing method. Figure 7C The interactive process diagram of the data processing method according to the embodiment of the present invention is as follows Figure 5 .like Figure 7C As shown, the steps of the embodiment of the present invention may include:

[0177] Step S7301, the on-chip storage unit receives Data1.

[0178] In the embodiment of the present invention, this step can be performed after S7109.

[0179] Step S7302, the on-chip storage unit determines whether there is a matching index entry, if so, execute S7303, if not, execute S7310.

[0180] Step S7303, the on-chip storage unit obtains the offset address 11 corresponding to Data1.

[0181] Step S7304, the on-chip storage unit sends the offset address 11 corresponding to Data1.

[0182] Step S7305, the off-chip storage unit queries the record pointed to by the offset address 11.

[0183] Step S7306, the off-chip storage unit determines whether the forwarding information of Interest1 requesting Data1 exists in the record pointed to by the offset address 11, reads the forwarding information of Interest1, and executes S7307 and S7309.

[0184] Step S7307: the off-chip storage unit sends forwarding information of Interest1.

[0185] Step S7308, the on-chip storage unit returns Data1 according to the forwarding information of Interes1.

[0186] Step S7309 , the off-chip storage unit caches Data1 and writes the storage address of Data1 into the record pointed to by offset address 21 .

[0187] Step S7310, the on-chip storage unit discards Data1.

[0188] For other technical solution details and technical effects of the embodiments of the present invention, please refer to the descriptions in other embodiments.

[0189] Embodiment 5

[0190] The embodiment of the present invention also provides a data processing method, which can be used to quickly determine which Data packages or Interest packages are stored locally, so that the node can quickly learn the Data packages or Interest packages stored locally, thereby improving the retrieval efficiency of the node. This implementation can also be used to share data stored on the node in an ICN network.

[0191] Figure 8 FIG2 is a flow chart of a data processing method according to an embodiment of the present invention. Figure 8 As shown, the steps of the embodiment of the present invention may include:

[0192] Step S801: Obtain a first ICN packet.

[0193] The first ICN packet is an interest packet or a data packet.

[0194] Step S802: Determine the position of the flag bit corresponding to the first ICN packet in the index unit according to the positioning function.

[0195] Step S803: query or set the value of the flag bit corresponding to the first ICN packet according to the position of the flag bit corresponding to the first ICN packet.

[0196] The value of the flag bit in the index unit is used to indicate whether the Interest packet and / or Data packet corresponding to the flag bit is stored locally.

[0197] In an embodiment of the present invention, after the node receives an ICN packet and stores relevant information of the ICN packet, the flag bit corresponding to the ICN packet in the index unit may be set to valid. For example, the above-mentioned querying or setting the value of the flag bit corresponding to the first ICN packet according to the position of the flag bit corresponding to the first ICN packet may include: when the first ICN packet is stored locally, setting the value of the flag bit corresponding to the first ICN packet to valid. Exemplarily, the value of the flag bit corresponding to the ICN packet may be set to valid after S7109, S7209 or S7309. In other embodiments of the present invention, when a node has stored some Data data when it is enabled, the flag bits corresponding to these Data packets may be set to valid when the node is enabled.

[0198] In an embodiment of the present invention, the positioning function can be used to determine the position of the flag bit corresponding to any ICN packet in the index unit. Exemplarily, the position of the flag bit corresponding to the ICN packet in the index unit can be determined according to the identifier of the ICN packet. For example, when the ICN packet is an Interest packet, the position of the flag bit corresponding to the Interest packet in the index unit can be determined according to the name of the Data packet requested by the Interest packet. When the ICN packet is a Data packet, the position of the flag bit corresponding to the Data packet in the index unit can be determined according to the name of the Data packet. For example, the positioning function can be K hash functions, and the identifier of the ICN packet is input into the K hash functions respectively, and K results can be obtained. Exemplarily, the K results can be K "1", and for example, the K results can be 1 "0" and K-1 "1", and for example, the K results can be 1 "10", 1 "11" and K-2 "00", etc. In other embodiments of the present invention, the K results can be arranged as an M-bit binary number in the order of the corresponding K positioning functions, and the M-bit binary number can be used as an offset address pointing to the record table.

[0199] In an embodiment of the present invention, the index unit may be, for example, a bit array, wherein an ICN packet may correspond to one or more bits in the index unit, and the flag bit corresponding to the ICN packet in the index unit is one or more bits. Exemplarily, when the value of the bit corresponding to the ICN packet is 1, the flag bit corresponding to the ICN packet is determined to be valid, and when the value of the bit corresponding to the ICN packet is not all 0, the flag bit corresponding to the ICN packet is determined to be invalid.

[0200] In other embodiments of the present invention, in order to reduce the number of flag bits, thereby reducing the storage space of the index unit and the amount of transmission data of the index unit that needs to be transmitted during network sharing, a compression flag bit can also be used as an implementation method of the flag bit corresponding to each ICN packet.

[0201] For example, the above-mentioned determination of the position of the flag bit corresponding to the first ICN packet in the index unit according to the positioning function can also be implemented by the following steps: first, according to the positioning function, determine the position of the non-compressed flag bit mapped by the first ICN packet in the index unit; then perform compression sensing on the position of the non-compressed flag bit corresponding to the first ICN packet to obtain the position of the compressed flag bit corresponding to the first ICN packet; then use the position of the compressed flag bit corresponding to the first ICN packet as the position of the flag bit corresponding to the first ICN; wherein the total number of non-compressed flag bits in the index unit is greater than the total number of compressed flag bits in the index unit. In other embodiments of the present invention, the total number of non-compressed flag bits can be M bits, such as 32 bits, and the total number of compressed flag bits can be N bits, such as 18 bits.

[0202] In an embodiment of the present invention, in order to share information about which Data packets or Interest packets are stored in the node with other nodes in the ICN network, after querying or setting the value of the flag bit corresponding to the first ICN packet according to the position of the flag bit corresponding to the first ICN packet, the method may further include:

[0203] Send index units to other nodes.

[0204] In other embodiments of the present invention, the flag bit can be stored in an on-chip storage unit. For example, each bit of the bit array in the Compressed Bloom filter of the on-chip storage unit can be used as the flag bit corresponding to the ICN packet stored in the node. Then the above-mentioned sending of the index unit to other nodes can include: sending the bit array in the Compressed Bloom filter to other nodes. In other words, when the forwarding plane needs to share the cache information in the CS, the bit array of the Compressed Bloom filter in the on-chip storage unit can be transmitted to the network to complete the information sharing.

[0205] In the embodiment of the present invention, the above-mentioned determination of the position of the flag bit corresponding to the first ICN packet in the index unit according to the positioning function can be implemented by the following steps:

[0206] If the first ICN packet is the first Data packet, determine the position of the flag bit corresponding to the first ICN packet according to the identifier and positioning function of the first Data packet;

[0207] If the first ICN packet is the second Interest packet, the Data packet requested by the second Interest packet is the second Data packet, and the position of the flag bit corresponding to the first ICN packet is determined according to the identifier of the second Data packet and the positioning function.

[0208] In other embodiments of the present invention, after querying or setting the value of the flag bit corresponding to the first ICN packet according to the position of the flag bit corresponding to the first ICN packet, the method may further include:

[0209] According to the position of the flag bit corresponding to the first ICN packet, the first offset address corresponding to the first ICN packet is determined, wherein the record pointed to by the first offset address is used to store the forwarding information or storage address of the second ICN packet corresponding to the first ICN packet; then, the record pointed to by the first offset address corresponding to the first ICN packet is queried, and data processing is performed according to the query result. Among them, the implementation method of the step of querying the record pointed to by the first offset address corresponding to the first ICN packet and performing data processing according to the query result can refer to the relevant description in other embodiments of the present invention.

[0210] In other embodiments of the present invention, before determining the first offset address corresponding to the first ICN packet according to the position of the flag bit corresponding to the first ICN packet, the method may further include:

[0211] Determine whether the flag bit of the second ICN packet corresponding to the first ICN packet is valid;

[0212] If the flag bit of the second ICN packet corresponding to the first ICN packet is valid, a step of determining a first offset address corresponding to the first ICN packet according to a position of the flag bit corresponding to the first ICN packet is performed.

[0213] It should be noted that after the node receives the first ICN packet, it can query the value of the flag bit corresponding to the second ICN packet in the index unit to preliminarily confirm whether the node may store the second ICN packet. If the second ICN packet may exist, the offset address is determined according to the value of the flag bit corresponding to the second ICN packet. The record table pointed to by the offset address is stored in the off-chip storage unit. The record pointed to by the offset address is queried, and data processing is performed based on the query result.

[0214] From the above algorithm description, we can find that using the CMaPIT&CS storage structure can effectively simplify the retrieval process of name data, reduce the retrieval frequency of the index structure in the on-chip storage unit and the number of accesses to the slow memory in the off-chip storage unit. At the same time, it can be clearly observed that in CMaPIT&CS, whether it is an Interest package or a Data package, the retrieval time complexity is determined by CoMBF, and its time complexity is O(1).

[0215] Based on the above embodiments, the present invention further provides a data processing method. Fig. 9 The data processing method of the present invention is shown in FIG. Figure 3 After determining the position of the flag bit corresponding to the first ICN packet in the index unit according to the positioning function, the method of the embodiment of the present invention may further include the following steps:

[0216] Step S901: Obtain a first ICN packet.

[0217] This step is similar to S801.

[0218] Step S902: Determine the position of the flag bit corresponding to the first ICN packet in the index unit according to the positioning function.

[0219] This step is similar to S802.

[0220] Step S903: according to the position of the flag bit corresponding to the first ICN packet, set the value of the flag bit corresponding to the first ICN packet.

[0221] This step is similar to S803.

[0222] Step S904: Obtain a third ICN packet.

[0223] The third ICN packet may be an Interest packet or a Data packet.

[0224] Step S905: Determine the position of the flag bit corresponding to the third ICN packet in the index unit according to the positioning function.

[0225] In an embodiment of the present invention, the positioning function may be K hash functions, and the above-mentioned determination of the position of the flag bit corresponding to the third ICN packet in the index unit may adopt the following implementation. For example, the identifier of the ICN packet may be input into the K hash functions, the calculation results of the K hash functions may be arranged into a binary number according to the order of the K hash functions, and the position of the bit with a bit value of 1 in the binary number may be used as the position of the flag bit corresponding to the ICN packet in the index unit.

[0226] Step S906, querying the value of the flag bit corresponding to the third ICN packet.

[0227] In the embodiment of the present invention, after determining the position of the flag bit corresponding to the third ICN packet in the index unit according to the positioning function, the method of the embodiment of the present invention may further include:

[0228] Step S907: Determine the second offset address corresponding to the third ICN packet according to the position of the flag bit corresponding to the third ICN packet.

[0229] Step S908: query the record pointed to by the second offset address corresponding to the third ICN packet, and perform data processing according to the query result.

[0230] The record pointed to by the second offset address may be used to store forwarding information or a storage address of a fourth ICN packet corresponding to the third ICN packet.

[0231] In an embodiment of the present invention, if the third ICN packet is a Data packet, the above-mentioned determination of the flag bit corresponding to the third ICN packet in the index unit according to the positioning function may include: determining the flag bit corresponding to the third ICN packet according to the positioning function and the identifier of the third ICN packet; correspondingly, the above-mentioned query of the value of the flag bit corresponding to the third ICN packet may include: querying whether the value of the position of the flag bit corresponding to the third ICN packet in the index unit is valid; if it is valid, obtaining the second offset address corresponding to the third ICN packet according to the identifier of the third ICN packet; further, if the record pointed to by the second offset address stores the forwarding information of the Interest packet requesting the third ICN packet, the third ICN packet is returned according to the forwarding information of the Interest packet requesting the third ICN packet.

[0232] In an embodiment of the present invention, if the third ICN packet is an Interest packet; the above-mentioned obtaining of the second offset address may include: determining a flag bit corresponding to the third ICN packet according to the positioning function and the identifier of the Data packet requested by the third ICN packet; correspondingly, the above-mentioned querying of the value of the flag bit corresponding to the third ICN packet may include: querying whether the value of the position of the flag bit corresponding to the third ICN packet in the index unit is valid; if it is valid, obtaining the second offset address corresponding to the third ICN packet according to the identifier of the third ICN packet; further, if the storage address of the Data packet requested by the third ICN packet is stored in the record pointed to by the second offset address, the Data packet requested by the third ICN packet is read from the storage address of the Data packet requested by the third ICN packet, and according to the forwarding information of the third ICN packet, the Data packet requested by the third ICN packet is returned.

[0233] It should be noted that the explanation of the same steps or concepts in this embodiment as in other embodiments can refer to the description in other embodiments. Other technical effects of the embodiments of the present invention can refer to the description in other embodiments, which will not be repeated here.

[0234] Embodiment 6

[0235] The data processing method provided by the embodiment of the present invention is described below by way of example.

[0236] In one example, the process of retrieving the Interest package in the CMaPIT&CS storage structure can be described as follows:

[0237] In this storage structure, K=3 hash functions are set, the size of the Bloom filter in the CoMBF data structure is set to 32 bits, the size of the Compressed Unit is set to 18 bits, and the Compressed Unit is equally divided into 6 parts. The corresponding positioning array MA is set to 6 bits, that is, the storage structure can store 26 elements in the PacketStore. It should be noted that the equal fraction of the compression unit needs to be the same as the bit number of the positioning array.

[0238] In this system, two Interest packets named / ndn / UA / videos and / ndn / UA / maps are sequentially input into the storage structure. Before each Interest packet is input, the positioning array MA is initialized to an all-0 state. It should be noted that the two Interest packets named / ndn / UA / videos and / ndn / UA / maps mean that the names of the Data packets requested by the two Interest packets are / ndn / UA / videos and / ndn / UA / maps respectively.

[0239] When the first Interest packet is input, the name of the Interest packet / ndn / UA / videos is first input into the CMaPIT&CS storage structure. The 6th, 14th, and 20th bits in the Bloom filter are hash mapped, and these three bits are all 1, which means that the Interest packet exists in the structure. After compressed sensing, the 2nd, 4th, and 5th parts of the Compressed Unit have hash mappings, so the values ​​of the 2nd, 4th, and 5th bits of the positioning array MA will be set to 1, and the values ​​of other positions are 0. The final value of the positioning array MA is 010110, that is, the offset address of the Interest packet in the Packet Store is 010110. Subsequently, the corresponding record of the Packet Store is checked to record the pointer to the CS memory, that is, there is a Data packet corresponding to the first Interest packet, and finally the Data packet is read. It should be noted that the corresponding record of the Packet Store refers to the record in the record table pointed to by the offset address.

[0240] Similarly, the Interest packet named / ndn / UA / maps also exists in the storage structure, and its offset address in PacketStore is 110100. Then check the corresponding record of Packet Store and find that there is no pointer to the CS memory, that is, there is no Data packet corresponding to the second Interest packet. Finally, update the forwarding information of the Interest packet in the record and wait for the arrival of the Data packet.

[0241] In another example, the process of retrieving the Data package in the CMaPIT&CS storage structure can be described as follows:

[0242] In this storage structure, K=3 hash functions are used, the size of the Bloom filter in the CoMBF data structure is set to 32 bits, the size of the Compressed Unit is set to 18 bits, and the Compressed Unit is equally divided into 6 parts. The corresponding positioning array MA is set to 6 bits, so this storage structure can store 26 elements in the Packet Store.

[0243] In this system, two Data packets named / ndn / UA / maps and / TJU / videos are input in sequence. Before each Data packet is input, the positioning array MA is initialized to an all-0 state. It should be noted that the two Data packets named / ndn / UA / maps and / TJU / videos mean that the names of the two Data packets are / ndn / UA / maps and / TJU / videos respectively.

[0244] When the first Data packet is input, the name of the Data packet / ndn / UA / maps is first input into the CMaPIT&CS storage structure. The 2nd, 5th, and 16th bits in the Bloom filter are hash mapped, and these three bits are all 1, which means that the Data packet exists in the structure. After compressed sensing, the 1st, 2nd, and 4th parts of the Compressed Unit have hash mappings, so the values ​​of the 1st, 2nd, and 4th bits of the positioning array MA will be set to 1, and the values ​​of other positions are 0. Finally, the value of the positioning array MA is 110100, that is, the offset address of the Data packet in the Packet Store is 110100. Subsequently, the corresponding record of the PacketStore is checked to record the forwarding information of the corresponding Interest packet, and the Data packet is returned according to the forwarding information. At the same time, the storage location of the Data packet in the CS memory is recorded in the Packet Store. Similarly, the Data packet named / TJU / videos is hash mapped in the 1st, 7th, and 21st bits in the Bloom filter, but these three bits are not all 1, that is, there is no matching record in the CoMBF, so the Data packet is directly discarded. It should be noted that the corresponding record of the Packet Store refers to the record in the record table pointed to by the offset address.

[0245] It should be noted that the explanation of the same steps or concepts in this embodiment as in other embodiments can refer to the description in other embodiments. Other technical effects of the embodiments of the present invention can refer to the description in other embodiments, which will not be repeated here.

[0246] The embodiment of the present invention integrates the PIT table and the CS memory index, that is, uses CoMBF to build a unified joint storage structure CMaPIT&CS, which can also be called an index result. By deploying the efficient data structure CoMBF that can directly index and share data, CMaPIT&CS can reduce the number of retrievals of the forwarding plane when processing data packets and improve the retrieval performance. At the same time, the storage consumption of the forwarding plane is further reduced, the retrieval speed of the name data is increased, and the retrieval performance is improved.

[0247] The embodiment of the present invention further provides a data processing device 1000 . Fig.10 FIG. 1 is a schematic diagram of the structure of a data processing device according to an embodiment of the present invention. Fig.10 As shown, the device includes a processor 1001 and a memory 1002 for storing a computer program that can be executed on the processor.

[0248] Wherein, when the processor 1001 is used to run the computer program, it executes Figures 3 to 7C Any of the steps of the data processing method shown, and / or, Figures 8 to 9 Any step of the data processing method shown.

[0249] In an embodiment of the present invention, the data processing device 1000 may further include an interface 1003 and a bus 1004, etc., wherein the interface 1003 may be used to receive or send an ICN packet or send an index unit, and the bus 1004 is used for data interaction between the processor 1001, the memory 1002 and the interface 1003.

[0250] In an embodiment of the present invention, the data processing device may be located on a node in the ICN network, and may be located at an intermediate node or a terminal node, for example. In other embodiments of the present invention, the data processing device may be a router or a terminal.

[0251] It should be noted that the explanation of the same steps or concepts in this embodiment as in other embodiments can refer to the description in other embodiments, which will not be repeated here. Other technical effects of the embodiments of the present invention can refer to the description in other embodiments, which will not be repeated here.

[0252] An embodiment of the present invention further provides a computer-readable storage medium, on which a data processing program is stored. When the data processing program is executed by a processor, the steps of the data processing method shown in the above embodiment are implemented.

[0253] It should be noted that the explanation of the same steps or concepts in this embodiment as in other embodiments can refer to the description in other embodiments, which will not be repeated here. Other technical effects of the embodiments of the present invention can refer to the description in other embodiments, which will not be repeated here.

[0254] In practical applications, the receiving unit, acquiring unit, processing unit and sending unit involved in the above embodiments can all be implemented by a central processing unit (CPU), a microprocessor (MPU), a digital signal processor (DSP) or a field programmable gate array (FPGA) located in a wireless data sending device.

[0255] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of hardware embodiments, software embodiments, or embodiments combining software and hardware. Furthermore, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage and optical storage, etc.) containing computer-usable program code.

[0256] The present invention is described with reference to the flowchart and / or block diagram of the method, device (system), and computer program product according to the embodiment of the present invention. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the process and / or box in the flowchart and / or block diagram can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device produce a device for implementing the functions specified in one or more processes in the flowchart and / or one or more boxes in the block diagram.

[0257] These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory produce a manufactured product including an instruction device that implements the functions specified in one or more processes in the flowchart and / or one or more boxes in the block diagram.

[0258] These computer program instructions may also be loaded onto a computer or other programmable data processing device so that a series of operational steps are executed on the computer or other programmable device to produce a computer-implemented process, whereby the instructions executed on the computer or other programmable device provide steps for implementing the functions specified in one or more processes in the flowchart and / or one or more boxes in the block diagram.

[0259] The above description is only a preferred embodiment of the present invention and is not intended to limit the protection scope of the present invention.

Claims

1. A data processing method, characterized in that: Applied to a node in an information center network (ICN), the method comprises: Obtain a first offset address corresponding to the first ICN packet; Querying the record pointed to by the first offset address, and performing data processing according to the query result; The record pointed to by the first offset address is used to store the storage address of the second ICN packet or the forwarding information of the second ICN packet when the second ICN packet corresponding to the first ICN packet is stored locally; The querying of the record pointed to by the first offset address and performing data processing according to the query result include: If the first ICN packet is an Interest packet, query whether the record pointed to by the first offset address stores the storage address of the second ICN packet, and the second ICN packet is the Data packet requested by the first ICN packet; if the storage address of the second ICN packet is stored in the record pointed to by the first offset address, read the second ICN packet from the storage space pointed to by the storage address of the second ICN packet, and return the second ICN packet according to the forwarding information of the first ICN packet; If the first ICN packet is a Data packet, query whether the record pointed to by the first offset address stores the forwarding information of the second ICN packet, and the second ICN packet is an Interest packet requesting the first ICN packet; if the record pointed to by the first offset address stores the forwarding information of the second ICN packet, return the first ICN packet according to the forwarding information of the second ICN packet.

2. The method according to claim 1, characterized in that If the first ICN packet is an Interest packet, and the second ICN packet corresponding to the first ICN packet is a Data packet requested by the first ICN packet, then the record pointed to by the first offset address is used to store the storage address of the second ICN packet when the second ICN packet is stored locally; If the first ICN packet is a Data packet, and the second ICN packet corresponding to the first ICN packet is an Interest packet requesting the first ICN packet, the record pointed to by the first offset address is used to store forwarding information of the second ICN packet when the second ICN packet is stored locally.

3. The method according to claim 1, characterized in that The record pointed to by the first offset address is also used to store the storage address of the first ICN packet or the forwarding information of the first ICN packet after the first ICN packet is stored locally; The method further includes: writing the forwarding information or storage address of the first ICN packet into the record pointed to by the first offset address.

4. The method according to claim 1, characterized in that The second offset address corresponding to the second ICN packet is the same as the first offset address, and the record pointed to by the first offset address is also used to store the storage address of the first ICN packet or the forwarding information of the first ICN packet after the first ICN packet is stored locally; Then the step of querying the record pointed to by the first offset address and performing data processing according to the query result further includes: When the first ICN packet is an Interest packet, if the storage address of the second ICN packet is not stored in the record pointed to by the first offset address, updating the forwarding information of the first ICN packet stored in the record pointed to by the first offset address; When the first ICN packet is a Data packet, if the record pointed to by the first offset address stores forwarding information of the second ICN packet, the first ICN packet is cached, and the storage address of the first ICN packet is written into the record pointed to by the first offset address.

5. The method according to claim 3 or 4, characterized in that: Obtain a third offset address corresponding to the third ICN packet; Querying the record pointed to by the third offset address, and performing data processing according to the query result; Wherein, when the third offset address is the same as the first offset address, querying the record pointed to by the third offset address and performing data processing according to the query result includes: If the first ICN is an Interest packet, and the third ICN packet is a Data packet requested by the first ICN, it is found that the forwarding information of the first ICN packet is stored in the record pointed to by the third offset address, and the third ICN packet is returned according to the forwarding information of the first ICN packet found. If the first ICN is a Data packet, and the third ICN packet is an Interest packet requesting the first ICN request, it is found that the storage address of the first ICN packet is stored in the record pointed to by the first offset address, and the first ICN packet is read from the storage space pointed to by the queried storage address of the first ICN packet, and the read first ICN packet is returned according to the forwarding information of the third ICN packet.

6. The method according to claim 1, characterized in that The obtaining the first offset address corresponding to the first ICN packet includes: If the first ICN packet is an Interest packet, obtaining an identifier of a second ICN packet requested by the first ICN packet, and obtaining the first offset address according to the identifier of the second ICN packet requested by the first ICN packet; If the first ICN packet is a Data packet, an identifier of the first ICN packet is obtained, and the first offset address is obtained according to the identifier of the first ICN packet.

7. The method according to any one of claims 1-4, 6, characterized in that: The obtaining the first offset address corresponding to the first ICN packet includes: Determine, according to the positioning function, a position of a flag bit corresponding to the first ICN packet in the index unit; Determine the first offset address according to the position of the flag bit corresponding to the first ICN packet; The value of the flag bit in the index unit is used to indicate whether an Interest packet and / or Data packet corresponding to the flag bit is stored locally.

8. The method according to any one of claims 1-4, 6, characterized in that: Before obtaining the first offset address corresponding to the first ICN packet, the method includes: Obtaining the first ICN packet; Determine whether there is an index entry that matches the identifier of the first ICN packet, where the index entry is used to record whether the first ICN packet and / or the second ICN packet corresponding to the first ICN packet is stored locally; If there is an index entry matching the identifier of the first ICN packet, the step of obtaining the first offset address corresponding to the first ICN packet is performed.

9. The method according to claim 8, characterized in that If the first ICN packet is a Data packet, and the second ICN packet is an Interest packet, the method further includes: If there is no index entry matching the identifier of the first ICN packet, the first ICN packet is discarded.

10. The method according to claim 8, characterized in that If the first ICN packet is a Data packet and the second ICN packet is an Interest packet, the determining whether there is an index entry matching the identifier of the first ICN packet includes: Determine, according to the positioning function, the position of the flag bit corresponding to the first ICN packet in the index unit, wherein the value of the flag bit in the index unit is used to indicate whether a Data packet corresponding to the flag bit is stored locally; Query the value of the flag bit corresponding to the first ICN packet; If the value of the flag bit corresponding to the first ICN packet is valid, it is determined that there is an index entry matching the identifier of the first ICN packet.

11. The method according to claim 8, characterized in that If the first ICN packet is an Interest packet, and the second ICN packet is a Data packet requested by the first ICN packet, then the determining whether there is an index entry matching the identifier of the first ICN packet includes: Determine, according to the positioning function, a position of a flag bit corresponding to the second ICN packet corresponding to the first ICN packet in the index unit; Query the value of the flag bit corresponding to the second ICN packet; If the value of the flag bit corresponding to the second ICN packet is valid, it is determined that there is an index entry matching the identifier of the first ICN packet.

12. A data processing device applied to an information center network (ICN), characterized in that: The apparatus comprises a processor and a memory for storing a computer program executable on the processor; Wherein, when the processor is used to run the computer program, it executes the steps of the data processing method described in any one of claims 1 to 11.

13. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a message forwarding program, and when the message forwarding program is executed by the processor, the steps of the data processing method according to any one of claims 1 to 11 are implemented.

Citation Information

Cited By

  • Data processing method and device, and computer readable storage medium

    WO2019201091A1