A novel JSON based regular expression language for pattern matching in the internet of things

被引:0
作者
Raihan ur Rasool
Maleeha Najam
Hafiz Farooq Ahmad
Hua Wang
Zahid Anwar
机构
[1] Victoria University,Department of Electronic Engineering
[2] Fatima Jinnah Women University (FJWU),College of Computer Sciences and Information Technology
[3] King Faisal University,undefined
[4] National University of Sciences and Technology,undefined
[5] Fontbonne University,undefined
来源
Journal of Ambient Intelligence and Humanized Computing | 2019年 / 10卷
关键词
Deep packet inspection/Deep content inspection; Efficient matching; JavaScript Object Notation (JSON); Pattern matching; Parsing; Regular expressions;
D O I
暂无
中图分类号
学科分类号
摘要
The Internet of Things work by constantly sensing the physical properties in the vicinity of the user such as ambient light, sounds, motion and temperature. These sensors produce huge volumes of data that has to be efficiently sifted for relevant events required triggering certain actions. In addition, filtering has to be performed to ensure that privacy-sensitive confidential data is not leaked. Efficient and expressive pattern matching is thus a key enabling technology for the full realization of ambient and humanized computing. The bulk of research in this area has focused on the use of specialized hardware and reducing of the memory footprint. Unfortunately, there has been limited work if any on optimizing the core elements of pattern matching- the regular expression language and the compilation process that is responsible for converting patterns into internal data structures. The importance of writing good REs so that on compilation they do not lead to unrealizable data structures is relatively less understood. In the proposed research, we empirically compare different RE processing engines and practically demonstrate that the compilation phase is highly memory intensive and time-consuming as compared to the matching phase -and hence is worth exploring for new techniques and optimizations. As a second important contribution, we propose a novel technique for defining regular expressions by utilizing JavaScript Object Notation. Our evaluation with carefully created patterns shows that the performance of the proposed technique is at par with competing approaches. It is also less ambiguous, extensible, more expressive and much appropriate for defining large and complex patterns.
引用
收藏
页码:1463 / 1481
页数:18
相关论文
共 68 条
  • [1] Aho AV(1975)Efficient string matching: an aid to bibliographic search Commun ACM 18 333-340
  • [2] Corasick MJ(2015)Design and optimizations for efficient regular expression matching in DPI systems Comput Commun 61 103-120
  • [3] Antonello R(1977)A fast string searching algorithm Commun ACM 20 762-772
  • [4] Fernandes S(2015)A memory efficient DFA using compression and pattern segmentation Procedia Comput Sci 56 292-299
  • [5] Sadok D(2008)An improved DFA for fast regular expression matching ACM SIGCOMM Comput Commun Rev 38 29-40
  • [6] Kelner J(2011)Differential encoding of DFAs for fast regular expression matching IEEE/ACM Trans Netw 19 683-694
  • [7] Szabó G(2014)Towards fast and optimal grouping of regular expressions via DFA size estimation IEEE J Sel Areas Commun 32 1797-1809
  • [8] Boyer RS(2015)Speculative parallel pattern matching using stride-k DFA for deep packet inspection J Netw Comput Appl 54 78-87
  • [9] Moore JS(2006)Fast string matching by using probabilities: on an optimal mismatch variant of Horspool’s algorithm Theor Comput Sci 359 329-343
  • [10] Chang YK(2014)Bypassing space explosion in high-speed regular expression matching IEEE/ACM Trans Netw 22 1701-1714