Wu, Chun-HungChun-HungWuChiang, KuoKuoChiangYu, Ruo-JianRuo-JianYuSHENG-DE WANG2018-09-102018-09-102008-1202533839http://scholars.lib.ntu.edu.tw/handle/123456789/343066https://www.scopus.com/inward/record.uri?eid=2-s2.0-57149130805&doi=10.1080%2f02533839.2008.9671475&partnerID=40&md5=4c63801a4cd94f27d5d7ec383bc3193fUnstructured peer-to-peer (P2P) overlay architectures are attracting more and more attention. In order to solve the topology mismatch problem, many approaches take locality information into account when designing peer-to-peer overlay networks. In this paper, we not only exploit locality but also take resource types into consideration. Taking advantage of data replication, selective search, clustering, and interest groups, we can improve the search performance of unstructured P2P networks. Simulation results show that our algorithm is better than the mOverlay network in the number of messages per search while it maintains almost the same hit ratio and comes with competitive locality properties. © 2008, Taylor & Francis Group, LLC.application/pdfapplication/pdfLocality aware; Overlay networks; Peer-to-peer networks; Resource awareDistributed computer systems; Overlay networks; Data replication; Locality aware; Peer-to-peer overlay networks; Resource aware; Search performance; Topology mismatch problem; Unstructured P2P network; Unstructured peer-to-peer; Peer to peer networksjournal article10.1080/02533839.2008.96714752-s2.0-57149130805WOS:000263264000011