2021
DOI: 10.1016/j.jpdc.2021.02.023
|View full text |Cite
|
Sign up to set email alerts
|

Smart contract service migration mechanism based on container in edge computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(6 citation statements)
references
References 10 publications
0
6
0
Order By: Relevance
“…(3) while the set of VSF k detection ants is not empty do (4) Divide ants into several groups according to the SSE i of each ant and the distributed VSF k concentration (5) Forward different groups to different adjacent nodes of the current node according to equation ( 5); (6) for each DA i do (7) ifVSF k is found then (8) Add this node into SSE i ; (9) Return back to SE u according to SSE i ; (10) Update VSF k concentrations on links according to equation ( 2); (11) Add this node (i.e., ECS) into ECS VSF k ; (12) else ifHDA i ≥ 1then (13) Add this node into SSE i ; (14) Join the next-hop searching; (15) else ifHDA i � 0then ( 16) Die without any feedback; (17) end if (18) end for (19) requests is low, the SPDs of AVDP and AMSP are 0.079 s and 0.085 s, respectively. When the number of service requests reaches the maximum, the SPD of AVDP just increases by 0.061 s, while the SPD of AMSP increases by 0.125 s. Moreover, when the network load is the heaviest, the SPD of AVDP reduces to 0.132 s with the time period increasing; that is, the SPD of AVDP is optimized with time, while that of AMSP increases to 0.235 s in the same situation.…”
Section: E Simulation Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…(3) while the set of VSF k detection ants is not empty do (4) Divide ants into several groups according to the SSE i of each ant and the distributed VSF k concentration (5) Forward different groups to different adjacent nodes of the current node according to equation ( 5); (6) for each DA i do (7) ifVSF k is found then (8) Add this node into SSE i ; (9) Return back to SE u according to SSE i ; (10) Update VSF k concentrations on links according to equation ( 2); (11) Add this node (i.e., ECS) into ECS VSF k ; (12) else ifHDA i ≥ 1then (13) Add this node into SSE i ; (14) Join the next-hop searching; (15) else ifHDA i � 0then ( 16) Die without any feedback; (17) end if (18) end for (19) requests is low, the SPDs of AVDP and AMSP are 0.079 s and 0.085 s, respectively. When the number of service requests reaches the maximum, the SPD of AVDP just increases by 0.061 s, while the SPD of AMSP increases by 0.125 s. Moreover, when the network load is the heaviest, the SPD of AVDP reduces to 0.132 s with the time period increasing; that is, the SPD of AVDP is optimized with time, while that of AMSP increases to 0.235 s in the same situation.…”
Section: E Simulation Resultsmentioning
confidence: 99%
“…Meanwhile, the VSF k concentrations on the corresponding searching links update and the current node (i.e., ECS) is added into ECS VSF k (lines 6-11). Else if HDA i of the ant is not zero, the ant adds this node into its SSE i and joins to the nexthop searching (lines [12][13][14]. Otherwise, the ant dies without any feedback (lines 15-16).…”
Section: E Forwardingmentioning
confidence: 99%
See 2 more Smart Citations
“…It randomly generates uniform discrete values and then determines the devices to be migrated according to these values. In [20], a service migration mechanism based on mobile awareness was proposed to solve the problem of multinode service migration in smart contract edge computing. By optimizing business selection and finding the corresponding destination nodes, delays in business and service can be reduced, and the QoS can be improved.…”
Section: Service Migration In Edge Computingmentioning
confidence: 99%