On the Analysis of Satisfaction for Web Services Selection

Lim, Erbin; Thiran, Philippe; Maamar, Zakaria

doi:10.1109/scc.2012.66

Cited by 14 publications

(15 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thereafter, we measure the average output performance of tasks in communities following different methods. Figure 4 depicts the results of optimal -core, Depth-1 Convex-Checker, Depth-2 Convex-Checker, 3-Way Satisfaction [7], and 2 Player Non-Cooperative [8] methods in one grand community with many web services scenario. For -core, we assign to 15% of total community worth, = 0.15 × v(C), which allows subsets of the coalition to gain maximum 15% of v(C).…”

Section: Experimental Results and Analysismentioning

confidence: 99%

“…In this direction, recently [7], [8] proposed mechanisms to help users and services maximize their gain. A two-player non-cooperative game between web services and community master was introduced in [8].…”

Section: Introduction and Related Workmentioning

confidence: 99%

“…In [7] a 3-way satisfaction approach for selecting web services has been proposed. In this approach, the authors proposed a web service selection process that the community masters can use.…”

Section: Introduction and Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Efficient Coalition Formation for Web Services

Asl

Otrok

Mizouni

2013

2013 IEEE International Conference on Services Computing

Self Cite

View full text Add to dashboard Cite

Web services are loosely-coupled business applications willing to cooperate in distributed settings within different groups called communities. Communities aim to provide better visibility, efficiency, market share and total payoff. There are a number of proposed mechanisms and models on aggregating web services and making them cooperate within their communities. However, forming optimal and stable communities as coalitions to maximize individual and group efficiency and income has not been addressed yet. In this paper, we propose an efficient coalition formation mechanism using cooperative game-theoretic techniques. We propose a mechanism for community membership requests and selections of web services in the scenarios where established communities already exist. Moreover, we analyze the scenarios where communities are not established yet and web services can form multiple communities. The ultimate objective is to develop a mechanism for web services to form stable groups allowing them to maximize their efficiency and generate nearoptimal (welfare-maximizing) communities. The theoretical and simulation results show that our algorithms provide web services and community owners with applicable and nearoptimal decision making mechanisms.

show abstract

Section: Experimental Results and Analysismentioning

confidence: 99%

Section: Introduction and Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Coalition Formation for Web Services

Asl

Otrok

Mizouni

2013

2013 IEEE International Conference on Services Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [4,17], the historical QoS records are recruited to evaluate the trust of web service, by comparing the historical QoS data with the SLA promised by service providers. In [18], the service is evaluated by considering its historical QoS records.…”

Section: B Related Work and Comparison Analysismentioning

confidence: 99%

“…However, there are so many web services that share the same or similar functionality [1][2][3] on the Internet, it becomes a necessity to evaluate and rank all the functional-qualified candidate services, based on their QoS (Quality of Service) information. However, due to the reasons of unstable network running environment or the exaggerated propaganda, the QoS information advertised by service providers is not always trusted [4][5], which blocks a user from selecting a trusted web service.…”

Section: Introductionmentioning

confidence: 99%

A Evaluation Method for Web Service with Large Numbers of Historical Records

Xia

et al. 2014

2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications

View full text Add to dashboard Cite

Due to the unstable network environment or fake advertisement reasons, the QoS (quality of service) data published by web service providers is not always trusted. Therefore, it is a promising way to evaluate the service quality, based on the historical QoS records generated from the past invocations of web services. However, for some web services with large numbers of historical QoS records, the evaluation efficiency is usually low and cannot meet the quick response requirements of subsequent service selection or service composition. Moreover, it will lead to the 'Lagging Effect' (i.e., the evaluation result cannot reflect the up-todate quality change trend of a web service), if all the historical QoS records are treated equally in service evaluation. In view of these challenges, a novel service evaluation method named Partial-HR (Partial Historical Records-based service evaluation method) is put forward in this paper, by which only partial important historical QoS records are employed to evaluate the service quality. Finally, a set of experiments are designed and deployed to validate the feasibility of our proposal, in terms of evaluation accuracy and efficiency.

show abstract

Dynamic formation of service communities in the cloud under distribution and incomplete information settings

Khosrowshahi-Asl¹,

Estrada

Otrok

et al. 2017

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

Communities that gather functionally identical or complementary cloud services aim to provide better visibility, efficiency, and market share. This paper investigates the issue of forming these communities in distributed decision-making settings under incomplete information. By incomplete information, we mean only partial information about the individual performance of cloud services within communities and about how they will behave within these communities is available. Forming communities in these particular settings is still an open problem. Most of the existing models require real-time global knowledge about the services and high computational complexity, which makes the community formation extremely hard and time-consuming. In this paper, we propose a strategic Distributed Decision-making Mechanism (DDM) that regulates the cloud services decision-making process. DDM first generates an initial set of data based on information obtained from existing cloud services regarding their single and cooperative efficiency. By analyzing this set and on the basis of a distance function, the decision-making mechanism with regard to which community to form is implemented as a decision profile of strategies and their expected utility computed in terms of computational efficiency. DDM efficiently and systematically helps 1) communities find appropriate cloud services to invite as new members and 2) single services find suitable communities to join. To evaluate the proposed mechanism, we performed experiments using real data including 142 users and 4,000 cloud services obtained from the CloudArmor, CloudHarmony, and WS-DREAM datasets. The experimental results show that our algorithms outperform the existing solutions. KEYWORDScloud services, community of services, distributed decision-making INTRODUCTIONModern applications are nowadays developed using service-oriented architecture and web services technology where the cloud's software as a service (SaaS) is de facto model for software delivery. To make these applications more efficient and adaptive to the new requirements of being flexible, cloud services including SaaS, platform as a service (PaaS), infrastructure as a service (IaaS), and backend as a service (BaaS) are shifted, from the perspective of design and engineering, from passive and individual components to intelligent, autonomous, and collaborative-based components having common goals. 1-4 Being collaborative entails new challenges towards analyzing the overall system's performance in achieving these common goals. 5-8 One of the initiatives towards strengthening this collaboration among services is capitalizing on the concept of virtual communities. 9-11 A virtual community of services is defined as a group of services offering similar and complementary functionalities with diverse non-functional properties that can ensure the inter-community and intra-community interactions.Despite the existence of the current services technologies (e.g., WSDL and SOAP) and cloud developments that enable developing virtual commun...

show abstract

On the Analysis of Satisfaction for Web Services Selection

Cited by 14 publications

References 27 publications

Efficient Coalition Formation for Web Services

Efficient Coalition Formation for Web Services

A Evaluation Method for Web Service with Large Numbers of Historical Records

Dynamic formation of service communities in the cloud under distribution and incomplete information settings

Contact Info

Product

Resources

About