Article (Scientific journals)
Convergence Analysis of Evolutionary Algorithms in the Presence of Crash-Faults and Cheaters
Muszynski, Jakub; Varrette, Sébastien; Bouvry, Pascal et al.
2012In Computers and Mathematics with Applications, 64 (12), p. 3805 - 3819
Peer Reviewed verified by ORBi
 

Files


Full Text
camwa6922.pdf
Publisher postprint (432.88 kB)
Request a copy

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Evolutionary algorithms; Algorithmic based fault tolerance; Desktop grids and volunteer computing systems; Convergence proof
Abstract :
[en] This paper analyzes the fault-tolerance nature of Evolutionary Algorithms (EAs) when executed in a distributed environment subjected to malicious acts. More precisely, the inherent resilience of EAs against two types of failures is considered: (1) crash faults, typically due to resource volatility which lead to data loss and part of the computation loss; (2) cheating faults, a far more complex kind of fault that can be modeled as the alteration of output values produced by some or all tasks of the program being executed. This last type of failure is due to the presence of cheaters on the computing platform. Most often in Global Computing (GC) systems such as BOINC, cheaters are attracted by the various incentives provided to stimulate the volunteers to share their computing resources: cheaters typically seek to obtain rewards with little or no contribution to the system. In this paper, the Algorithm-Based Fault Tolerance (ABFT) aspects of EAs against the above types of faults is characterized. Whereas the inherent resilience of EAs has been previously observed in the literature, for the first time, a formal analysis of the impact of the considered faults over the executed EA including a proof of convergence is proposed in this article. By the variety of problems addressed by EAs, this study will hopefully promote their usage in the future developments around distributed computing platform such as Desktop Grids and Volunteer Computing Systems or Cloud systems where the resources cannot be fully trusted.
Disciplines :
Computer science
Identifiers :
UNILU:UL-ARTICLE-2012-1269
Author, co-author :
Muszynski, Jakub ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Varrette, Sébastien ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Bouvry, Pascal ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Seredynski, Franciszek;  Cardinal Stefan Wyszynski University, Department of Mathematics and Natural Sciences, Woycickiego 1/3, 01-938 Warsaw, Poland
Khan, Samee U.;  North Dakota State University (NDSU), Fargo, ND 58108–6050, USA
External co-authors :
yes
Language :
English
Title :
Convergence Analysis of Evolutionary Algorithms in the Presence of Crash-Faults and Cheaters
Publication date :
2012
Journal title :
Computers and Mathematics with Applications
ISSN :
1873-7668
Publisher :
Pergamon Press - An Imprint of Elsevier Science
Volume :
64
Issue :
12
Pages :
3805 - 3819
Peer reviewed :
Peer Reviewed verified by ORBi
Name of the research project :
evoperf
Funders :
IRP
Available on ORBilu :
since 15 March 2017

Statistics


Number of views
91 (1 by Unilu)
Number of downloads
0 (0 by Unilu)

Scopus citations®
 
9
Scopus citations®
without self-citations
6
OpenCitations
 
6
WoS citations
 
7

Bibliography


Similar publications



Contact ORBilu