Fault Tolerant Mechanism of Bio-inspired Adaptive Routing System
Fault Tolerant Mechanism of Bio-inspired Adaptive Routing System
复制标题
DOI：
10.4108/icst.bionetics2008.4717
复制
发表时间：
2008-11
期刊：
影响因子：
--
通讯作者：
Akiyuki Iwasaki;T. Nozoe;Takashi Kawauchi;M. Okamoto
中科院分区：
文献类型：
--
作者：
Akiyuki Iwasaki;T. Nozoe;Takashi Kawauchi;M. Okamoto
SPF（最短路径优先）路由算法在Internet上广泛流传。由于该路由算法是为了提高每个数据包的吞吐量而设计的，因此它不适合网络中的平均负载平衡。相反，细胞内的代谢网络可以利用酶反馈机制实现负载平衡并实现容错。也就是说，细胞内的代谢途径由许多酶促反应步骤组成，其中生化反应物（底物）通过独特的酶转化为产物，并且后期步骤的产物经常充当该途径中第一个关键步骤的抑制剂（反馈控制）。这样，途径的最终产物可以控制其自身的合成，并防止中间体和最终产物的无用积累。最近，通过模仿细胞中的酶反馈机制，我们设计了一种容错自适应路由算法，以避免网络中的局部拥塞和时变拥塞。我们通过测试数据的模拟对所提出的算法与SPF和ECMP（等价多路径协议）进行了评估和比较。这项研究展示了所提出的算法如何显着改善延迟、负载平衡和容错的机制。然而，由于互联网中存在大量节点，因此很难将所有现有节点替换为提议的节点。接下来我们将提出一种有效的随机分配自适应节点的方法以及由 100 个节点组成的无标度网络。并且我们描述了所提出的算法的方法，没有任何用处。检查每个节点随时间变化的流量，只关注大约 10% 的排名靠前的大流量节点，我们将这些节点替换为我们提出的自适应节点。通过这样做，我们可以设计一种容错自适应路由，它可以动态平均网络内的负载平衡。
The routing algorithm of SPF (Shortest Path First) is widely distributed in the Internet. Since this routing algorithm is designed in order to improve throughput of each packet, it is not suitable for averaging load balance in the network. On the contrary, metabolic networks in the cell can realize load balance and achieve fault-tolerance by using enzymatic feedback mechanism. That is, a metabolic pathway in the cell is composed of a lot of enzymatic reaction steps in which biochemical reactant (substrate) is converted to the product by unique enzyme, and the product of a late step frequently acts as an inhibitor of the first committed step in this pathway (feedback control). This way, the end product of a pathway controls its own synthesis and prevents useless accumulation of intermediates and of end product. Recently, by mimicking enzymatic feedback mechanism in the cell, we have designed a fault-tolerant adaptive routing algorithm to avoid the partial and time-variant congestions in the network. We evaluated and compared the proposed algorithm with SPF and ECMP (Equal Cost Multi-path Protocol) by using the simulation of test data. This study shows the mechanism how the proposed algorithm can remarkably improve both latency, load balance and fault tolerance. Since there are enormous numbers of nodes in the Internet, however, it is difficult to replace all existing nodes to the proposed nodes. We shall next propose an efficient method for the allocation of adaptive nodes in random and a scale-free network composed of 100 nodes. And we describe the method of the proposed algorithm without useless. Examined the time-variant traffic at each node, and only focused on around 10% top ranked heavy-traffic nodes, we replace such nodes to our proposed adaptive nodes. By doing this, we could design a fault-tolerant adaptive routing, which can dynamically average load-balance within the network.