Efficient and adaptive discovery techniques of Web Services handling large data sets
Journal of Systems and Software
A probabilistic approach to modeling and estimating the QoS of web-services-based workflows
Information Sciences: an International Journal
QDSL: a queuing model for systems with differential service levels
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A Declarative Approach for QoS-Aware Web Service Compositions
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Preference Model Driven Services Selection
CAiSE '09 Proceedings of the 21st International Conference on Advanced Information Systems Engineering
An optimal QoS-based Web service selection scheme
Information Sciences: an International Journal
QoS-driven self-healing web service composition based on performance prediction
Journal of Computer Science and Technology
Algorithms for SLA composition to provide inter-domain services
IM'09 Proceedings of the 11th IFIP/IEEE international conference on Symposium on Integrated Network Management
An adaptive algorithm for failure recovery during dynamic service composition
PReMI'07 Proceedings of the 2nd international conference on Pattern recognition and machine intelligence
Mobile Networks and Applications
The Knowledge Engineering Review
A cost model for distributed coverage processing services
Proceedings of the ACM SIGSPATIAL International Workshop on High Performance and Distributed Geographic Information Systems
Contemporary web service discovery mechanisms
Journal of Web Engineering
QoS-driven composite web services selection
ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
QoS aware service composition with multiple quality constraints
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
SOAP request scheduling for differentiated quality of service
WISE'05 Proceedings of the 2005 international conference on Web Information Systems Engineering
QoS-Driven web service composition with inter service conflicts
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
QoS-Driven grid resource selection based on novel neural networks
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
SENECA – simulation of algorithms for the selection of web services for compositions
TES'05 Proceedings of the 6th international conference on Technologies for E-Services
Reconfigurable composition of web services using belief revision through genetic algorithm
SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part I
A2thOS: availability analysis and optimisation in SLAs
International Journal of Network Management
Dynamic service selection with end-to-end constrained uncertain qos attributes
ICSOC'12 Proceedings of the 10th international conference on Service-Oriented Computing
A priority-based transaction commit protocol for composite web services
Proceedings of the Fourth Asia-Pacific Symposium on Internetware
A flexible approach for considering interdependent security objectives in service composition
Proceedings of the 28th Annual ACM Symposium on Applied Computing
QoS decomposition for service composition using genetic algorithm
Applied Soft Computing
A novel service selection based on resource-directive decomposition
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
| Hi-index | 0.00 |
Web services are new forms of Internet software that can be universally deployed and invoked using standard protocol. Services from different providers can be integrated to provide composite services. In this paper, we study the end-to-end QoS issues of composite service by utilizing a QoS broker that is responsible for coordinating the individual service component to meet the quality constraint. We design the service selection algorithms used by QoS brokers to meet end-to-end QoS constraints. The objective of the algorithms is to maximize the user-defined utility while meeting the end-to-end delay constraint. We model the problem as the Multiple Choice Knapsack Problem (MCKP) and provide efficient solutions. The algorithms are tested for their performance.