Dynamically Optimal Self-adjusting Single-Source Tree Networks

Chen Avin, Kaushik Mondal, Stefan Schmid

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

2 Scopus citations

Abstract

This paper studies a fundamental algorithmic problem related to the design of demand-aware networks: networks whose topologies adjust toward the traffic patterns they serve, in an online manner. The goal is to strike a tradeoff between the benefits of such adjustments (shorter routes) and their costs (reconfigurations). In particular, we consider the problem of designing a self-adjusting tree network which serves single-source, multi-destination communication. The problem has interesting connections to self-adjusting datastructures. We present two constant-competitive online algorithms for this problem, one randomized and one deterministic. Our approach is based on a natural notion of Most Recently Used (MRU) tree, maintaining a working set. We prove that the working set is a cost lower bound for any online algorithm, and then present a randomized algorithm RANDOM-PUSH which approximates such an MRU tree at low cost, by pushing less recently used communication partners down the tree, along a random walk. Our deterministic algorithm MOVE-HALF does not directly maintain an MRU tree, but its cost is still proportional to the cost of an MRU tree, and also matches the working set lower bound.

Original languageEnglish
Title of host publicationLATIN 2020
Subtitle of host publicationTheoretical Informatics - 14th Latin American Symposium 2021, Proceedings
EditorsYoshiharu Kohayakawa, Flávio Keidi Miyazawa
PublisherSpringer Science and Business Media Deutschland GmbH
Pages143-154
Number of pages12
ISBN (Print)9783030617912
DOIs
StatePublished - 1 Jan 2020
Event14th Latin American Symposium on Theoretical Informatics, LATIN 2020 - Sao Paulo, Brazil
Duration: 5 Jan 20218 Jan 2021

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12118 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th Latin American Symposium on Theoretical Informatics, LATIN 2020
Country/TerritoryBrazil
CitySao Paulo
Period5/01/218/01/21

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Dynamically Optimal Self-adjusting Single-Source Tree Networks'. Together they form a unique fingerprint.

Cite this