Dynamically placing tasks into edge nodes based on reputation scores
A computer-implemented method, according to one embodiment, includes dynamically assigning reputation scores to a plurality of tasks, and dynamically assigning reputation scores to a plurality of edge nodes. The method further includes dynamically placing the tasks into the edge nodes based on the reputation scores assigned to the tasks and the reputation scores assigned to the edge nodes. A computer program product, according to one embodiment, includes a computer readable storage medium having program instructions embodied therewith. The program instructions are readable and/or executable by a computer to cause the computer to perform the foregoing method. A system, according to another embodiment, includes a processor, and logic integrated with the processor, executable by the processor, or integrated with and executable by the processor. The logic is configured to perform the foregoing method.
1. A computer-implemented method, comprising:
dynamically assigning first reputation scores to a plurality of tasks;
dynamically assigning second reputation scores to a plurality of edge nodes associated with a predetermined network; and
dynamically placing, within the predetermined network of an edge computing environment, the tasks into a first portion of the edge nodes based on the first reputation scores assigned to the tasks and the second reputation scores assigned to the first portion of the edge nodes,
wherein a result of the dynamic placement includes the tasks not being placed into a second portion of the edge nodes based on the second reputation scores assigned to the second portion of the edge nodes being based on a determined temporary unavailability of the second portion of the edge nodes,
wherein the dynamically assigning the second reputation scores comprises adjusting the second reputation score assigned to a first of the edge nodes in the first portion of the edge nodes in response to a determination that a relative degree of secureness of the first edge node in the first portion of the edge nodes changes.
2. The computer-implemented method of claim 1 , wherein the dynamically assigning the first reputation scores to the plurality of tasks includes: adjusting the reputation score assigned to a first of the tasks in response to a determination that a predetermined parameter of input data and/or output data associated with the first task has changed.
3. The computer-implemented method of claim 2 , wherein the predetermined parameter is selected from the group consisting of: a level of confidentiality, an owner of the input data and/or output data, and whether the input data and/or output data is financial data.
4. The computer-implemented method of claim 1 , wherein the dynamically assigning the second reputation scores further comprises: adjusting the the second reputation score assigned to the first edge node in the first portion of the edge nodes in response to a determination that a predetermined parameter of the predetermined network has changed, wherein the first edge node is connected to the predetermined network.
5. The computer-implemented method of claim 4 , wherein the predetermined parameter is an availability of backup resources or an owner of the predetermined network.
6. The computer-implemented method of claim 1 , comprising: determining whether any of the plurality of edge nodes are ever temporarily unavailable; in response to a determination that the first edge node in the first portion of the edge nodes is temporarily unavailable, basing the reputation score of the first edge node in the first portion of the edge nodes on the determined temporary unavailability; and in response to a determination that a first edge node in the second portion of the edge nodes is temporarily unavailable, basing the reputation score of the first edge node in the second portion of the edge nodes on the determined temporary unavailability.
7. The computer-implemented method of claim 6 , wherein basing the reputation score of the first edge node in the first portion of the edge nodes on the determined temporary unavailability includes: setting the reputation score of the first edge node in the first portion of the edge nodes to a first value for a duration of time that the first edge node in the first portion of the edge nodes is available, and adjusting the reputation score of the first edge node in the first portion of the edge nodes to a second value in response to a determination that the first edge node in the first portion of the edge nodes becomes temporary unavailable.
8. The computer-implemented method of claim 6 , wherein the dynamically placing, within the predetermined network, the tasks into the edge nodes associated with the predetermined network includes: identifying a first of the tasks that is assigned a first reputation score; identifying a second edge node in the first portion of the edge nodes that is assigned a second reputation score for a duration of time that the first edge node in the first portion of the edge nodes is available and a third reputation score for a duration of time that the first edge node in the first portion of the edge nodes is unavailable; wherein the first reputation score matches the second reputation score; determining whether the first task can be completed during the duration of time that the first edge node in the first portion of the edge nodes is available; in response to a determination that the first task can be completed during the duration of time that the first edge node in the first portion of the edge nodes is available, placing the first task into the first edge node in the first portion of the edge nodes; and in response to a determination that the first task cannot be completed during the duration of time that the first edge node in the first portion of the edge nodes is available, not placing the first task into the first edge node in the first portion of the edge nodes.
9. The computer-implemented method of claim 6 , wherein the dynamically placing, within the predetermined network, the tasks into the edge nodes based on the first reputation scores assigned to the tasks and the second reputation scores assigned to the edge nodes includes: determining, for each of the tasks, one of the edge nodes having a reputation score that is greater than or equal to the reputation score of the task; and dynamically placing the task into the determined edge node.
10. A computer program product, the computer program product comprising a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions readable and/or executable by a computer to cause the computer to:
dynamically assign, by the computer, first reputation scores to a plurality of tasks;
dynamically assign, by the computer, second reputation scores to a plurality of edge nodes associated with a predetermined network; and
dynamically place, by the computer, within the predetermined network of an edge computing environment, the tasks into a first portion of the edge nodes based on the first reputation scores assigned to the tasks and the second reputation scores assigned to the first portion of the edge nodes,
wherein a result of the dynamic placement includes the tasks not being placed into a second portion of the edge nodes based on the second reputation scores assigned to the second portion of the edge nodes being based on a determined temporary unavailability of the second portion of the edge nodes,
wherein the dynamically assigning the second reputation scores comprises adjusting the second reputation score assigned to a first of the edge nodes in the first portion of the edge nodes in response to a determination that a relative degree of secureness of the first edge node in the first portion of the edge nodes changes.
11. The computer program product of claim 10 , wherein the dynamically assigning the first reputation scores to the plurality of tasks includes: adjusting the reputation score assigned to a first of the tasks in response to a determination that a predetermined parameter of input data and/or output data associated with the first task has changed.
12. The computer program product of claim 11 , wherein the predetermined parameter is selected from the group consisting of: a level of confidentiality, an owner of the input data and/or output data, and whether the input data and/or output data is financial data.
13. The computer program product of claim 10 , wherein the dynamically assigning the second reputation scores further comprises: adjusting the the second reputation score assigned to the first edge node in the first portion of the edge nodes in response to a determination that a predetermined parameter of the predetermined network has changed, wherein the first edge node is connected to the predetermined network.
14. The computer program product of claim 13 , wherein the predetermined parameter is an availability of backup resources or an owner of the predetermined network.
15. The computer program product of claim 10 , comprising: the program instructions readable and/or executable by the computer to cause the computer to: determine, by the computer, whether any of the plurality of edge nodes are ever temporarily unavailable; in response to a determination that the first edge node in the first portion of the edge nodes is temporarily unavailable, base, by the computer, the reputation score of the first edge node in the first portion of the edge nodes on the determined temporary unavailability; and in response to a determination that a first edge node in the second portion of the edge nodes is temporarily unavailable, base, by the computer, the reputation score of the first edge node in the second portion of the edge nodes on the determined temporary unavailability.
16. The computer program product of claim 15 , wherein basing the reputation score of the first edge node in the first portion of the edge nodes on the determined temporary unavailability includes: setting the reputation score of the first edge node in the first portion of the edge nodes to a first value for a duration of time that the first edge node in the first portion of the edge nodes is available, and adjusting the reputation score of the first edge node in the first portion of the edge nodes to a second value in response to a determination that the first edge node in the first portion of the edge nodes becomes temporary unavailable.
17. The computer program product of claim 15 , wherein the dynamically placing, within the predetermined network, the tasks into the edge nodes associated with the predetermined network includes: identifying a first of the tasks that is assigned a first reputation score; identifying a second edge node in the first portion of the edge nodes that is assigned a second reputation score for a duration of time that the first edge node is available and a third reputation score for a duration of time that the first edge node in the first portion of the edge nodes is unavailable; wherein the first reputation score matches the second reputation score; determining whether the first task can be completed during the duration of time that the first edge node in the first portion of the edge nodes is available; in response to a determination that the first task can be completed during the duration of time that the first edge node in the first portion of the edge nodes is available, placing the first task into the first edge node in the first portion of the edge nodes; and in response to a determination that the first task cannot be completed during the duration of time that the first edge node in the first portion of the edge nodes is available, not placing the first task into the first edge node in the first portion of the edge nodes.
18. The computer program product of claim 15 , wherein the dynamically placing, within the predetermined network, the tasks into the edge nodes based on the first reputation scores assigned to the tasks and the second reputation scores assigned to the edge nodes includes: determining, for each of the tasks, one of the edge nodes having a reputation score that is greater than or equal to the reputation score of the task; and dynamically placing the task into the determined edge node.
19. A system, comprising:
a plurality of edge nodes;
a processor; and
logic integrated with the processor, executable by the processor, or integrated with and executable by the processor, the logic being configured to:
dynamically assign first reputation scores to a plurality of tasks;
dynamically assign second reputation scores to the plurality of edge nodes associated with a predetermined network; and
dynamically place, within the predetermined network of an edge computing environment, the tasks into a first portion of the edge nodes based on the first reputation scores assigned to the tasks and the second reputation scores assigned to the first portion of the edge nodes,
wherein a result of the dynamic placement includes the tasks not being placed into a second portion of the edge nodes based on the second reputation scores assigned to the second portion of the edge nodes being based on a determined temporary unavailability of the second portion of the edge nodes,
wherein the dynamically assigning the second reputation scores comprises adjusting the second reputation score assigned to a first of the edge nodes in the first portion of the edge nodes in response to a determination that a relative degree of secureness of the first edge node in the first portion of the edge nodes changes.
20. The system of claim 19 , wherein the dynamically assigning the first reputation scores to the plurality of tasks includes: adjusting the reputation score assigned to a first of the tasks in response to a determination that a predetermined parameter of input data and/or output data associated with the first task has changed.