Peer-to-Peer　(P2P)　network　is　an　important　component　to　implement　next　generation　Internet,　howto　quickly　and　efficiently　search　the　resources　in　P2P　networks　has　become　one　of　the　most　critical　issues,　at　the　same　time,　this　is　one　of　greatest　concern　to　users.　This　paper　describes　the　basic　Flooding　Peer-to-Peer　network　search　method,　followed　by　analysis　of　several　new　search　methods　pros　and　cons,　and　then　further　analysis　of　these　algorithms　is　proposed　based　on　a　cache-based　search　algorithm:　When　a　node　of　the　remaining　load　capacity　is　high,　it　will　become　the　center　node,　and　form　a　joint　topology　area　with　the　nearby　nodes　together,　then　the　center　node　and　ordinary　nodes　also　need　to　store　the　index　cache,　at　the　local　region　the　overheating　resources　will　be　copied　to　the　local　(that　is,　the　contents　cache).　The　simulation　shows　that　the　algorithm　can　effectively　improve　the　hit　rates　of　resources　searching,　reduce　the　query　delay.　©　Springer　Science+Business　Media,　LLC　2011.