测量MapReduce环境中入侵检测规则之间的相似度

Research in Adaptive and Convergent Systems Pub Date : 2014-10-05 DOI:10.1145/2663761.2664224

Inbok Lee, P. Do, Phuoc Do, Sung-Ryul Kim

{"title":"测量MapReduce环境中入侵检测规则之间的相似度","authors":"Inbok Lee, P. Do, Phuoc Do, Sung-Ryul Kim","doi":"10.1145/2663761.2664224","DOIUrl":null,"url":null,"abstract":"In this paper, we define the problem of measuring similarities among intrusion detection rules written as regular expression. It is related to the efficiency of the intrusion detection systems. To avoid complex computation related to regular expression, we propose a simple heuristic of considering them as strings and computing the distances among them. We implemented this idea on MapReduce environment.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Measuring similarities among intrusion detection rules on the MapReduce environment\",\"authors\":\"Inbok Lee, P. Do, Phuoc Do, Sung-Ryul Kim\",\"doi\":\"10.1145/2663761.2664224\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we define the problem of measuring similarities among intrusion detection rules written as regular expression. It is related to the efficiency of the intrusion detection systems. To avoid complex computation related to regular expression, we propose a simple heuristic of considering them as strings and computing the distances among them. We implemented this idea on MapReduce environment.\",\"PeriodicalId\":120340,\"journal\":{\"name\":\"Research in Adaptive and Convergent Systems\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Research in Adaptive and Convergent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2663761.2664224\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Research in Adaptive and Convergent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2663761.2664224","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文定义了用正则表达式表示的入侵检测规则之间的相似度度量问题。这关系到入侵检测系统的效率。为了避免与正则表达式相关的复杂计算，我们提出了一个简单的启发式方法，将它们视为字符串并计算它们之间的距离。我们在MapReduce环境中实现了这个想法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Measuring similarities among intrusion detection rules on the MapReduce environment

In this paper, we define the problem of measuring similarities among intrusion detection rules written as regular expression. It is related to the efficiency of the intrusion detection systems. To avoid complex computation related to regular expression, we propose a simple heuristic of considering them as strings and computing the distances among them. We implemented this idea on MapReduce environment.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Research in Adaptive and Convergent Systems

自引率

0.00%

发文量