Routing is the process of moving a packet from source to destination. This process is implemented by special devices called routers. These routers have memory to save the algorithms that control the routers. Therefore, routing aims to find good paths from source to destination. Network packet routing, a classic computer science problem, has had two significant approaches: link-state and distance-vector. By using the simulation technique and by using C++language this paper illustrates the ways in which these two protocols operate and demonstrate their different complexities of operation in terms of time variation and quantities of information processed.