The University of Southampton
University of Southampton Institutional Repository

Flexible Service Provisioning with Advance Agreements

Flexible Service Provisioning with Advance Agreements
Flexible Service Provisioning with Advance Agreements
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.
249-256
Stein, Sebastian
cb2325e7-5e63-475e-8a69-9db2dfbdb00b
Jennings, N. R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Payne, Terry
0bb13d45-2735-45a3-b72c-472fddbd0bb4
Stein, Sebastian
cb2325e7-5e63-475e-8a69-9db2dfbdb00b
Jennings, N. R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Payne, Terry
0bb13d45-2735-45a3-b72c-472fddbd0bb4

Stein, Sebastian, Jennings, N. R. and Payne, Terry (2008) Flexible Service Provisioning with Advance Agreements. Seventh International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-08), Portugal. 12 - 16 May 2008. pp. 249-256 .

Record type: Conference or Workshop Item (Paper)

Abstract

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.

PDF
AAMAS08_0509.pdf - Version of Record
Download (601kB)

More information

Published date: May 2008
Additional Information: Event Dates: 12-16 May 2008
Venue - Dates: Seventh International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-08), Portugal, 2008-05-12 - 2008-05-16
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 265128
URI: https://eprints.soton.ac.uk/id/eprint/265128
PURE UUID: d6d7ed86-54f9-4ddd-958d-1500a6c1011e

Catalogue record

Date deposited: 30 Jan 2008 16:05
Last modified: 18 Jul 2017 07:29

Export record

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×