Abstract
By introducing the idea of data compression storage and not distinguishing between intermediate node and termination node, we propose a new matching algorithm for the IP with mask. The worst-case space complexity of the algorithm is fixed. The comparison of the experiments’ result shows that the new algorithm has superior performance. In the case of a large set of patterns, its matching performance is better, which is very suitable for application in IDS systems with large traffic and very strong real-time requirements.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Cheng, J., Ruomeng, X., Tang, X., Sheng, V.S., Cai, C.: An abnormal network flow feature sequence prediction approach for DDoS attacks detection in big data environment. CMC: Comput. Mater. Continua 55(1), 095–119 (2018)
Liu, L., Zhang, H., Yu, X., et al.: An efficient security system for mobile data monitoring. Wirel. Commun. Mob. Comput. 2018, 1–10 (2018)
Kwok, T.T.-O., Kwok, Y.-K.: Design and evaluation of parallel string matching algorithms for network intrusion detection systems. In: Li, K., Jesshope, C., Jin, H., Gaudiot, J.-L. (eds.) NPC 2007. LNCS, vol. 4672, pp. 344–353. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74784-0_35
Guangming, T., Ping, L., Dongbo, B.Y.: Revisiting multiple pattern matching algorithms for multi-core architecture. J. Comput. Sci. Technol. 26(5), 866–874 (2011)
Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. IEEE/ACM Trans. Commun. 18(6), 333–340 (1975)
Wu, S., Manber, U.: A fast algorithm for multi-pattern searching. Technical report TR-94-17 (1994)
Commentz-Walter, B.: A string matching algorithm fast on the average. In: Maurer, Hermann A. (ed.) ICALP 1979. LNCS, vol. 71, pp. 118–132. Springer, Heidelberg (1979). https://doi.org/10.1007/3-540-09510-1_10
Zhang, Y.J., Zhang, W.Z.: A multiple-pattern matching algorithm based on bitmap. J. Harbin Inst. Technol. 42(2), 277–280 (2010)
He, L.T., Fang, B.X., Yu, X.Z.: A time optimal exact string matching algorithm. J. Softw. 92(16), 676–683 (2005)
Zhang W. An improved Wu-Manber multiple patterns matching algorithm[C]// IEEE International Conference on Electronic Information and Communication Technology. IEEE, 2017:91
Baker, Z.K., Prasanna, V.K.: Time and area efficient pattern matching on FPGAs. In: FPGA, pp. 223–232 (2004)
Clark, C., Lee, W., Schimmel, D., Contis, D., Kon, M., Thomas, A.: A hardware platform for network intrusion detection and prevention. In: NP (2004)
Lee, J., Hwang, S.H., Park, N., Lee, S.-W., Jun, S., Kim, Y.S.: A high performance NIDS using FPGA-based regular expression matching. In: SAC 2007, pp. 1187–1191 (2007)
Bremler-Barr, A., David, S.T., Harchol, Y., et al.: Leveraging traffic repetitions for high-speed deep packet inspection. In: Computer Communications, pp. 2578–2586. IEEE (2015)
Acknowledgement
This work was supported by National Key Research & Development Plan of China under Grant 2016QY05X1000, National Natural Science Foundation of China under Grant No. 61771166, CERNET Innovation Project under Grant No. NGII20170101, and Dongguan Innovative Research Team Program under Grant No. 201636000100038.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Guo, G., Xin, Y., Yu, X., Liu, L., Cao, H. (2019). A Fast IP Matching Algorithm Under Large Traffic. In: Sun, X., Pan, Z., Bertino, E. (eds) Artificial Intelligence and Security. ICAIS 2019. Lecture Notes in Computer Science(), vol 11635. Springer, Cham. https://doi.org/10.1007/978-3-030-24268-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-030-24268-8_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-24267-1
Online ISBN: 978-3-030-24268-8
eBook Packages: Computer ScienceComputer Science (R0)