On the Solution of the Steiner Tree NP-Hard Problem via Physarum BioNetwork

In the last several years, many algorithms trying to mimic biological processes have been proposed to enhance the performance of communication networks. However, the bio-inspired algorithms represent only the very first step toward the design of a smart adaptive communication network since: 1) they model only a limited set of the rules underlying the biological processes, thus, omitting fundamental functionalities; 2) they are executed on traditional computer architectures, thus, failing to achieve the intrinsic parallelism exhibited by biological processes. To overcome these issues, in this paper, the BioNetwork paradigm is proposed, a novel communication network paradigm in which the traditional network nodes are replaced by living organisms. The BioNetwork paradigm provides very attractive features over traditional network paradigms, such as efficiency, adaptivity, reliability, self-organization, and scalability. Moreover, it has a huge potential since it can be adopted in many different applications, such as health and military ones. In the paper, this potential is shown by proving that a BioNetwork can solve one of the most fundamental NP-hard problems in networks, i.e., the Steiner tree problem. To this aim, a BioNetwork constituted by a unicellular organism, the Physarum polycephalum slime mold, is designed. Throughout the paper, it is proven that a Physarum BioNetwork can solve the Steiner tree problem with an exponential convergence rate toward the optimal solution. The theoretical solutions are validated through a case study.

[1]  T. Nakagaki,et al.  Smart network solutions in an amoeboid organism. , 2004, Biophysical chemistry.

[2]  T. Miyaji,et al.  CAN SOLVE THE SHORTEST PATH PROBLEM ON RIEMANNIAN SURFACE MATHEMATICALLY RIGOROUSLY , 2011 .

[3]  K. Kohama,et al.  Calcium regulation of the actin-myosin interaction of Physarum polycephalum. , 1999, International review of cytology.

[4]  Toshiyuki Nakagaki,et al.  Physarum solver: A biologically inspired method of road-network navigation , 2006 .

[5]  T. Nakagaki,et al.  Intelligence: Maze-solving by an amoeboid organism , 2000, Nature.

[6]  H. Siegelmann,et al.  Analog computation with dynamical systems , 1998 .

[7]  Hava T. Siegelmann,et al.  Computational Complexity for Continuous Time Dynamics , 1999 .

[8]  Toshiyuki Nakagaki,et al.  A Method Inspired by Physarum for Solving the Steiner Problem , 2010, Int. J. Unconv. Comput..

[9]  T. Koch,et al.  SteinLib: An Updated Library on Steiner Tree Problems in Graphs , 2001 .

[10]  Kenji Leibnitz,et al.  Biological principles for future internet architecture design , 2011, IEEE Communications Magazine.

[11]  Andrew Schumann,et al.  Physarum Chip Project: Growing Computers From Slime Mould , 2012, Int. J. Unconv. Comput..

[12]  A. Tero,et al.  A mathematical model for adaptive transport network in path finding by true slime mold. , 2007, Journal of theoretical biology.

[13]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[14]  Özgür B. Akan,et al.  A survey on bio-inspired networking , 2010, Comput. Networks.

[15]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[16]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[17]  Klaus-Peter Zauner,et al.  Robot control with biological cells , 2007, Biosyst..