Provided by: International Journal of Computer Science and Information Technologies
Date Added: Mar 2015
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, many algorithms are used. Breadth First Search (BFS) and Depth First Search (DFS) are two standard search algorithms used to traverse any network. The search performance of these algorithms may differ node to node i.e. the search performance of BFS may be better for some nodes and the search performance of DFS may be better for some other nodes.