Fault Tolerant Mechanism of Bio-inspired Adaptive Routing System

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.

[1]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[2]  Kwan Lawrence Yeung,et al.  Traffic distribution over equal-cost-multi-paths , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[3]  K. Goh,et al.  Universal behavior of load distribution in scale-free networks. , 2001, Physical review letters.

[4]  R. Pastor-Satorras,et al.  Critical load and congestion instabilities in scale-free networks , 2003 .

[5]  A. Barabasi,et al.  Global organization of metabolic fluxes in the bacterium Escherichia coli , 2004, Nature.

[6]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[7]  Masahiro Okamoto,et al.  A Bio-inspired Adaptive Routing based on Enzymatic Feedback Control Mechanism in Metabolic Networks , 2007, IMECS.

[8]  Bo Hu,et al.  Efficient routing on complex networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Renata Teixeira,et al.  In search of path diversity in ISP networks , 2003, IMC '03.

[10]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

[11]  Masahiro Okamoto,et al.  Design of Bio-inspired Fault-tolerant Adaptive Routing Based on Enzymatic Feedback Control in the Cell: Towards Averaging Load Balance in the Network , 2007, 2007 Frontiers in the Convergence of Bioscience and Information Technologies.

[12]  Beom Jun Kim,et al.  Path finding strategies in scale-free networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Jun Ohkubo,et al.  Scale-free property of optimal network for packet flow by a packet routing control , 2005 .

[14]  Angela L. Chiu,et al.  Overview and Principles of Internet Traffic Engineering , 2002, RFC.

[15]  Masahiro Okamoto,et al.  Biologically Inspired Adaptive Routing by Mimicking Enzymic Feedback Control Mechanism in the Cell , 2006, BioADIT.

[16]  Tao Zhou,et al.  Efficient routing on scale-free networks based on local information , 2006 .

[17]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[18]  Rami Cohen,et al.  The Internet Dark Matter - on the Missing Links in the AS Connectivity Map , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[19]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[20]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.