Distributed redundancy and robustness in complex systems

Handle URI:
http://hdl.handle.net/10754/561599
Title:
Distributed redundancy and robustness in complex systems
Authors:
Randles, Martin; Lamb, David J.; Odat, Enas M.; Taleb-Bendiab, Azzelarabe
Abstract:
The uptake and increasing prevalence of Web 2.0 applications, promoting new large-scale and complex systems such as Cloud computing and the emerging Internet of Services/Things, requires tools and techniques to analyse and model methods to ensure the robustness of these new systems. This paper reports on assessing and improving complex system resilience using distributed redundancy, termed degeneracy in biological systems, to endow large-scale complicated computer systems with the same robustness that emerges in complex biological and natural systems. However, in order to promote an evolutionary approach, through emergent self-organisation, it is necessary to specify the systems in an 'open-ended' manner where not all states of the system are prescribed at design-time. In particular an observer system is used to select robust topologies, within system components, based on a measurement of the first non-zero Eigen value in the Laplacian spectrum of the components' network graphs; also known as the algebraic connectivity. It is shown, through experimentation on a simulation, that increasing the average algebraic connectivity across the components, in a network, leads to an increase in the variety of individual components termed distributed redundancy; the capacity for structurally distinct components to perform an identical function in a particular context. The results are applied to a specific application where active clustering of like services is used to aid load balancing in a highly distributed network. Using the described procedure is shown to improve performance and distribute redundancy. © 2010 Elsevier Inc.
KAUST Department:
Computer Science Program
Publisher:
Elsevier BV
Journal:
Journal of Computer and System Sciences
Issue Date:
Mar-2011
DOI:
10.1016/j.jcss.2010.01.008
Type:
Article
ISSN:
00220000
Appears in Collections:
Articles; Computer Science Program

Full metadata record

DC FieldValue Language
dc.contributor.authorRandles, Martinen
dc.contributor.authorLamb, David J.en
dc.contributor.authorOdat, Enas M.en
dc.contributor.authorTaleb-Bendiab, Azzelarabeen
dc.date.accessioned2015-08-02T09:15:04Zen
dc.date.available2015-08-02T09:15:04Zen
dc.date.issued2011-03en
dc.identifier.issn00220000en
dc.identifier.doi10.1016/j.jcss.2010.01.008en
dc.identifier.urihttp://hdl.handle.net/10754/561599en
dc.description.abstractThe uptake and increasing prevalence of Web 2.0 applications, promoting new large-scale and complex systems such as Cloud computing and the emerging Internet of Services/Things, requires tools and techniques to analyse and model methods to ensure the robustness of these new systems. This paper reports on assessing and improving complex system resilience using distributed redundancy, termed degeneracy in biological systems, to endow large-scale complicated computer systems with the same robustness that emerges in complex biological and natural systems. However, in order to promote an evolutionary approach, through emergent self-organisation, it is necessary to specify the systems in an 'open-ended' manner where not all states of the system are prescribed at design-time. In particular an observer system is used to select robust topologies, within system components, based on a measurement of the first non-zero Eigen value in the Laplacian spectrum of the components' network graphs; also known as the algebraic connectivity. It is shown, through experimentation on a simulation, that increasing the average algebraic connectivity across the components, in a network, leads to an increase in the variety of individual components termed distributed redundancy; the capacity for structurally distinct components to perform an identical function in a particular context. The results are applied to a specific application where active clustering of like services is used to aid load balancing in a highly distributed network. Using the described procedure is shown to improve performance and distribute redundancy. © 2010 Elsevier Inc.en
dc.publisherElsevier BVen
dc.subjectAlgebraic connectivityen
dc.subjectDistributed redundancyen
dc.subjectObserver systemen
dc.subjectSystem robustnessen
dc.titleDistributed redundancy and robustness in complex systemsen
dc.typeArticleen
dc.contributor.departmentComputer Science Programen
dc.identifier.journalJournal of Computer and System Sciencesen
dc.contributor.institutionSchool of Computing and Mathematical Sciences, Liverpool John Moores University, Liverpool, United Kingdomen
kaust.authorOdat, Enas M.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.