A fast string search algorithm for computer networking

Computer networking requires a fast string search algorithm for fast data manipulation. This algorithm must perform better in long text, long pattern, and large alphabet set. Boyer-Moore algorithm is one of the most suitable string search algorithms to meet these criteria. But, its implementation complexity is very high. We have simplified the Boyer-Moore algorithm, reduced memory requirement, and made it faster. Time complexity analysis was performed and then verified by numerical simulations. Simulation results also prove our algorithm's superior performance in the networking environment.