Decision equations for efficient search algorithms for network security

Generally to secure a network from denial-of-service to Smurf attacks, hackers that perpetrate exploits, it is necessary to perform the tasks like Searching for multiple strings in packet payloads, approximate string matching, IP traceback via probabilistic marking, IP traceback via logging, detecting worms, etc. To execute the tasks there are many algorithms used. The search algorithms like Breadth First Search (BFS), Depth First Search (DFS), Depth First Iterative Deepening (DFID) etc are used to traverse any network like graph or a tree. The performance of one search algorithm may be better than the performance of any other search algorithms for search a particular node of a network. The algorithms, like BFS, DFS and DFID can be used to traverse any tree like network entirely. But it is necessary to determine a best suitable algorithm to search the goal node instead of using any one of them randomly. Then the identified algorithm can be used to traverse the network to reach the goal node.