<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">606228853</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128101205.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150601xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s10796-013-9432-y</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s10796-013-9432-y</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Adaptive and similarity-based tradeoff algorithms in a price-timeslot-QoS negotiation system to establish cloud SLAs</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Seokho Son, Kwang Sim]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Since participants in a Cloud may be independent bodies, some mechanisms are necessary for resolving the different preferences to establish a service-level agreement (SLA) for Cloud service reservations. Whereas there are some mechanisms for supporting SLA negotiation, there is little or no negotiation support involving price, time slot, and QoS issues concurrently for a Cloud service reservation. For the concurrent price, timeslot, and QoS negotiation, a tradeoff algorithm to generate and evaluate a proposal which consists of price, timeslot, and QoS proposals is necessary. The contribution of this work is designing a multi-issue negotiation mechanism to facilitate 1) concurrent price, time slot, and QoS negotiations including the design of QoS utility functions and 2) adaptive and similarity-based trade-off proposals for price, time slots, and level of QoS issues. The tradeoff algorithm referred to as &quot;adaptive burst mode” is especially designed to increase negotiation speed, total utility, and to reduce computational load for evaluating proposals by adaptively generating concurrent set of proposals. The empirical results obtained from simulations carried out using an agent-based testbed suggest that using the negotiation mechanism, (i) a consumer and a provider agent have a mutually satisfying agreement on price, time slot, and QoS issues in terms of the aggregated utility and (ii) the fastest negotiation speed with (iii) comparatively lower number of evaluated proposals in a negotiation.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media New York, 2013</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Cost-models and economics of grid/cloud computing</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Agent-based cloud computing</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Service level agreement</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Multi-issue negotiation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Cloud service reservation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">QoS negotiation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Son</subfield>
   <subfield code="D">Seokho</subfield>
   <subfield code="u">Department of Information and Communications, Gwangju Institute of Science and Technology, 261 Cheomdan-gwagiro, Buk-gu, 500-712, Gwangju, Republic of Korea</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Sim</subfield>
   <subfield code="D">Kwang</subfield>
   <subfield code="u">School of Computing, The University of Kent, Chatham Maritime, ME4 4AG, Kent, UK</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Information Systems Frontiers</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">17/3(2015-06-01), 565-589</subfield>
   <subfield code="x">1387-3326</subfield>
   <subfield code="q">17:3&lt;565</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">17</subfield>
   <subfield code="o">10796</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s10796-013-9432-y</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s10796-013-9432-y</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Son</subfield>
   <subfield code="D">Seokho</subfield>
   <subfield code="u">Department of Information and Communications, Gwangju Institute of Science and Technology, 261 Cheomdan-gwagiro, Buk-gu, 500-712, Gwangju, Republic of Korea</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Sim</subfield>
   <subfield code="D">Kwang</subfield>
   <subfield code="u">School of Computing, The University of Kent, Chatham Maritime, ME4 4AG, Kent, UK</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Information Systems Frontiers</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">17/3(2015-06-01), 565-589</subfield>
   <subfield code="x">1387-3326</subfield>
   <subfield code="q">17:3&lt;565</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">17</subfield>
   <subfield code="o">10796</subfield>
  </datafield>
 </record>
</collection>
