Efficient algorithms for Web services selection with end-to-end QoS constraints
University of California, Irvine
Indexed incrossref
Abstract
Service-Oriented Architecture (SOA) provides a flexible framework for service composition. Using standard-based protocols (such as SOAP and WSDL), composite services can be constructed by integrating atomic services developed independently. Algorithms are needed to select service components with various QoS levels according to some application-dependent performance requirements. We design a broker-based architecture to facilitate the selection of QoS-based services. The objective of service selection is to maximize an application-specific utility function under the end-to-end QoS constraints. The problem is modeled in two ways: the combinatorial model and the graph model. The combinatorial model defines the…
Citation impact
1,165
total citations
- FWCI
- 202.20
- Percentile
- 100%
- References
- 21
Citations per year
Authors
3Topics & keywords
Topics
Keywords
- Computer science
- Knapsack problem
- Quality of service
- Web service
- Service-oriented architecture
- Distributed computing
- Heuristic
- Graph
UN Sustainable Development Goals
- Industry, innovation and infrastructure
No related works found for this paper.