A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="https://core.ac.uk/download/pdf/82713008.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
QoS negotiation in service composition
<span title="">2011</span>
<i title="Elsevier BV">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/anq6kvwvqbegtipq5vfhvonzqq" style="color: black;">The Journal of Logic and Algebraic Programming</a>
</i>
Preserved Fulltext
Service composition in Service Oriented Computing concerns not only integration of heterogeneous distributed applications but also dynamic selection of services. Quality of Service (QoS) plays a key role in service composition as services providing the same functionalities can be differentiated according to their QoS guarantees. At subscription time, a service requester and a provider may sign a contract recording the QoS of the supplied service. The cc-pi calculus has been introduced as a
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jlap.2010.04.001">doi:10.1016/j.jlap.2010.04.001</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mhf4m2co3fbs3lesdsjtbaxq3q">fatcat:mhf4m2co3fbs3lesdsjtbaxq3q</a>
</span>
more »
... raint-based model of QoS contracts. In this work we propose a variant of the cc-pi calculus in which the alternatives in a choice rather than being selected non-deterministically have a dynamic priority. Basically, a guard c j : π j in a choice is enabled if the constraint c j is entailed by the store of constraints and the prefix π j can be consumed. Moreover, the jth branch can be selected not only if the corresponding guard c j : π j is enabled but also if c j is weaker than the constraints c i of the other enabled alternatives. We prove that our choice operator is more general than a choice operator with static priority. Finally, we exploit some examples to show that our prioritised calculus allows arbitrarily complex QoS negotiations and that a static form of priority is strictly less expressive than ours.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190226040630/https://core.ac.uk/download/pdf/82713008.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/1c/4e/1c4e350bea5fa07eaff6c03f9c162a42ae6e6f92.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jlap.2010.04.001">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
elsevier.com
</button>
</a>