基于CAN的Web QoS管理模型

Shidong Zhang, Bai Wang, G. Wei, Chao Xin
{"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}
引用次数: 3

摘要

在将P2P技术应用于服务发现方面已经做了大量的工作。然而,它们大多只关注功能属性的匹配。提出了一种基于内容可寻址网络的web服务质量模型。在该模型中,我们使用非功能属性值来匹配web服务,并给出了服务匹配算法。由于某些节点接收到更多的查询请求,我们通过分配虚拟权值来降低这些节点的查询成本。通过与KD-Tree模型的比较,验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Web QoS Management Model Based on CAN
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信