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

被引:5
作者
Rasool, Raihan Ur [1 ,3 ]
Najam, Maleeha [2 ]
Ahmad, Hafiz Farooq [3 ]
Wang, Hua [1 ]
Anwar, Zahid [4 ,5 ]
机构
[1] Victoria Univ, Melbourne, Vic, Australia
[2] FJWU, Dept Elect Engn, Rawalpindi, Pakistan
[3] King Faisal Univ, Coll Comp Sci & Informat Technol, Al Hasa, Saudi Arabia
[4] Natl Univ Sci & Technol, Islamabad, Pakistan
[5] Fontbonne Univ, St Louis, MO USA
关键词
Deep packet inspection; Deep content inspection; Efficient matching; !text type='Java']Java[!/text]Script Object Notation ([!text type='JSON']JSON[!/text]); Pattern matching; Parsing; Regular expressions; DFA;
D O I
10.1007/s12652-018-0869-1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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
页数:19
相关论文
共 30 条
  • [21] Behavior Monitoring Using Learning Techniques and Regular-Expressions-Based Pattern Matching
    Shin, Hyo-Sang
    Turchi, Dorio
    He, Shaoming
    Tsourdos, Antonios
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2019, 20 (04) : 1289 - 1302
  • [22] A Power-Efficient Approach to TCAM-based Regular Expression Matching
    Huang, Kun
    Chen, Xuelin
    2018 27TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATION AND NETWORKS (ICCCN), 2018,
  • [23] PTME: A Regular Expression Matching Engine Based on Speculation and Enumerative Computation on FPGA
    Sun, Mingqian
    Xie, Guangwei
    Zhang, Fan
    Gho, Wei
    Fan, Xitian
    Li, Tianyang
    Chen, Li
    Du, Jiayu
    ACM TRANSACTIONS ON RECONFIGURABLE TECHNOLOGY AND SYSTEMS, 2024, 18 (01)
  • [24] A text pattern-matching tool based on Parsing Expression Grammars
    Ierusalimschy, Roberto
    SOFTWARE-PRACTICE & EXPERIENCE, 2009, 39 (03) : 221 - 258
  • [25] Efficient regular expression matching over hybrid dictionary-based compressed data
    Sun, Xiuwen
    Mo, Da
    Wu, Di
    Ye, Chunhui
    Yu, Qingying
    Cui, Jie
    Zhong, Hong
    JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2023, 215
  • [26] NOVEL PERSPECTIVES ON PATTERN MATCHING WITH ASSOCIATION-BASED SYMMETRIC LOCAL FEATURES
    Dev, Deep S.
    Kisku, Dakshina R.
    Gupta, Phalguni
    INTERNATIONAL JOURNAL OF ROBOTICS & AUTOMATION, 2022, 37 (03) : 236 - 247
  • [27] Efficient compression algorithm for ternary content addressable memory-based regular expression matching
    Liu, Shu
    Su, Shaojing
    Liu, Desheng
    Huang, Zhiping
    Xiao, Mingyan
    ELECTRONICS LETTERS, 2017, 53 (03) : 152 - 154
  • [28] ENREM: An efficient NFA-based regular expression matching engine on reconfigurable hardware for NIDS
    Tran Trung Hieu
    Tran Ngoc Thinh
    Tomiyama, Shigenori
    JOURNAL OF SYSTEMS ARCHITECTURE, 2013, 59 (4-5) : 202 - 212
  • [29] A Novel Algorithm for Pattern Matching Based on Modified Push-Down Automata
    Lounnas, Bilal
    Bouderah, Brahim
    Moussaoui, Abdelouahab
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2016, 32 (02) : 403 - 424
  • [30] An Extensible, Regular-Expression-Based Tool for Multi-Language Mutant Generation
    Groce, Alex
    Holmes, Josie
    Marinov, Darko
    Shi, August
    Zhang, Lingming
    PROCEEDINGS 2018 IEEE/ACM 40TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING - COMPANION (ICSE-COMPANION, 2018, : 25 - 28