Dongbo Yang, Zhongxin Wu, Bingheng Yan, D. Qian, Zhongzhi Luan
{"title":"基于代理的动态Web服务选择MADM方法","authors":"Dongbo Yang, Zhongxin Wu, Bingheng Yan, D. Qian, Zhongzhi Luan","doi":"10.1109/APSCC.2007.35","DOIUrl":null,"url":null,"abstract":"How to dynamically select and bind Web services to ideally meet the requirement of service consumers becomes a more and more important topic in Web service community. This paper presents an agent-based multi-attributes decision making (MADM) approach for the dynamic Web service selection. We summarize the Web service selection problem to MADM problem, and take an agent which executes periodically measurement tasks to avoid the imprecise of decision matrix (DM) as well as to remove unavailable services from the service registry. In addition, we introduce a simplified but effective method to work out the MADM problem. Experiments shows this approach is effective in particular for services which have multiple duplicates and require mass computation under unstable network environment.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Agent-Based MADM Approach to the Dynamic Web Service Selection\",\"authors\":\"Dongbo Yang, Zhongxin Wu, Bingheng Yan, D. Qian, Zhongzhi Luan\",\"doi\":\"10.1109/APSCC.2007.35\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"How to dynamically select and bind Web services to ideally meet the requirement of service consumers becomes a more and more important topic in Web service community. This paper presents an agent-based multi-attributes decision making (MADM) approach for the dynamic Web service selection. We summarize the Web service selection problem to MADM problem, and take an agent which executes periodically measurement tasks to avoid the imprecise of decision matrix (DM) as well as to remove unavailable services from the service registry. In addition, we introduce a simplified but effective method to work out the MADM problem. Experiments shows this approach is effective in particular for services which have multiple duplicates and require mass computation under unstable network environment.\",\"PeriodicalId\":370753,\"journal\":{\"name\":\"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APSCC.2007.35\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APSCC.2007.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Agent-Based MADM Approach to the Dynamic Web Service Selection
How to dynamically select and bind Web services to ideally meet the requirement of service consumers becomes a more and more important topic in Web service community. This paper presents an agent-based multi-attributes decision making (MADM) approach for the dynamic Web service selection. We summarize the Web service selection problem to MADM problem, and take an agent which executes periodically measurement tasks to avoid the imprecise of decision matrix (DM) as well as to remove unavailable services from the service registry. In addition, we introduce a simplified but effective method to work out the MADM problem. Experiments shows this approach is effective in particular for services which have multiple duplicates and require mass computation under unstable network environment.