D-M Algorithm gets the optimized individual cost per sites pair, whereas ILS and LIS Algorithm reduce the total costs to minimum respectively in chain topology and other conditions.

• 其中D-M算法用于得到最小的节点间单次传播开销，而ILS和LIS算法分别在链式结构和更普遍条件下使总传播开销最小。