In this paper, the authors present routing algorithm for a new class of interconnection network for parallel and distributed systems called Triple Loop (TL). The main motivation behind the design of this interconnection network and routing algorithm was to obtain a constant degree interconnection network and time complexity O (n). The TL (m) network has some remarkable features such as small diameter, regularity, symmetry, scalability and simple routing. The nodes in TL (n) network adopt the Geometric Address Scheme (GAS) as (ring-no, node-no). For example ring 0 nodes are addressed as (0,0), (0,1), (0,2), etc.