rDAN: Toward robust demand-aware network designs

Chen Avin, Alexandr Hercules, Andreas Loukas, Stefan Schmid

Research output: Contribution to journalArticlepeer-review

17 Scopus citations

Abstract

We currently witness the emergence of interesting new network topologies optimized towards the traffic matrices they serve, such as demand-aware datacenter interconnects (e.g., ProjecToR) and demand-aware peer-to-peer overlay networks (e.g., SplayNets). This paper introduces a formal framework and approach to reason about and design robust demand-aware networks (DAN). In particular, we establish a connection between the communication frequency of two nodes and the path length between them in the network, and show that this relationship depends on the entropy of the communication matrix. Our main contribution is a novel robust, yet sparse, family of networks, short rDANs, which guarantee an expected path length that is proportional to the entropy of the communication patterns.

Original languageEnglish
Pages (from-to)5-9
Number of pages5
JournalInformation Processing Letters
Volume133
DOIs
StatePublished - 1 May 2018

Keywords

  • Algorithms
  • Coding theory
  • Datacenter interconnects
  • Network design
  • Peer-to-peer topologies

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'rDAN: Toward robust demand-aware network designs'. Together they form a unique fingerprint.

Cite this