CN114338704A - Data exchange system for block chain cluster - Google Patents

Data exchange system for block chain cluster Download PDF

Info

Publication number
CN114338704A
CN114338704A CN202111681732.8A CN202111681732A CN114338704A CN 114338704 A CN114338704 A CN 114338704A CN 202111681732 A CN202111681732 A CN 202111681732A CN 114338704 A CN114338704 A CN 114338704A
Authority
CN
China
Prior art keywords
transmission
stored
request
data
state
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
CN202111681732.8A
Other languages
Chinese (zh)
Inventor
唐为玮
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hefei Yingfan Network Technology Co ltd
Original Assignee
Hefei Yingfan Network Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hefei Yingfan Network Technology Co ltd filed Critical Hefei Yingfan Network Technology Co ltd
Priority to CN202111681732.8A priority Critical patent/CN114338704A/en
Publication of CN114338704A publication Critical patent/CN114338704A/en
Withdrawn legal-status Critical Current

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a data exchange system for a block chain cluster, which comprises: the acquisition processing module is used for acquiring the request data and processing the request data to obtain request processing data; acquiring transmission data, calculating the transmission data to obtain a transmission state value, and analyzing the transmission state value to obtain a transmission path; acquiring corresponding stored data according to the request tag, processing and calculating the stored data to obtain a stored state value, and analyzing the stored state value to obtain a stored result; the matching module is used for matching the request processing data with the transmission path, and if the matching is successful, a first exchange signal is generated; matching the request processing data with the stored result according to the first exchange signal, and if the matching is successful, generating a second exchange signal; the exchange module is used for exchanging the request data with the stored data according to the second exchange signal.

Description

Data exchange system for block chain cluster
Technical Field
The invention belongs to the technical field of block chains, and particularly relates to a data exchange system for a block chain cluster.
Background
Data switching (data switching) refers to a process of establishing a temporary interconnection path for data communication between any two terminal devices among a plurality of data terminal Devices (DTEs). Data exchange can be divided into: circuit switching, message switching, packet switching, and hybrid switching. The circuit switching principle is basically the same as the telephone switching principle. The circuit switching has the disadvantages that the utilization rate of the circuit is low, and the circuit cannot be fully utilized in the idle time of two parties in the communication process;
the block chain is a distributed shared account book and a database, and has the characteristics of decentralization, no tampering, trace retaining in the whole process, traceability, collective maintenance, openness and transparency and the like; the blockchain is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, a consensus mechanism and an encryption algorithm.
The publication number CN111079161A discloses a trusted data exchange method based on a block chain technology, which is proposed to solve the problems that the existing service data exchange is slow, and cross-domain data circulation and sharing exist information authentication, information confidentiality and information are easy to tamper, and are not beneficial to use, and includes the following steps: s1: carrying out data statistics and classification on the credible service according to a preset uplink data model; s2: inputting data by utilizing the Internet; s3: auditing the input service data based on the known information; s4: if the audit is passed, the service data is uploaded to the block chain, and if the audit is not passed, the information is deleted; s5: and transmitting the upload data to all nodes on the block chain. The invention solves the problems of information authentication, information confidentiality and information tamper resistance existing in cross-domain data circulation and sharing, and promotes the cross-domain sharing of data.
But has the defect that the dynamic monitoring and matching can not be carried out according to the request data, the transmission route and the stored data, so that the data exchange effect is poor.
Disclosure of Invention
The invention aims to provide a data exchange system for a block chain cluster, which mainly aims to solve the technical problem of poor data exchange effect caused by incapability of carrying out dynamic monitoring and matching according to request data, transmission routes and stored data in the block chain cluster.
The purpose of the invention can be realized by the following technical method:
a data exchange system for a block chain cluster comprises an acquisition processing module, a matching module and an exchange module;
the acquisition processing module is used for acquiring request data, wherein the request data comprises a sending request type, a request address and a request label, and processing the request data to obtain request processing data; acquiring transmission data, wherein the transmission data comprises a transmission state, a transmission type, a transmission space and historical transmission, calculating the transmission data to obtain a transmission state value, and analyzing the transmission state value to obtain a transmission path; acquiring corresponding stored data according to the request tag, wherein the stored data comprises a stored type, a historical request, a stored space and a stored state, processing and calculating the stored data to obtain a stored state value, and analyzing the stored state value to obtain a stored result;
the matching module is used for matching the request processing data with the transmission path, and if the matching is successful, a first exchange signal is generated; if the matching fails, returning to the exchange failure; matching the request processing data with the stored result according to the first exchange signal, and if the matching is successful, generating a second exchange signal; if the matching fails, returning to the exchange failure;
the exchange module is used for exchanging the request data with the stored data according to the second exchange signal.
Further, performing a processing operation on the request data to obtain the request processing data, and obtaining a storage allocation result includes:
s21: acquiring a request type, a request address and a request label in request data, setting different request types to correspond to different request preset values, matching the request type in the request data with all the request types to acquire the corresponding request preset values, and marking the corresponding request preset values as QYYi, wherein i is 1,2.
S22: marking the request address as QDi, i 1,2.. n; setting different request addresses to correspond to different address weights, matching the request addresses in the request data with all the request addresses to obtain corresponding address weights, and marking the corresponding address weights as QDQi, wherein i is 1,2.. n;
s23: label the request tag as QBi, i 1,2.. n; carrying out normalization processing on the marked request preset value and the address weight and taking values;
s24: using formulas
Figure BDA0003447846010000031
Calculating to obtain a request value; wherein, QZiExpressed as a request value, a1 and a2 are expressed as preset different proportionality coefficients;
s25: and combining the request value with the marked request preset value, the request address, the address weight and the request label to obtain the request processing data.
Further, calculating the transmission data to obtain a transmission value, and analyzing the transmission value to obtain a transmission path, including:
s31: acquiring a transmission state, a transmission type, a transmission space and historical transmission in transmission data, and marking the transmission state as CZi, wherein i is 1,2.. n; setting different transmission states to correspond to different state preset values, matching the transmission states in the transmission data with all the transmission states to obtain corresponding state preset values, and marking the state preset values as ZYYi, wherein i is 1,2. The transmission state comprises a working state, an idle state and a disconnection state;
s32: marking the transmission type as CLi, i ═ 1,2.. n; setting different transmission types to correspond to different transmission weights, matching the transmission types with all the transmission types to obtain the corresponding transmission weights, and marking the transmission types as CLQi, wherein i is 1,2.. n;
s33: label the capacity value in the transmission space as CKi, i ═ 1,2.. n; marking the transmission times of historical transmission as LCCi, i is 1,2.. n; marking the last transmission interval duration of the historical transmission as LCJi, i is 1,2.. n;
s34: carrying out normalization processing on the marked state preset value, the transmission weight, the transmission space, the transmission times and the transmission interval duration to obtain values;
s35: using formulas
Figure BDA0003447846010000041
Calculating to obtain a state-transfer value; wherein, CTiExpressed as a transmission value, b1, b2, b3 and b4 are expressed as preset different proportionality coefficients, mu is expressed as a preset correction factor, and LCJi0 is expressed as an average value of the transmission interval duration;
s36: matching and analyzing the transmission state value and a preset standard transmission state threshold value, and if the transmission state value is not greater than the preset standard transmission state threshold value, judging that a transmission line corresponding to the transmission state value cannot transmit and generating a first matching signal; if the transmission state value is larger than the preset standard transmission state threshold value, judging that the transmission line corresponding to the transmission state value can transmit and generate a second matching signal, setting the transmission line corresponding to the transmission state value as an effective line, and setting the transmission line corresponding to the maximum transmission state value as an initial selection line;
s37: and combining the effective line and the initially selected line to obtain a transmission path.
Further, the processing and calculation of the stored data to obtain a stored state value, and the analysis of the stored state value to obtain a stored result include:
s41: acquiring a stored type, a history request, a stored space and a stored state in stored data, and marking the stored type as YCLi, wherein i is 1,2.. n; setting different stored types to correspond to different storage preset values, matching the stored types with all the stored types to obtain corresponding storage preset values, and marking the storage preset values as CYLi, wherein i is 1,2.. n;
s42: marking the total number of historical requests as QZCi, i ═ 1,2.. n; marking a stored capacity value in a stored space as YCRi, i ═ 1,2.. n; marking the stored state as YCZi, i ═ 1,2.. n; setting different storage states to correspond to different storage state weights, matching the stored states with all the storage states to obtain corresponding storage state weights, and marking the storage state weights as CZQi, wherein i is 1,2.. n;
s43: carrying out normalization processing on the marked stored preset value, the total times of the historical requests, the stored capacity value and the stored form weight and taking values;
s44: using formulas
Figure BDA0003447846010000051
Calculating to obtain a storage state value; wherein, CCiExpressed as a storage state value, c1, c2 and c3 are expressed as preset different proportionality coefficients, beta is expressed as a preset storage state correction factor, and YCRi0 is expressed as a preset standard capacity value;
s45: analyzing the stored state value, matching the stored state value with a preset standard stored state threshold value, and if the stored state value is not greater than the standard stored state threshold value, judging that stored data corresponding to the stored state value can be exchanged and generating a first stored state signal; if the stored state value is larger than the standard stored state threshold value, judging that stored data corresponding to the stored state value cannot be exchanged and generating a second stored state signal;
s46: and combining the first state storage signal and the second state storage signal and the corresponding state storage values and the stored data to obtain a stored result.
Further, the request processing data is matched with the transmission path, and if the matching is successful, a first exchange signal is generated; if the matching fails, returning the exchange failure, and the specific steps comprise:
s51: obtaining request value QZ corresponding to request processing dataiTransmission state value CT corresponding to the initially selected line in the transmission pathi
S52: using formulas
Figure BDA0003447846010000052
Calculating to obtain a first correlation coefficient; wherein g1 and g2 are expressed as preset different proportionality coefficients;
s53: matching the first correlation coefficient with a preset standard line threshold, and if the first correlation coefficient is not greater than the standard line threshold, judging that a path can be formed between the request processing data and the initially selected line and generating a first exchange signal; and if the first correlation coefficient is larger than the threshold value of the standard line, judging that a path cannot be formed between the request processing data and the initially selected line and generating an exchange failure prompt.
Further, the request processing data is matched with the stored result according to the first exchange signal, and if the matching is successful, a second exchange signal is generated; if the matching fails, returning the exchange failure, and the specific steps comprise:
s61: obtaining request value QZ corresponding to request processing dataiA stored state value CC corresponding to the first stored state signal in the stored resulti
S62: using formulas
Figure BDA0003447846010000061
Calculating to obtain a second correlation coefficient; wherein f1 and f2 are expressed as preset different proportionality coefficients;
s63: matching the second correlation coefficient with a preset standard storage threshold, and if the second correlation coefficient is not greater than the standard storage threshold, judging that the request processing data and the stored data in the stored result can be exchanged and generating a second exchange signal; and if the second correlation coefficient is larger than the standard storage threshold, judging that the data requested to be processed and the stored data in the stored result cannot be exchanged and generating an exchange failure prompt.
The invention has the beneficial effects that:
in various aspects disclosed by the invention, a collection processing module is utilized to obtain request data, the request data comprises a sending request type, a request address and a request label, and the request data is processed to obtain request processing data; acquiring transmission data, wherein the transmission data comprises a transmission state, a transmission type, a transmission space and historical transmission, calculating the transmission data to obtain a transmission state value, and analyzing the transmission state value to obtain a transmission path; acquiring corresponding stored data according to the request tag, wherein the stored data comprises a stored type, a historical request, a stored space and a stored state, processing and calculating the stored data to obtain a stored state value, and analyzing the stored state value to obtain a stored result; by collecting the request data, the transmission data and the stored data and carrying out processing and analysis, the dynamic monitoring can be carried out on the requesting party, the transmitting party and the exchanging party, and effective data support is provided for subsequent dynamic matching;
matching the request processing data with the transmission path by using a matching module, and if the matching is successful, generating a first exchange signal; if the matching fails, returning to the exchange failure; matching the request processing data with the stored result according to the first exchange signal, and if the matching is successful, generating a second exchange signal; if the matching fails, returning to the exchange failure; the acquired data are processed and calculated to establish contact among the data and analyze and establish connection, so that a requesting party, a transmitting party and an exchanging party are matched at the same time to further optimize the data transmission effect;
exchanging the request data with the stored data by using the exchange module according to the second exchange signal; the purpose of improving the data exchange effect by dynamically monitoring and matching according to the request data, the transmission route and the stored data can be achieved.
Drawings
The invention will be further described with reference to the accompanying drawings.
Fig. 1 is a block diagram of a data switching system for a blockchain cluster according to the present invention.
Detailed Description
The technical method in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Example one
Referring to fig. 1, the present invention is a data exchange system for a block chain cluster, including an acquisition processing module, a matching module and an exchange module; the acquisition processing module, the matching module and the switching module are used for acquiring, processing and analyzing data through a plurality of sub-nodes on a block chain;
the acquisition processing module is used for acquiring request data, wherein the request data comprises a sending request type, a request address and a request label, and processing the request data to obtain request processing data; acquiring transmission data, wherein the transmission data comprises a transmission state, a transmission type, a transmission space and historical transmission, calculating the transmission data to obtain a transmission state value, and analyzing the transmission state value to obtain a transmission path; acquiring corresponding stored data according to the request tag, wherein the stored data comprises a stored type, a historical request, a stored space and a stored state, processing and calculating the stored data to obtain a stored state value, and analyzing the stored state value to obtain a stored result;
the specific steps of processing the request data to obtain the request processing data and obtaining the storage allocation result comprise:
acquiring a request type, a request address and a request label in request data, setting different request types to correspond to different request preset values, matching the request type in the request data with all the request types to acquire the corresponding request preset values, and marking the corresponding request preset values as QYYi, wherein i is 1,2.
Marking the request address as QDi, i 1,2.. n; setting different request addresses to correspond to different address weights, matching the request addresses in the request data with all the request addresses to obtain corresponding address weights, and marking the corresponding address weights as QDQi, wherein i is 1,2.. n;
label the request tag as QBi, i 1,2.. n; carrying out normalization processing on the marked request preset value and the address weight and taking values;
using formulas
Figure BDA0003447846010000081
Calculating to obtain a request value; wherein, QZiExpressed as a request value, a1 and a2 are expressed as preset different proportionality coefficients;
combining the request value with the marked request preset value, request address, address weight and request label to obtain request processing data;
the method comprises the following steps of calculating transmission data to obtain a transmission state value, analyzing the transmission state value to obtain a transmission path, and comprising the following steps:
acquiring a transmission state, a transmission type, a transmission space and historical transmission in transmission data, and marking the transmission state as CZi, wherein i is 1,2.. n; setting different transmission states to correspond to different state preset values, matching the transmission states in the transmission data with all the transmission states to obtain corresponding state preset values, and marking the state preset values as ZYYi, wherein i is 1,2. The transmission state comprises a working state, an idle state and a disconnection state;
marking the transmission type as CLi, i ═ 1,2.. n; setting different transmission types to correspond to different transmission weights, matching the transmission types with all the transmission types to obtain the corresponding transmission weights, and marking the transmission types as CLQi, wherein i is 1,2.. n;
label the capacity value in the transmission space as CKi, i ═ 1,2.. n; marking the transmission times of historical transmission as LCCi, i is 1,2.. n; marking the interval duration of last transmission of historical transmission as LCJi, i is 1,2
...n;
Carrying out normalization processing on the marked state preset value, the transmission weight, the transmission space, the transmission times and the transmission interval duration to obtain values;
using formulas
Figure BDA0003447846010000091
Calculating to obtain a state-transfer value; wherein, CTiExpressed as a transmission value, b1, b2, b3 and b4 are expressed as preset different proportionality coefficients, mu is expressed as a preset correction factor, and LCJi0 is expressed as an average value of the transmission interval duration;
matching and analyzing the transmission state value and a preset standard transmission state threshold value, and if the transmission state value is not greater than the preset standard transmission state threshold value, judging that a transmission line corresponding to the transmission state value cannot transmit and generating a first matching signal; if the transmission state value is larger than the preset standard transmission state threshold value, judging that the transmission line corresponding to the transmission state value can transmit and generate a second matching signal, setting the transmission line corresponding to the transmission state value as an effective line, and setting the transmission line corresponding to the maximum transmission state value as an initial selection line;
combining the effective line and the initially selected line to obtain a transmission path;
the stored data is processed and calculated to obtain a stored state value, and the stored state value is analyzed to obtain a stored result, wherein the method comprises the following steps:
acquiring a stored type, a history request, a stored space and a stored state in stored data, and marking the stored type as YCLi, wherein i is 1,2.. n; setting different stored types to correspond to different storage preset values, matching the stored types with all the stored types to obtain corresponding storage preset values, and marking the storage preset values as CYLi, wherein i is 1,2.. n;
marking the total number of historical requests as QZCi, i ═ 1,2.. n; marking a stored capacity value in a stored space as YCRi, i ═ 1,2.. n; marking the stored state as YCZi, i ═ 1,2.. n; setting different storage states to correspond to different storage state weights, matching the stored states with all the storage states to obtain corresponding storage state weights, and marking the storage state weights as CZQi, wherein i is 1,2.. n;
carrying out normalization processing on the marked stored preset value, the total times of the historical requests, the stored capacity value and the stored form weight and taking values;
using formulas
Figure BDA0003447846010000101
Calculating to obtain a storage state value; wherein, CCiExpressed as a storage state value, c1, c2 and c3 are expressed as preset different proportionality coefficients, beta is expressed as a preset storage state correction factor, and YCRi0 is expressed as a preset standard capacity value;
analyzing the stored state value, matching the stored state value with a preset standard stored state threshold value, and if the stored state value is not greater than the standard stored state threshold value, judging that stored data corresponding to the stored state value can be exchanged and generating a first stored state signal; if the stored state value is larger than the standard stored state threshold value, judging that stored data corresponding to the stored state value cannot be exchanged and generating a second stored state signal;
combining the first state storage signal, the second state storage signal, the corresponding state storage value and the stored data to obtain a stored result;
the matching module is used for matching the request processing data with the transmission path, and if the matching is successful, a first exchange signal is generated; if the matching fails, returning to the exchange failure; matching the request processing data with the stored result according to the first exchange signal, and if the matching is successful, generating a second exchange signal; if the matching fails, returning to the exchange failure;
matching the request processing data with the transmission path, and if the matching is successful, generating a first exchange signal; if the matching fails, returning the exchange failure, and the specific steps comprise:
obtaining request value QZ corresponding to request processing dataiAnd a transmission pathThe transmission state value CT corresponding to the middle and initial selection linei
Using formulas
Figure BDA0003447846010000102
Calculating to obtain a first correlation coefficient; wherein g1 and g2 are expressed as preset different proportionality coefficients;
matching the first correlation coefficient with a preset standard line threshold, and if the first correlation coefficient is not greater than the standard line threshold, judging that a path can be formed between the request processing data and the initially selected line and generating a first exchange signal; and if the first correlation coefficient is larger than the threshold value of the standard line, judging that a path cannot be formed between the request processing data and the initially selected line and generating an exchange failure prompt.
Matching the request processing data with the stored result according to the first exchange signal, and if the matching is successful, generating a second exchange signal; if the matching fails, returning the exchange failure, and the specific steps comprise:
obtaining request value QZ corresponding to request processing dataiA stored state value CC corresponding to the first stored state signal in the stored resulti
Using formulas
Figure BDA0003447846010000111
Calculating to obtain a second correlation coefficient; wherein f1 and f2 are expressed as preset different proportionality coefficients;
matching the second correlation coefficient with a preset standard storage threshold, and if the second correlation coefficient is not greater than the standard storage threshold, judging that the request processing data and the stored data in the stored result can be exchanged and generating a second exchange signal; if the second correlation coefficient is larger than the standard storage threshold value, judging that the data requested to be processed and the stored data in the stored result cannot be exchanged and generating an exchange failure prompt;
the exchange module is used for exchanging the request data with the stored data according to the second exchange signal; the exchange module forms a path among the requesting party, the transmitting party and the exchange party and exchanges the request data of the requesting party with the stored data of the exchange party through a transmission path;
the working principle of the embodiment of the invention is as follows: in the embodiment of the invention, the acquisition processing module is used for acquiring the request data, the request data comprises the sending request type, the request address and the request label, the request data is processed, and the formula is used
Figure BDA0003447846010000112
Calculating to obtain a request value;
combining the request value with the marked request preset value, request address, address weight and request label to obtain request processing data; acquiring transmission data, wherein the transmission data comprises a transmission state, a transmission type, a transmission space and historical transmission, calculating the transmission data to obtain a transmission state value, and analyzing the transmission state value to obtain a transmission path; using formulas
Figure BDA0003447846010000121
Calculating to obtain a state-transfer value; matching and analyzing the transmission state value and a preset standard transmission state threshold value, and if the transmission state value is not greater than the preset standard transmission state threshold value, judging that a transmission line corresponding to the transmission state value cannot transmit and generating a first matching signal; if the transmission state value is larger than the preset standard transmission state threshold value, judging that the transmission line corresponding to the transmission state value can transmit and generate a second matching signal, setting the transmission line corresponding to the transmission state value as an effective line, and setting the transmission line corresponding to the maximum transmission state value as an initial selection line; combining the effective line and the initially selected line to obtain a transmission path; acquiring corresponding stored data according to the request tag, wherein the stored data comprises a stored type, a history request, a stored space and a stored state, processing and calculating the stored data to obtain a stored state value, and utilizing a formula
Figure BDA0003447846010000122
Calculating to obtain a storage state value; analyzing the stored state value, matching the stored state value with a preset standard stored state threshold value, and if the stored state value is not greater than the standard stored state threshold value, judging that stored data corresponding to the stored state value can be exchangedGenerating a first state storage signal; if the stored state value is larger than the standard stored state threshold value, judging that stored data corresponding to the stored state value cannot be exchanged and generating a second stored state signal; combining the first state storage signal, the second state storage signal, the corresponding state storage value and the stored data to obtain a stored result; by collecting the request data, the transmission data and the stored data and carrying out processing and analysis, the dynamic monitoring can be carried out on the requesting party, the transmitting party and the exchanging party, and effective data support is provided for subsequent dynamic matching;
matching the request processing data with the transmission path by using a matching module, and if the matching is successful, generating a first exchange signal; if the matching fails, returning to the exchange failure; matching the request processing data with the stored result according to the first exchange signal, and if the matching is successful, generating a second exchange signal; if the matching fails, returning to the exchange failure; including the use of formulas
Figure BDA0003447846010000123
Calculating to obtain a first correlation coefficient; matching the first correlation coefficient with a preset standard line threshold, and if the first correlation coefficient is not greater than the standard line threshold, judging that a path can be formed between the request processing data and the initially selected line and generating a first exchange signal; if the first correlation coefficient is larger than the threshold value of the standard line, judging that a path cannot be formed between the request processing data and the initially selected line and generating an exchange failure prompt; using formulas
Figure BDA0003447846010000131
Calculating to obtain a second correlation coefficient; matching the second correlation coefficient with a preset standard storage threshold, and if the second correlation coefficient is not greater than the standard storage threshold, judging that the request processing data and the stored data in the stored result can be exchanged and generating a second exchange signal; if the second correlation coefficient is larger than the standard storage threshold value, judging that the data requested to be processed and the stored data in the stored result cannot be exchanged and generating an exchange failure prompt; the exchange module is used for exchanging the request data with the stored data according to the second exchange signal; tong (Chinese character of 'tong')The acquired data are processed and calculated to establish contact among the data and analyze and establish connection, so that a request party, a transmission party and an exchange party are matched at the same time to further optimize the data transmission effect;
exchanging the request data with the stored data by using the exchange module according to the second exchange signal; the purpose of improving the data exchange effect by dynamically monitoring and matching according to the request data, the transmission route and the stored data can be achieved.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus, device and method can be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules is only one logical functional division, and other divisions may be realized in practice.
The modules described as separate parts may or may not be physically separate, and parts displayed as modules may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the method of the embodiment.
In addition, functional modules in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional module.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof.
The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference signs in the claims shall not be construed as limiting the claim concerned.
Furthermore, it is obvious that the word "comprising" does not exclude other elements or steps, and the singular does not exclude the plural. A plurality of units or means recited in the system claims may also be implemented by one unit or means in software or hardware. The terms second, etc. are used to denote names, but not any particular order.
Finally, it should be noted that the above examples are only intended to illustrate the technical process of the present invention and not to limit the same, and although the present invention has been described in detail with reference to the preferred embodiments, it will be understood by those skilled in the art that modifications or equivalent substitutions may be made to the technical process of the present invention without departing from the spirit and scope of the technical process of the present invention.

Claims (6)

1. A data exchange system for a block chain cluster is characterized by comprising an acquisition processing module, a matching module and an exchange module;
the acquisition processing module is used for acquiring request data, wherein the request data comprises a sending request type, a request address and a request label, and processing the request data to obtain request processing data; acquiring transmission data, wherein the transmission data comprises a transmission state, a transmission type, a transmission space and historical transmission, calculating the transmission data to obtain a transmission state value, and analyzing the transmission state value to obtain a transmission path; acquiring corresponding stored data according to the request tag, wherein the stored data comprises a stored type, a historical request, a stored space and a stored state, processing and calculating the stored data to obtain a stored state value, and analyzing the stored state value to obtain a stored result;
the matching module is used for matching the request processing data with the transmission path, and if the matching is successful, a first exchange signal is generated; if the matching fails, returning to the exchange failure; matching the request processing data with the stored result according to the first exchange signal, and if the matching is successful, generating a second exchange signal; if the matching fails, returning to the exchange failure;
the exchange module is used for exchanging the request data with the stored data according to the second exchange signal.
2. The data switching system for a blockchain cluster according to claim 1, wherein the performing a processing operation on the request data to obtain the request processing data and obtaining the storage allocation result comprises:
s21: acquiring a request type, a request address and a request label in request data, setting different request types to correspond to different request preset values, matching the request type in the request data with all the request types to acquire the corresponding request preset values, and marking the corresponding request preset values as QYYi, wherein i is 1,2.
S22: marking the request address as QDi, i 1,2.. n; setting different request addresses to correspond to different address weights, matching the request addresses in the request data with all the request addresses to obtain corresponding address weights, and marking the corresponding address weights as QDQi, wherein i is 1,2.. n;
s23: label the request tag as QBi, i 1,2.. n; carrying out normalization processing on the marked request preset value and the address weight and taking values;
s24: using formulas
Figure FDA0003447845000000021
Calculating to obtain a request value; wherein, QZiExpressed as a request value, a1 and a2 are expressed as preset different proportionality coefficients;
s25: and combining the request value with the marked request preset value, the request address, the address weight and the request label to obtain the request processing data.
3. The system according to claim 2, wherein the calculating the transmission data to obtain the transmission state value and the analyzing the transmission state value to obtain the transmission path comprises:
s31: acquiring a transmission state, a transmission type, a transmission space and historical transmission in transmission data, and marking the transmission state as CZi, wherein i is 1,2.. n; setting different transmission states to correspond to different state preset values, matching the transmission states in the transmission data with all the transmission states to obtain corresponding state preset values, and marking the state preset values as ZYYi, wherein i is 1,2. The transmission state comprises a working state, an idle state and a disconnection state;
s32: marking the transmission type as CLi, i ═ 1,2.. n; setting different transmission types to correspond to different transmission weights, matching the transmission types with all the transmission types to obtain the corresponding transmission weights, and marking the transmission types as CLQi, wherein i is 1,2.. n;
s33: label the capacity value in the transmission space as CKi, i ═ 1,2.. n; marking the transmission times of historical transmission as LCCi, i is 1,2.. n; marking the last transmission interval duration of the historical transmission as LCJi, i is 1,2.. n;
s34: carrying out normalization processing on the marked state preset value, the transmission weight, the transmission space, the transmission times and the transmission interval duration to obtain values;
s35: using formulas
Figure FDA0003447845000000022
Calculating to obtain a state-transfer value; wherein, CTiExpressed as a transmission value, b1, b2, b3 and b4 are expressed as preset different proportionality coefficients, mu is expressed as a preset correction factor, and LCJi0 is expressed as an average value of the transmission interval duration;
s36: matching and analyzing the transmission state value and a preset standard transmission state threshold value, and if the transmission state value is not greater than the preset standard transmission state threshold value, judging that a transmission line corresponding to the transmission state value cannot transmit and generating a first matching signal; if the transmission state value is larger than the preset standard transmission state threshold value, judging that the transmission line corresponding to the transmission state value can transmit and generate a second matching signal, setting the transmission line corresponding to the transmission state value as an effective line, and setting the transmission line corresponding to the maximum transmission state value as an initial selection line;
s37: and combining the effective line and the initially selected line to obtain a transmission path.
4. The system of claim 3, wherein the stored data is processed and calculated to obtain a stored state value, and the stored state value is analyzed to obtain a stored result, comprising:
s41: acquiring a stored type, a history request, a stored space and a stored state in stored data, and marking the stored type as YCLi, wherein i is 1,2.. n; setting different stored types to correspond to different storage preset values, matching the stored types with all the stored types to obtain corresponding storage preset values, and marking the storage preset values as CYLi, wherein i is 1,2.. n;
s42: marking the total number of historical requests as QZCi, i ═ 1,2.. n; marking a stored capacity value in a stored space as YCRi, i ═ 1,2.. n; marking the stored state as YCZi, i ═ 1,2.. n; setting different storage states to correspond to different storage state weights, matching the stored states with all the storage states to obtain corresponding storage state weights, and marking the storage state weights as CZQi, wherein i is 1,2.. n;
s43: carrying out normalization processing on the marked stored preset value, the total times of the historical requests, the stored capacity value and the stored form weight and taking values;
s44: using formulas
Figure FDA0003447845000000031
Calculating to obtain a storage state value; wherein, CCiExpressed as a storage state value, c1, c2 and c3 are expressed as preset different proportionality coefficients, beta is expressed as a preset storage state correction factor, and YCRi0 is expressed as a preset standard capacity value;
s45: analyzing the stored state value, matching the stored state value with a preset standard stored state threshold value, and if the stored state value is not greater than the standard stored state threshold value, judging that stored data corresponding to the stored state value can be exchanged and generating a first stored state signal; if the stored state value is larger than the standard stored state threshold value, judging that stored data corresponding to the stored state value cannot be exchanged and generating a second stored state signal;
s46: and combining the first state storage signal and the second state storage signal and the corresponding state storage values and the stored data to obtain a stored result.
5. The data switching system for the blockchain cluster as claimed in claim 4, wherein the request processing data is matched with the transmission path, and if the matching is successful, the first switching signal is generated; if the matching fails, returning the exchange failure, and the specific steps comprise:
s51: obtaining request value QZ corresponding to request processing dataiTransmission state value CT corresponding to the initially selected line in the transmission pathi
S52: using formulas
Figure FDA0003447845000000041
Calculating to obtain a first correlation coefficient; wherein g1 and g2 are expressed as preset different proportionality coefficients;
s53: matching the first correlation coefficient with a preset standard line threshold, and if the first correlation coefficient is not greater than the standard line threshold, judging that a path can be formed between the request processing data and the initially selected line and generating a first exchange signal; and if the first correlation coefficient is larger than the threshold value of the standard line, judging that a path cannot be formed between the request processing data and the initially selected line and generating an exchange failure prompt.
6. The data switching system for blockchain clusters according to claim 5, wherein the requested processing data is matched with the stored result according to the first switching signal, and if the matching is successful, the second switching signal is generated; if the matching fails, returning the exchange failure, and the specific steps comprise:
s61: obtaining request value QZ corresponding to request processing dataiA stored state value CC corresponding to the first stored state signal in the stored resulti
S62: using formulas
Figure FDA0003447845000000051
Calculating to obtain a second correlation coefficient; wherein f1 and f2 are expressed as preset different proportionality coefficients;
s63: matching the second correlation coefficient with a preset standard storage threshold, and if the second correlation coefficient is not greater than the standard storage threshold, judging that the request processing data and the stored data in the stored result can be exchanged and generating a second exchange signal; and if the second correlation coefficient is larger than the standard storage threshold, judging that the data requested to be processed and the stored data in the stored result cannot be exchanged and generating an exchange failure prompt.
CN202111681732.8A 2021-12-30 2021-12-30 Data exchange system for block chain cluster Withdrawn CN114338704A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111681732.8A CN114338704A (en) 2021-12-30 2021-12-30 Data exchange system for block chain cluster

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111681732.8A CN114338704A (en) 2021-12-30 2021-12-30 Data exchange system for block chain cluster

Publications (1)

Publication Number Publication Date
CN114338704A true CN114338704A (en) 2022-04-12

Family

ID=81022969

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111681732.8A Withdrawn CN114338704A (en) 2021-12-30 2021-12-30 Data exchange system for block chain cluster

Country Status (1)

Country Link
CN (1) CN114338704A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115098323A (en) * 2022-06-16 2022-09-23 广州市企德友诚美信息技术开发有限公司 Signal access method based on big data

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115098323A (en) * 2022-06-16 2022-09-23 广州市企德友诚美信息技术开发有限公司 Signal access method based on big data

Similar Documents

Publication Publication Date Title
US20200372039A1 (en) Data processing method, apparatus, and system
US7246101B2 (en) Knowledge-based system and method for reconstructing client web page accesses from captured network packets
CN102122379B (en) Offline advertising services
CN111600967B (en) Access pressure-based load balancing system among block chain nodes
CN108429718A (en) Account recognition methods and device
TW200830786A (en) Methods, systems, and computer program products for grooming traffic on a shared network facility based on a peak utilization analysis of the shared network facility
CN107623685A (en) The method and device of quick detection SYN Flood attacks
CN108156038A (en) Ask distribution method, device, access gateway and storage medium
CN114338704A (en) Data exchange system for block chain cluster
CN111654321A (en) Satellite network management method and device and electronic equipment
CN113992544B (en) Optimization method and device for port flow distribution
CN115842743A (en) Network intelligent service system based on block chain
CN118200190A (en) Network performance monitoring and maintaining method, system and medium based on artificial intelligence
CN111429288A (en) User portrait construction method and device, computer equipment and storage medium
US7844443B2 (en) Network subscriber experience modeling
CN113037872B (en) Caching and prefetching method based on Internet of things multi-level edge nodes
CN113676498A (en) Prediction machine management system for accessing third-party information based on distributed network technology
CN201048388Y (en) Blade server based kilomega switching blade
CN105871891B (en) DNS privacy disclosure risk assessment method and system
CN112001454B (en) Clustering method and device for special line for collecting guests
CN104780061B (en) A kind of communication-cost Forecasting Methodology based on daily record
CN114611848A (en) Resource management system and method
CN115052323B (en) Smart city mobile service system based on big data
CN117834307B (en) Data transmission protection method and system for data transmission network based on communication state
CN213547535U (en) Operation and maintenance monitoring system based on Zabbix

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
WW01 Invention patent application withdrawn after publication
WW01 Invention patent application withdrawn after publication

Application publication date: 20220412