Distributed Self-Adjusting Tree Networks

Bruna Peres, Otavio A.De O. Souza, Olga Goussevskaia, Chen Avin, Stefan Schmid

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Abstract

    We consider the problem of designing dynamic network topologies that self-adjust to the (possibly changing) traffic pattern they serve. Such demand-aware networks currently receive much attention, especially in the context of datacenters, due to emerging technologies supporting the fast reconfiguration of the physical topology. We present the first fully distributed, provably efficient self-adjusting network. Our network called DiSptayNet relies on algorithms that perform decentralized and concurrent topological adjustments to account for changes in the demand. We present a rigorous formal analysis of the correctness and performance of DiSptayNet, which can be seen as an interesting generalization of analyses known from sequential self-adjusting datastructures. We also report on results from extensive trace-driven simulations.

    Original languageAmerican English
    Title of host publicationINFOCOM 2019 - IEEE Conference on Computer Communications
    Pages145-153
    Number of pages9
    ISBN (Electronic)9781728105154
    DOIs
    StatePublished - 1 Apr 2019
    Event2019 IEEE Conference on Computer Communications, INFOCOM 2019 - Paris, France
    Duration: 29 Apr 20192 May 2019

    Publication series

    NameProceedings - IEEE INFOCOM
    Volume2019-April

    Conference

    Conference2019 IEEE Conference on Computer Communications, INFOCOM 2019
    Country/TerritoryFrance
    CityParis
    Period29/04/192/05/19

    All Science Journal Classification (ASJC) codes

    • General Computer Science
    • Electrical and Electronic Engineering

    Fingerprint

    Dive into the research topics of 'Distributed Self-Adjusting Tree Networks'. Together they form a unique fingerprint.

    Cite this