QoS-Based Dynamic Web Service Composition with Ant Colony Optimization

Zhang, Wei; Chang, Carl K.; Feng, Taiming; Jiang, Hsin-yi

doi:10.1109/compsac.2010.76

Cited by 102 publications

(68 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After thoroughly reviewing the effectiveness of the above listed QoS based Composition mechanisms, techniques employed by Lu Li et al [4], Farhan Hassan Khan et al [5] and Wei Zhang et al [15] were found to be more practical & effective in terms of quality. Techniques employed by Pooya Shahrokh et al [13] and Rajesh Karunamurthy et al [8] were found to satisfy user's requirements (functional aspects) more efficiently than other methods.…”

Section: Comparison Of Effectiveness Of Composition Methodsmentioning

confidence: 99%

“…Wei Zhang et al [15] presented a QoS based technique for composition of web services dynamically and used Ant Colony Optimization (ACO) algorithm for optimization. An updated version of ACO algorithm was presented to resolve the multi objective optimization problem aiming to find better settlements between multiple objectives.…”

Section: Related Workmentioning

confidence: 99%

“…In [15] authors have proposed a technique of performing decomposition of composite services into parallel execution paths, having a general flow structure. The problem of dynamic composition of web services for each execution path was considered to be a multi-objective optimization problem and hence presented MO¬_ACO (Multi-Objective Ant Colony Optimization) algorithm to handle it.…”

Section: ) Based On Ant Colony Optimizationmentioning

confidence: 99%

See 2 more Smart Citations

Computation of QoS While Composing Web Services

Shabbar¹,

Shrimali²,

Sha³

2017

ijacsa

View full text Add to dashboard Cite

Abstract-Composition of web services has emerged as a fast growing field of research since an atomic service in its entirety is not capable to perform a specific task. Composition of web services is a process where a set of web services, heterogeneous in nature, are clubbed together in order to perform a specific task. Individually, Component web services may be performing well as far as Quality of Service (QoS) is concerned but the core issue is that while composing, do they satisfy Users requirements in terms of QoS? Computation of QoS while composing web services appears to be a big challenge. A lot of research work in this regard, has already been undertaken to come out with new, innovative and credible solutions for the same. This Paper presents a thorough review-study of different frameworks, architectures, methodologies and algorithms suggested by different researchers in their efforts to compute the overall QoS while composing web services. Moreover, Effectiveness of different methods in terms of QoS while composing is also presented.

show abstract

Section: Comparison Of Effectiveness Of Composition Methodsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: ) Based On Ant Colony Optimizationmentioning

confidence: 99%

See 1 more Smart Citation

Computation of QoS While Composing Web Services

Shabbar¹,

Shrimali²,

Sha³

2017

ijacsa

View full text Add to dashboard Cite

show abstract

“…The chaos variable was used to improve the efficiency of the ACO algorithm. The study [16] used a k-tuple pheromone to represent k objectives. A strategy was adopted to decompose a composite service with a general composition structure into parallel execution paths.…”

Section: A Ant Colony Optimization Algorithmsmentioning

confidence: 99%

Bio‐inspired cost‐aware optimization for data‐intensive service provision

Wang

Shen

Luo

2015

Concurrency and Computation

View full text Add to dashboard Cite

The use of Big Data and the development of cloud computing have led to greater dependence on dataintensive services. Each service may actually request or create a large amount of data sets. The scope, number, and complexity of data-intensive services are all set to soar in the future. To compose these services will be more challenging. Issues of autonomy, scalability, adaptability, and robustness, become difficult to resolve. Bio-inspired algorithms can overcome the new challenging requirements of data-intensive service provision. It is useful for the provision of data-intensive services to explore key features and mechanisms of biological systems and accordingly to add biological mechanisms to services. In this paper, we will discuss singleobjective and multi-objective data-intensive service provision problems based on bio-inspired algorithms. Further, we will propose an ant-inspired negotiation approach. Finally, this paper points out future research topics. The use of Big Data and the development of cloud computing have led to greater dependence on data-intensive services. Each service may actually request or create a large amount of data sets. The scope, number, and complexity of data-intensive services are all set to soar in the future. To compose these services will be more challenging. Issues of autonomy, scalability, adaptability, and robustness, become difficult to resolve. Bio-inspired algorithms can overcome the new challenging requirements of data-intensive service provision. It is useful for the provision of data-intensive services to explore key features and mechanisms of biological systems and accordingly to add biological mechanisms to services. In this paper, we will discuss single-objective and multi-objective data-intensive service provision problems based on bio-inspired algorithms. Further, we will propose an ant-inspired negotiation approach. Finally, this paper points out future research topics. Disciplines Engineering | Science and Technology Studies

show abstract

“…Because of the different QoS attributes of services, plus the dependency constraint and the conflict constraint among services, the service composition problem has been regarded in related work as a multiple-choice knapsack problem [13], a constrained combinatorial optimization problem [23], a weighted directed acyclic graph problem [29], a knapsack problem [32], and a multi-dimensional and/or multi-objective problem [34]. The paper [30] considered web service composition problem as an optimization problem for the first time.…”

Section: Related Workmentioning

confidence: 99%

Towards minimizing cost for composite data-intensive services

Wang

Shen

et al. 2013

Proceedings of the 2013 IEEE 17th International Conference on Computer Supported Cooperative Work in Design (CSCWD)

View full text Add to dashboard Cite

Service-oriented architecture provides a scalable and flexible framework to implement loosely-coupled, standardsbased, and protocol-independent distribute computing. One of its goals is to make use of the distributed services with different functions to build powerful composite services. Service composition is an active research area in service computing. Existing research is endeavoring to achieve desirable quality levels of composite services and improve customer satisfaction. The service-oriented approach using Web services is also of great interest for the implementation of data-intensive processes such as data mining, image processing and so on. The applications based on data-intensive services have become the most challenging type of applications in service-oriented architecture. The servicebased strategy provides maximal flexibility when designing dataintensive applications. Huge data sets that may each be replicated in different data centers have to be exchanged between several services. The movement of mass data influences the performance of the whole application process. Especially, the price of services will be different when considering the data center's locations and the amount of data transferred. It is desirable to find the cost minimized service composition solution in service computing. Therefore, how to select appropriate data centers for accessing data replicas and how to select services with lowest associated costs are emerging problems when deploying and executing dataintensive service applications. In this paper, a cost minimizing service composition model for dataintensive applications is proposed. Furthermore, how bio-inspired algorithms offer advantages to solve such problems will be presented. Abstract-Service-oriented architecture provides a scalable and flexible framework to implement loosely-coupled, standardsbased, and protocol-independent distribute computing. One of its goals is to make use of the distributed services with different functions to build powerful composite services. Service composition is an active research area in service computing. Existing research is endeavoring to achieve desirable quality levels of composite services and improve customer satisfaction. The service-oriented approach using Web services is also of great interest for the implementation of data-intensive processes such as data mining, image processing and so on. The applications based on data-intensive services have become the most challenging type of applications in service-oriented architecture. The servicebased strategy provides maximal flexibility when designing dataintensive applications. Huge data sets that may each be replicated in different data centers have to be exchanged between several services. The movement of mass data influences the performance of the whole application process. Especially, the price of services will be different when considering the data center's locations and the amount of data transferred. It is desirable to find the cost minimized service composition soluti...

show abstract

QoS-Based Dynamic Web Service Composition with Ant Colony Optimization

Cited by 102 publications

References 16 publications

Computation of QoS While Composing Web Services

Computation of QoS While Composing Web Services

Bio‐inspired cost‐aware optimization for data‐intensive service provision

Towards minimizing cost for composite data-intensive services

Contact Info

Product

Resources

About