This paper presents a simulation analysis of hash-based algorithms for the search of routing tables in ATM routing switches. First, we give a brief summary of basic ATM issues of interest for us. Then, a detailed description of the simulation environment used in the project is given. Simulation analysis for the basic solution and two improvements was done, and results are presented and discussed. This paper is a part of a bigger project dealing with implementation of ATM routing tables.