Introduction to algorithms
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
The greedy coloring is a bad probabilistic algorithm
Journal of Algorithms
Reliable computer systems (3rd ed.): design and evaluation
Reliable computer systems (3rd ed.): design and evaluation
Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
Building Web Services with Java: Making Sense of Xml, Soap, Wsdl, and Uddi
Building Web Services with Java: Making Sense of Xml, Soap, Wsdl, and Uddi
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Web Services: A Technical Introduction
Web Services: A Technical Introduction
IEEE Internet Computing
Semantic Matching of Web Services Capabilities
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
On Requirements for Ontologies in Management of Web Services
CAiSE '02/ WES '02 Revised Papers from the International Workshop on Web Services, E-Business, and the Semantic Web
The evolution of Protégé: an environment for knowledge-based systems development
International Journal of Human-Computer Studies
A model for web services discovery with QoS
ACM SIGecom Exchanges
DAML-QoS Ontology for Web Services
ICWS '04 Proceedings of the IEEE International Conference on Web Services
QoS computation and policing in dynamic web service selection
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
QoS in Ontology-Based Service Classification and Discovery
DEXA '04 Proceedings of the Database and Expert Systems Applications, 15th International Workshop
A Framework and Ontology for Dynamic Web Services Selection
IEEE Internet Computing
WWW '05 Proceedings of the 14th international conference on World Wide Web
Enterprise SOA: Service-Oriented Architecture Best Practices (The Coad Series)
Enterprise SOA: Service-Oriented Architecture Best Practices (The Coad Series)
A QoS Ontology Language for Web-Services
AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 01
Web services QoS: external SLAs and internal policies or: how do we deliver what we promise?
WISEW'03 Proceedings of the Fourth international conference on Web information systems engineering workshops
QoS-Based service selection and ranking with trust and reputation management
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
Service selection algorithms for composing complex services with multiple qos constraints
ICSOC'05 Proceedings of the Third international conference on Service-Oriented Computing
Hi-index | 0.00 |
Web Services (WSs) are a new breed of web application that is gaining momentum. One of the research challenges it brings along is the establishment of an interoperable semantic framework suitable to represent not only the functional, but also the non-functional features of WSs, i.e. their Quality-of-Service (QoS), which in most cases are not included in the WS description. Nevertheless, integrating QoS features in WS profiles is to the advantage of both users and providers, as it supports QoS-aware WS selection and composition addressing the user's QoS requirements, while enabling WS providers to increase their profits. The purpose of this paper is twofold. On the one hand, it aims to present a QoS ontology framework adequate for WS provision. On the other hand, it studies the problem of providers that receive concurrent requests of numerous customers for WSs demonstrating different bandwidth and price properties. It introduces the “Selective Multiple Choice Knapsack Problem” that aims to identify the services that should be delivered to the customers in order to maximize the provider's profit, subject to maximum bandwidth constraints on the server side. Thus, the QoS-awareness in this version of this problem is limited to the consideration of two QoS parameters: service bandwidth and cost. The problem is solved by a proposed algorithm that has been empirically evaluated via numerous experiments.