Research Article
Industry 4.0 Oriented Distributed Infographic Design
Algorithm 2
Data storage node selection.
| (i) | Input: , K, Link bandwidth matrix, node | | (ii) | Output: Optimal nodes set (Opt-nodes set) | | (1) | for i = 1 | | (2) | Unit data access speed = | | (3) | end-for | | (4) | Rank the nodes according to step 2 from largest to smallest, and the ranked set is UDAS_D | | (5) | Opt_nodes set UDAS_D1 | | (6) | delete UDAS_D1 from UDAS_D | | (7) | for i = 1 | | (8) | dis = Dijkstra(A, UDAS_Di) | | (9) | if dis K | | (10) | Opt_nodes set UDAS_Di | | (11) | delete UDAS_Di from UDAS_D | | (12) | end-if | | (13) | end-for | | (14) | return Opt_nodes set |
|
