The　feasibility　of　heterogeneous　search　(HES)　was　evaluated　in　the　context　of　timekeeping　peer-to-peer　networks.　Heterogeneous　search　was　used　to　avoid　unstable　search　performance　by　combining　multiple　search　techniques　among　peers.　HES　technique　depends　on　intelligently　switching　existing　search　techniques　or　corresponding　forwarding　algorithms　whose　function　is　completed　in　the　Module-selector　block.　Three　basic　homogeneous　search　(HMS)　techniques　such　as,　flooding　(FLD),　random-walkers　(RDW),　and　an　intelligent　forward　(IFD)　technique　was　implemented　to　create　HES.　Simulation　techniques　showed　the　benefits　of　HES　over　HMS　in　unstructured　peer-to-peer　networks.