Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/32796
- Title
- Exploring tradeoffs in pleiotrophy and redundancy using evolutionary computing
- Author/Creator
-
Berryman, Matthew J.;
Khoo, Wei-Li;
Nguyen, Hiep;
O'Neill, Erin;
Allison, Andrew G.;
Abbott, Derek
- Description
- Evolutionary computation algorithms are increasingly being used to solve optimization problems as they have many advantages over traditional optimization algorithms. In this paper we use evolutionary computation to study the trade-off between pleiotropy and redundancy in a client-server based network. Pleiotropy is a termused to describe components that perform multiple tasks, while redundancy refers to multiple components performing one same task. Pleiotropy reduces cost but lacks robustness, while redundancy increases network reliability but is more costly, as together, pleiotropy and redundancy build flexibility and robustness into systems. Therefore it is desirable to have a network that contains a balance between pleiotropy and redundancy. We explore how factors such as link failure probability, repair rates, and the size of the network influence the design choices that we explore using genetic algorithms.
- Relation
- BioMEMS, and Nanotechnology: SPIE Conference 2003. BioMEMS and Nanotechnology: Proceedings of SPIE, Vol. 5275 (Perth, W.A. 10-12 December, 2003) p. 49-58
- Publisher Link
- http://dx.doi.org/10.1117/12.548001
- Date
- 2004
- Publisher
- SPIE: International Society for Optical Engineering
- Keyword(s)
-
evolutionary computation algorithms;
optimization problems;
pleiotrophy;
redundancy;
genetic algorithms
- Resource Type
- conference paper
- Identifier
- http://hdl.handle.net/1959.13/32796
- Identifier
- ISSN:0277-786X
- Full Text
52 Visitors
60 Hits
1 Downloads
