This paper proposes a dynamical fast IP-routing lookup algorithm (DFR). This algorithm uses special data structure to construct index table, and can support inserting, deleting and updating route dynamically. DFR algorithm accesses memory at most four times and at least two times for a route look up. DFR is suitable not only for hardware implementation but also for software implementation.