<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445879270</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317145537.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20110701xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s10601-011-9106-7</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s10601-011-9106-7</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Data transfer planning with tree placement for collaborative environments</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Petr Holub, Hana Rudová, Miloš Liška]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Latency-sensitive data distribution and media streaming is a part of many network-centric applications. Based on our previous practical experiences with interactive high-quality media distribution and orchestration of network-centric collaborative environments, we have developed an automated planner for media stream distribution in environments where bandwidth of streams is comparable to capacities of network links. We have successfully adopted methods of constraint programming to deal with this problem. We provide anew comprehensive description of the constraint model which builds upon basic algebraic description we have published earlier. To formulate the model, a tree placement problem is proposed and anew corresponding variant of the link-based model for traffic placement problem is applied. We prove correctness of the proposed constraint satisfaction problem to present validity of included constraints with respect to the desired functionality of planning. Anevaluation of the implemented solver is presented on a number of experimental problems to show effectiveness of the formulation. Importantly, the solver is apart of anapplication middleware called CoUniverse, which is pioneering orchestration of component-based interactive collaborative environments in anumber of global demonstrations and projects. Both flexibility of the described model as well as generality of other parts of the CoUniverse framework allowed it to be one of very few early adopters of bandwidth-on-demand services for advanced high-bandwidth applications.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media, LLC, 2011</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Data transfer planning</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Constraint programming</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Collaborative environments</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Data networks</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Holub</subfield>
   <subfield code="D">Petr</subfield>
   <subfield code="u">Institute of Computer Science, Masaryk University, Botanická 68a, 602 00, Brno, Czech Republic</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Rudová</subfield>
   <subfield code="D">Hana</subfield>
   <subfield code="u">Faculty of Informatics, Masaryk University, Botanická 68a, 602 00, Brno, Czech Republic</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Liška</subfield>
   <subfield code="D">Miloš</subfield>
   <subfield code="u">Faculty of Informatics, Masaryk University, Botanická 68a, 602 00, Brno, Czech Republic</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Constraints</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">16/3(2011-07-01), 283-316</subfield>
   <subfield code="x">1383-7133</subfield>
   <subfield code="q">16:3&lt;283</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">16</subfield>
   <subfield code="o">10601</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s10601-011-9106-7</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</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="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/s10601-011-9106-7</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">Holub</subfield>
   <subfield code="D">Petr</subfield>
   <subfield code="u">Institute of Computer Science, Masaryk University, Botanická 68a, 602 00, Brno, Czech Republic</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">Rudová</subfield>
   <subfield code="D">Hana</subfield>
   <subfield code="u">Faculty of Informatics, Masaryk University, Botanická 68a, 602 00, Brno, Czech Republic</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">Liška</subfield>
   <subfield code="D">Miloš</subfield>
   <subfield code="u">Faculty of Informatics, Masaryk University, Botanická 68a, 602 00, Brno, Czech Republic</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">Constraints</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">16/3(2011-07-01), 283-316</subfield>
   <subfield code="x">1383-7133</subfield>
   <subfield code="q">16:3&lt;283</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">16</subfield>
   <subfield code="o">10601</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="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
