<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Discrete and Continuous Models and Applied Computational Science</journal-id><journal-title-group><journal-title xml:lang="en">Discrete and Continuous Models and Applied Computational Science</journal-title><trans-title-group xml:lang="ru"><trans-title>Discrete and Continuous Models and Applied Computational Science</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2658-4670</issn><issn publication-format="electronic">2658-7149</issn><publisher><publisher-name xml:lang="en">Peoples' Friendship University of Russia named after Patrice Lumumba (RUDN University)</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">8830</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Articles</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Статьи</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">Intrusion Detection using Genetically Generated Finite Automata</article-title><trans-title-group xml:lang="ru"><trans-title>Обнаружение сетевых атак с помощью генетически создаваемых конечных автоматов</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Fralenko</surname><given-names>V P</given-names></name><name xml:lang="ru"><surname>Фраленко</surname><given-names>Виталий Петрович</given-names></name></name-alternatives><email>alarmod@pereslavl.ru</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Program System Institute</institution></aff><aff><institution xml:lang="ru">Институт программных систем им. А.К. Айламазяна</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2012-04-15" publication-format="electronic"><day>15</day><month>04</month><year>2012</year></pub-date><issue>4</issue><issue-title xml:lang="en">NO4 (2012)</issue-title><issue-title xml:lang="ru">№4 (2012)</issue-title><fpage>96</fpage><lpage>102</lpage><history><date date-type="received" iso-8601-date="2016-09-08"><day>08</day><month>09</month><year>2016</year></date></history><permissions><copyright-statement xml:lang="ru">Copyright ©; 2012, Фраленко В.П.</copyright-statement><copyright-year>2012</copyright-year><copyright-holder xml:lang="ru">Фраленко В.П.</copyright-holder><ali:free_to_read xmlns:ali="http://www.niso.org/schemas/ali/1.0/"/><license><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">http://creativecommons.org/licenses/by/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rudn.ru/miph/article/view/8830">https://journals.rudn.ru/miph/article/view/8830</self-uri><abstract xml:lang="en">Two new methods for detecting network attacks using genetically generated ﬁnite automata with a) the transitions actions, and b) with the selected states are presented. The ﬁrst method is based on the “ﬂib” model that can predict changes in network activity on the basis of progressived analysis of network records in the KDD-99 format. The second method is an adaptation of a classical ﬁnite automata.</abstract><trans-abstract xml:lang="ru">Представлены два метода обнаружения сетевых атак с помощью генетически создаваемых конечных автоматов с а) действиями на переходах и б) с выделенными состояниями. В основе первого метода лежит модель «флиба», способная предсказывать изменения сетевой активности на основе поступательного анализа сетевых записей в формате KDD-99. Второй метод является адаптацией классического конечного автомата.</trans-abstract><kwd-group xml:lang="en"><kwd>finite automata</kwd><kwd>network attack</kwd><kwd>genetic algorithm</kwd><kwd>mutation</kwd><kwd>crossover</kwd><kwd>recall</kwd><kwd>precision</kwd><kwd>“flib”</kwd><kwd>state</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>конечный автомат</kwd><kwd>сетевая атака</kwd><kwd>генетический алгоритм</kwd><kwd>мутация</kwd><kwd>скрещивание</kwd><kwd>полнота</kwd><kwd>точность</kwd><kwd>«флиб»</kwd><kwd>состояние</kwd></kwd-group></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Городецкий В. И., Котенко И. В., Маньков Е. В. Моделирование распределенных атак на компьютерные сети. — СПб. — С. 56–57.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Галатенко А. В. Об автоматной модели защищенных компьютерных систем. — Т. 4. — М. — С. 263–270.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Automated Generation and Analysis of Attack Graphs / O. Sheyner, S. Jha, J. Wing et al. — Oakland, USA.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>Колегов Д. Н. Проблемы синтеза и анализа графов атак // Вестник ТГУ. Приложение. — 2007. — № 23. — С. 180–188.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Lippmann R., Ingols K., Scott C. Evaluating and Strengthening EnterpriseNetwork Security Using Attack Graphs. — http://citeseerx.ist.psu.edu/ viewdoc/download?doi=10.1.1.92.3063&amp;rep=rep1&amp;type=pdf.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Lippmann R. P., Ingols K. W., Piwowarski K. Practical Attack Graph Generation for Network Defense. — http://citeseerx.ist.psu.edu/viewdoc/download? doi=10.1.1.112.8029&amp;rep=rep1&amp;type=pdf.</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Sheyner O. Scenario Graphs and Attack Graphs: Ph.D. thesis / Carnegie Mellon University. — Pittsburgh, USA, 2004.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Степашкин М. В., Котенко И. В., Богданов В. С. Интеллектуальная система анализа защищенности компьютерных сетей. — М.: Физматлит.</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>Фогель Л., Оуэнс А., Уолш М. Искусственный интеллект и эволюционное моделирование. — М.: Мир, 1969.</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>Шалыто А. А. SWITCH-технология. Алгоритмизация и программирование задач логического управления. — СПб.: Наука, 1998.</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Fifth ACM SIGKDD International Conference on Knowledge Discovery &amp; DataMining. — http://www.sigkdd.org/kdd1999/.</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>Kayacik H. G., Zincir-Heywood A. N., Heywood M. I. Selecting Features for Intrusion Detection: A Feature Relevance Analysis on KDD 99 Intrusion DetectionDatasets. — St. Andrews, Canada.</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>Miller B., Goldberg M. Genetic Algorithms, Tournament Selection, and the Effectsof Noise. — Vol. 3. — Pp. 193–212.</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>De Jong K. An Analysis of the Behavior of a Class of Genetic Adaptive Systems: Ph.D. thesis / University of Michigan. — Ann Arbor, USA, 1975.</mixed-citation></ref><ref id="B15"><label>15.</label><mixed-citation>Graphviz. Graph Visualization Software. — http://www.graphviz.org.</mixed-citation></ref><ref id="B16"><label>16.</label><mixed-citation>The DOT Language. Graph Visualization Software. — http://www.graphviz. org/content/dot-language.</mixed-citation></ref></ref-list></back></article>
