This paper addresses the problem of reducing the routing information in multicomputer networks. After an overview of the routing problems, the approach followed here is interval routing, initially proposed by Santoro and Khatib, developed by van Leeuwen and Tan and improved by Mugwaneza and Juganaru. Tests and measures are provided for these methods in case of regular topologies. As fault tolerance is a major feature in a distributed system special cases as breakdowns of links or nodes were considered. Finally the comparative study among the three mentioned techniques is done and proves that the method described by Mugwaueza (1993) is the most efficient.