{"title":"基于CAN的Web QoS管理模型","authors":"Shidong Zhang, Bai Wang, G. Wei, Chao Xin","doi":"10.1109/ISCID.2011.44","DOIUrl":null,"url":null,"abstract":"A large number of works have been made to apply P2P techniques into services discovery. However, most of them only focus on matching the functional properties. This paper proposed a web QoS Model, which is based on the content addressable network. In this model, we use the non-functional properties values to match web service, and the service matching algorithm is given out. We assign a virtual weight to reduce the query cost of some nodes since they receive more query request. Experiments with real datasets show the ectiveness of the proposed scheme by comparing with KD-Tree Model.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Web QoS Management Model Based on CAN\",\"authors\":\"Shidong Zhang, Bai Wang, G. Wei, Chao Xin\",\"doi\":\"10.1109/ISCID.2011.44\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A large number of works have been made to apply P2P techniques into services discovery. However, most of them only focus on matching the functional properties. This paper proposed a web QoS Model, which is based on the content addressable network. In this model, we use the non-functional properties values to match web service, and the service matching algorithm is given out. We assign a virtual weight to reduce the query cost of some nodes since they receive more query request. Experiments with real datasets show the ectiveness of the proposed scheme by comparing with KD-Tree Model.\",\"PeriodicalId\":224504,\"journal\":{\"name\":\"2011 Fourth International Symposium on Computational Intelligence and Design\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Fourth International Symposium on Computational Intelligence and Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCID.2011.44\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Fourth International Symposium on Computational Intelligence and Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCID.2011.44","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A large number of works have been made to apply P2P techniques into services discovery. However, most of them only focus on matching the functional properties. This paper proposed a web QoS Model, which is based on the content addressable network. In this model, we use the non-functional properties values to match web service, and the service matching algorithm is given out. We assign a virtual weight to reduce the query cost of some nodes since they receive more query request. Experiments with real datasets show the ectiveness of the proposed scheme by comparing with KD-Tree Model.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
