Deterministic Self-Adjusting Tree Networks Using Rotor Walks

We revisit the design of self-adjusting single-source tree networks. The problem can be seen as a generalization of the classic list update problem to trees, and finds applications in reconfigurable datacenter networks. We are given a balanced binary tree T connecting n nodes V = {v 1 ,..., v n }. A...

Full description

Bibliographic Details

Published in:	Proceedings of the International Conference on Distributed Computing Systems pp. 67 - 77
Main Authors:	Avin, Chen, Bienkowski, Marcin, Salem, Iosif, Sama, Robert, Schmid, Stefan, Schmidt, Pawel
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.07.2022
Subjects:	Behavioral sciences Binary trees competitive analysis Costs Distributed computing list update online algorithms rotor walks Rotors self adjusting networks Source coding
ISSN:	2575-8411
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!