Fault tolerant mechanism of bio-inspired adaptive routing system

Akiyuki Iwasaki, Tadasuke Nozoe, Takashi Kawauchi, Masahiro Okamoto

Research output: Contribution to conferencePaper

Abstract

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.

Original languageEnglish
Publication statusPublished - Jan 1 2008
Event3rd International ICST Conference on Bio-Inspired Models of Network, Information and Computing Systems, BIONETICS 2008 - Hyogo, Japan
Duration: Nov 25 2008Nov 28 2008

Other

Other3rd International ICST Conference on Bio-Inspired Models of Network, Information and Computing Systems, BIONETICS 2008
CountryJapan
CityHyogo
Period11/25/0811/28/08

Fingerprint

Routing algorithms
Fault tolerance
Internet
Feedback
Complex networks
Adaptive algorithms
Metabolic Networks and Pathways
Feedback control
Enzymes
Throughput
Network protocols
Substrates
Costs
Costs and Cost Analysis

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications
  • Information Systems
  • Health Informatics

Cite this

Iwasaki, A., Nozoe, T., Kawauchi, T., & Okamoto, M. (2008). Fault tolerant mechanism of bio-inspired adaptive routing system. Paper presented at 3rd International ICST Conference on Bio-Inspired Models of Network, Information and Computing Systems, BIONETICS 2008, Hyogo, Japan.

Fault tolerant mechanism of bio-inspired adaptive routing system. / Iwasaki, Akiyuki; Nozoe, Tadasuke; Kawauchi, Takashi; Okamoto, Masahiro.

2008. Paper presented at 3rd International ICST Conference on Bio-Inspired Models of Network, Information and Computing Systems, BIONETICS 2008, Hyogo, Japan.

Research output: Contribution to conferencePaper

Iwasaki, A, Nozoe, T, Kawauchi, T & Okamoto, M 2008, 'Fault tolerant mechanism of bio-inspired adaptive routing system', Paper presented at 3rd International ICST Conference on Bio-Inspired Models of Network, Information and Computing Systems, BIONETICS 2008, Hyogo, Japan, 11/25/08 - 11/28/08.
Iwasaki A, Nozoe T, Kawauchi T, Okamoto M. Fault tolerant mechanism of bio-inspired adaptive routing system. 2008. Paper presented at 3rd International ICST Conference on Bio-Inspired Models of Network, Information and Computing Systems, BIONETICS 2008, Hyogo, Japan.
Iwasaki, Akiyuki ; Nozoe, Tadasuke ; Kawauchi, Takashi ; Okamoto, Masahiro. / Fault tolerant mechanism of bio-inspired adaptive routing system. Paper presented at 3rd International ICST Conference on Bio-Inspired Models of Network, Information and Computing Systems, BIONETICS 2008, Hyogo, Japan.
@conference{40ae99bea148483891ed61fbdddd176d,
title = "Fault tolerant mechanism of bio-inspired adaptive routing system",
abstract = "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.",
author = "Akiyuki Iwasaki and Tadasuke Nozoe and Takashi Kawauchi and Masahiro Okamoto",
year = "2008",
month = "1",
day = "1",
language = "English",
note = "3rd International ICST Conference on Bio-Inspired Models of Network, Information and Computing Systems, BIONETICS 2008 ; Conference date: 25-11-2008 Through 28-11-2008",

}

TY - CONF

T1 - Fault tolerant mechanism of bio-inspired adaptive routing system

AU - Iwasaki, Akiyuki

AU - Nozoe, Tadasuke

AU - Kawauchi, Takashi

AU - Okamoto, Masahiro

PY - 2008/1/1

Y1 - 2008/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84899659641&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84899659641&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:84899659641

ER -