A fast string search algorithm for deep packet classification

  • Authors:

  • A. N. M. Ehtesham Rafiq;M.Watheq El-Kharashi;Fayez Gebali

  • Affiliations:

  • Department of Electrical and Computer Engineering, University of Victoria, P.O. Box 3055 STN CSC, Victoria, BC, Canada V8W 3P6;Department of Computer and Systems Engineering, Ain Shams University, Cairo, Egypt;Department of Electrical and Computer Engineering, University of Victoria, P.O. Box 3055 STN CSC, Victoria, BC, Canada V8W 3P6

  • Venue:
  • Computer Communications
  • Year:
  • 2004

Quantified Score

Hi-index 0.24

Visualization

Abstract

In this paper, we propose a string search algorithm that requires reduced time complexity. It also requires a small amount of memory, and shows better performance than any other algorithm for deep packet classification based on their payload data. The proposed algorithm is based on Boyer-Moore algorithm but requires a much reduced number of operations. In addition, our algorithm's memory requirement is lower than Boyer-Moore algorithm without sacrificing its speed. We have done time complexity analysis and verified its time complexities through extensive numerical simulations. These simulations show that our algorithm's performance is better for long text, long pattern, and large alphabet set and even its worst case time complexity linearly depends on the length of the text.