上述方法可以计算有向节点对到任一目标块的最优标志 和 ，若最优标志以有

上述方法可以计算有向节点对到任一目标块的最优标志 和 ，若最优标志以有向节点对为单位进行存储，则在寻路过程中每拓展到一个节点都要读取文件，从而导致I/O耗时增大，且读取数据的利用率不高。

結果 (英文) 1:

These methods for computing the nodes for the best mark of any destination and, if the best flag is stored in nodes, for which are in the process of path-finding each expanded to a node to read the file, which results in increase of I/O time, and reads the data utilization is not high.

結果 (英文) 2:

These methods have to be calculated on either a target node optimal block signs and, if the flag to have the best units of storage node, then expand the routing process to a node for each file to be read, causing I / O time-consuming increased, and the read data efficiency is not high.

結果 (英文) 3:

The method can calculate the optimal node on arrival to sign a target block and, if the optimal symbol to store as a unit to have to the node, in the wayfinding process of each to a node to read the file, resulting in increased I/O time consuming, and read data utilization rate is not high.