Details
| Original language | English |
|---|---|
| Title of host publication | Proceedings |
| Subtitle of host publication | 2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013 |
| Pages | 2730-2734 |
| Number of pages | 5 |
| Publication status | Published - 2013 |
| Event | 2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013 - Manchester, United Kingdom (UK) Duration: 13 Oct 2013 → 16 Oct 2013 |
Publication series
| Name | Proceedings - 2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013 |
|---|
Abstract
Fault-tolerant networks are needed for many applications, such as telecommunication networks, electricity networks, traffic, routing, and others. Several methods for constructing fault-tolerant networks out of a given set of nodes exists, among them classical graph-theoretic ones, and recently also several bio-inspired algorithms have been proposed for such application. In this paper we study the performance of these different algorithms for that problem. Performance means that both the complexity of the algorithm for a given problem size and the quality of the generated networks are taken into account. We conclude that classical algorithms that belong to a certain complexity class are efficient for small to medium size problems, while at some point, for larger problems, bio-inspired solutions are more efficient to get a solution.
Keywords
- (k, Fault tolerant network, Physarum polycephalum, Slime mold, T)-spanner
ASJC Scopus subject areas
- Computer Science(all)
- Human-Computer Interaction
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
Proceedings: 2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013. 2013. p. 2730-2734 6722219 (Proceedings - 2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - Applicability of bio-inspired and graph-theoretic algorithms for the design of complex fault-tolerant graphs
AU - Becker, Matthias
AU - Schmidt, Florian
AU - Szczerbicka, Helena
PY - 2013
Y1 - 2013
N2 - Fault-tolerant networks are needed for many applications, such as telecommunication networks, electricity networks, traffic, routing, and others. Several methods for constructing fault-tolerant networks out of a given set of nodes exists, among them classical graph-theoretic ones, and recently also several bio-inspired algorithms have been proposed for such application. In this paper we study the performance of these different algorithms for that problem. Performance means that both the complexity of the algorithm for a given problem size and the quality of the generated networks are taken into account. We conclude that classical algorithms that belong to a certain complexity class are efficient for small to medium size problems, while at some point, for larger problems, bio-inspired solutions are more efficient to get a solution.
AB - Fault-tolerant networks are needed for many applications, such as telecommunication networks, electricity networks, traffic, routing, and others. Several methods for constructing fault-tolerant networks out of a given set of nodes exists, among them classical graph-theoretic ones, and recently also several bio-inspired algorithms have been proposed for such application. In this paper we study the performance of these different algorithms for that problem. Performance means that both the complexity of the algorithm for a given problem size and the quality of the generated networks are taken into account. We conclude that classical algorithms that belong to a certain complexity class are efficient for small to medium size problems, while at some point, for larger problems, bio-inspired solutions are more efficient to get a solution.
KW - (k
KW - Fault tolerant network
KW - Physarum polycephalum
KW - Slime mold
KW - T)-spanner
UR - http://www.scopus.com/inward/record.url?scp=84893583741&partnerID=8YFLogxK
U2 - 10.1109/SMC.2013.465
DO - 10.1109/SMC.2013.465
M3 - Conference contribution
AN - SCOPUS:84893583741
SN - 9780769551548
T3 - Proceedings - 2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013
SP - 2730
EP - 2734
BT - Proceedings
T2 - 2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013
Y2 - 13 October 2013 through 16 October 2013
ER -