This paper proposes a network routing algorithm REI which has autonomous adaptability to network traffic conditions. When a routing node has some different paths to a given destination, we can evaluate these paths in terms of their latency (delay time) information which will be given from inbound data packets. Based on the path evaluation by latency, every node works as a distributed autonomous agent for adaptive routing. By network simulations to compare with conventional and enhanced OSPFs, we show that the multi-agents based routing algorithm has better adaptability in congested path avoidance and network load balancing. © 2011 IEEE.