Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
Communications of the ACM
Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
Recent results on the single-source shortest paths problem
ACM SIGACT News
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
Introduction to Algorithms
SIAM Journal on Computing
The Self-Serv Environment for Web Services Composition
IEEE Internet Computing
Semantic Matching of Web Services Capabilities
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Priority Queues: Small, Monotone and Trans-dichotomous
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
eFlow: A Platform for Developing and Managing Composite e-Services
AIWORC '00 Proceedings of the Academia/Industry Working Conference on Research Challenges
A model for web services discovery with QoS
ACM SIGecom Exchanges
QoS-Aware Middleware for Web Services Composition
IEEE Transactions on Software Engineering
Meteor-s web service annotation framework
Proceedings of the 13th international conference on World Wide Web
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
QoS Aggregation for Web Service Composition using Workflow Patterns
EDOC '04 Proceedings of the Enterprise Distributed Object Computing Conference, Eighth IEEE International
QoS Aggregation in Web Service Compositions
EEE '05 Proceedings of the 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE'05) on e-Technology, e-Commerce and e-Service
An approach for QoS-aware service composition based on genetic algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Web Services Automatic Composition Based on QoS
ICEBE '05 Proceedings of the IEEE International Conference on e-Business Engineering
Optimal Web Services Selection Using Dynamic Programming
ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
WSBen: A Web Services Discovery and Composition Benchmark
ICWS '06 Proceedings of the IEEE International Conference on Web Services
Heuristics for QoS-aware Web Service Composition
ICWS '06 Proceedings of the IEEE International Conference on Web Services
A Graph-Based Framework for Composition of Stateless Web Services
ECOWS '06 Proceedings of the European Conference on Web Services
Efficient algorithms for Web services selection with end-to-end QoS constraints
ACM Transactions on the Web (TWEB)
Discovering the best web service
Proceedings of the 16th international conference on World Wide Web
Qos-Aware Automatic Composition of Web Services Using AI Planners
ICIW '07 Proceedings of the Second International Conference on Internet and Web Applications and Services
Investigating web services on the world wide web
Proceedings of the 17th international conference on World Wide Web
Distributed automatic service composition in large-scale systems
Proceedings of the second international conference on Distributed event-based systems
Efficient online monitoring of web-service SLAs
Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
Automatic Service Composition Based on Enhanced Service Dependency Graph
ICWS '08 Proceedings of the 2008 IEEE International Conference on Web Services
Effective Web Service Composition in Diverse and Large-Scale Service Networks
IEEE Transactions on Services Computing
The LLAMA Middleware Support for Accountable Service-Oriented Architecture
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
Semantic Web Service Composition Framework Based on Parallel Processing
CEC '09 Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing
Effective Pruning Algorithm for QoS-Aware Service Composition
CEC '09 Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing
A QoS-Driven Approach for Semantic Service Composition
CEC '09 Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing
HTN planning for Web Service composition using SHOP2
Web Semantics: Science, Services and Agents on the World Wide Web
Hi-index | 0.00 |
In the research of service composition, it demands efficient algorithms that not only retrieve correct service compositions automatically from thousands of services but also satisfy the quality requirements of different service users. However, most approaches treat these two aspects as two separate problems, automatic service composition and service selection. Although the latest researches realize the restriction of this separate view and some specific methods are proposed, they still suffer from serious limitations in scalability and accuracy when addressing both requirements simultaneously. In order to cope with these limitations and efficiently solve the combined problem which is known as QoS-aware or QoS-driven automatic service composition problem, we propose a new graph search problem, single-source optimal directed acyclic graphs (DAGs), for the first time. This novel single-source optimal DAGs (SSOD) problem is similar to, but more general than the classical single-source shortest paths (SSSP) problem. In this paper, a new graph model of SSOD problem is proposed and a Sim-Dijkstra algorithm is presented to address the SSOD problem with the time complexity of O(nlog n + m) (n and m are the number of nodes and edges in the graph respectively), and the proofs of its soundness. It is also directly applied to solve the QoS-aware automatic service composition problem, and a service composition tool named QSynth is implemented. Evaluations show that Sim-Dijkstra algorithm achieves superior scalability and efficiency with respect to a large variety of composition scenarios, even more efficient than Our worklist algorithm that won the performance championship of Web Services Challenge 2009.