Toward demand-aware networking: A theory for self-adjusting networks

Chen Avin, Stefan Schmid

Research output: Contribution to journalArticlepeer-review

22 Scopus citations

Abstract

The physical topology is emerging as the next frontier in an ongoing effort to render communication networks more flexible. While first empirical results indicate that these flexibilities can be exploited to reconfigure and optimize the network toward the workload it serves and, e.g., providing the same bandwidth at lower infrastructure cost, only little is known today about the fundamental algorithmic problems underlying the design of reconfigurable networks. This paper initiates the study of the theory of demand-aware, self-adjusting networks. Our main position is that self-adjusting networks should be seen through the lense of self-adjusting datastructures. Accordingly, we present a taxonomy classifying the different algorithmic models of demand-oblivious, fixed demand-aware, and reconfigurable demand-aware networks, introduce a formal model, and identify objectives and evaluation metrics. We also demonstrate, by examples, the inherent advantage of demand-aware networks over state-of-the-art demand-oblivious, fixed networks (such as expanders). We conclude by observing that the usefulness of self-adjusting networks depends on the spatial and temporal locality of the demand; as relevant data is scarce, we call for community action.

Original languageEnglish
Pages (from-to)31-40
Number of pages10
JournalComputer Communication Review
Volume48
Issue number5
DOIs
StatePublished - 1 Oct 2018

Keywords

  • Amortized Analysis
  • Network Design
  • Online Algorithms
  • Self-adjusting Datastructures

Fingerprint

Dive into the research topics of 'Toward demand-aware networking: A theory for self-adjusting networks'. Together they form a unique fingerprint.

Cite this