Web Services Allocation Guided by Reputation in Distributed SOA-Based Environments

V. Serbanescu, Florin Pop, V. Cristea, O. Achim
{"title":"Web Services Allocation Guided by Reputation in Distributed SOA-Based Environments","authors":"V. Serbanescu, Florin Pop, V. Cristea, O. Achim","doi":"10.1109/ISPDC.2012.25","DOIUrl":null,"url":null,"abstract":"Web services have become one of the easiest ways to fulfill a wide range of tasks in multiple domains of work. Their availability has increased significantly through Service-Oriented Distributed Environments that have become standard platforms for their deployment. At the same time, the clients impose their own constraints and expectations from services and require from the service providers the best replica to satisfy these constraints. The main objective of this paper is implementing a model that can effectively and accurately determine the best endpoint of a web service deployed in a distributed environment depending on the constraints of the client that invoked it and the capabilities of each replica. While each service offers different functions and each client may have different preferences for these functions, our method is independent from the services' features and computes the best replica using properties that define quality (processing time), business constraints (service price) and client's feedback (reputation), properties available for every service. The model is purely mathematical and will produce the same results for the same values of these criteria regardless of the particular functionality of the service invoked. The algorithm behind the model also takes into account the properties specific to distributed environments such as the client's location or the load limitations of the system on which the replica is deployed. This paper describes this algorithm, along with its architecture of the system that implements the model and the tests conducted.","PeriodicalId":287900,"journal":{"name":"2012 11th International Symposium on Parallel and Distributed Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 11th International Symposium on Parallel and Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPDC.2012.25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

Web services have become one of the easiest ways to fulfill a wide range of tasks in multiple domains of work. Their availability has increased significantly through Service-Oriented Distributed Environments that have become standard platforms for their deployment. At the same time, the clients impose their own constraints and expectations from services and require from the service providers the best replica to satisfy these constraints. The main objective of this paper is implementing a model that can effectively and accurately determine the best endpoint of a web service deployed in a distributed environment depending on the constraints of the client that invoked it and the capabilities of each replica. While each service offers different functions and each client may have different preferences for these functions, our method is independent from the services' features and computes the best replica using properties that define quality (processing time), business constraints (service price) and client's feedback (reputation), properties available for every service. The model is purely mathematical and will produce the same results for the same values of these criteria regardless of the particular functionality of the service invoked. The algorithm behind the model also takes into account the properties specific to distributed environments such as the client's location or the load limitations of the system on which the replica is deployed. This paper describes this algorithm, along with its architecture of the system that implements the model and the tests conducted.
分布式soa环境中基于声誉的Web服务分配
Web服务已经成为在多个工作领域中完成广泛任务的最简单方法之一。它们的可用性通过面向服务的分布式环境得到了显著提高,这些环境已经成为它们部署的标准平台。同时,客户端对服务施加自己的约束和期望,并要求服务提供者提供满足这些约束的最佳副本。本文的主要目标是实现一个模型,该模型可以根据调用web服务的客户端的约束和每个副本的功能,有效而准确地确定部署在分布式环境中的web服务的最佳端点。虽然每个服务提供不同的功能,每个客户端可能对这些功能有不同的偏好,但我们的方法独立于服务的特性,并使用定义质量(处理时间)、业务约束(服务价格)和客户反馈(声誉)的属性来计算最佳副本,这些属性可用于每个服务。该模型是纯粹的数学模型,无论调用的服务的特定功能如何,对于这些标准的相同值都会产生相同的结果。模型背后的算法还考虑了特定于分布式环境的属性,例如客户端的位置或部署副本的系统的负载限制。本文描述了该算法,并给出了实现该模型的系统架构和所进行的测试。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信