The subject of matching text or search the texts is important topics in the field of computer science and is used in many programs such as Microsoft word program in correct spelling mistakes and search &replace, and other uses. The aim of this study was to learn how to trade-off texts matching algorithms, which are very much where we have the application on Horspool's and Brute Force algorithms. According to the standard number of comparisons and time of execution. The study pointed on preference Horspool's algorithm.

This paper aims to compare between OSPFv2 and OSPFv3, to explain the impact of the change in OSPFv3 packet format and the over load when OSPFv3 uses IPv6 packet instead of IPv4 packet format that was used by OSPFv2, and the comparison based on common OSPF packets that was sent in the same network.