Conference paper Open Access

Resource partitioning in the NEPHELE datacentre interconnect

Konstantinos Yiannopoulos; Konstantinos Kontodimas; Kostas Christodoulopoulos; Emmanouel (Manos) Varvarigos

MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="">
  <controlfield tag="005">20200120171439.0</controlfield>
  <controlfield tag="001">1010220</controlfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Natioinal Technical University of Athens</subfield>
    <subfield code="a">Konstantinos Kontodimas</subfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">University of Patras and National Technical University of Athens</subfield>
    <subfield code="a">Kostas Christodoulopoulos</subfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">National Technical University of Athens</subfield>
    <subfield code="a">Emmanouel (Manos) Varvarigos</subfield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">1014845</subfield>
    <subfield code="z">md5:66106014cbe38c42cb1a82725d865952</subfield>
    <subfield code="u"></subfield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2017-07-20</subfield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">openaire</subfield>
    <subfield code="o"></subfield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">University of Peloponnese</subfield>
    <subfield code="a">Konstantinos Yiannopoulos</subfield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Resource partitioning in the NEPHELE datacentre interconnect</subfield>
  <datafield tag="536" ind1=" " ind2=" ">
    <subfield code="c">645212</subfield>
    <subfield code="a">eNd to End scalable and dynamically reconfigurable oPtical arcHitecture for application-awarE SDN cLoud datacentErs</subfield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u"></subfield>
    <subfield code="a">Creative Commons Attribution 4.0 International</subfield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2"></subfield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&lt;p&gt;We present heuristic algorithms for the efficient resource partitioning in the NEPHELE datacentre optical interconnect. The algorithms aim to segment the network into smaller and isolated virtual datacentres (VDCs), where all racks are able to communicate at full capacity irrespective of their placement. Since the NEPHELE architecture relies on shared optical rings, the isolation of VDC traffic is challenging. Observing its close resemblance to finding a bi-clique on a bipartite graph, which is NP-hard, we propose heuristic algorithms which find a solution by limiting either the spatial spread of racks that construct each VDC or their wavelength allocation. If a solution cannot be found, then the algorithms invoke a second de-fragmentation phase, where they re-allocate the racks of existing VDCs to concentrate them spatially and reduce traffic on the shared optical rings. It is demonstrated via simulation that the proposed heuristics can achieve very high utilization and also exhibit low VDC request blocking probability for typically expected VDC sizes.&lt;/p&gt;</subfield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="n">doi</subfield>
    <subfield code="i">isVersionOf</subfield>
    <subfield code="a">10.5281/zenodo.1010219</subfield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.5281/zenodo.1010220</subfield>
    <subfield code="2">doi</subfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">conferencepaper</subfield>
All versions This version
Views 6767
Downloads 3232
Data volume 32.5 MB32.5 MB
Unique views 6666
Unique downloads 3232


Cite as