Conference paper Open Access

Resource partitioning in the NEPHELE datacentre interconnect

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

DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="" xmlns="" xsi:schemaLocation="">
  <identifier identifierType="DOI">10.5281/zenodo.1010220</identifier>
      <creatorName>Konstantinos Yiannopoulos</creatorName>
      <affiliation>University of Peloponnese</affiliation>
      <creatorName>Konstantinos Kontodimas</creatorName>
      <affiliation>Natioinal Technical University of Athens</affiliation>
      <creatorName>Kostas Christodoulopoulos</creatorName>
      <affiliation>University of Patras and National Technical University of Athens</affiliation>
      <creatorName>Emmanouel (Manos) Varvarigos</creatorName>
      <affiliation>National Technical University of Athens</affiliation>
    <title>Resource partitioning in the NEPHELE datacentre interconnect</title>
    <date dateType="Issued">2017-07-20</date>
  <resourceType resourceTypeGeneral="Text">Conference paper</resourceType>
    <alternateIdentifier alternateIdentifierType="url"></alternateIdentifier>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.5281/zenodo.1010219</relatedIdentifier>
    <rights rightsURI="">Creative Commons Attribution 4.0 International</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
    <description descriptionType="Abstract">&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;</description>
      <funderName>European Commission</funderName>
      <funderIdentifier funderIdentifierType="Crossref Funder ID">10.13039/501100000780</funderIdentifier>
      <awardNumber awardURI="info:eu-repo/grantAgreement/EC/H2020/645212/">645212</awardNumber>
      <awardTitle>eNd to End scalable and dynamically reconfigurable oPtical arcHitecture for application-awarE SDN cLoud datacentErs</awardTitle>
All versions This version
Views 6767
Downloads 3232
Data volume 32.5 MB32.5 MB
Unique views 6666
Unique downloads 3232


Cite as