We analyze delay based routing in parallel queues wherein packets are routed to the queue(s) with the least estimated delay. We argue that the average queue occupancy converges to a Wardrop equilibrium profile , but the instantaneous profile may show either convergence or relaxation oscillations depending on the traffic. The analysis uses concepts and results from dynamical systems theory applied to limiting differential equations for the averaging iterations.