Network resource log verification method and pruning mechanism using block chain
By generating hash values and storing log files on the blockchain, the problem of SLA verification in smart contracts increases in the size of blockchain is solved, and the blockchain size is optimized by pruning overdue records, improving the efficiency of 5G network resource sharing and verify the performance of the process.
Patent Information
- Application Number
- CN202480001399.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2024-06-28
- Filing Date
- 2024-07-05
- Publication Date
- 2024-12-06
AI Technical Summary
When using the original network log verification service level protocol (SLA) in smart contracts, it will cause a significant increase in the size of the blockchain, and the lack of a deletion mechanism when the SLA is overdue, resulting in a downgrade of the verification process.
By generating hash values instead of the original network log and storing it on the blockchain, while storing filtered or aggregated log files outside the blockchain, overdue SLA records are regularly deleted to optimize the blockchain size.
It reduces the computing resource demand of blockchain, improves the speed of network resource sharing in 5G networks, and maximizes space saving by pruning blockchains, reducing part of the blockchain size synchronized by peers.
Smart Images

Figure CN119096520A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of network resource management in cellular networks, such as network slicing in 5G mobile networks. Background Art
[0002] Network sharing in modern cellular networks (such as 5G networks) is becoming a popular choice for mobile operators. Network sharing allows the physical network to be divided into independent logical networks. It also enables efficient resource sharing to meet different service requirements (for example, ultra-low latency for car-to-car applications). Network resource providers and tenants use service level agreements (SLAs) to define QoS (quality of service) requirements (such as bandwidth, throughput, and latency, etc.).
[0003] Today, blockchain plays an important role in facilitating the sharing of network resources, such as network slicing. Blockchain provides a decentralized and tamper-proof ledger for creating and verifying network slicing transactions. A smart contract is a decentralized computer program that runs on a blockchain network and automatically and deterministically executes agreements based on predefined conditions. Smart contracts can predefine rules to automatically execute the management of network slices.
[0004] However, using raw network logs to verify SLAs in smart contracts requires a lot of computation and greatly increases the size of the blockchain. In addition, when the SLA is overdue, there is no mechanism to delete the overdue records on the blockchain, and the verification process will be degraded. Summary of the invention
[0005] Therefore, one of the purposes of the present invention is to develop a method suitable for monitoring and verifying SLAs on a blockchain, which can facilitate faster creation of network resource sharing in 5G networks and reduce the computing resources required by the blockchain.
[0006] Therefore, one aspect of the present invention is a computer-implemented method for reducing the size of a blockchain. The method includes the following steps: providing a series of data files; generating a series of processing files within a certain time interval based on filtering and / or aggregating the series of data files; calculating a hash value for each of the series of processing files; adding the hash values as blocks to the blockchain respectively; and storing the series of processing files outside the blockchain.
[0007] In some embodiments, the series of data files are network resource log files of a cellular network.
[0008] In some embodiments, the series of process files are related to performance requirements of a cellular network SLA over a certification period.
[0009] In some embodiments, the certification period is equal to the length of the time interval.
[0010] In some embodiments, the number of process files in the series of process files is less than the number of data files in the series of data files.
[0011] In some embodiments, a processing file in the series of processing files is an aggregation of two data files in the series of data files that are related to the performance requirement.
[0012] In some embodiments, the blockchain includes blocks that are records of the SLA in addition to the hash values.
[0013] In some embodiments, the SLA record includes the performance requirements, the certification period, the SLA period, and the SLA record retention date.
[0014] In some embodiments, in the step of adding the hash values as blocks to the blockchain respectively, the hash values are added to the blockchain sequentially at time intervals.
[0015] In some embodiments, providers and tenants of network resources may access the blockchain.
[0016] In some embodiments, the step of storing the series of processed files outside the blockchain includes: providing the hash value to the provider by the blockchain; and storing the hash value associated with their respective processed files in the database by the provider.
[0017] According to another aspect of the present invention, a computer-implemented method for pruning a blockchain containing cellular network SLA records is provided. The method includes the following steps: identifying an overdue SLA record on the blockchain; identifying the latest block representing the SLA record proof on the blockchain; determining an optimized position on the blockchain corresponding to the maximum gain; setting the next block after the optimized position as a pseudo genesis block; and defining a portion of the blockchain starting from the pseudo genesis block as a pruned chain.
[0018] In some embodiments, the retention date of the overdue SLA record has expired.
[0019] In some embodiments, the gain is calculated as the number of blocks pruned before the pseudo genesis block minus the number of additional blocks that need to be copied after the pseudo genesis block.
[0020] In some embodiments, the additional block includes one or more blocks, each block representing a non-overdue SLA record or a log proof thereof.
[0021] In some embodiments, the log proof of the non-overdue SLA record is a hash value of a processed file obtained by filtering and / or aggregating one or more data files. The data file is a network resource log file of the cellular network.
[0022] In some embodiments, before the step of identifying overdue SLA records on the blockchain, the method further comprises the step of determining the percentage of all overdue blocks on the blockchain to all blocks on the blockchain. Only when the percentage is higher than a threshold, the method proceeds to the step of identifying overdue SLA records.
[0023] In some embodiments, the step of identifying overdue SLA records on the blockchain further includes: identifying more than one overdue SLA record. The step of identifying the latest block representing the SLA record proof on the blockchain further includes: identifying the latest block of each overdue SLA record.
[0024] According to another aspect of the present invention, a non-transitory computer-readable medium is provided, on which computer instructions are recorded. When the computer instructions are executed on one or more processors, the one or more processors are caused to perform operations according to the above-mentioned computer-implemented method for reducing the size of a blockchain.
[0025] According to another aspect of the present invention, a non-transitory computer-readable medium is provided, on which computer instructions are recorded. When the computer instructions are executed on one or more processors, the one or more processors are caused to perform operations according to the computer-implemented method of pruning a blockchain containing SLA records for a cellular network.
[0026] According to another aspect of the present invention, a computing system is provided, which includes one or more processors; and a memory containing instructions, which, when executed by the one or more processors, cause the computing system to perform operations according to the above-mentioned computer-implemented method for reducing the size of a blockchain.
[0027] According to another aspect of the present invention, a computing system is provided, which includes one or more processors; and a memory containing instructions, which, when executed by the one or more processors, cause the computing system to perform operations according to the above-mentioned computer-implemented method of pruning a blockchain containing SLA records for a cellular network.
[0028] Thus, it can be seen that various embodiments of the present invention provide different methods that ultimately reduce the size of the blockchain used to monitor and verify SLAs by using network resource logs (e.g., logs related to network resource sharing, such as network slicing, SIM card access, etc.). In some embodiments, the hash of the log file is saved on the blockchain instead of the log file itself, which greatly reduces the size of the block, thereby saving space. In some embodiments, the blockchain can be pruned with the goal of maximizing the space saving benefits, so the size of the portion of the blockchain synchronized by the peer can be reduced.
[0029] The foregoing summary is neither intended to define the invention of the present application nor to limit the scope of the invention in any way, which is measured by the appended claims. BRIEF DESCRIPTION OF THE DRAWINGS
[0030] The above and further features of the present invention will become apparent from the following description of embodiments thereof, which are provided by way of example only with reference to the accompanying drawings, in which:
[0031] Figure 1a shows a typical network resource sharing scheme that utilizes blockchain and blockchain-related smart contracts for SLA verification.
[0032] Figure 1b shows an example of how specific providers and tenants can access SLA records saved on the blockchain.
[0033] Figure 2 A block diagram showing a log file and a blockchain in a method for reducing the size of a blockchain according to an embodiment of the present invention.
[0034] Figure 3 Shows Figure 2 Flowchart of the main steps of the method.
[0035] Figure 4 The data fields and their definitions in an exemplary SLA record are shown.
[0036] Figure 5 The data fields and their definitions in an exemplary SLA periodic log proof are shown.
[0037] Figure 6 Method steps are shown how SLA periodic log proofs on a blockchain can be provided to providers and tenants and used by the latter.
[0038] Figure 7 Shows the data fields and their definitions in a sample message that a blockchain notifies a network resource provider.
[0039] Figure 8 It shows the process by which tenants query information from blockchain and network resource providers and use this information to check whether the performance requirements in the SLA are met.
[0040] Fig. 9 The structure of a blockchain before pruning operation according to another embodiment of the present invention is shown.
[0041] Fig.10 The pruning operation on the blockchain and how to construct the pruned blockchain are shown.
[0042] Fig.11 Shows Fig.10 Flowchart of the main steps of the method.
[0043] Fig.12 Shows Figure 2-3 Experimental results of the method in comparison with traditional techniques. DETAILED DESCRIPTION
[0044] Network slicing in 5G networks allows the creation of multiple isolated virtual networks within a single physical infrastructure. Each of these virtual networks (called a network slice) is customized to meet the specific requirements of different applications and / or devices. Network slicing is critical to effectively support a variety of services with different service level requirements (SLRs) in 5G mobile networks. These services include machine-type communications, ultra-reliable low-latency communications (such as vehicle-to-vehicle applications), and enhanced mobile broadband content delivery. In a practical example, each network slice is managed by a mobile virtual network operator (MVNO), where the infrastructure provider (the owner of the telecommunications infrastructure) rents out its physical resources to the MVNO that shares the underlying physical network. Based on the allocated resources, the MVNO can autonomously deploy multiple network slices tailored for the various applications provided to users.
[0045] On the other hand, in some networks, network resources are divided based on SIM card access rights. As the technician understands, the SIM card is a unique identifier for each UE (user equipment) and is used by the network to authenticate and authorize the UE to access network services. The SIM card contains an IMSI (International Mobile Subscriber Identity), which is a globally unique number that identifies a specific user. When the UE attempts to connect to the network, it presents the SIM card credentials. The network operator's system verifies the SIM card / IMSI to determine which network resources and services a specific user is entitled to based on his subscription plan (SLA). For example, some users may have premium plans that allow them to get higher data speeds, more bandwidth, lower latency, or access to dedicated network slices optimized for specific use cases. Other users may have basic plans with more limited resources.
[0046] Figure 1a shows a typical scenario of network resource sharing in a 5G cellular network. As shown in the figure, 5G resources 20 are provided by resource providers 22 and leased to resource tenants 24. Providers 22 provide network services and resources, while tenants 24 use the network slicing system as users or customers. Examples of 5G resources 20 include, but are not limited to, the number and type of sub-slices, physical network functions (PNFs), virtual network functions (VNFs), CPU, I / O, memory, storage, etc. Once the resources are negotiated between the provider 22 and the tenant 24, an SLA must be established. In particular, the provider 22 and the tenant 24 use the SLA to define at least QoS requirements (such as bandwidth, throughput, and latency, etc.). Note that there may not be just one SLA, and there may be different SLAs involving different stakeholders. The established SLAs need to be managed and monitored by the provider 22 and the tenant 24 to ensure that the service is running well.
[0047] The blockchain 26 plays an important role in facilitating the sharing of network resources of the 5G resources 20. The blockchain 26 is used to monitor and verify SLAs to ensure transparency and trust between the provider 22 and the tenant 24. In particular, the blockchain 26 provides a decentralized, tamper-proof ledger to create and verify network slice transactions, ensuring the security and immutability of transactions. A smart contract 30 is associated with the blockchain 26, and it can be understood by those skilled in the art that a smart contract 30 is an agreement reached between multiple parties in the form of computer code. Smart contracts allow transactions to be automatically carried out when one or more contract conditions are met without resorting to a third party. As shown in the example of FIG. 1a, the smart contract 30 creates various SLA records 28a, 28b, which are initialized on the blockchain 26 by the provider 22 and the tenant 24 to define performance requirements and verify whether the requirements are met. FIG. 1b shows an example of how a specific provider and tenant can access multiple SLA records in the blockchain, such as provider_1 and tenant_1 both access SLA_1 on the chain, and provider_n and tenant_n both access SLA_2 on the chain.
[0048] Different network functions are effective in executing network slicing and controlling SLAs whenever 5G resources are used20. For example, network functions include the access and mobility management function (AMF), which controls user equipment (UE) that has been authenticated to use operator services and manages the mobility of UEs between gNBs (gNodeBs). The session management function (SMF) manages the sessions of the UE, while the AMF transmits session management messages between the UE and the SMF. The user plane function (UPF) performs processing and forwarding of user data. The network slice selection function (NSSF) is responsible for the management and coordination of network slices. The communication service management function (CSMF) translates service requirements into requirements related to network slices.
[0049] Network functions generate various raw network logs (not shown in FIG. 1a or FIG. 1b), which are collected and included in the smart contract 30 for SLA verification. For example, one network resource log file may be related to the response time of the slice network, while another network resource log file may be related to the throughput of the slice network. Therefore, the network resource log files may contain valuable information related to the SLA to determine whether the performance requirements are met. However, traditionally, all raw network logs are transmitted and stored in the blockchain, which greatly increases the size of the blockchain. In addition, verifying the SLA using raw network logs requires a lot of computation.
[0050] On the other hand, in the conventional technology, the SLA is saved as an SLA record on the blockchain, as shown in FIG. 1a, and there may be overdue SLA records 28a and unexpired SLA records 28b at any point in time. In one example, when the SLA record retention date in the SLA record has passed, the SLA record becomes overdue, indicating that the SLA record may be deleted. For example, due to regulatory requirements, the SLA record may need to be retained for six months after the service contract between the provider and the tenant is terminated. However, in the conventional technology, when the SLA expires, there is no mechanism to delete the overdue record on the blockchain, which will cause the SLA verification process to be degraded. Since all blocks in the blockchain are synchronized between all peers, this is especially true for overdue SLA records 28a. In this regard, the example shown in FIG. 1 has three peers (peer 1, peer 2, and peer 3), all of which synchronize the same blocks for SLA records 28a, 28b.
[0051] Therefore, the system and method provided by the exemplary embodiments of the present invention are suitable for improving efficient 5G network resource sharing based on blockchain technology. For example, network resource sharing can be based on network slicing or SIM card access, as briefly described above. The improvement of the present invention is based on the on-chain and off-chain technologies in network resource log verification.
[0052] Go to Figure 2 , an embodiment of the present invention provides a method for verifying SLA in 5G network resource sharing, which uses log hash values instead of original network resource logs to reduce the required blockchain size. The network resource provider creates a hashed network log on the blockchain as proof and provides the original log off the chain for verification. The network resource tenant sequentially requests the hashed network log and the original log from the provider for SLA requirement verification. The main steps of the method are as follows Figure 3 As shown, we will now refer to Figure 2. First, in step 140, a series of original network resource files 132 are provided by various network functions similar to those described above. Each original network resource file 132 is a data file stored in a database 138 of a network resource provider. Examples of original network resource files 132 include log files that respectively record the bandwidth, throughput, and latency of the tenant's network capacity. There is no limit on the time for generating various original network resource files 132—they can be generated substantially simultaneously, sequentially, or in other ways. Then, in step 142, a series of filtered or aggregated log files 134 are generated based on the original network resource files 132. The filtered or aggregated log files 134 are processed files obtained after filtering the original network resource files 132 and / or aggregating two or more original network resource files 132. In Figure 2 In the example shown, the first filtered or aggregated log file 134 in the series is an aggregation of Log_1 (e.g., about response time) and Log_3 (e.g., about throughput) of a series of original network resource files 132. Another filtered or aggregated log file 134 in the series is an aggregation of Log_2 and Log_n of a series of original network resource files 132. It should be noted that, generally, as long as the slice network is in operation, the original network resource files 132 are continuously generated, and therefore the filtered or aggregated log files 134 are also continuously generated. However, the filtered or aggregated log files 134 are generated regularly at a predetermined time interval (e.g., once an hour), and it is best to specify this time interval in the "Log Proof Condition" field in the SLA record corresponding to the filtered or aggregated log file, which will be described in detail later. Due to such a time interval, the number of filtered or aggregated log files 134 is generally less than the number of original network resource files 132 generated within a certain period of time (e.g., a day).
[0053] Next, in step 144, a hash value is calculated for each filtered or aggregated log file 134 as a periodic log proof. Due to the above time interval, the log proof is generated periodically, which is the result of the periodic generation of the filtered or aggregated log file. Note that the type of hash algorithm / function applicable to the method in this embodiment is not limited, and examples of hash algorithms that can be used include SHA-256 and SHA-512. Compared with the filtered or aggregated log file 134 at the same level in size as the original network resource file 132, the hash value is much smaller. Subsequently, in step 146, the hash values are provided to the blockchain 126 in a sequential manner, and each hash value is part of the SLA periodic log proof corresponding to the filtered or aggregated log file 134. The reason for adding the hash values sequentially to the blockchain 126 is that a series of filtered or aggregated log files 134 are recursively generated at time intervals (for example, one per hour), so the hash values are also generated at the same frequency, and once the hash value is created, it will be submitted to the blockchain 126, so that a series of hash values are sequentially added to the blockchain 126.
[0054] exist Figure 2 In the example shown, each hash value stored in the blockchain 126 is part of the periodic log proof 136 of the SLA. It should be noted that although Figure 2 Different periodic log certificates 136 for different SLAs are shown, but there may be multiple periodic log certificates 136 for the same SLA in the blockchain 126 (see, for example, Figure 9-10 In addition, the blockchain 126 can store not only the periodic log proof 136, but also the SLA record ( Figure 2 Not shown, but can be seen in Figure 9-10 Finally, since the periodic log proof 136 is stored on the blockchain 126, in step 148, the filtered or aggregated log file 134 is stored outside the blockchain 126, for example, in a database 138 of the network resource provider. The database 138 can store other information or data, such as the original network resource log file.
[0055] Figure 4 Figure 1 shows the exemplary contents of an SLA record that can be stored in the blockchain and accessed by providers and tenants of slice network resources. There are various ID fields that store the IDs of the SLA, provider, and tenant. The performance requirements under the SLA are also stored in the SLA record, in Figure 4 In the SLA, example performance requirements include latency and reliability. Importantly, the SLA record also includes a “Log Proof Conditions” field, which specifies the conditions under which the provider needs to submit network log proofs to the blockchain. Figure 2-3In the method, the time interval between the generation of two filtered or aggregated log files can be set by the log proof condition in the SLA record, because once the filtered or aggregated log file is created, it should be stored to the blockchain. Another field in the SLA record is the "SLA record retention date", which, as mentioned above, determines when the SLA record can be deleted from the blockchain. For example, the deletion of the SLA record may be allowed six months after the service contract between the provider and the tenant is terminated.
[0056] The provider submits the SLA periodic log proof to the blockchain when the log proof conditions are met (e.g., when one hour has passed since the last log proof was saved to the blockchain). Figure 5 The following figure shows the exemplary contents of an SLA periodic log attestation that can be stored in a blockchain and accessed by providers and tenants of slice network resources. There are multiple ID fields that store the IDs of the SLA, provider, and tenant. The attestation period for a particular SLA periodic log attestation is also specified. In addition, based on the filtered or aggregated log files ( Figure 5 The hash value calculated as Hash Value (Filtered Aggregate Log) in Figure 1 and the filtered or aggregated log files are also stored in the SLA Periodic Log Proof. It can be seen that the size of the SLA Periodic Log Proof is significantly smaller than the original network resource log because the payload in the SLA Periodic Log Proof is only the hash value.
[0057] Please see Figure 6 , which shows in more detail Figure 3 As described above, in step 146, the hash value is provided to the blockchain, and since the hash value is included in Figure 5 In the SLA periodic log proof shown, in step 146, the SLA periodic log proof is actually submitted to the blockchain, such as Figure 6 Then, once the SLA periodic log proof is created on the blockchain, the blockchain notifies the provider of the block ID, SLA ID, proof period, and hash log proof in step 147. Similarly, the blockchain notifies the tenant of the block ID, SLA ID, proof period, and hash log proof in step 149. After step 147, the provider saves the filtered or aggregated log files in its database along with the relevant information in step 148, as described above and Figure 6 On the other hand, if necessary, the tenant can obtain the hash log proof at any time by querying the blockchain in step 150, which will be described in detail later.
[0058] Figure 7Exemplary content of data including filtered or aggregated log files and related information is shown, which is saved to the provider's database in step 148. Various IDs are saved, including the ID of the block on the blockchain containing the hash log proof, and the ID of the SLA corresponding to the log proof. In addition, the certification period of the generated SLA periodic log proof is also specified. The hash value calculated based on the filtered or aggregated log file, as well as the filtered or aggregated log file itself, are stored in the database. Finally, the hash function used to calculate the hash value is stored together with the hash value. Therefore, all information is maintained by the provider, and the tenant can make a request to the provider when verification of the SLA is required. In a variation of this embodiment, the provider may save a link to the filtered or aggregated log file in its database, while the actual log file is stored in another location.
[0059] Figure 8 An exemplary method is shown of how a tenant may request information from a network resource provider and a blockchain to verify an SLA, and in particular to check whether any performance requirements specified in the SLA are met. In step 152, the tenant queries the provider for filtered or aggregated logs and a hash function (but not the hash value itself). In step 154, the provider returns such information to the tenant, and the tenant applies the hash function to the filtered or aggregated logs to obtain a hash value (H). In addition to step 152, the tenant also queries the blockchain for a hash log proof in step 156. The requested hash log proof is returned from the blockchain in step 158. Subsequently, in step 160, the tenant compares the H value obtained in step 154 with the hash log proof from the blockchain. In other words, it compares the proof on the blockchain to see if the off-chain proof is equal to the on-chain proof. If the H value is equal to the hash log proof on the blockchain, it means that the information held by the provider is authentic, and the tenant can then check whether the performance requirements are met by analyzing the filtered or aggregated logs in the provider's database in step 162. The tenant can repeat this process multiple times. Figure 8 , in order to analyze different filtered or aggregated logs, such as for different SLAs and / or for multiple analyses for the same SLA.
[0060] See also Fig. 9 In another embodiment of the present invention, a method for pruning a blockchain containing SLA records for a cellular network is provided. The cellular network may be a slicing network. In summary, the method determines the percentage of overdue blocks among all blocks on the blockchain, finds an optimal location to prune the blockchain to minimize the blocks that need to be synchronized by all peers, and then generates a pruned blockchain. Fig. 9An example blockchain is shown without any pruning operations. As can be seen, the first block of the blockchain is the genesis block (block 0). After block 0, there are nine more blocks that contain not only blocks storing SLA records (SLA_1, SLA_2, SLA_3, SLA_4), but also blocks storing periodic log proofs for one or more of these SLA records. Fig. 9 In the example shown, SLA_1 and SLA_2 have expired, while SLA_3 and SLA_4 have not expired. Obviously, since there are overdue SLA records on the blockchain, all peers need to synchronize the blockchain containing the overdue SLAs, which not only requires more space to save blocks, but also causes the verification process to be prolonged.
[0061] exist Fig.10 In the , the method of pruning a blockchain is explained by showing the structure of the pruned blockchain and how some blocks in the full blockchain are copied to other locations in the blockchain. The flowchart of the method is shown in Fig.11 There can be different criteria to determine whether a pruning operation should be performed. For example, the percentage of overdue blocks (i.e., blocks whose SLA record retention date has expired) among all blocks on the blockchain can be continuously monitored. Fig. 9 In the blockchain shown, there are a total of ten blocks, six of which are overdue, namely blocks 1, 2, 3, 5, 6, and 8. Since these blocks are related to SLA_1 or SLA_2, each block contains an SLA record or periodic log proof. Therefore, Fig. 9 The percentage of overdue blocks is 60%. When the percentage of overdue blocks exceeds a threshold (e.g. 60%), the pruning mechanism is automatically executed.
[0062] Pruning method from Fig.11 The process begins at step 170 in which all SLAs whose record retention dates have expired are determined by scanning the entire blockchain from the genesis block or pseudo-genesis block to the latest block. Fig. 9 In the example shown, this means scanning all blocks from the genesis block (block 0) to the latest block (block 9). Fig. 9 In the example of , assume that SLA_1 and SLA_2 are overdue. Then, in step 172, the latest block of the periodic log proof of each overdue SLA is found. For SLA_1, the latest block containing the periodic log proof is block 5, and for SLA_2, the latest block containing the periodic log proof is block 8. In general, assuming there are n overdue SLAs, the latest block array will become: Latest block = {(a1,a2,...,an)|a1,a2,...,an∈block number}(1)
[0063] Then, in step 174, the optimal position of the pruning operation is determined by finding the position corresponding to the maximum gain. Here, the gain is defined as g(a i ), which is equal to the number of blocks that can be reduced after pruning minus the number of additional blocks that need to be created (i.e., the number of blocks that need to be copied to the pruned blockchain). For each position on the blockchain, a separate gain can be calculated according to the above definition, but there is at least one position that, if selected as the pruning position, will produce the largest gain compared to the other positions. In general, the optimal position is calculated by argmax([g(a1),g(a2),...,g(an)]), so the argmax operation returns the position that produces the largest gain. In Fig. 9 In the example of , when the pruning position is at block 8 (i.e., the front part of all chains including block 8 are pruned and not included in the pruned chain), the gain is the largest, so the optimization position is at block 8. The block immediately following the optimization position will be set as the pseudo genesis block in step 176. Fig.10 The blockchain status after the pruning operation with block 8 as the optimized position is shown. It can be seen that blocks 0 to 8 in the blockchain are deleted (pruned), and starting from block 9, the remaining blocks are retained in the pruned blockchain. Then, block 9 becomes the pseudo genesis block.
[0064] Once the optimized position is selected, the method proceeds to the step of actually pruning the blockchain. First, in step 178, the non-overdue SLAs and their SLA periodic log proofs (if any) are copied to the location on the blockchain after the optimized position. The copied blocks become additional blocks added to the blockchain. Fig.10 As shown, in the example, SLA_3 and SLA_4 are not overdue, so blocks 4 and 7, which contain the SLA record of SLA_3 and the periodic log proof of SLA_3 respectively, are copied and generate new blocks 10 and 11 respectively. Subsequently, in step 180, a new information block is also added to the blockchain, which indicates that block 9 is a pseudo genesis block and becomes block 12. Finally, in step 182, the pseudo genesis block and the affected blocks (i.e., the blocks deleted from the pruned blockchain) will be notified to the peers. Peers can choose to synchronize blocks starting from the pseudo genesis block (so peers only need to deal with unfinished SLAs) or synchronize the entire blockchain (at the cost of reduced SLA verification performance) as needed. Fig.10 As shown in the figure, after the pruning operation, the original blockchain of size 10 becomes a pruned blockchain of size 4, and the blockchain size is reduced by 60%. It should be understood that since the blockchain has the characteristic that blocks cannot be retroactively changed, it will of course not be truly cut or truncated, but by introducing a pseudo-genesis block, peers only need to synchronize part of the entire blockchain, thereby reducing computational complexity and space requirements.
[0065] To evaluate Figure 2-3 The methods and Figure 10-11 In order to compare the performance improvements achieved by the methods in the experiment, an experiment was set up. In the experiment, a scenario was set up, that is, there were 100 SLAs, and each SLA had 10 network logs per minute. The size of each log was 100 bytes. The proof period was set to every hour (so 24 SLA periodic log proofs were generated for each SLA every day). The size of the SLA periodic log proof was set to 100 bytes each. The SLA period was set to one month (ignoring block overhead).
[0066] Fig.12 Shows Figure 2-3 The performance of the method is compared with that of the unused Figure 2-3 The same scenario of the method in is compared. It can be seen that using Figure 2-3 After the above method, the size of the blockchain grows linearly with the size of the hash log, but the growth rate is much lower than storing the original log directly on the blockchain. From the numerical results, it can be seen that using Figure 2-3 The method in the blockchain is only about 7.2MB in size, and the data saved off-chain (including filtering or aggregation logs) is about 4GB. In contrast, if this method is not used, the size of the blockchain will be 4GB because all filtering or aggregation logs are saved on the blockchain.
[0067] for Figure 10-11 The numerical results show that after pruning the blockchain, the size of the blockchain is only 1.7GB (referring to the part synchronized with peers, not the entire chain), and the size of the entire chain is 4.5GB (no synchronization required). In contrast, if the blockchain is not pruned, the size of the blockchain is only 1.7GB (referring to the part synchronized with peers, not the entire chain), and the size of the entire chain is only 4.5GB (no synchronization required). Figure 10-11 The size of the blockchain is 4GB with the method in , and the entire blockchain needs to be synchronized by all peers. The size of the blockchain using the pruning method is slightly larger than the size of the blockchain without the method because there are additional blocks copied to the chain (similar to the blocks mentioned in step 178 above). It can be seen that if the provider must verify and submit the network log directly on the blockchain, then the provider can use Figure 10-11 The technique provided in prunes the blockchain and shortens the number of blocks. Thus, the size of the blockchain synchronized by peers can be reduced.
[0068] The exemplary embodiments have been described in detail above. Although specific embodiments are mentioned in the description, it should be clear to those skilled in the art that the present invention can also be implemented by changing these specific details. Therefore, the present invention should not be understood to be limited to the embodiments described herein.
[0069] Although embodiments have been shown and described in detail in the accompanying drawings and the foregoing description, these embodiments should be considered illustrative rather than restrictive, and it should be understood that only exemplary embodiments are shown and described, and the scope of the invention is not limited in any way. It is understood that any feature described herein can be used in any embodiment. The illustrative embodiments are not mutually exclusive or exclusive of other embodiments not described herein. Therefore, the present invention also provides an embodiment comprising a combination of one or more of the above-mentioned illustrative embodiments. Without departing from the spirit and scope of the present invention, the present disclosure described herein may be modified and varied, and therefore, only the limitations specified in the appended claims should apply.
[0070] For example, despite Figure 2-3 The methods and Figure 10-11 The methods in are independent of each other and do not require each other to be executed, but the two methods can be combined and applied to the same blockchain. For example, you can use Figure 2-3 The method in Figure 9-10 The SLA periodic log proof shown in , not only does the original network resource log file need to be saved to the blockchain, but even if the blockchain only contains hash values (log proof), the blockchain can be pruned to achieve further size reduction and verification process enhancement.
[0071] The functional units and modules of the system and method according to the embodiments of the present disclosure can be implemented using computing devices, computer processors or electronic circuits, including but not limited to application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs) and other programmable logic devices configured or programmed according to the teachings of the present disclosure. Computer instructions or software codes running in computing devices, computer processors or programmable logic devices can be easily written by technicians in the software or electronics fields according to the teachings of the present disclosure.
[0072] All or part of the embodiment methods may be performed in one or more computing devices, including server computers, personal computers, laptop computers, and mobile computing devices, such as smart phones and tablet computers.
[0073] Embodiments include computer storage media, transient and non-transitory storage devices having stored therein computer instructions or software codes that can be used to program a computer or microprocessor to perform any of the processes of the present invention. Storage media, transient and non-transitory computer-readable storage media may include, but are not limited to, floppy disks, optical disks, Blu-ray disks, DVDs, CD-ROMs, magneto-optical disks, ROMs, RAMs, flash memory devices, or any type of medium or device suitable for storing instructions, codes, and / or data.
[0074] Each functional unit and module of each embodiment can also be implemented in a distributed computing environment and / or a cloud computing environment, wherein all or part of the machine instructions are executed in a distributed manner by one or more processing devices interconnected by a communication network (such as an intranet, a wide area network, a local area network, the Internet, and other forms of data transmission media).
Claims
1. A computer-implemented method for reducing the size of a blockchain, comprising the following steps: a) Provide a series of data files; b) generating a series of processing files at certain time intervals according to filtering and / or aggregating the series of data files; c) calculating a hash value for each processing file in the series of processing files; d) adding the hash values as blocks to the blockchain respectively; as well as e) storing the series of processing files outside the blockchain.
2. The computer-implemented method of claim 1 , wherein: The series of data files are network resource log files of the cellular network.
3. The computer-implemented method of claim 2, wherein: The series of process files are associated with performance requirements of a service level agreement (SLA) for the cellular network over a certification period. The computer-implemented method of claim 3 , wherein the certification period is equal to the length of the time interval.
5. The computer-implemented method of claim 1 , wherein: The number of the processing files in the series of processing files is less than the number of the data files in the series of data files.
6. The computer-implemented method of claim 3, wherein: One of the series of process files is an aggregation of two data files in the series of data files that are related to the performance requirement.
7. The computer-implemented method of claim 3, wherein the blockchain includes blocks that are records of the SLA in addition to the hash values.
8. The computer-implemented method of claim 7, wherein the SLA record includes the performance requirement, the certification period, an SLA period, and an SLA record retention date.
9. The computer-implemented method of claim 1 , wherein in step d), the hash values are sequentially added to the blockchain in the order of the time intervals.
10. The computer-implemented method of claim 2, wherein the blockchain is accessible to providers and tenants of network resources.
11. The computer-implemented method of claim 10, wherein step e) further comprises: f) providing the hash value to the provider by the blockchain; g) storing, by said provider, said hash values associated with the respective processed files in a database.
12. A computer-implemented method for pruning a blockchain containing service level agreement (SLA) records for a cellular network; the method comprising the steps of: a) Identify overdue SLA records on the blockchain; b) identifying the latest block on the blockchain that represents the SLA record proof; c) determining an optimized position on the blockchain corresponding to a maximum gain; d) setting the next block after the optimized position as a pseudo genesis block; as well as e) defining a portion of the blockchain starting with the pseudo genesis block as a pruned chain.
13. The computer-implemented method of claim 12, wherein a retention date of the overdue SLA record has expired.
14. The computer-implemented method of claim 12, wherein the gain is calculated as the number of blocks that can be pruned before the pseudo genesis block minus the number of additional blocks that need to be copied after the pseudo genesis block.
15. The computer-implemented method of claim 14, wherein the additional blocks include one or more blocks, each block representing a non-overdue SLA record or a log proof thereof.
16. The computer-implemented method of claim 15, wherein the log proof of the unexpired SLA record is a hash value of a processed file based on filtering and / or aggregation of one or more data files; the data files are network resource log files of the cellular network.
17. The computer-implemented method according to claim 12 further includes a step before step a): determining the percentage of all overdue blocks on the blockchain to all blocks on the blockchain; only when the percentage is higher than a threshold, the method goes to step a).
18. The computer-implemented method of claim 12, wherein step a) further comprises: Identify one or more overdue SLA records; Wherein step b) further includes: identifying the latest block of each overdue SLA record.
19. A non-transitory computer-readable medium having computer instructions recorded thereon, which, when executed on one or more processors, cause the one or more processors to perform operations according to the method of claim 1.
20. A computing system comprising: one or more processors; as well as A memory containing instructions that, when executed by the one or more processors, cause the computing system to perform operations according to the method of claim 1.
21. A non-transitory computer readable medium having computer instructions recorded thereon, which when executed on one or more processors cause the one or more processors to perform operations according to the method of claim 12.
22. A computing system comprising: one or more processors; as well as A memory containing instructions which, when executed by one or more processors, cause the computing system to perform operations according to the method of claim 12.
