{"title":"基于特征相似度的非结构化点对点网络搜索","authors":"Chih-Lin Hu, Yi-Hsun Chang, Kuo-Fu Huang","doi":"10.1109/U-MEDIA.2014.54","DOIUrl":null,"url":null,"abstract":"This paper proposes a semantic overlay architecture design in unstructured peer-to-peer network environments. According to semantic distances based on feature similarity of files in a system, this design organizes a semantic peer-to-peer overlay that is capable of delivering query messages to neighboring peers in semantic proximity. In addition, this paper develops a deterministic search approach that can perform content search in a parallel manner over a semantic overlay. Extensive simulations are conducted to examine the proposed deterministic search mechanism in unstructured peer-to-peer networks. Experimental results show that this mechanism can provide satisfactory search services with cost-effective performance in terms of message cost, search latency and hit ratio.","PeriodicalId":174849,"journal":{"name":"2014 7th International Conference on Ubi-Media Computing and Workshops","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Searching with Feature Similarity in Unstructured Peer-to-Peer Networks\",\"authors\":\"Chih-Lin Hu, Yi-Hsun Chang, Kuo-Fu Huang\",\"doi\":\"10.1109/U-MEDIA.2014.54\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a semantic overlay architecture design in unstructured peer-to-peer network environments. According to semantic distances based on feature similarity of files in a system, this design organizes a semantic peer-to-peer overlay that is capable of delivering query messages to neighboring peers in semantic proximity. In addition, this paper develops a deterministic search approach that can perform content search in a parallel manner over a semantic overlay. Extensive simulations are conducted to examine the proposed deterministic search mechanism in unstructured peer-to-peer networks. Experimental results show that this mechanism can provide satisfactory search services with cost-effective performance in terms of message cost, search latency and hit ratio.\",\"PeriodicalId\":174849,\"journal\":{\"name\":\"2014 7th International Conference on Ubi-Media Computing and Workshops\",\"volume\":\"65 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 7th International Conference on Ubi-Media Computing and Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/U-MEDIA.2014.54\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 7th International Conference on Ubi-Media Computing and Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/U-MEDIA.2014.54","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Searching with Feature Similarity in Unstructured Peer-to-Peer Networks
This paper proposes a semantic overlay architecture design in unstructured peer-to-peer network environments. According to semantic distances based on feature similarity of files in a system, this design organizes a semantic peer-to-peer overlay that is capable of delivering query messages to neighboring peers in semantic proximity. In addition, this paper develops a deterministic search approach that can perform content search in a parallel manner over a semantic overlay. Extensive simulations are conducted to examine the proposed deterministic search mechanism in unstructured peer-to-peer networks. Experimental results show that this mechanism can provide satisfactory search services with cost-effective performance in terms of message cost, search latency and hit ratio.