<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet href="client.xsl" type="text/xsl"?>
<article article-type="other">
<front>
<journal-meta>
<journal-id/>
<issn/>
<banner>
<!--<href>banner.jpg</href>-->
<size width="100%"/>
</banner>
</journal-meta>
<article-meta>
<title-group>
<article-title>Provisioning Heterogeneous and Unreliable Providers for
Service Workflows</article-title>
</title-group>

<author><a href="mailto:ss04r@ecs.soton.ac.uk"><name>Sebastian Stein</name></a></author>
<aff>School of Electronics and Computer Science, <br/>University of Southampton, Southampton, SO17 1BJ, UK</aff>

<author><a href="mailto:nrj@ecs.soton.ac.uk"><name>Nicholas R. Jennings</name></a></author>
<aff>School of Electronics and Computer Science, <br/>University of Southampton, Southampton, SO17 1BJ, UK</aff>

<author><a href="mailto:trp@ecs.soton.ac.uk"><name>Terry R. Payne</name></a></author>
<aff>School of Electronics and Computer Science, <br/>University of Southampton, Southampton, SO17 1BJ, UK</aff>


</article-meta></front>
<body>
<abstract>
<title>ABSTRACT</title>
<p>In this paper, we address the problemof provisioning unreliable and
heterogeneous service providers for the constituent tasks of abstract
workflows. Specifically, we deal with unreliable providers by provisioning
multiple service providers redundantly for specific tasks,
and we employ a local search mechanism to choose among many
heterogeneous providers that offer the same type of service. We
empirically show that our strategy can achieve significant improvements
over current approaches, and we demonstrate that it works
well over a range of environments.</p>
</abstract>
<fpdf>
<href>pdflogo.jpg</href>
<hpdf>AAMAS07_0032_47e7e92f3351efea98ac9660e0f3063d</hpdf>
</fpdf>
</body>
</article>

