We investigate the performance bounds for interference adaptive dynamic channel assignment (IA-DCA) in wireless networks. IA-DCA has been shown to be a promising radio resource allocation strategy in reuse systems such as FDMA and TDMA. Our previous work has presented the upper performance bound for IA-DCA algorithms by assuming an idealized dynamic channel allocation scheme with instant interference adaptation and maximal packing (IAMP) which not only provided guaranteed quality of received signal but also minimum co-channel reuse distance. The two sets of performance bounds previously obtained are results of exact analysis of the asymptotic case where the number of channels is assumed to be infinite, and an approximate analysis corresponding to the practical case where the number of channels is finite. In this paper, we study the practical case and verify the bounds by means of computer analysis. The idealized IAMP method is modified such that it reaches reasonable accuracy within finite simulation time.