Genetic algorithms for delays evaluation in networked automation systems

In this paper, we present an approach to evaluate end-to-end delays in packets switching networked automation systems. Since Client-Server paradigm is considered for communication between the field devices, the existing methods of network delays evaluation are hardly applicable to assess realistic u...

Full description

Saved in:
Bibliographic Details
Published inEngineering applications of artificial intelligence Vol. 24; no. 3; pp. 485 - 490
Main Authors Addad, B., Amari, S., Lesage, J-J.
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.04.2011
Elsevier
Subjects
Online AccessGet full text
ISSN0952-1976
1873-6769
1873-6769
DOI10.1016/j.engappai.2010.10.017

Cover

More Information
Summary:In this paper, we present an approach to evaluate end-to-end delays in packets switching networked automation systems. Since Client-Server paradigm is considered for communication between the field devices, the existing methods of network delays evaluation are hardly applicable to assess realistic upper bounds of these delays. In an effort to enhance these delays evaluation, we propose an alternative method. Two algorithms, usually used for optimization problems, exhaustive and genetic algorithms, are then developed to achieve this purpose. While a formal proof about the capacity of the former one to ensure the worst delay overestimation is given, the latter proves to provide faster and more accurate results at the same time. This is shown on a practical case study while comparing the results of the two methods.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0952-1976
1873-6769
1873-6769
DOI:10.1016/j.engappai.2010.10.017