Push-Down Trees: Optimal Self-Adjusting Complete Trees

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 cost...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE/ACM transactions on networking 2022-12, Vol.30 (6), p.2419-2432
Hauptverfasser:	Avin, Chen, Mondal, Kaushik, Schmid, Stefan
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation algorithms competitive analysis Costs Design Heuristic algorithms Lower bounds Network topology online algorithms Random walk Reconfigurable networks Routing self-adjusting datastructures Servers Topology
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!