Decision Processes in Agent-Based Automated Contracting
IEEE Internet Computing
QoS-Aware Middleware for Web Services Composition
IEEE Transactions on Software Engineering
Constraint Driven Web Service Composition in METEOR-S
SCC '04 Proceedings of the 2004 IEEE International Conference on Services Computing
The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver
IEEE Transactions on Computers
Provisioning heterogeneous and unreliable providers for service workflows
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Emergent service provisioning and demand estimation through self-organizing agent communities
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Mechanism design for task procurement with flexible quality of service
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Flexible procurement of services with uncertain durations using redundancy
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Mechanism Design for Task Procurement with Flexible Quality of Service
SOCASE '09 Proceedings of the AAMAS 2009 International Workshop on Service-Oriented Computing: Agents, Semantics, and Engineering
Algorithms and mechanisms for procuring services with uncertain durations using redundancy
Artificial Intelligence
Self-organizing agent communities for autonomic resource management
Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems
| Hi-index | 0.00 |
In this paper, we develop a novel algorithm that allows service consumer agents to automatically select and provision service provider agents for their workflows in highly dynamic and uncertain computational service economies. In contrast to existing work, our algorithm reasons explicitly about the impact of failures on the overall feasibility of a workflow, and it mitigates them by proactively provisioning multiple providers in parallel for particularly critical tasks and by explicitly planning for contingencies. Furthermore, our algorithm provisions only part of its workflow at any given time, in order to retain flexibility and to decrease the potential for missing negotiated service time slots. We show empirically that current approaches are unable to achieve a high utility in such uncertain and dynamic environments; whereas our algorithm consistently outperforms them over a range of environments. Specifically, our approach can achieve up to a 27-fold increase in utility and successfully completes most workflows within a strict deadline, even when the majority of providers do not honour their contracts.