1 Ocak 2018 Dergi makalesi Açık Erişim

Bagci, K. Tolga; Tekalp, A. Murat

MARC21 XML

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Dynamic Resource Allocation by Batch Optimization for Value-Added Video Services Over SDN</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="p">IEEE TRANSACTIONS ON MULTIMEDIA</subfield>
    <subfield code="v">20</subfield>
    <subfield code="n">11</subfield>
    <subfield code="c">3084-3096</subfield>
  </datafield>
  <controlfield tag="001">34919</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">We propose a video service architecture and a novel resource allocation optimization framework to enable network service providers (NSP) to offer value-added video services (VAVS) over software-defined networking including different service levels, service-level awareness of users, and associated business models. To this effect, we introduce a new batch-optimization framework, where resource (path, bitrate, and admission control) allocations for a small group of flows (consisting of new service requests and some existing ones) are performed simultaneously as the number of new service requests and network conditions vary. The optimization problem becomes NP-complete when path computations are jointly (re-)optimized as a group in order to accommodate all service requests to the extent possible, to best utilize entire network resources in a fair manner, and maximize network service provider's revenue. In order to compute dynamic resource allocations online, we propose a heuristic group-constrained-shortest path procedure that aims for a fair allocation of resources among a group of requests with the same service level, while maximizing the total NSP revenue. Experimental results demonstrate the feasibility of the proposed method for possible deployment by NSP to offer future VAVS, and that the proposed solution is close to the optimal solution, which is approximately computed using a divide-and conquer strategy, for varying network size and traffic load conditions. In particular, we show that processing service requests in batches significantly improves total revenue and fairness in congested mode of operation.</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="2">opendefinition.org</subfield>
    <subfield code="a">cc-by</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Koc Univ, Dept Elect &amp; Elect Engn, TR-34450 Istanbul, Turkey</subfield>
    <subfield code="a">Tekalp, A. Murat</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="b">article</subfield>
    <subfield code="a">publication</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">Koc Univ, Dept Elect &amp; Elect Engn, TR-34450 Istanbul, Turkey</subfield>
    <subfield code="a">Bagci, K. Tolga</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2018-01-01</subfield>
  </datafield>
  <controlfield tag="005">20210315191543.0</controlfield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="o">oai:zenodo.org:34919</subfield>
    <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="z">md5:3b8cafd7d2c5e5b6982c17541d6072d8</subfield>
    <subfield code="s">173</subfield>
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/34919/files/bib-6cd26fc3-74c8-4ff3-9e4e-909c9fc0047c.txt</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
    <subfield code="a">Creative Commons Attribution</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1109/TMM.2018.2823907</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
</record>