CN113596182B - Distributed multi-terminal service method and device - Google Patents

Distributed multi-terminal service method and device Download PDF

Info

Publication number
CN113596182B
CN113596182B CN202111154218.9A CN202111154218A CN113596182B CN 113596182 B CN113596182 B CN 113596182B CN 202111154218 A CN202111154218 A CN 202111154218A CN 113596182 B CN113596182 B CN 113596182B
Authority
CN
China
Prior art keywords
nodes
node
evaluation data
user side
server
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.)
Active
Application number
CN202111154218.9A
Other languages
Chinese (zh)
Other versions
CN113596182A (en
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.)
Shenzhen Spacetime Cloud Technology Co ltd
Original Assignee
Shenzhen Spacetime Cloud 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 Shenzhen Spacetime Cloud Technology Co ltd filed Critical Shenzhen Spacetime Cloud Technology Co ltd
Priority to CN202111154218.9A priority Critical patent/CN113596182B/en
Publication of CN113596182A publication Critical patent/CN113596182A/en
Application granted granted Critical
Publication of CN113596182B publication Critical patent/CN113596182B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/1097Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/62Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/64Protecting data integrity, e.g. using checksums, certificates or signatures
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00Network architectures or network communication protocols for network security
    • H04L63/04Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
    • H04L63/0428Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
    • H04L63/0442Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload wherein the sending and receiving network entities apply asymmetric encryption, i.e. different keys for encryption and decryption
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/46Secure multiparty computation, e.g. millionaire problem
    • H04L2209/463Electronic voting
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/50Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • General Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Health & Medical Sciences (AREA)
  • Software Systems (AREA)
  • Bioethics (AREA)
  • Health & Medical Sciences (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Databases & Information Systems (AREA)
  • Computing Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention provides a distributed multi-terminal service method and a distributed multi-terminal service device.A distributed storage block chain system consisting of Y credible nodes and a unique block-out node receives state data of each service terminal, wherein the state data is used for indicating whether the service terminal is in fault and/or occupied or not and is acquired by a sensing network arranged at each service terminal; packing the state data according to the unique block outlet node to form a current block, correspondingly decoding a private key of the current block, and performing link storage on the current block; the method and the system respond to the query request of the user side and send the private key to the user side, the state data of the server side is stored, and the user can query in real time, so that the real-time state of the server side is known, in addition, the stored data cannot be tampered, and the safety is high.

Description

Distributed multi-terminal service method and device
Technical Field
The present invention relates to distributed storage technologies, and in particular, to a distributed multi-port service method and apparatus.
Background
In a service system in the prior art, the service system generally includes ports such as a service end, a user end, and a backend end.
With the development of society, more and more offline entity servers serve users, and the servers are isolated from each other, so that when a user needs to select a certain server for service, the user often needs to go to the entity server to know the working state of the server, for example, whether the server is being used by another user or whether the server has a fault and cannot be used, and the user experience is reduced.
Therefore, the existing service system can not let the user know the state of each server, and the user experience is low.
Disclosure of Invention
The embodiment of the invention provides a distributed multi-terminal service method and a distributed multi-terminal service device, and aims to solve the technical problem.
In a first aspect of the embodiments of the present invention, a distributed multi-terminal service method is provided, including:
randomly generating an election committee comprising M nodes from the N nodes, and electing and generating a unique block-out node from the M nodes according to the election committee, wherein M and N are positive integers, and M is smaller than N; wherein randomly generating an election committee comprising M nodes from the N nodes comprises:
acquiring random numbers of the T-th round and the T + 1-th round of elections according to a preset election model, wherein the random numbers of the T + 1-th round are generated by the random numbers of the T-th round and seeds provided by each node of the T-th round;
sorting the N nodes of the current round based on the current random number, and selecting the first M nodes as the election committee;
the election committee elects to generate Y trusted nodes from the N nodes, and the Y trusted nodes and the unique block-out node jointly form a distributed storage block chain system, wherein Y is larger than M and smaller than N;
receiving state data of each server based on the distributed storage area block chain system, wherein the state data are used for indicating whether the server is in fault and/or occupied or not and are acquired by a sensing network arranged at each server;
packing the state data according to the unique block outlet node to form a current block, correspondingly decoding a private key of the current block, and performing link storage on the current block;
and responding to a query request of a user side, and sending the private key to the user side.
Optionally, in a possible implementation manner of the first aspect, the sensor network includes a camera network, and the camera network is configured to acquire a regional image of the server;
and indicating whether the server side is in fault and/or occupied or not based on the area image.
Optionally, in a possible implementation manner of the first aspect, sending the private key to the user side in response to a query request of the user side includes:
and responding to a query request of a user side and the rights and interests information, and sending the private key to the user side.
Optionally, in a possible implementation manner of the first aspect, the method further includes:
and receiving offline evaluation data of the user terminal aiming at the server terminal based on the distributed storage block chain system.
Optionally, in a possible implementation manner of the first aspect, after receiving offline evaluation data of the user side for the server side based on the distributed storage blockchain system, the method further includes:
forwarding the offline evaluation data to an offline verification node, wherein the offline verification node performs verification processing on the offline evaluation data to obtain a verification result;
and storing the verification result based on the distributed storage area blockchain system.
Optionally, in a possible implementation manner of the first aspect, after receiving offline evaluation data of the user side for the server side based on the distributed storage blockchain system, the method further includes:
if the offline evaluation data are negative evaluation data, forwarding the negative evaluation data to a down-link verification node, and verifying the evaluation data by the down-link verification node to obtain a verification result;
based on the distributed storage block chain system, the verification result is subjected to review processing, and the review result is obtained and is linked for storage;
and if the review result indicates that the negative evaluation data is true, triggering the intelligent contract to improve the credit rating of the user side, and if the review result indicates that the negative evaluation data is false, triggering the intelligent contract to reduce the credit rating of the user side.
Optionally, in a possible implementation manner of the first aspect, after receiving offline evaluation data of the user side for the server side based on the distributed storage blockchain system, the method further includes:
giving the unique block-out node verification right based on Y credible nodes;
if the offline evaluation data are negative evaluation data, verifying the negative evaluation data according to the verification right of the unique block outlet node to obtain a verification result;
and if the verification result indicates that the negative evaluation data is true, triggering the intelligent contract to improve the credit rating of the user side, and if the verification result indicates that the negative evaluation data is false, triggering the intelligent contract to reduce the credit rating of the user side.
Optionally, in a possible implementation manner of the first aspect, the method further includes:
and allocating rights and interests to the election committee and the trusted nodes based on a preset allocation rule and the unique block-out node.
In a second aspect of the embodiments of the present invention, a distributed multi-terminal service device is provided, including:
an election module, configured to randomly generate an election committee including M nodes from the N nodes, and elect to generate a unique block output node from the M nodes according to the election committee, where M and N are positive integers, and M is smaller than N;
wherein randomly generating an election committee comprising M nodes from the N nodes comprises:
acquiring random numbers of the T-th round and the T + 1-th round of elections according to a preset election model, wherein the random numbers of the T + 1-th round are generated by the random numbers of the T-th round and seeds provided by each node of the T-th round;
sorting the N nodes of the current round based on the current random number, and selecting the first M nodes as the election committee;
the election committee generates Y credible nodes from the N node elections, and the Y credible nodes and the unique block-out node form a distributed storage block chain system together, wherein Y is larger than M and smaller than N;
the data module is used for receiving state data of each server based on the distributed storage area block chain system, wherein the state data are used for indicating whether the server is in fault and/or occupied or not and are acquired by a sensing network arranged at each server;
the packing module is used for packing the state data according to the unique block outlet node to form a current block, correspondingly decoding a private key of the current block and performing link storage on the current block;
and the query module responds to a query request of a user side and sends the private key to the user side.
In a third aspect of the embodiments of the present invention, a distributed multi-terminal service device is provided, including: memory, a processor and a computer program, the computer program being stored in the memory, the processor running the computer program to perform the method of the first aspect of the invention as well as various possible aspects of the first aspect.
In a fourth aspect of the embodiments of the present invention, a computer-readable storage medium is provided, in which a computer program is stored, and the computer program is used for implementing the method according to the first aspect of the present invention and various possible references to the first aspect when the computer program is executed by a processor.
According to the distributed multi-terminal service method and device provided by the invention, the state data of the service terminal is stored through the distributed storage block chain system consisting of Y trusted nodes and the only block node, and a user can inquire in real time, so that the real-time state of the service terminal is known, in addition, the stored data cannot be tampered, and the safety is higher.
Drawings
Fig. 1 is a schematic flowchart of a distributed multi-terminal service method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a plurality of nodes provided by an embodiment of the present invention;
fig. 3 is a schematic structural diagram of a distributed multi-terminal service device according to an embodiment of the present invention;
fig. 4 is a schematic diagram of a hardware structure of a distributed multi-terminal service device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the 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.
Referring to fig. 1, which is a flowchart illustrating a distributed multi-terminal service method according to an embodiment of the present invention, an execution main body of the method shown in fig. 1 may be a software and/or hardware device. The execution subject of the present application may include, but is not limited to, at least one of: user equipment, network equipment, etc. The user equipment may include, but is not limited to, a computer, a smart phone, a Personal Digital Assistant (PDA), the above mentioned electronic equipment, and the like. The network device may include, but is not limited to, a single network server, a server group of multiple network servers, or a cloud of numerous computers or network servers based on cloud computing, wherein cloud computing is one type of distributed computing, a super virtual computer consisting of a cluster of loosely coupled computers. The present embodiment does not limit this. The distributed multi-terminal service method comprises steps S101 to S105, and specifically comprises the following steps:
s101, randomly generating an election committee comprising M nodes from the N nodes, and electing and generating a unique block output node from the M nodes according to the election committee, wherein M and N are positive integers, and M is smaller than N.
It is understood that, referring to fig. 2, the blockchain has a plurality of nodes, and in the embodiment, a unique block node is found from the plurality of nodes to pack data to form a block. Firstly, an election committee comprising M nodes needs to be generated randomly, then the election committee is utilized to elect and generate a unique block output node from the M nodes, and then the data is packaged by the unique block output node, so that the calculation amount is less than that of a packaging mode in the prior art, and the efficiency is improved to a greater extent.
In some embodiments, randomly generating an election committee comprising M nodes from among the N nodes may be selected according to a preset election model as follows:
firstly, setting the participating N nodes as follows:
Figure 330090DEST_PATH_IMAGE001
Figure 575126DEST_PATH_IMAGE002
is that
Figure 902334DEST_PATH_IMAGE003
The private key and the public key of (c),
Figure 766384DEST_PATH_IMAGE004
is that
Figure 908653DEST_PATH_IMAGE005
Signing the Message before the random number generation algorithm starts
Figure 532446DEST_PATH_IMAGE006
Has been broadcast to each node. Each wheel
Figure 127375DEST_PATH_IMAGE007
Information of broadcast
Figure 404904DEST_PATH_IMAGE008
Figure 136100DEST_PATH_IMAGE009
Is to let receive
Figure 332726DEST_PATH_IMAGE010
Node of
Figure 165684DEST_PATH_IMAGE011
Is the basis for the information participating in the T-th round.
The above is the advance setting of the preset election model.
After the preset election model is set, at the T thWheel, each node
Figure 965012DEST_PATH_IMAGE012
Will suggest a fixed length
Figure 567026DEST_PATH_IMAGE013
Binary number of
Figure 465712DEST_PATH_IMAGE014
The choice of L depends on the total number of nodes n,
Figure 35234DEST_PATH_IMAGE015
each round based on the random number of this round
Figure 123406DEST_PATH_IMAGE016
And
Figure 360353DEST_PATH_IMAGE017
the first M nodes are selected by sorting the nodes in the following step P1. And generating random numbers of T +1 rounds through step P2
Figure 898781DEST_PATH_IMAGE018
. Each round of random numbers is a binary number of fixed length bits R.
It should be noted that the above is a framework of the preset election model.
It is understood that through the above rounds of random elections, the top M nodes can be selected as an election committee.
Therein, step P1 (random number according to current round)
Figure 706332DEST_PATH_IMAGE019
To pair
Figure 113042DEST_PATH_IMAGE020
Sorting) specifically includes:
each node receives and acknowledges all node-proposed
Figure 689648DEST_PATH_IMAGE021
According to the agreed Hash function Hash (the Hash function Hash can be selected according to the required Hash result length, the selection range of the Hash is not limited), wherein the agreed result length after the Hash is
Figure 664557DEST_PATH_IMAGE022
qConstant is an arbitrary constant that the consensus network can agree on, calculating:
Figure 943092DEST_PATH_IMAGE023
Figure 904226DEST_PATH_IMAGE024
Figure 584606DEST_PATH_IMAGE025
Figure 730416DEST_PATH_IMAGE026
wherein the content of the first and second substances,
Figure 246980DEST_PATH_IMAGE027
is an operation to remove the leftmost l bits of a binary number s,
Figure 995493DEST_PATH_IMAGE028
is a bitwise exclusive-or of binary numbers a, b of the same length.
Figure 546691DEST_PATH_IMAGE029
Figure 722457DEST_PATH_IMAGE030
Figure 850950DEST_PATH_IMAGE031
Figure 419466DEST_PATH_IMAGE032
Figure 808859DEST_PATH_IMAGE033
Figure 906259DEST_PATH_IMAGE034
Wherein the content of the first and second substances,
Figure 787628DEST_PATH_IMAGE035
is an operation that shifts s left by r bits,
Figure 143523DEST_PATH_IMAGE036
the result of intercepting the alpha bit to the b-1 bit of the number s is obtained; mod is the modulo function.
Finally according to
Figure 138154DEST_PATH_IMAGE037
Ascending sort selects the top M committees for the current round. If the same condition occurs, comparing
Figure 655723DEST_PATH_IMAGE038
The order is determined in the arrival sequence of most nodes, and the priority of the average arrival time is higher earlier (different nodes can rebroadcast the Address signature with the higher priority).
Step P2 (combining the first and last bits sorted in P1 to form the random number for the next round)
Figure 758809DEST_PATH_IMAGE039
) The method specifically comprises the following steps:
in step P1, the Last node of the ascending sort is recorded at the same time, which is called that the corresponding generated node is Last, the First node of the ascending sort is First, and α is the mixing ratio:
Figure 403548DEST_PATH_IMAGE041
wherein the content of the first and second substances,
Figure 33112DEST_PATH_IMAGE042
it will be appreciated that this step may generate random numbers for the T +1 round
Figure 472315DEST_PATH_IMAGE043
It should be noted that in the scheme, multiple rounds of random selection are adopted through a preset election model, M nodes are randomly selected from any N nodes to serve as a committee, all the N nodes have a selection participation process, and the selection process cannot be jointly controlled by a few participants to select a result.
S102, the election committee elects the N nodes to generate Y credible nodes, and the Y credible nodes and the unique block-out node jointly form a distributed storage block chain system, wherein Y is larger than M and smaller than N.
It can be understood that the scheme forms a distributed storage block chain system, the distributed storage block chain system is composed of Y trusted nodes and a unique block outlet node, and subsequent data is stored by using the distributed storage block chain system.
In practical application, the electing generates Y trusted nodes, which may be to acquire hardware parameters of the N nodes and elect Y trusted nodes from nodes meeting preset criteria.
S103, receiving state data of each server based on the distributed storage area block chain system, wherein the state data are used for indicating whether the server is in fault and/or occupied or not and are acquired by a sensing network arranged at each server.
It should be noted that this step stores the state data by using the distributed storage block chain system obtained in steps S101 to S102.
The state data is acquired by a sensing network arranged at a server, the sensing network comprises a camera network arranged at the server, the camera network is used for acquiring a regional image of the server, and then whether the server is in fault and/or occupied is indicated based on the regional image.
It can be understood that the camera can shoot the image of the server, then transmit the image to the control center or directly transmit the image to the server, and judge whether the server is faulty and/or occupied through image recognition, so as to form state data to be stored in the distributed storage area block chain system.
And S104, packing the state data according to the unique block outlet node to form a current block, correspondingly decoding a private key of the current block, and performing link storage on the current block.
Specifically, the distributed storage block chain system receives the state data, and the selected unique block node is used for linking and storing the state data, so that the state data is disclosed in the distributed storage block chain system, the problem of data storage safety of a centralized platform is avoided, and meanwhile, a user can inquire the state of a server at any time so as to better use the server.
And S105, responding to the query request of the user side, and sending the private key to the user side.
Specifically, the user side may initiate a query request to the distributed storage blockchain system, the distributed storage blockchain system may respond to the query request of the user side, and may send the private key to the user side, and the user side may query the status data by using the received private key.
In practical application, when a user acquires a decryption private key of query state data, the user needs to pay rights and interests to the distributed storage area block chain system, correspondingly, after the distributed storage area block chain system obtains query information of the user, whether the user pays the rights and interests can be judged in real time, and if the user pays the rights and interests, the private key is sent to a user side.
In some embodiments, the election committee and the trusted node may also be assigned a benefit based on a preset assignment rule and the unique out-of-block node, i.e., a contribution to the election committee and the trusted node.
In practical applications, a sensor network may malfunction, which may cause inaccurate collected state data and bring about misjudgment to users, and to solve the above problem, in some embodiments, the distributed multi-port service method includes:
and receiving offline evaluation data of the user terminal aiming at the server terminal based on the distributed storage block chain system.
It can be understood that, in this embodiment, the user may evaluate the offline experience, for example, when the user arrives at the server and finds that the server is being used or is in a damaged state, the user may upload offline evaluation data to the distributed storage block chain system for storage based on the user, and other users may see the offline evaluation data, so as to better know the state of the server.
In other embodiments, after receiving offline evaluation data of the user side for the server side based on the distributed storage blockchain system, the method further includes:
forwarding the offline evaluation data to an offline verification node, wherein the offline verification node performs verification processing on the offline evaluation data to obtain a verification result;
and storing the verification result based on the distributed storage area blockchain system.
It can be understood that, in the embodiment, the downlink verification node is used to verify the downlink evaluation data to obtain a verification result, and then the verification result is stored in the distributed storage area blockchain system. The verification result can be true or false, and the verification is performed by the down-link verification node so as to supervise the user side which uploads the offline evaluation data and prevent the user side from performing malicious evaluation.
In still other embodiments, after receiving offline evaluation data of the user terminal for the server terminal based on the distributed storage blockchain system, the method further includes:
if the offline evaluation data are negative evaluation data, forwarding the negative evaluation data to a down-link verification node, and verifying the evaluation data by the down-link verification node to obtain a verification result;
based on the distributed storage block chain system, the verification result is subjected to review processing, and the review result is obtained and is linked for storage;
and if the review result indicates that the negative evaluation data is true, triggering the intelligent contract to improve the credit rating of the user side, and if the review result indicates that the negative evaluation data is false, triggering the intelligent contract to reduce the credit rating of the user side.
It can be understood that, in the embodiment, only negative evaluation data in the lower evaluation data is verified, thereby preventing malicious evaluation of the user side and reducing the verified data amount.
It should be noted that, in the present embodiment, after the verification node performs the preliminary verification, the distributed storage block chain system is used for performing the verification again, that is, the review processing described above, so that the accuracy of the verification result is improved, and the misjudgment is prevented.
In some further embodiments, after receiving offline evaluation data of the user side for the server side based on the distributed storage blockchain system, the method further includes:
giving the unique block-out node verification right based on Y credible nodes;
if the offline evaluation data are negative evaluation data, verifying the negative evaluation data according to the verification right of the unique block outlet node to obtain a verification result;
and if the verification result indicates that the negative evaluation data is true, triggering the intelligent contract to improve the credit rating of the user side, and if the verification result indicates that the negative evaluation data is false, triggering the intelligent contract to reduce the credit rating of the user side.
The method can be understood that the unique block-out node in the distributed storage block chain system is adopted to directly verify the negative evaluation data in the under-line evaluation data, wherein the unique block-out node has the verification right given by the Y credible nodes, and only the unique block-out node is needed to verify the negative evaluation data, so that the correctness of the verification result is ensured, and the calculation amount is further reduced.
Referring to fig. 3, a schematic structural diagram of a distributed multi-port service apparatus according to an embodiment of the present invention is shown, where the distributed multi-port service apparatus includes:
an election module, configured to randomly generate an election committee including M nodes from the N nodes, and elect to generate a unique block output node from the M nodes according to the election committee, where M and N are positive integers, and M is smaller than N;
the election committee generates Y credible nodes from the N node elections, and the Y credible nodes and the unique block-out node form a distributed storage block chain system together, wherein Y is larger than M and smaller than N;
the data module is used for receiving state data of each server based on the distributed storage area block chain system, wherein the state data are used for indicating whether the server is in fault and/or occupied or not and are acquired by a sensing network arranged at each server;
the packing module is used for packing the state data according to the unique block outlet node to form a current block, correspondingly decoding a private key of the current block and performing link storage on the current block;
and the query module responds to a query request of a user side and sends the private key to the user side.
The apparatus in the embodiment shown in fig. 3 can be correspondingly used to perform the steps in the method embodiment shown in fig. 1, and the implementation principle and technical effect are similar, which are not described herein again.
Referring to fig. 4, which is a schematic diagram of a hardware structure of a distributed multi-port service device according to an embodiment of the present invention, the distributed multi-port service device 40 includes: a processor 41, memory 42 and computer programs; wherein
A memory 42 for storing the computer program, which may also be a flash memory (flash). The computer program is, for example, an application program, a functional module, or the like that implements the above method.
A processor 41 for executing the computer program stored in the memory to implement the steps performed by the apparatus in the above method. Reference may be made in particular to the description relating to the preceding method embodiment.
Alternatively, the memory 42 may be separate or integrated with the processor 41.
When the memory 42 is a device independent of the processor 41, the apparatus may further include:
a bus 43 for connecting the memory 42 and the processor 41.
The present invention also provides a computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, is adapted to implement the methods provided by the various embodiments described above.
Among other things, the computer-readable storage medium may be a communication medium. Communication media includes any medium that facilitates transfer of a computer program from one place to another. Computer storage media may be any available media that can be accessed by a general purpose or special purpose computer. For example, a computer readable storage medium is coupled to the processor such that the processor can read information from, and write information to, the computer readable storage medium. Of course, the computer readable storage medium may also be integral to the processor. The processor and the computer-readable storage medium may reside in an Application Specific Integrated Circuit (ASIC). Additionally, the ASIC may reside in user equipment. Of course, the processor and the computer-readable storage medium may also reside as discrete components in a communication device. The computer readable storage medium may be read-only memory (ROM), random-access memory (RAM), CD-ROMs, magnetic tapes, floppy disks, optical data storage devices, and the like.
The present invention also provides a program product comprising execution instructions stored in a computer readable storage medium. The at least one processor of the device may read the execution instructions from the computer-readable storage medium, and the execution of the execution instructions by the at least one processor causes the device to implement the methods provided by the various embodiments described above.
In the above embodiments of the apparatus, it should be understood that the Processor may be a Central Processing Unit (CPU), other general purpose processors, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the present invention may be embodied directly in a hardware processor, or in a combination of the hardware and software modules within the processor.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.

Claims (10)

1. A distributed multi-terminal service method, comprising:
randomly generating an election committee comprising M nodes from the N nodes, and electing and generating a unique block-out node from the M nodes according to the election committee, wherein M and N are positive integers, and M is smaller than N;
the election committee elects to generate Y trusted nodes from the N nodes, and the Y trusted nodes and the unique block-out node jointly form a distributed storage block chain system, wherein Y is larger than M and smaller than N;
receiving state data of each server based on the distributed storage area block chain system, wherein the state data are used for indicating whether the server is in fault and/or occupied or not and are acquired by a sensing network arranged at each server;
packing the state data according to the unique block outlet node to form a current block, correspondingly decoding a private key of the current block, and performing link storage on the current block;
responding to a query request of a user side, and sending the private key to the user side;
wherein randomly generating an election committee comprising M nodes from the N nodes comprises:
acquiring random numbers of the T-th round and the T + 1-th round of elections according to a preset election model, wherein the random numbers of the T + 1-th round are generated by the random numbers of the T-th round and seeds provided by each node of the T-th round;
and sorting the N nodes of the current round based on the current random number, and selecting the first M nodes as the election committee.
2. The method according to claim 1, wherein the sensor network comprises a camera network for acquiring a regional image of the server;
and indicating whether the server side is in fault and/or occupied or not based on the area image.
3. The method of claim 1, wherein sending the private key to the user side in response to a query request from the user side comprises:
and responding to a query request of a user side and the rights and interests information, and sending the private key to the user side.
4. The method of claim 1, further comprising:
and receiving offline evaluation data of the user terminal aiming at the server terminal based on the distributed storage block chain system.
5. The method of claim 4, further comprising, after receiving offline evaluation data of the user side for the server side based on the distributed storage blockchain system, the method further comprising:
forwarding the offline evaluation data to an offline verification node, wherein the offline verification node performs verification processing on the offline evaluation data to obtain a verification result;
and storing the verification result based on the distributed storage area blockchain system.
6. The method of claim 4, further comprising, after receiving offline evaluation data of the user side for the server side based on the distributed storage blockchain system, the method further comprising:
if the offline evaluation data are negative evaluation data, forwarding the negative evaluation data to a down-link verification node, and verifying the evaluation data by the down-link verification node to obtain a verification result;
based on the distributed storage block chain system, the verification result is subjected to review processing, and the review result is obtained and is linked for storage;
and if the review result indicates that the negative evaluation data is true, triggering the intelligent contract to improve the credit rating of the user side, and if the review result indicates that the negative evaluation data is false, triggering the intelligent contract to reduce the credit rating of the user side.
7. The method of claim 4, further comprising, after receiving offline evaluation data of the user side for the server side based on the distributed storage blockchain system, the method further comprising:
giving the unique block-out node verification right based on Y credible nodes;
if the offline evaluation data are negative evaluation data, verifying the negative evaluation data according to the verification right of the unique block outlet node to obtain a verification result;
and if the verification result indicates that the negative evaluation data is true, triggering the intelligent contract to improve the credit rating of the user side, and if the verification result indicates that the negative evaluation data is false, triggering the intelligent contract to reduce the credit rating of the user side.
8. The method of claim 1, further comprising:
and allocating rights and interests to the election committee and the trusted nodes based on a preset allocation rule and the unique block-out node.
9. A distributed multi-terminal service device, comprising:
an election module, configured to randomly generate an election committee including M nodes from the N nodes, and elect to generate a unique block output node from the M nodes according to the election committee, where M and N are positive integers, and M is smaller than N;
wherein randomly generating an election committee comprising M nodes from the N nodes comprises:
acquiring random numbers of the T-th round and the T + 1-th round of elections according to a preset election model, wherein the random numbers of the T + 1-th round are generated by the random numbers of the T-th round and seeds provided by each node of the T-th round;
sorting the N nodes of the current round based on the current random number, and selecting the first M nodes as the election committee;
the election committee generates Y credible nodes from the N node elections, and the Y credible nodes and the unique block-out node form a distributed storage block chain system together, wherein Y is larger than M and smaller than N;
the data module is used for receiving state data of each server based on the distributed storage area block chain system, wherein the state data are used for indicating whether the server is in fault and/or occupied or not and are acquired by a sensing network arranged at each server;
the packing module is used for packing the state data according to the unique block outlet node to form a current block, correspondingly decoding a private key of the current block and performing link storage on the current block;
and the query module responds to a query request of a user side and sends the private key to the user side.
10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, is adapted to carry out the method of any one of claims 1 to 8.
CN202111154218.9A 2021-09-29 2021-09-29 Distributed multi-terminal service method and device Active CN113596182B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111154218.9A CN113596182B (en) 2021-09-29 2021-09-29 Distributed multi-terminal service method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111154218.9A CN113596182B (en) 2021-09-29 2021-09-29 Distributed multi-terminal service method and device

Publications (2)

Publication Number Publication Date
CN113596182A CN113596182A (en) 2021-11-02
CN113596182B true CN113596182B (en) 2021-12-14

Family

ID=78242737

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111154218.9A Active CN113596182B (en) 2021-09-29 2021-09-29 Distributed multi-terminal service method and device

Country Status (1)

Country Link
CN (1) CN113596182B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109978727A (en) * 2019-03-28 2019-07-05 上海荷福人工智能科技(集团)有限公司 A kind of AI intelligent building operation platform
CN110779573A (en) * 2019-10-30 2020-02-11 重庆瑞坤科技发展股份有限公司 Wisdom district thing networking data acquisition box
WO2020112104A1 (en) * 2018-11-28 2020-06-04 Visa International Service Association Blockchain-based accountable data publishing and usage

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20200059369A1 (en) * 2017-05-16 2020-02-20 Peking University Shenzhen Graduate School Determining consensus by parallel proof of voting in consortium blockchain
US11354621B2 (en) * 2019-02-08 2022-06-07 Nb Ventures, Inc. Supply chain management system and a method of operating the same

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020112104A1 (en) * 2018-11-28 2020-06-04 Visa International Service Association Blockchain-based accountable data publishing and usage
CN109978727A (en) * 2019-03-28 2019-07-05 上海荷福人工智能科技(集团)有限公司 A kind of AI intelligent building operation platform
CN110779573A (en) * 2019-10-30 2020-02-11 重庆瑞坤科技发展股份有限公司 Wisdom district thing networking data acquisition box

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"基于区块链的分布式物联网信任管理方法研究";任彦冰 等;《计算机研究与发展》;20180715;全文 *

Also Published As

Publication number Publication date
CN113596182A (en) 2021-11-02

Similar Documents

Publication Publication Date Title
CN108737375B (en) Block chain consensus method and system
CN111625593B (en) Block chain-based data processing method and device and computer equipment
US20170075941A1 (en) Consensus system and method for adding data to a blockchain
CN111698094B (en) Common identification method based on block chain system and block chain system
CN110597489B (en) Random number generation method, equipment and medium
CN113055188B (en) Data processing method, device, equipment and storage medium
WO2022217807A1 (en) Blockchain consensus node selection method and apparatus, and computer device and storage medium
CN113326516A (en) Block chain consensus method, block chain system and computer equipment
CN110784521B (en) Block chain consensus method, electronic device and storage medium
CN110570311B (en) Block chain consensus method, device and equipment
CN113850600B (en) Transaction consensus method, device, equipment and storage medium based on block chain
CN114745140B (en) Urban planning field block chain consensus verification method and system based on aggregation encryption
CN110990790B (en) Data processing method and equipment
CN112398949A (en) Transaction confirmation method, system, device and computer equipment
CN113448694B (en) Block chain consensus method for improving transaction processing capability
CN113596182B (en) Distributed multi-terminal service method and device
CN110990413B (en) Block chain data storage device and rapid storage method thereof
CN112995167A (en) Kafka mechanism-based power utilization information acquisition method, block chain network and user side
CN113596180B (en) Distributed multi-end docking method and device
CN116980281A (en) Node selection method, node selection device, first node, storage medium and program product
CN113556405B (en) Distributed management method and device for private information
CN110585717B (en) Information processing method and device
CN113949711B (en) Distributed process data processing method and device
CN113922993B (en) Distributed acquisition data control method and device
CN113901137A (en) Distributed flow information processing method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant