CN111221649A - Edge resource storage method, access method and device - Google Patents
Edge resource storage method, access method and device Download PDFInfo
- Publication number
- CN111221649A CN111221649A CN201911415818.9A CN201911415818A CN111221649A CN 111221649 A CN111221649 A CN 111221649A CN 201911415818 A CN201911415818 A CN 201911415818A CN 111221649 A CN111221649 A CN 111221649A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- edge
- request
- edge computing
- 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.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
- G06F9/5072—Grid computing
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/502—Proximity
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Physics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a method and a device for storing edge resources based on a block chain, which comprehensively evaluate the storage capacity, the credit degree and the access distance of edge computing nodes in an edge block chain network through an edge block chain resource allocation model to obtain an optimal allocation mode of node data, store the node data on the edge computing nodes in the edge block chain network according to the allocation mode and solve the problem of the requirement of a resource allocation method of an edge computing system.
Description
Technical Field
The application relates to the field of block chains, in particular to a block chain-based edge resource storage method and device, and a block chain-based edge resource access method and device.
Background
In order to solve the problems of centralized computing capability, low security, single point and the like in the traditional cloud computing system, edge computing is concerned in recent years. Different from the cloud computing model, the requests and responses of the terminal equipment and the cloud computing center in the edge computing are bidirectional, and the terminal equipment not only sends the requests to the cloud computing center, but also can complete computing tasks issued by the cloud computing center. The cloud computing center is no longer the only relay of the data producer and the consumer, because the terminal device takes the roles of the data producer and the consumer into account, part of the services can directly complete the response at the edge and return to the terminal device, and the cloud computing center and the edge respectively form two service response streams.
The integration of edge calculation and block chains can improve the overall efficiency of the Internet of things equipment. Taking the internet of things equipment group as an example, on one hand, the mobile edge calculation can be used as a local brain of the internet of things equipment, data returned by different internet of things equipment in the same scene are stored and processed, and the working states and paths of various equipment are optimized and corrected, so that the optimal overall application of the scene is achieved. On the other hand, the terminal equipment of the internet of things can 'register' data to the edge computing server, ensure the reliability and the safety of the data with the help of the block chain technology, and provide possibility for various development modes such as future charging of the equipment of the internet of things according to services and the like.
However, the edge computing system based on block chains faces many problems, and one of the most important problems is the resource allocation problem. In the application scenario of edge computing, the actual computing power of the edge computing server is limited, and the storage space is also limited, which cannot be compared with that of an ordinary PC or server. Therefore, how to design a resource allocation method suitable for the edge computing system based on the block chain is very important,
disclosure of Invention
The application provides a block chain-based edge resource storage method and device, which solve the problem of requirements on a resource allocation method of an edge computing system.
The application provides a block chain-based edge resource storage method, which comprises the following steps:
extracting a data abstract of the node data by the edge computing node;
the edge computing node sends a data storage request of the node to an edge block chain network; the data storage request comprises a data abstract;
constructing an edge block chain resource distribution model according to the storage capacity, the credit degree and the access distance of the nodes;
and the marginal block chain resource allocation model comprehensively evaluates the storage capacity, the credit degree and the access distance of the marginal computing nodes in the marginal block chain network, acquires an optimal allocation mode of the node data, and stores the node data on the marginal computing nodes in the marginal block chain network according to the allocation mode.
Preferably, the data digest of the node data is in the format of,
{id,datatype,dataname,time,creator,store nodes list,valid time,otherproperities,signature}
wherein,
the id is a data network-wide unique identifier,
datatype, dataame, is the data type and name,
the time is the time at which the data was created,
the creator is the creator of the data,
the store nodes list is a list of storage nodes for data in the block chain, and is initially empty,
the valid time is the valid time of the data,
other properties are other properties of the data,
signature is the creator's signature.
Preferably, the edge computing node sends a data storage request of the node to the edge blockchain network, and the data storage request of the node is sent in a full-network broadcast manner.
Preferably, the storage capacity, the reputation degree, and the access distance of the node are obtained in the following manner,
if the storage space of the node i is C, the allocated space is C (i), and the spare capacity f (i) is:
smaller (i) means more free space, larger storage capacity;
defining the credit degree of the node as R, wherein the higher the R is, the good credit of the node is meant, and the reliability of data storage is strong;
defining the access distance between different nodes as d (i, j), wherein d (i, j) is the access distance between the node i and the node j.
Preferably, the edge block chain resource allocation model includes:
the model includes the following formula,
in which the formula (I) is shown,
obtaining an optimal set of data m storage according to the storage capacity, the credit degree and the access distance of the nodes, wherein the set is { x }imAnd the optimal access mode of the node yijm}，x im1, data m is stored on node i, and a summary field store nodes list of data m should contain i; y isijm1 means that node j can access data m through node i;
in which the formula (I) is shown,
indicating that each node j's request to access data m can be satisfied;
in which the formula (I) is shown,
indicating that each node j's request to access data m can be satisfied.
This application provides an edge resource storage device simultaneously, includes:
the abstract extraction unit is used for extracting the data abstract of the node data by the edge computing node;
the device comprises a request sending unit, a data storage unit and a data storage unit, wherein the request sending unit is used for sending a data storage request of an edge computing node to an edge block chain network; the data storage request comprises a data abstract;
the model building unit is used for building an edge block chain resource distribution model according to the storage capacity, the credit degree and the access distance of the nodes;
and the resource allocation unit is used for comprehensively evaluating the storage capacity, the credit degree and the access distance of the edge computing node in the edge block chain network by the edge block chain resource allocation model, acquiring the optimal allocation mode of the node data, and storing the node data on the edge computing node in the edge block chain network according to the allocation mode.
The application also provides an edge resource access method, which comprises the following steps:
the edge computing node sends a request for accessing data to a local block of the node;
the edge computing node searches whether the local block of the node stores the requested data abstract or not; if the local block of the node stores the requested data abstract, the edge computing node acquires the stored data from the acquired local block of the node;
if the local block of the node does not store the requested data abstract, the edge computing node sends the data request to a neighbor node;
after the neighbor node receives the data request, the neighbor node searches whether the local block stores the requested data abstract or not; if the local block of the neighbor node stores the requested number summary, the stored data is provided to the edge compute node.
Preferably, the method further comprises the following steps:
and after the neighbor nodes provide the stored data to the edge computing nodes, the credit degree of the neighbor nodes is improved.
This application provides an edge resource access device based on block chain simultaneously, includes:
the edge computing node sends a request for accessing data to a local block of the node;
the data acquisition unit is used for searching whether the local block of the node stores the requested data abstract or not by the edge computing node; if the local block of the node stores the requested data abstract, the edge computing node acquires the stored data from the acquired local block of the node;
the request sending unit is used for sending the data request to the neighbor node by the edge computing node if the local block of the node does not store the requested data abstract;
the data acquisition unit is used for searching whether the local block stores the requested data abstract or not after the neighbor node receives the data request; if the local block of the neighbor node stores the requested number summary, the stored data is provided to the edge compute node.
The application provides a method and a device for storing edge resources based on a block chain, which comprehensively evaluate the storage capacity, the credit degree and the access distance of edge computing nodes in an edge block chain network through an edge block chain resource allocation model to obtain an optimal allocation mode of node data, and store the node data on the edge computing nodes in the edge block chain network according to the allocation mode to solve the problem of the requirement of a resource allocation method of an edge computing system.
Drawings
FIG. 1 is an overall architecture diagram of an edge resource storage method provided herein;
FIG. 2 is a schematic flow chart of an edge resource storage method provided in the present application;
FIG. 3 is a schematic diagram of an edge resource storage device provided in the present application;
FIG. 4 is a flow chart illustrating an edge resource access method provided in the present application;
FIG. 5 is an edge computing resource allocation diagram provided herein;
fig. 6 is a schematic diagram of an edge resource access device provided in the present application.
Detailed Description
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present application. This application is capable of implementation in many different ways than those herein set forth and of similar import by those skilled in the art without departing from the spirit of this application and is therefore not limited to the specific implementations disclosed below.
FIG. 1 is an overall architecture diagram of an edge resource storage method provided in the present application; the method comprises the following three layers: the system comprises a terminal node layer, an edge computing node layer and a cloud computing center node layer. The terminal nodes are various terminal devices, such as various internet of things terminals. In a traditional internet of things system, a terminal node only has data acquisition and submission functions, and all the computing functions are processed by a cloud computing center node. In the edge computing scenario, the edge computing node may also accept the request of the terminal node to perform the computing task and respond to the request. It should be noted that the edge computing node is an arbitrary node located between the terminal and the cloud computing center node, and therefore, part of the terminal node physical devices also play the role of the edge computing node, which is different from the traditional cloud computing mode. When the edge computing node cannot complete a complex computing task, the edge computing node needs to be submitted to a cloud computing node to complete the complex computing task, namely, the third layer of the framework.
In an edge computing system based on a block chain, edge computing capacity is mainly combined with a block chain technology, and due to the combination, edge computing nodes (including part of terminal nodes) can have direct interaction capacity, for example, quick, safe and credible payment can be carried out among the nodes, and one automobile can sell map congestion information to another automobile without passing through a cloud computing node.
It can be said that the blockchain brings a trusted, secure future to the edge computation.
However, the storage and computation capabilities of the edge computing node are limited, and the mobility is strong, and the resource allocation, data storage and resource access of the edge computing node face four major challenges:
1. how to deal with the problem of limited storage space resources of nodes in the edge computing scenario?
2. How to deal with the problem of instability of the edge nodes, the nodes may exit the edge computing network at any time.
3. How to maximize the user access experience.
4. How to deal with malicious behavior of the edge node, such as owning data but denying service to other users.
The solution provided by the present application is described below.
FIG. 2 is a flow chart illustrating a method for storing edge resources provided according to the architecture diagram of FIG. 1.
As shown in fig. 2, an edge resource storage method provided in the present application includes the following steps:
in step S201, the edge computing node extracts a data summary of the node data.
The edge computing node or the terminal node generates data aiming at an application scene, such as automobile map data and the like, the data needs to be stored, the node extracts and computes data abstract, and the data format is as follows
{id,datatype,dataname,time,creator,store nodes list,valid time,otherproperities,signature}
Wherein,
the id is a data network-wide unique identifier,
datatype, dataame, is the data type and name,
the time is the time at which the data was created,
the creator is the creator of the data,
the store nodes list is a list of storage nodes for data in the block chain, and is initially empty,
the valid time is the valid time of the data,
other properties are other properties of the data,
signature is the creator's signature.
Step S202, the edge computing node sends a data storage request of the node to an edge block chain network; the data storage request comprises a data summary.
The node is broadcast in the whole network and submits application, and the data is hopefully included in the edge computing block chain storage.
And step S203, constructing an edge block chain resource distribution model according to the storage capacity, the credit degree and the access distance of the nodes.
Based on the resource allocation of the edge computing nodes of the block chain, an allocation model is provided, which comprises the following construction steps,
firstly, the definition of the storage capacity of a node is given, the larger the storage capacity is, the larger the probability of being selected as a storage node is, the storage space of a node i is C, the allocated space is C (i), and the idle capacity f (i) is:
smaller (i) means more free space and more storage capacity.
Defining the access distance between different nodes as d (i, j), meaning the access distance between node i and node j, such as hop count, time delay, etc., is a mature problem in the field of network research and does not belong to the protection category to be redefined in this patent. The smaller d (i, j) is, the better the experience of data access is, which means that the quality of the server can be better guaranteed in the marginal computing scenario.
The credibility of the node is defined as R, the higher the R is, the credibility of the node is good, the reliability of data stored in the node is high, and the description of the R can be in various forms, such as the times of service rejection, the times of service failure, the times of complaints and the like.
The method also comprises the step of defining the data redundancy coefficient as K, wherein the data redundancy coefficient is the lower limit of the number of nodes which the data should be stored in the block chain network, the maximum of K is all nodes in the node set V of all networks of the block chain, and the data redundancy coefficient can be flexibly defined according to different system requirements. For example, for a scenario with strong mobility, K should be set to a large value, whereas K may be reduced appropriately, and K is generally greater than 1.
Then, according to the parameters of the storage capacity, the credibility, the access distance and the like of the nodes,
the data storage allocation problem is formalized as the following model:
xim,yijm∈{0,1}
the model can be calculated by means of existing algorithms and tools and even approximately optimal algorithms. In the above-described model, the model,
the formula (1) comprehensively considers the storage capacity, the credit degree and the access distance of the nodes to obtain an optimal set { x ] of the data m which should be storedimAnd the optimal access mode of the node yijm}。xim1 means that data m is stored on node i, and the digest field store nodes list of data m should contain i. y isijm1 means that node j can access data m through node i.
The formula (2) means that the request of the node j for accessing the data m can be satisfied by at least K nodes, so that the fault tolerance of the data and the resistance to the exit or the failure of the edge node are greatly improved.
Equation (3) means that each node j's request to access data m can be satisfied.
Step S204, the marginal block chain resource distribution model carries out comprehensive evaluation on the storage capacity, the credit degree and the access distance of the marginal computing nodes in the marginal block chain network, obtains the optimal distribution mode of the node data, and stores the node data on the marginal computing nodes in the marginal block chain network according to the distribution mode.
The method mainly comprises the steps of comprehensively evaluating the storage capacity, the credit degree and the access distance of edge computing nodes according to a constructed edge block chain resource distribution model, obtaining an optimal distribution mode of the node data, and then storing the node data on the edge computing nodes in an edge block chain network.
By the method, the storage and access policies of the node are generated, and the effect is as shown in fig. 5, not every edge node stores all data, and blank block data in the graph indicates that the node does not store. It should be noted, however, that in order to ensure that data of the system is available in an extreme case, the cloud computing center node must store the full amount of data.
Corresponding to the above-mentioned edge resource storage method, the present application also provides an edge resource storage apparatus 300, as shown in fig. 3, including:
a digest extraction unit 310 that extracts a data digest of the node data by the edge calculation node;
a request sending unit 320, where the edge computing node sends a data storage request of the node to the edge blockchain network; the data storage request comprises a data abstract;
the model construction unit 330 is used for constructing an edge block chain resource allocation model according to the storage capacity, the credit degree and the access distance of the nodes;
the resource allocation unit 340 performs comprehensive evaluation on the storage capacity, the credit degree and the access distance of the edge computing node in the edge block chain network by using the edge block chain resource allocation model to obtain an optimal allocation mode of the node data, and stores the node data on the edge computing node in the edge block chain network according to the allocation mode.
The present application also provides an edge resource access method, as shown in fig. 4, including:
in step S401, the edge compute node sends a request to access data to the local tile of the node.
Step S402, the edge computing node searches whether the local block of the node stores the requested data abstract; if the local block of the node stores the requested data abstract, the edge computing node acquires the stored data from the acquired local block of the node;
step S403, if the local block of the node does not store the requested data abstract, the edge computing node sends the data request to the neighbor node;
step S404, after the neighbor node receives the data request, the neighbor node searches whether the local block stores the requested data abstract; if the local block of the neighbor node stores the requested number summary, the stored data is provided to the edge compute node. And after the neighbor nodes provide the stored data to the edge computing nodes, the credit degree of the neighbor nodes is improved.
Specifically, the process of submitting the resource access request by the node includes the following steps:
assuming that a node G in the above figure wants to access data of a block 2, first, the summary information of the data of the block 2 is retrieved, and the node G itself is found in a store nodes list, so that the data is stored locally and therefore can be accessed directly;
assuming that the node G in the above diagram wants to access the data of the block 3, first, the summary information of the data of the block 3 is retrieved, and it is found that the node G is not in the store nodes list, so the data is not stored locally, the node G broadcasts the request to its neighboring nodes, and the neighboring node E receives the request again, finds that the data of the block 3 is stored locally, and then responds to the node G to complete the data access.
The nodes should be motivated to store data, which is the basis for ensuring the operation of the whole system. Therefore, node E will be promoted in reputation after providing data to G. Meanwhile, the node G can also add expense information in the data request, ensure that other nodes can be attracted to serve the node G, and obtain benefits.
There may be a question here, yijmThe node 1 is not only providing service, but certainly not, the former is model calculation, and the actual data access process is only suggested but not mandatory.
The resource response and reputation updating process when a resource access or a node is abnormal comprises the following steps:
assuming that a resource access exception occurs in a node, for example, in the above example, although the node E stores the data m, the node E does not provide the data to the node G, the reputation degree R of the node E will be reduced, and will be affected in the subsequent data storage process.
When the edge node exits the network and causes the storage nodes of the data m to be reduced, the experience of data access is reduced, but the existence of the cloud computing center node ensures the existence of the full data storage and the problem of data loss is not caused.
The updating of the node credibility is already introduced in the previous steps, and the credibility can also introduce third-party oracle credible data as a basis, which is also the protection scope of the patent.
Corresponding to the above edge resource access method, the present application also provides an edge resource access apparatus 600, as shown in fig. 6, including:
a request sending unit 610, where the edge computing node sends a request for accessing data to a local block of the node;
the data acquisition unit 620, the edge computing node searches whether the local block of the node stores the requested data abstract; if the local block of the node stores the requested data abstract, the edge computing node acquires the stored data from the acquired local block of the node;
a request sending unit 630, if the local block of the node does not store the requested data digest, the edge computing node sends the data request to a neighboring node;
after receiving the data request, the neighbor node retrieves whether the local block stores the requested data summary; if the local block of the neighbor node stores the requested number summary, the stored data is provided to the edge compute node.
Preferably, the method further comprises the following steps:
and the credibility promoting subunit promotes the credibility of the neighbor node after the neighbor node provides the stored data to the edge computing node.
The application provides a method and a device for storing edge resources based on a block chain, which comprehensively evaluate the storage capacity, the credit degree and the access distance of edge computing nodes in an edge block chain network through an edge block chain resource allocation model to obtain an optimal allocation mode of node data, and store the node data on the edge computing nodes in the edge block chain network according to the allocation mode to solve the problem of the requirement of a resource allocation method of an edge computing system.
Finally, it should be noted that: although the present invention has been described in detail with reference to the above embodiments, it should be understood by those skilled in the art that various changes may be made and equivalents may be substituted for elements thereof without departing from the spirit and scope of the invention.
Claims (10)
1. An edge resource storage method, comprising:
extracting a data abstract of the node data by the edge computing node;
the edge computing node sends a data storage request of the node to an edge block chain network; the data storage request comprises a data abstract;
constructing an edge block chain resource distribution model according to the storage capacity, the credit degree and the access distance of the nodes;
and the marginal block chain resource allocation model comprehensively evaluates the storage capacity, the credit degree and the access distance of the marginal computing nodes in the marginal block chain network, acquires an optimal allocation mode of the node data, and stores the node data on the marginal computing nodes in the marginal block chain network according to the allocation mode.
2. The method of claim 1, wherein the data digest of the node data is in the format of,
{id,datatype,dataname,time,creator,store nodes list,valid time,otherproperities,signature}
wherein,
the id is a data network-wide unique identifier,
datatype, dataame, is the data type and name,
the time is the time at which the data was created,
the creator is the creator of the data,
the store nodes list is a list of storage nodes for data in the block chain, and is initially empty,
the valid time is the valid time of the data,
other properties are other properties of the data,
signature is the creator's signature.
3. The method of claim 1, wherein the edge computing node sends the data storage request of the node to the edge blockchain network, and the data storage request of the node is sent in a network-wide broadcast manner.
4. The method of claim 1, wherein the storage capacity, reputation, and access distance of the node are obtained by,
if the storage space of the node i is C, the allocated space is C (i), and the spare capacity f (i) is:
smaller (i) means more free space, larger storage capacity;
defining the credit degree of the node as R, wherein the higher the R is, the good credit of the node is meant, and the reliability of data storage is strong;
defining the access distance between different nodes as d (i, j), wherein d (i, j) is the access distance between the node i and the node j.
5. The method of claim 1, wherein the edge blockchain resource allocation model comprises:
the model includes the following formula,
in which the formula (I) is shown,
obtaining an optimal set of data m storage according to the storage capacity, the credit degree and the access distance of the nodes, wherein the set is { x }imAnd the optimal access mode of the node yijm}，xim1, data m is stored on node i, and a summary field of data m should contain i; y isijm1 means that node j can access data m through node i;
in which the formula (I) is shown,
indicating that each node j's request to access data m can be satisfied;
in which the formula (I) is shown,
indicating that each node j's request to access data m can be satisfied.
6. An edge resource storage device, comprising:
the abstract extraction unit is used for extracting the data abstract of the node data by the edge computing node;
the device comprises a request sending unit, a data storage unit and a data storage unit, wherein the request sending unit is used for sending a data storage request of an edge computing node to an edge block chain network; the data storage request comprises a data abstract;
the model building unit is used for building an edge block chain resource distribution model according to the storage capacity, the credit degree and the access distance of the nodes;
and the resource allocation unit is used for comprehensively evaluating the storage capacity, the credit degree and the access distance of the edge computing node in the edge block chain network by the edge block chain resource allocation model, acquiring the optimal allocation mode of the node data, and storing the node data on the edge computing node in the edge block chain network according to the allocation mode.
7. An edge resource access method, comprising:
the edge computing node sends a request for accessing data to a local block of the node;
the edge computing node searches whether the local block of the node stores the requested data abstract or not; if the local block of the node stores the requested data abstract, the edge computing node acquires the stored data from the acquired local block of the node;
if the local block of the node does not store the requested data abstract, the edge computing node sends the data request to a neighbor node;
after the neighbor node receives the data request, the neighbor node searches whether the local block stores the requested data abstract or not; if the local block of the neighbor node stores the requested number summary, the stored data is provided to the edge compute node.
8. The method of claim 7, further comprising:
and after the neighbor nodes provide the stored data to the edge computing nodes, the credit degree of the neighbor nodes is improved.
9. An edge resource access device based on a block chain, comprising:
the edge computing node sends a request for accessing data to a local block of the node;
the data acquisition unit is used for searching whether the local block of the node stores the requested data abstract or not by the edge computing node; if the local block of the node stores the requested data abstract, the edge computing node acquires the stored data from the acquired local block of the node;
the request sending unit is used for sending the data request to the neighbor node by the edge computing node if the local block of the node does not store the requested data abstract;
the data acquisition unit is used for searching whether the local block stores the requested data abstract or not after the neighbor node receives the data request; if the local block of the neighbor node stores the requested number summary, the stored data is provided to the edge compute node.
10. The apparatus of claim 9, further comprising:
and the credibility promoting subunit promotes the credibility of the neighbor node after the neighbor node provides the stored data to the edge computing node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911415818.9A CN111221649A (en) | 2019-12-31 | 2019-12-31 | Edge resource storage method, access method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911415818.9A CN111221649A (en) | 2019-12-31 | 2019-12-31 | Edge resource storage method, access method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111221649A true CN111221649A (en) | 2020-06-02 |
Family
ID=70831016
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911415818.9A Pending CN111221649A (en) | 2019-12-31 | 2019-12-31 | Edge resource storage method, access method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111221649A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112581022A (en) * | 2020-12-29 | 2021-03-30 | 上海优扬新媒信息技术有限公司 | User credit determination method and device |
| CN114172742A (en) * | 2021-12-23 | 2022-03-11 | 国网浙江省电力有限公司信息通信分公司 | Hierarchical authentication method of power Internet of things terminal equipment based on node map and edge authentication |
| CN114884753A (en) * | 2022-07-11 | 2022-08-09 | 成都信息工程大学 | Data access processing method applied to industrial internet cloud service platform |
| CN114900519A (en) * | 2022-05-06 | 2022-08-12 | 中国电信股份有限公司 | Capability calling method, capability calling device, storage medium and electronic equipment |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108616534A (en) * | 2018-04-28 | 2018-10-02 | 中国科学院信息工程研究所 | A kind of method and system for protecting internet of things equipment ddos attack based on block chain |
| CN108664330A (en) * | 2018-05-16 | 2018-10-16 | 哈尔滨工业大学（威海） | A kind of cloud resource distribution method based on change neighborhood search strategy |
| CN109165972A (en) * | 2018-07-30 | 2019-01-08 | 广东工业大学 | A kind of mobile block chain resource allocation methods of task based access control migration mechanism |
| CN109388492A (en) * | 2018-10-09 | 2019-02-26 | 浙江工业大学 | A kind of mobile block chain optimization calculation force distribution method under multiple edge calculations server scenes based on simulated annealing |
| US20190158594A1 (en) * | 2017-11-20 | 2019-05-23 | Moshe Shadmon | System and apparatus to manage data using a peer-to-peer network and the blockchain |
| CN109993847A (en) * | 2019-04-15 | 2019-07-09 | 内蒙古大学 | A blockchain-based architecture and working method for collecting traffic accident information |
| CN110231990A (en) * | 2019-05-22 | 2019-09-13 | 深圳供电局有限公司 | Block chain resource optimal allocation method and device based on secondary auction |
| CN110417872A (en) * | 2019-07-08 | 2019-11-05 | 深圳供电局有限公司 | Edge network resource allocation method facing mobile block chain |
-
2019
- 2019-12-31 CN CN201911415818.9A patent/CN111221649A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190158594A1 (en) * | 2017-11-20 | 2019-05-23 | Moshe Shadmon | System and apparatus to manage data using a peer-to-peer network and the blockchain |
| CN108616534A (en) * | 2018-04-28 | 2018-10-02 | 中国科学院信息工程研究所 | A kind of method and system for protecting internet of things equipment ddos attack based on block chain |
| CN108664330A (en) * | 2018-05-16 | 2018-10-16 | 哈尔滨工业大学（威海） | A kind of cloud resource distribution method based on change neighborhood search strategy |
| CN109165972A (en) * | 2018-07-30 | 2019-01-08 | 广东工业大学 | A kind of mobile block chain resource allocation methods of task based access control migration mechanism |
| CN109388492A (en) * | 2018-10-09 | 2019-02-26 | 浙江工业大学 | A kind of mobile block chain optimization calculation force distribution method under multiple edge calculations server scenes based on simulated annealing |
| CN109993847A (en) * | 2019-04-15 | 2019-07-09 | 内蒙古大学 | A blockchain-based architecture and working method for collecting traffic accident information |
| CN110231990A (en) * | 2019-05-22 | 2019-09-13 | 深圳供电局有限公司 | Block chain resource optimal allocation method and device based on secondary auction |
| CN110417872A (en) * | 2019-07-08 | 2019-11-05 | 深圳供电局有限公司 | Edge network resource allocation method facing mobile block chain |
Non-Patent Citations (1)
| Title |
|---|
| Y. HUANG 等: ""Resource Allocation and Consensus on Edge Blockchain in Pervasive Edge Computing Environments"", 《2019 IEEE 39TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS)》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112581022A (en) * | 2020-12-29 | 2021-03-30 | 上海优扬新媒信息技术有限公司 | User credit determination method and device |
| CN114172742A (en) * | 2021-12-23 | 2022-03-11 | 国网浙江省电力有限公司信息通信分公司 | Hierarchical authentication method of power Internet of things terminal equipment based on node map and edge authentication |
| CN114172742B (en) * | 2021-12-23 | 2024-02-20 | 国网浙江省电力有限公司信息通信分公司 | Hierarchical authentication method for power Internet of Things terminal equipment based on node map and edge authentication |
| CN114900519A (en) * | 2022-05-06 | 2022-08-12 | 中国电信股份有限公司 | Capability calling method, capability calling device, storage medium and electronic equipment |
| CN114900519B (en) * | 2022-05-06 | 2023-12-12 | 中国电信股份有限公司 | Capability calling method, capability calling device, storage medium and electronic equipment |
| CN114884753A (en) * | 2022-07-11 | 2022-08-09 | 成都信息工程大学 | Data access processing method applied to industrial internet cloud service platform |
| CN114884753B (en) * | 2022-07-11 | 2022-09-30 | 成都信息工程大学 | Data access processing method applied to industrial internet cloud service platform |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111221649A (en) | Edge resource storage method, access method and device | |
| EP3640823B1 (en) | Service data storage method, device, storage medium, and electronic device | |
| CN108769230B (en) | Transaction data storage method, device, server and storage medium | |
| CN116112931B (en) | A terminal trust evaluation method and device based on consensus mechanism trust aggregation | |
| CN113242553B (en) | Malicious node detection method based on block chain fragmentation | |
| Gu et al. | Resource allocation scheme for community-based fog computing based on reputation mechanism | |
| CN115987547B (en) | Multi-platform interconnection and intercommunication cloud connector system | |
| Vairagade et al. | Enabling machine learning‐based side‐chaining for improving QoS in blockchain‐powered IoT networks | |
| CN114650302A (en) | Trusted management method of IoT edge devices based on blockchain | |
| CN113726913A (en) | Backbone node access method and block chain system | |
| WO2024146179A1 (en) | Cross-blockchain transaction processing method, related device, storage medium and product | |
| CN111669267A (en) | Blockchain consensus mechanism configuration and endorsement policy configuration method | |
| CN112631777B (en) | Searching and resource allocation method based on block chain and edge calculation | |
| Li et al. | SFC-enabled reliable service provisioning in mobile edge computing via digital twins | |
| CN113162971A (en) | Block link point management method, device, computer and readable storage medium | |
| US10572486B2 (en) | Data communication in a distributed data grid | |
| Yang et al. | User-centric blockchain for industry 5.0 applications | |
| EP2071764B1 (en) | A method, device and communication system thereof of electing local master | |
| WO2018192340A1 (en) | Method for implementing network slice admission control, and apparatus and terminal | |
| CN108833110A (en) | Digital asset processing method and processing device | |
| CN109218406B (en) | A cross-domain collaborative service method for smart cities | |
| CN111797169A (en) | Data storage method, equipment and storage medium | |
| CN117318913A (en) | Blockchain lightweight consensus method and system based on global trust | |
| Jafari et al. | Performance improvement of distributed cache using middleware session | |
| Zhao et al. | Social-aware cross-chain authentication strategy in mobile edge computing |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200602 |
|
| RJ01 | Rejection of invention patent application after publication |