The enormous increase in the number of transistors on the same chip and the increase of the size of system itself, lead to many challenges to the implementation of system on chip (SoC). These challenges are solved using the network on chip (NoC) methodology. NoC routing is one of the most important challenges that affect the whole performance of the system. Routing can affect the latency of the network as well as the entire throughput of the network. In this paper, a comparative study is performed on XY routing algorithm (deterministic routing algorithm), fully adaptive XY routing algorithm (fully adaptive routing algorithm) and two partially adaptive routing algorithms (the odd even (OE) routing algorithm and the abacus turn model (AbTM) routing algorithm) on four traffic patterns. Booksim simulator is used in this work. The AbTM proved to be the best routing algorithm for the performance of the NoC in terms of latency and throughput. The AbTM settles the network to maximum even adaptiveness among all its routers.