CN113179154B - Resource joint distribution method in quantum key distribution Internet of things and related equipment - Google Patents

Resource joint distribution method in quantum key distribution Internet of things and related equipment Download PDF

Info

Publication number
CN113179154B
CN113179154B CN202110322124.1A CN202110322124A CN113179154B CN 113179154 B CN113179154 B CN 113179154B CN 202110322124 A CN202110322124 A CN 202110322124A CN 113179154 B CN113179154 B CN 113179154B
Authority
CN
China
Prior art keywords
nodes
node
resources
topology
path
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
CN202110322124.1A
Other languages
Chinese (zh)
Other versions
CN113179154A (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.)
Beijing University of Posts and Telecommunications
Original Assignee
Beijing University of Posts and Telecommunications
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 Beijing University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Priority to CN202110322124.1A priority Critical patent/CN113179154B/en
Publication of CN113179154A publication Critical patent/CN113179154A/en
Application granted granted Critical
Publication of CN113179154B publication Critical patent/CN113179154B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/0852—Quantum cryptography
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR 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/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G—PHYSICS
    • G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
    • G16Y30/00—IoT infrastructure
    • G16Y30/10—Security thereof

Abstract

The invention provides a resource joint distribution method in a quantum key distribution Internet of things and related equipment, wherein the method comprises the following steps: decomposing a service into a plurality of tasks; determining a shortest path group among nodes related to each task in the Internet of things and a node set capable of executing a calculation task; constructing a first auxiliary topology facing to load and a second auxiliary topology facing to encryption based on a preset network physical topology and a shortest path group; acquiring a first candidate node set based on the first auxiliary topology and the node set, acquiring a second candidate node set according to the first candidate node set and the second auxiliary topology, and determining a computing node with the minimum key consumption through the second candidate node set; 4C resources including computing resources, storage resources, communication resources, and encryption resources are allocated based on the computing nodes. The method provided by the disclosure solves the problem of 4C resource joint allocation, reduces the failure rate of service encryption bearing, and improves the utilization rate of encrypted resources.

Description

Resource joint distribution method in quantum key distribution Internet of things and related equipment
Technical Field
The disclosure relates to the technical field of internet of things, in particular to a resource joint allocation method in the internet of things for quantum key distribution and related equipment.
Background
In order to avoid the attack of the security of the Internet of Things (IoT) by Quantum computing, a Quantum Key Distribution (QKD) technology is introduced into the conventional IoT, so that the Internet of Things with Quantum Key Distribution is formed. In the quantum key distribution internet of things, the existing resource allocation method usually considers the joint allocation of computing resources, communication resources and storage resources or the allocation of part of the resources, but does not consider the joint allocation with encryption resources. The key resources generated by the QKD technology can be used as encryption resources, so that information leakage in the information transmission process is avoided. However, the introduction of encryption resources presents new challenges to the edge cloud coordination process. On one hand, the state of the encrypted resource can influence whether the service can be safely carried; on the other hand, the way in which computing resources, communication resources, and storage resources are allocated affects the consumption state of encryption resources. Therefore, in the internet of things for quantum key distribution, 4C resource allocation procedures of computing (computing) resources, Communication (Communication) resources, storage (Caching) resources and encryption (Cryptography) cannot be split, and 4C resource constraints should be jointly considered.
Disclosure of Invention
In view of this, the present disclosure aims to provide a resource joint allocation method in an internet of things for quantum key distribution and related devices.
Based on the above purpose, the present disclosure provides a resource joint allocation method in a quantum key distribution internet of things, including:
responding to a service request of the Internet of things, and decomposing the service into a plurality of tasks based on the resource requirement of the service, wherein the tasks comprise calculation tasks;
determining a shortest path group among nodes associated with each task in the Internet of things based on the tasks; determining a node set capable of executing the computing task according to all the nodes included in the shortest path group;
constructing a first auxiliary topology facing to load and a second auxiliary topology facing to encryption based on a preset network physical topology and the shortest path group;
in response to determining that the bearer path of the service meets the requirement of maximum delay and communication resource constraints, acquiring a first candidate node set through the first auxiliary topology and the node set;
in response to determining that a Quantum Key Distribution (QKD) path of the traffic satisfies an encryption resource constraint, obtaining a second candidate node set through the second auxiliary topology and the first candidate node set, and determining a compute node with a minimum key consumption based on the second candidate node set;
based on the compute nodes, computing resources, storage resources, communication resources, and encryption resources are allocated.
Based on the same inventive concept, the present disclosure also provides a resource joint allocation apparatus in a quantum key distribution internet of things, including:
a service decomposition module: configured to, in response to a service request of the internet of things, decompose a service into a plurality of tasks based on resource requirements of the service, the plurality of tasks including a computing task;
an auxiliary topology building module: configured to determine a shortest path set between nodes associated with each of the tasks in the internet of things based on the plurality of tasks; determining a node set capable of executing the computing task according to all the nodes included in the shortest path group;
constructing a first auxiliary topology facing to the load and a second auxiliary topology facing to the encryption based on a preset network physical topology and the shortest path group;
the route calculation module: configured to obtain a first set of candidate nodes via the first auxiliary topology and the set of nodes in response to determining that a bearer path of the service satisfies a requirement of maximum latency and a communication resource constraint;
in response to determining that a Quantum Key Distribution (QKD) path of the traffic satisfies an encryption resource constraint, obtaining a second candidate node set through the second auxiliary topology and the first candidate node set, and determining a compute node with a minimum key consumption based on the second candidate node set;
a resource allocation module: is configured to allocate computing resources, storage resources, communication resources and encryption resources based on the compute node.
Based on the same inventive concept, the present disclosure also provides an electronic device, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor implements the method according to any one of the above aspects when executing the program.
Based on the same inventive concept, the present disclosure also provides a non-transitory computer-readable storage medium storing computer instructions for causing a computer to perform the method as described in any one of the above.
As can be seen from the above, the resource joint allocation method in the quantum key distribution internet of things and the related device provided by the disclosure solve the problem of joint allocation of 4C resources by combining the 4C resource hybrid constraints of the computing resources, the storage resources, the communication resources and the encryption resources on the premise of meeting the delay requirement of the service, thereby reducing the failure rate of service encryption bearing, improving the utilization rate of the encryption resources, and meeting the security requirement of the service in the quantum key distribution internet of things.
Drawings
In order to more clearly illustrate the technical solutions in the present disclosure or related technologies, the drawings needed to be used in the description of the embodiments or related technologies are briefly introduced below, and it is obvious that the drawings in the following description are only embodiments of the present disclosure, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
FIG. 1 is a schematic diagram of resource allocation in an Internet of things for quantum key distribution;
fig. 2 is a flowchart of a resource joint allocation method in an internet of things for quantum key distribution according to the embodiment of the disclosure;
FIG. 3 is a business decomposition flow diagram of an embodiment of the disclosure;
FIG. 4 is a flow chart of an auxiliary topology construction of an embodiment of the present disclosure;
FIG. 5 is a flow chart of route calculation according to an embodiment of the present disclosure;
FIG. 6 is a flow chart of resource allocation according to an embodiment of the present disclosure;
FIG. 7 is a schematic diagram of a physical topology of a network according to an embodiment of the present disclosure;
fig. 8(a) is a schematic diagram of a first bearer-oriented auxiliary topology according to an embodiment of the present disclosure, and fig. 8(b) is a schematic diagram of a second encryption-oriented auxiliary topology according to an embodiment of the present disclosure;
fig. 9 is a schematic structural diagram of a resource joint allocation device in an internet of things for quantum key distribution according to the embodiment of the disclosure;
fig. 10 is a schematic structural diagram of an electronic device according to an embodiment of the disclosure.
Detailed Description
For the purpose of promoting a better understanding of the objects, aspects and advantages of the present disclosure, reference is made to the following detailed description taken in conjunction with the accompanying drawings.
It is to be noted that technical terms or scientific terms used in the embodiments of the present disclosure should have a general meaning as understood by those having ordinary skill in the art to which the present disclosure belongs, unless otherwise defined. The use of "first," "second," and similar terms in the embodiments of the disclosure is not intended to indicate any order, quantity, or importance, but rather to distinguish one element from another. The word "comprising" or "comprises", and the like, means that the element or item listed before the word covers the element or item listed after the word and its equivalents, but does not exclude other elements or items.
As described in the background section, existing resource allocation methods also have difficulty meeting requirements. In implementing the present disclosure, the applicant finds that the existing resource allocation method has the main problems that: often, only the joint allocation of the computing resources, communication resources and storage resources or the allocation of some of them is considered, and the joint allocation of the computing resources, communication resources, storage resources and encryption resources is not considered.
In view of this, the embodiment of the present disclosure provides a resource joint allocation method in an internet of things for quantum key distribution, which performs 4C resource joint allocation of computing resources, communication resources, storage resources and encryption resources by using a QKD technology under the condition that a delay requirement of a service is met, thereby reducing a service encryption bearing failure rate, improving a utilization rate of encryption resources, and further meeting a security requirement of the service in the internet of things for quantum key distribution.
Referring to fig. 1, a schematic diagram of resource allocation in an internet of things for quantum key distribution is shown, and a side cloud cooperation technology is adopted, and the internet of things for quantum key distribution is divided into 3 layers, namely a terminal layer, an edge layer and a cloud layer. The terminal equipment in the terminal layer is connected to the edge node in the edge layer through wireless or wired connection; the connection between the edge node and the cloud layer and between the edge nodes is mainly realized by an optical transmission network; the nodes of the cloud layer are connected by a core network.
In the quantum key distribution internet of things, a quantum secret network can be regarded as a primary stage of a quantum information network, and encryption functions such as key distribution, safety identification and position verification can be realized based on probabilistic preparation and measurement of a quantum superposition state or an entanglement state. The quantum key distribution technology is a typical application entering into practicality, and along with the higher and higher degree of practicality of the QKD technology, the QKD technology is widely applied to various network scenarios, such as the internet of things, a core network, an access network and the like, and different quantum key distribution mechanisms can be adopted according to different types of intelligent terminals.
The edge cloud cooperation technology has different capabilities in different scenes, and comprises resource cooperation, data cooperation, security strategy cooperation and application management cooperation. In the IoT scenario, the main capabilities of edge cloud collaboration technologies include resource collaboration and data collaboration. For resource cooperation, the edge node provides infrastructure resources such as calculation, storage and communication, and the south direction of the edge node provides rich network interfaces to support wide terminal access; the cloud provides resource scheduling management strategies including equipment management, resource management and network connection management of the edge nodes. For data cooperation, the edge node is mainly responsible for collecting field and terminal data, primarily processes and analyzes the data according to rules or data models, and uploads a processing result and related data to the cloud; the cloud provides storage, analysis and value mining of mass data. The edge nodes and the cloud end cooperate with each other, so that the controllable and ordered flow of data between the edge nodes and the cloud end can be supported, a complete data flow path is formed, and the life cycle management and the value mining of the data are carried out efficiently and at low cost.
Further, the figure shows an example of 4C resource allocation of a service, and first, content 1 stored on the cloud layer and content 2 cached at the edge layer 2 need to be acquired,after calculation, the calculation results are respectively stored in the cloud layer (content 3) and the edge node 4 (content 4). Accordingly, the 4C resources allocated for the task are as follows: allocating storage resources for the edge nodes 2 and 4 and allocating computing resources for the edge nodes 3; the distributed encryption resource comprises a pair of keys K between the cloud layer and the edge node 11cA pair of edge nodes 1 and 2, and a key K between them12Keys K between two pairs of edge nodes 2 and edge node 323Keys K between two pairs of edge nodes 3 and edge nodes 434And a key K between a pair of cloud layers and the edge node 44c。
In the resource joint allocation method in the quantum key distribution internet of things, the considered scene is the resource allocation problem after terminal layer services are converged to the edge layer. The edge nodes can comprise gateways of the internet of things, and each edge node internally comprises computing resources, storage resources and encryption resources; communication resources exist between the edge node and other nodes; cloud nodes comprise core network nodes and also have computing resources, storage resources and encryption resources.
The computing resources refer to CPU resources in a data center or a server and can provide computing power for services; the storage resource refers to a space for providing data storage for the service; the communication resource refers to a transmission resource required in the data transmission process; the encryption resource refers to a key generated by using the QKD technology, and can be stored in a key pool for the encryption of the service.
Hereinafter, the technical means of the present disclosure will be described in detail by specific examples.
Referring to fig. 2, the resource joint allocation method in the quantum key distribution internet of things of the present disclosure includes the following steps:
step S201, responding to a service request of the Internet of things, and decomposing the service into a plurality of tasks based on the resource requirement of the service, wherein the plurality of tasks comprise calculation tasks.
With reference to fig. 3, in this step, the service S belongs to S, S represents a service set, the resource requirement of the service includes a 4C resource of a computing resource, a storage resource, a communication resource, and an encryption resource, and the constraint of the 4C resource includes a computing resource constraint, a storage resource constraint, a communication resource constraint, and an encryption resource constraint.
Wherein, the computing resource constraint indicates that the residual CPU capacity on the computing node is not less than the business computing requirement; the storage resource constraint represents that the residual storage space on the storage node is not less than the service storage requirement; communication resource constraint indicates that idle wavelength resources on a link are not less than service communication bearing requirements, and wavelength consistency is required when a path of a task is allocated with a wavelength; the encryption resource constraint indicates that for any link on the path, the residual key amount of the key pool on the link is not less than the encryption requirement of the service. In addition, the allocation constraints of the 4C resources may also include the constraint that each computing task is executed by only one device and that input content needs to be aggregated to one device for processing.
The tasks further comprise a downloading task, an uploading task and a storing task, and the content required to be transmitted, calculated or stored by each task is represented as
Figure BDA0002993289170000061
The content transmitted, calculated or stored by the service s is denoted as DsAnd is and
Figure BDA0002993289170000062
wherein the content of the first and second substances,
Figure BDA0002993289170000063
which represents the content of the input to the calculation module,
Figure BDA0002993289170000064
which represents the total CPU cycles of the CPU,
Figure BDA0002993289170000065
representing the content output by the computing module;
further, in the above-mentioned case,
Figure BDA0002993289170000066
Figure BDA0002993289170000067
wherein the content of the first and second substances,
Figure BDA0002993289170000068
representing nodes v from the clouddownThe content of the downloaded content is, in turn,
Figure BDA0002993289170000069
representing slave edge layer nodes
Figure BDA00029932891700000610
The content obtained is cached and stored in a cache,
Figure BDA00029932891700000611
representing uploading of content to cloud layer node vupThe information is stored in a storage device (a),
Figure BDA00029932891700000612
representing content
Figure BDA00029932891700000613
Store to edge node
Figure BDA00029932891700000614
Step S202, based on the tasks, determining a shortest path group between nodes associated with the tasks in the Internet of things; and determining a node set capable of executing the computing task according to all the nodes included in the shortest path group.
Referring to FIG. 4, in this step, the input v is calculateddown、
Figure BDA00029932891700000615
To the output terminals v, respectivelyup、
Figure BDA0002993289170000071
BetweenK shortest paths, input vdownAnd
Figure BDA0002993289170000072
k shortest paths between any two nodes, and output vupAnd
Figure BDA0002993289170000073
deleting the repeated links of the K shortest paths between any two nodes to obtain the shortest path group Pn，PnThe expression of (a) is:
Figure BDA0002993289170000074
it will be appreciated that if the input v is calculateddown、
Figure BDA0002993289170000075
To the output terminal vup、
Figure BDA0002993289170000076
If there is a calculation failure in the shortest paths between K paths, the service encryption bearer fails.
Obtaining the node set V capable of executing the computing task by traversing all nodes in the shortest path group based on the nodes meeting the computing resource constraint and the links meeting the encryption resource constraint in the links connected with the nodesg。
Step S203, constructing a first auxiliary topology facing to the load and a second auxiliary topology facing to the encryption based on a preset network physical topology and the shortest path group.
Referring to fig. 4, in this step, the expression of the network physical topology is Gp(Vp,Ep) In the formula, VpRepresenting physical nodes in the topology, including cloud-level nodes and edge-level nodes, VpIs expressed as
Figure BDA0002993289170000077
Figure BDA0002993289170000078
EpRepresenting physical links in the topology, including cloud-layer links and edge-layer links, EpIs expressed as
Figure BDA0002993289170000079
The first auxiliary topology is configured to determine a bearer path and a bearer delay of the service, and the expression is Gc(Vc,Ec) In the formula, VcRepresenting nodes in a first auxiliary topology, denoted by PnMiddle node composition, VcIs expressed as
Figure BDA00029932891700000710
EcRepresenting links in a first auxiliary topology, including PnMedium link, and EpV contained incMiddle cloud layer node and VcLinks between nodes of the middle edge layer, EcIs expressed as
Figure BDA00029932891700000711
EcThe weight of the middle link is the link delay.
The second auxiliary topology is configured to determine a QKD path for the traffic, expressed as Gq(Vq,Eq) In the formula, VqRepresenting nodes in a second auxiliary topology, denoted by VcMiddle node composition, VqIs expressed as
Figure BDA00029932891700000712
EqRepresenting links in a second auxiliary topology, including EcMiddle link and corresponding reverse link, EqIs expressed as
Figure BDA00029932891700000713
EqThe weight of the intermediate link is related to the remaining key amount of the key pool on the linkThe more the amount of remaining keys, the smaller the link weight.
Step S204, responding to the requirement that the bearing path of the service meets the maximum time delay and the communication resource constraint, and acquiring a first candidate node set through the first auxiliary topology and the node set.
With reference to fig. 5, in this step, the maximum delay T includes a transmission delay, a calculation delay, and an encryption configuration delay, where the transmission delay is a bearer path P of the servicetThe maximum transmission delay in all branches.
In particular, when
Figure BDA0002993289170000081
Determining the bearing path P of the service when the time delay T is less than or equal to Tt(ii) a Otherwise, based on each node of the node set
Figure BDA0002993289170000086
In the first auxiliary topology Gc(Vc,Ec) Determining the bearer path P corresponding to the servicetAnd a time delay t;
when T is less than or equal to T and the bearing path P of the servicetWhen the communication resource constraint is satisfied, according to the corresponding node set VgThe node obtains the first candidate node set Vt。
Step S205, in response to determining that the QKD path of the service satisfies an encryption resource constraint, obtaining a second candidate node set through the second auxiliary topology and the first candidate node set, and determining a computing node with a minimum key consumption based on the second candidate node set.
With reference to FIG. 5, in this step, when
Figure BDA0002993289170000082
Determining the QKD path P of said trafficqAnd key consumption Nq(ii) a Otherwise, based on each node of the first candidate node set
Figure BDA0002993289170000083
In the second auxiliary topology Gq(Vq,Eq) Determining the QKD path and the key consumption N corresponding to the serviceqWherein the key consumption is the sum of the key consumption of each link in the QKD path.
When the QKD path PqAll the links meet the encrypted resource constraint according to the QKD path PqCorresponding to the first candidate node set VtTo obtain a second candidate node set Vk。
At the second candidate node set VkIn a manner corresponding to said key consumption NqThe smallest node is taken as the calculation node Vf。
And S206, distributing the computing resources, the storage resources, the communication resources and the encryption resources based on the computing nodes.
With reference to fig. 6, this step includes: in response to determining that the bearer path and the QKD path are not empty sets, allocating computing resources, storage resources, and communication resources according to the bearer path corresponding to the computing node; and distributing encryption resources according to the QKD path corresponding to the computing node.
When the bearer path is empty, i.e.
Figure BDA0002993289170000084
The service encryption bearer fails; when the QKD path is empty, i.e.
Figure BDA0002993289170000085
The traffic encryption bearer fails.
In some embodiments, the decomposing the service into a plurality of tasks based on resource requirements of the service in response to a service request of the internet of things includes:
the traffic is successfully carried in response to determining that the storage node satisfies the storage and encrypted transmission requirements.
Referring to FIG. 4, when a storage node
Figure BDA0002993289170000091
And vupWhen the storage resource constraint is met and the link meeting the encryption resource constraint exists in the links connected between the storage nodes, the service encryption bearing is successful; when the storage node
Figure BDA0002993289170000092
And vupAnd when the storage constraint is not satisfied or the link which satisfies the encryption resource constraint does not exist in the links connected between the storage nodes, the service encryption bearing fails.
Therefore, the resource joint distribution method in the quantum key distribution internet of things provided by the disclosure is based on the quantum key distribution technology and the edge cloud cooperation technology, on the premise of meeting the time delay requirement of the business, the 4C resource mixed constraint of the computing resource, the storage resource, the communication resource and the encryption resource is fully considered, the problem of joint distribution of the 4C resource is solved, the business encryption bearing failure rate is reduced, the utilization rate of the encryption resource is improved, and the safety requirement of the business in the quantum key distribution internet of things can be met.
Next, a specific application scenario of the resource joint allocation method in the quantum key distribution internet of things according to the embodiment of the disclosure is given.
Referring to FIG. 7, which is a network physical topology Gp(Vp,Ep) The structure diagram, wherein the node c is a cloud layer node, the other nodes are edge layer nodes, and the states of the computing resource, the storage resource, the communication resource and the encryption resource are shown in table 1 and table 2. The transmission delay between the cloud layer node and the edge layer node is 5 delay units, the transmission delay between the edge layer nodes is 1 delay unit, the calculated delay is 2 delay units, and the service encryption configuration delay is 1 delay unit. The service s is initialized by the node 3, the content 1 and the content 2 need to be obtained, the content 1 and the content 2 are converged and then calculated, the calculated result is cached by the content 3 transmission edge layer node 3, and the allowable maximum time delay T is 10 time delay units. Content 1, content 2 and content 3 occupy 10, 5 and 2 storage units, respectively; 5 calculation units are needed for calculating the content 1 and the content 2; transmission contents 1, 2 and 3 require 2, 1 and 1 wavelengths, respectively; encrypting contents 1, 2 and 3 requires 10, 5 and 2 keys, respectively, and the shortest path K is 1.
TABLE 1 available storage resources and computing resources Table
Figure BDA0002993289170000093
Figure BDA0002993289170000101
Table 2 available encryption resources and communication resources table
Figure BDA0002993289170000102
Firstly, a service s is divided into a calculation task, a download task, an upload task and a storage task, and the content D transmitted, calculated or stored in the service ssIn the step (1), the first step,
Figure BDA0002993289170000103
Figure BDA0002993289170000104
further, the edge layer node 3 is used as a storage node, the available storage resource of the edge layer node 3 is 3,
Figure BDA0002993289170000105
satisfying the resource constraints. 10 keys are needed for the encrypted content 1, and links 1-3(3-1), 2-3(3-2), 3-5(5-3), and c-3(3-c) meeting the encryption resource constraint exist in the links connected with the edge layer node 3; 5 keys are needed for the encrypted content 2, and links 1-3(3-1), 2-3(3-2), 3-5(5-3), and c-3(3-c) meeting the encryption resource constraint exist in the links connected with the edge layer node 3; since the encrypted resources of link 2-3(3-2) are only 10, link 2-3(3-2) cannot be used to transmit content 1 and content 2. Thus, the edge layer node 3 satisfies the nodeStorage and corresponding transmission encryption requirements.
Further, the input end nodes are cloud layer nodes c and edge layer nodes 1, and the output end nodes are edge layer nodes 3. Calculating the shortest paths between the cloud layer node c and the edge layer node 1 to the edge layer node 3, wherein the shortest paths are (c-3) and (1-3); and (c-1) and (1-c) of the shortest path between the cloud layer node c and the edge layer node 1 are calculated. There are no duplicate links in the above paths, thus forming the shortest path group Pn{ (c-3), (1-3), (c-1), (1-c) }. Traversing shortest path group PnThe node in (1) is screened out from a node set V with the capability of executing a computing taskgShortest Path set PnThe nodes in (1) contain nodes c,1 and 3, and the corresponding computing resources are 100, 10 and 2, respectively, because
Figure BDA0002993289170000111
So Vg＝{c,1}。
Referring to FIG. 8(a), to construct a bearer-oriented first auxiliary topology Gc(Vc,Ec) Wherein V iscC,1,3, from PnA middle node; ec＝{(c-3),(1-3),(3-c),(c-1),(1-c)}，EcComprising PnMiddle link and cloud nodes c and VcLinks (3-c), E between nodes of the middle edge layercThe weight of each link in the set is the link delay.
Referring to FIG. 8(b), to construct the second auxiliary topology G oriented to encryptionq(Vq,Eq) Wherein, VqC,1,3, by VcA middle node; ec＝{(c-3),(3-c),(1-3),(3-1),(c-1),(1-c)}，EqComprising EcMiddle link and corresponding reverse link, EqThe weight of each link in the group is related to the remaining key amount α of the key pool on the link, where α is 101.
Further, a first candidate node set V is obtainedt。
Figure BDA0002993289170000112
Setting v as a compute node in a first auxiliary topology Gc(Vc,Ec) Upper handleThe shortest path algorithm is used for acquiring the bearing path P corresponding to the servicetAnd a time delay t.
When the computing node is cloud layer node c, for
Figure BDA0002993289170000113
No transmission is required; for
Figure BDA0002993289170000114
The shortest path is (1-c); for the
Figure BDA0002993289170000115
The shortest path is (c-3). Bearer path P for traffict{ (1-c), (c-3) }; selecting a wavelength {1} on the link (1-c), and selecting a wavelength {2} on the link (c-3); the delay t comprises a transmission delay 6, a calculation delay 2 and a fixed encryption configuration delay 1, i.e. t is 9<And T. Thus, Vt＝{c}。
When the computing node is edge layer node 1, for
Figure BDA0002993289170000116
The shortest path is (c-1); for
Figure BDA0002993289170000117
No transmission is required; for the
Figure BDA0002993289170000118
The shortest path is (1-3). Service bearer path Pt{ (c-1), (1-3) }; selecting a wavelength {1} on the link (c-1), and selecting a wavelength {1} on the link (1-3); the delay t comprises a transmission delay 6, a calculation delay 2 and a fixed encryption configuration delay 1, i.e. t is 9<And T. Thus, Vt＝{c,1}。
Secondly, a second candidate node set V is obtainedk。
Figure BDA0002993289170000119
Setting v as a compute node, in a second auxiliary topology Gq(Vq,Eq) Executing the shortest path algorithm to obtain the QKD path P corresponding to the serviceqAnd key consumption Nq。
When the computing node is cloud layer node c, for
Figure BDA00029932891700001110
No transmission is required; for the
Figure BDA00029932891700001111
The shortest path is (1-c); for the
Figure BDA00029932891700001112
The shortest path is (c-3). QKD path P for trafficq{ (1-c), (c-3) }; the encryption resource can satisfy 5 keys required by the link (1-c) and 2 keys required by the link (c-3); consumption of a secret key N q5+ 2-7. Thus, Vk＝{c}。
When the computing node is edge layer node 1, for
Figure BDA0002993289170000121
The shortest path is (c-1); for the
Figure BDA0002993289170000122
No transmission is required; for the
Figure BDA0002993289170000123
The shortest path is (1-3). QKD path P for trafficq{ (c-1), (1-3) }; the encryption resource can satisfy 10 keys required by the link (c-1) and 2 keys required by the link (1-3); consumption of a secret key Nq10+ 2-12. Thus, Vk＝{c,1}。
According to the second candidate node set VkDetermining a final calculation node V (c, 1)fMake the corresponding key consumption NqAnd minimum. At VkCorresponding key consumption N in { c,1}qThe smallest node is cloud node c, therefore, compute node Vf＝{c}。
Finally, according to VfBearing path P corresponding to { c } and servicetAssign 5 computational units on node c { (1-c), (c-3) };2 storage units on node 3 are allocated; the wavelength {1} on link (1-c) and the wavelength {2} on link (c-3) are allocated.
Further according to Vf(c) and a QKD path P corresponding to the trafficqWith { (1-C), (C-3) }, 5 keys between node pair 1-C and 2 keys between node pair C-3 are distributed, completing the 4C resource allocation for traffic s.
It should be noted that the method of the embodiments of the present disclosure may be executed by a single device, such as a computer or a server. The method of the embodiment can also be applied to a distributed scene and completed by the mutual cooperation of a plurality of devices. In such a distributed scenario, one of the devices may only perform one or more steps of the method of the embodiments of the present disclosure, and the devices may interact with each other to complete the method.
It should be noted that the above describes some embodiments of the disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments described above and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.
Based on the same inventive concept, corresponding to the method of any embodiment, the invention also provides a resource joint distribution device in the quantum key distribution internet of things.
Referring to fig. 9, the device for jointly allocating resources in the quantum key distribution internet of things includes:
the service decomposition module 901: configured to, in response to a business request of the internet of things, decompose a business into a plurality of tasks based on resource requirements of the business, the plurality of tasks including a computing task.
Auxiliary topology building module 902: configured to determine a shortest path set between nodes associated with each of the tasks in the internet of things based on the plurality of tasks; determining a node set capable of executing the computing task according to all the nodes included in the shortest path group;
and constructing a first auxiliary topology facing to the load and a second auxiliary topology facing to the encryption based on a preset network physical topology and the shortest path group.
Route calculation module 903: configured to obtain a first set of candidate nodes via the first auxiliary topology and the set of nodes in response to determining that a bearer path of the service satisfies a requirement of maximum latency and a communication resource constraint;
in response to determining that the quantum key distribution QKD path of the traffic satisfies an encryption resource constraint, obtaining a second set of candidate nodes through the second auxiliary topology and the first set of candidate nodes, and determining a compute node with a minimum key consumption based on the second set of candidate nodes.
The resource allocation module 904: is configured to allocate computing resources, storage resources, communication resources and encryption resources based on the compute node.
For convenience of description, the above devices are described as being divided into various modules by functions, which are described separately.
Of course, the functionality of the various modules may be implemented in the same one or more software and/or hardware implementations of the present disclosure.
The device of the foregoing embodiment is used to implement the resource joint allocation method in the internet of things for quantum key distribution in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiment, which are not described herein again.
Based on the same inventive concept, corresponding to the method of any embodiment described above, the present disclosure further provides an electronic device, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, where when the processor executes the program, the method for jointly allocating resources in an internet of things for quantum key distribution described in any embodiment described above is implemented.
Fig. 10 is a schematic diagram illustrating a more specific hardware structure of an electronic device according to this embodiment, where the electronic device may include: a processor 1010, a memory 1020, an input/output interface 1030, a communication interface 1040, and a bus 1050. Wherein the processor 1010, memory 1020, input/output interface 1030, and communication interface 1040 are communicatively coupled to each other within the device via bus 1050.
The processor 1010 may be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an Application Specific Integrated Circuit (ASIC), or one or more Integrated circuits, and is configured to execute related programs to implement the technical solutions provided in the embodiments of the present disclosure.
The Memory 1020 may be implemented in the form of a ROM (Read Only Memory), a RAM (Random Access Memory), a static storage device, a dynamic storage device, or the like. The memory 1020 may store an operating system and other application programs, and when the technical solution provided by the embodiments of the present specification is implemented by software or firmware, the relevant program codes are stored in the memory 1020 and called to be executed by the processor 1010.
The input/output interface 1030 is used for connecting an input/output module to input and output information. The i/o module may be configured as a component in a device (not shown) or may be external to the device to provide a corresponding function. The input devices may include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output devices may include a display, a speaker, a vibrator, an indicator light, etc.
The communication interface 1040 is used for connecting a communication module (not shown in the drawings) to implement communication interaction between the present apparatus and other apparatuses. The communication module can realize communication in a wired mode (such as USB, network cable and the like) and also can realize communication in a wireless mode (such as mobile network, WIFI, Bluetooth and the like).
Bus 1050 includes a path that transfers information between various components of the device, such as processor 1010, memory 1020, input/output interface 1030, and communication interface 1040.
It should be noted that although the above-mentioned device only shows the processor 1010, the memory 1020, the input/output interface 1030, the communication interface 1040 and the bus 1050, in a specific implementation, the device may also include other components necessary for normal operation. In addition, those skilled in the art will appreciate that the above-described apparatus may also include only those components necessary to implement the embodiments of the present description, and not necessarily all of the components shown in the figures.
The electronic device of the above embodiment is used to implement the resource joint allocation method in the corresponding quantum key distribution internet of things in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiment, which are not described herein again.
Based on the same inventive concept, corresponding to any of the above-mentioned embodiment methods, the present disclosure also provides a non-transitory computer-readable storage medium storing computer instructions for causing the computer to execute the method for joint resource allocation in a quantum key distribution internet of things according to any of the above embodiments.
Computer-readable media of the present embodiments, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device.
The computer instructions stored in the storage medium of the foregoing embodiment are used to enable the computer to execute the resource joint allocation method in the quantum key distribution internet of things according to any of the foregoing embodiments, and have the beneficial effects of corresponding method embodiments, which are not described herein again.
Those of ordinary skill in the art will understand that: the discussion of any embodiment above is meant to be exemplary only, and is not intended to intimate that the scope of the disclosure, including the claims, is limited to these examples; within the idea of the present disclosure, also technical features in the above embodiments or in different embodiments may be combined, steps may be implemented in any order, and there are many other variations of the different aspects of the embodiments of the present disclosure as described above, which are not provided in detail for the sake of brevity.
In addition, well-known power/ground connections to Integrated Circuit (IC) chips and other components may or may not be shown in the provided figures for simplicity of illustration and discussion, and so as not to obscure the embodiments of the disclosure. Furthermore, devices may be shown in block diagram form in order to avoid obscuring embodiments of the present disclosure, and this also takes into account the fact that specifics with respect to implementation of such block diagram devices are highly dependent upon the platform within which the embodiments of the present disclosure are to be implemented (i.e., specifics should be well within purview of one skilled in the art). Where specific details (e.g., circuits) are set forth in order to describe example embodiments of the disclosure, it should be apparent to one skilled in the art that the embodiments of the disclosure can be practiced without, or with variation of, these specific details. Accordingly, the description is to be regarded as illustrative instead of restrictive.
While the present disclosure has been described in conjunction with specific embodiments thereof, many alternatives, modifications, and variations of these embodiments will be apparent to those of ordinary skill in the art in light of the foregoing description. For example, other memory architectures (e.g., dynamic ram (dram)) may use the discussed embodiments.
The disclosed embodiments are intended to embrace all such alternatives, modifications and variances which fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalents, improvements, and the like that may be made within the spirit and principles of the embodiments of the disclosure are intended to be included within the scope of the disclosure.

Claims (10)

1. A resource joint distribution method in a quantum key distribution Internet of things comprises the following steps:
responding to a service request of the Internet of things, and decomposing the service into a plurality of tasks based on the resource requirement of the service, wherein the tasks comprise calculation tasks;
determining a shortest path group among nodes associated with each task in the Internet of things based on the tasks; traversing all nodes in the shortest path group to obtain a node set capable of executing the computing task based on the nodes meeting computing resource constraint and the links meeting encryption resource constraint in the links connected with the nodes;
constructing a first auxiliary topology facing to load and a second auxiliary topology facing to encryption based on a preset network physical topology and the shortest path group;
in response to determining that the bearer path of the service meets the requirement of maximum delay and communication resource constraints, acquiring a first candidate node set through the first auxiliary topology and the node set;
in response to determining that a Quantum Key Distribution (QKD) path of the traffic satisfies an encryption resource constraint, obtaining a second candidate node set through the second auxiliary topology and the first candidate node set, and determining a compute node with a minimum key consumption based on the second candidate node set;
based on the compute nodes, computing resources, storage resources, communication resources, and encryption resources are allocated.
2. The method of claim 1, wherein said allocating computing, storage, communication and encryption resources based on said compute node comprises:
in response to determining that the bearer path and the QKD path are not empty sets, allocating the computing resources, storage resources, and communication resources according to the bearer path corresponding to the computing node; and distributing the encrypted resources according to the QKD path corresponding to the computing node.
3. The method according to claim 2, wherein the content transmitted, calculated or stored by the service s is denoted as DsAnd is and
Figure FDA0003536527470000011
wherein the content of the first and second substances,
Figure FDA0003536527470000012
which represents the content of the input to the calculation module,
Figure FDA0003536527470000013
which represents the total CPU cycles required for the device,
Figure FDA0003536527470000014
representing the content output by the calculation module.
4. The method of claim 3, wherein the determining a shortest path set between nodes associated with each of the tasks in the internet of things comprises:
calculating K shortest paths from the input end to the output end, K shortest paths between any two nodes in the input end and K shortest paths between any two nodes in the output end, deleting repeated links of the paths to obtain the shortest path group Pn，PnThe expression of (a) is:
Figure FDA0003536527470000021
。
5. the method of claim 4, wherein the expression of the network physical topology is Gp(Vp,Ep) In the formula, VpRepresenting physical nodes in the topology, including cloud-level nodes and edge-level nodes, VpWatch (A)Has the formula of
Figure FDA0003536527470000022
EpRepresenting physical links in the topology, including cloud-layer links and edge-layer links, EpIs expressed as
Figure FDA0003536527470000023
The expression of the first auxiliary topology is Gc(Vc,Ec) In the formula, VcRepresenting nodes in a first auxiliary topology, denoted by PnMiddle node composition, VcIs expressed as
Figure FDA0003536527470000024
EcRepresenting links in a first auxiliary topology, including PnMedium link, and EpV contained incMiddle cloud layer node and VcLinks between nodes of the middle edge layer, EcIs expressed as
Figure FDA0003536527470000025
The expression of the second auxiliary topology is Gq(Vq,Eq) In the formula, VqRepresenting nodes in a second auxiliary topology, denoted by VcMiddle node composition, VqIs expressed as
Figure FDA0003536527470000026
EqRepresenting links in a second auxiliary topology, including EcMiddle link and corresponding reverse link, EqIs expressed as
Figure FDA0003536527470000027
6. The method of claim 3, wherein the obtaining a first set of candidate nodes via the first auxiliary topology and the set of nodes in response to determining that a bearer path of the traffic satisfies a requirement of maximum latency and a communication resource constraint comprises:
the maximum time delay T comprises transmission time delay, calculation time delay and encryption configuration time delay, wherein the transmission time delay is a bearing path P of the servicetMaximum transmission delay in all branches;
when in use
Figure FDA0003536527470000028
Determining the bearing path P of the service when the time delay T is less than or equal to Tt(ii) a Otherwise, determining the bearer path P corresponding to the service on the first auxiliary topology based on each node of the node settAnd a time delay t;
when T is less than or equal to T and the bearing path P of the servicetWhen the communication resource constraint is satisfied, the first candidate node set V is obtained according to the corresponding node of the node sett。
7. The method of claim 6, wherein the obtaining a second set of candidate nodes through the second auxiliary topology and the first set of candidate nodes in response to determining that a Quantum Key Distribution (QKD) path of the traffic satisfies an encryption resource constraint and determining a compute node with a minimum key consumption based on the second set of candidate nodes comprises:
when in use
Figure FDA0003536527470000031
Determining the QKD path P of said trafficqAnd key consumption Nq(ii) a Otherwise, determining the QKD path and the key consumption N corresponding to the traffic on the second auxiliary topology based on each node of the first set of candidate nodesqWherein the key consumption is the sum of the key consumption of each link in the QKD path;
when the QKD path PqAll the links meet the encrypted resource constraint according to the QKD path PqCorresponding to the first candidate node setVtTo obtain a second candidate node set Vk；
At the second candidate node set VkTo select the corresponding key consumption NqThe smallest node is taken as the calculation node Vf。
8. A resource joint distribution device in a quantum key distribution Internet of things comprises:
a service decomposition module: configured to, in response to a service request of the internet of things, decompose a service into a plurality of tasks based on resource requirements of the service, the plurality of tasks including a computing task;
an auxiliary topology construction module: configured to determine a shortest path set between nodes associated with each of the tasks in the internet of things based on the plurality of tasks; traversing all nodes in the shortest path group to obtain a node set capable of executing the computing task based on the nodes meeting computing resource constraint and the links meeting encryption resource constraint in the links connected with the nodes;
constructing a first auxiliary topology facing to the load and a second auxiliary topology facing to the encryption based on a preset network physical topology and the shortest path group;
a route calculation module: configured to obtain a first set of candidate nodes via the first auxiliary topology and the set of nodes in response to determining that a bearer path of the service satisfies a requirement of maximum latency and a communication resource constraint;
in response to determining that a Quantum Key Distribution (QKD) path of the traffic satisfies an encryption resource constraint, obtaining a second candidate node set through the second auxiliary topology and the first candidate node set, and determining a compute node with a minimum key consumption based on the second candidate node set;
a resource allocation module: is configured to allocate computing resources, storage resources, communication resources and encryption resources based on the compute node.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the method of any one of claims 1 to 7 when the program is executed by the processor.
10. A non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the method of any one of claims 1 to 7.
CN202110322124.1A 2021-03-25 2021-03-25 Resource joint distribution method in quantum key distribution Internet of things and related equipment Active CN113179154B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110322124.1A CN113179154B (en) 2021-03-25 2021-03-25 Resource joint distribution method in quantum key distribution Internet of things and related equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110322124.1A CN113179154B (en) 2021-03-25 2021-03-25 Resource joint distribution method in quantum key distribution Internet of things and related equipment

Publications (2)

Publication Number Publication Date
CN113179154A CN113179154A (en) 2021-07-27
CN113179154B true CN113179154B (en) 2022-07-01

Family

ID=76922314

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110322124.1A Active CN113179154B (en) 2021-03-25 2021-03-25 Resource joint distribution method in quantum key distribution Internet of things and related equipment

Country Status (1)

Country Link
CN (1) CN113179154B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114928568B (en) * 2022-06-16 2023-06-09 中国联合网络通信集团有限公司 Routing path selection method, device and computer readable storage medium
CN115473630A (en) * 2022-08-11 2022-12-13 湖北工业大学 Internet of things privacy query method and system based on quantum computing

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109995650A (en) * 2018-01-03 2019-07-09 中兴通讯股份有限公司 Path calculation method and device under Multi-dimensional constraint based on SDN network
CN110224815A (en) * 2019-05-08 2019-09-10 北京邮电大学 QKD network resource allocation method and system
WO2019201441A1 (en) * 2018-04-19 2019-10-24 Telefonaktiebolaget Lm Ericsson (Publ) Path computation engine and method of configuring an optical path for quantum key distribution
CN110768837A (en) * 2019-10-28 2020-02-07 北京邮电大学 Network slice virtual resource allocation method, system and device
CN111711517A (en) * 2020-07-23 2020-09-25 苏州大学 Quantum key distribution protection method and system based on service security level

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2536608A (en) * 2014-11-28 2016-09-28 Aria Networks Ltd Optimizing the topology of a network with variable traffic demands
CN109743164B (en) * 2019-01-24 2020-09-25 北京邮电大学 Channel resource allocation method and device in quantum satellite network
CN111049645A (en) * 2019-11-20 2020-04-21 北京邮电大学 Internet of things system and quantum key distribution method and device thereof

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109995650A (en) * 2018-01-03 2019-07-09 中兴通讯股份有限公司 Path calculation method and device under Multi-dimensional constraint based on SDN network
WO2019201441A1 (en) * 2018-04-19 2019-10-24 Telefonaktiebolaget Lm Ericsson (Publ) Path computation engine and method of configuring an optical path for quantum key distribution
CN110224815A (en) * 2019-05-08 2019-09-10 北京邮电大学 QKD network resource allocation method and system
CN110768837A (en) * 2019-10-28 2020-02-07 北京邮电大学 Network slice virtual resource allocation method, system and device
CN111711517A (en) * 2020-07-23 2020-09-25 苏州大学 Quantum key distribution protection method and system based on service security level

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
Synchronization and Resource Allocation in Quantum Key Distribution Optical Networks;Zexian Li等;《2020 IEEE Computing, Communications and IoT Applications (ComComAp)》;20201231;全文 *

Also Published As

Publication number Publication date
CN113179154A (en) 2021-07-27

Similar Documents

Publication Publication Date Title
US11374776B2 (en) Adaptive dataflow transformation in edge computing environments
US20220182291A1 (en) End-to-end quality of service in edge computing environments
Zhang et al. Toward a unified elastic computing platform for smartphones with cloud support
WO2016161677A1 (en) Traffic offload method and system
CN111651253A (en) Computing resource scheduling method and device
US9621425B2 (en) Method and system to allocate bandwidth for heterogeneous bandwidth request in cloud computing networks
CN113179154B (en) Resource joint distribution method in quantum key distribution Internet of things and related equipment
CN112910639B (en) Quantum encryption service transmission method under multi-domain scene and related equipment
CN114268371B (en) Quantum channel resource allocation method and device and electronic equipment
Huang et al. Converged network-cloud service composition with end-to-end performance guarantee
WO2021190179A1 (en) Synchronous processing method and related apparatus
CN110020846A (en) A kind of transferred account service processing method and system
US11044308B2 (en) Dynamic gateway communication protocol control via software defined radio implemented devices
Khan et al. An efficient resource allocation mechanism for time-sensitive data in dew computing
CN112800455A (en) Distributed data storage system, set-top box equipment and data storage method
CN112910642B (en) Quantum key-based resource allocation method and system for Internet of things
US20220224762A1 (en) Queuing control for distributed compute network orchestration
CN114816744A (en) Memory control method and device, storage medium and electronic equipment
Fadlallah et al. Towards mobile collaborative autonomous networks using peer-to-peer communication
CN115002215A (en) Cloud-based government and enterprise-oriented resource allocation model training method and resource allocation method
CN115348324B (en) Method and device for determining optimized scheduling strategy and electronic equipment
Minerva et al. Virtualizing network
CN117202364A (en) Joint allocation method of network general memory computing resources and related equipment
CN115529125A (en) Route determining method of distributed quantum entanglement distribution network and related equipment
CN115361284A (en) Deployment adjustment method of virtual network function based on SDN

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