Show simple item record

dc.contributor.authorRandles, Martin
dc.contributor.authorLamb, David J.
dc.contributor.authorOdat, Enas M.
dc.contributor.authorTaleb-Bendiab, Azzelarabe
dc.date.accessioned2015-08-02T09:15:04Z
dc.date.available2015-08-02T09:15:04Z
dc.date.issued2011-03
dc.identifier.citationRandles, M., Lamb, D., Odat, E., & Taleb-Bendiab, A. (2011). Distributed redundancy and robustness in complex systems. Journal of Computer and System Sciences, 77(2), 293–304. doi:10.1016/j.jcss.2010.01.008
dc.identifier.issn00220000
dc.identifier.doi10.1016/j.jcss.2010.01.008
dc.identifier.urihttp://hdl.handle.net/10754/561599
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.
dc.publisherElsevier BV
dc.subjectAlgebraic connectivity
dc.subjectDistributed redundancy
dc.subjectObserver system
dc.subjectSystem robustness
dc.titleDistributed redundancy and robustness in complex systems
dc.typeArticle
dc.contributor.departmentComputer Science Program
dc.identifier.journalJournal of Computer and System Sciences
dc.contributor.institutionSchool of Computing and Mathematical Sciences, Liverpool John Moores University, Liverpool, United Kingdom
kaust.personOdat, Enas M.


This item appears in the following Collection(s)

Show simple item record