Fully compact routing in low memory self-healing trees

The paper (Compact Routing Messages in Self-Healing Trees, TCS 2017) introduced CompactFTZ, the first self-healing compact routing algorithm that works in a distributed network with each node using only O(logn) words (i.e. O(log2 n) bits) memory and thus O(logn) sized messages. The routing uses only...

Full description

Saved in:
Bibliographic Details
Main Authors: Armando Castañeda, Jonas Lefévre, Amitabh Trehan
Format: Default Conference proceeding
Published: 2020
Subjects:
Low memory distributed algorithms
Self-healing
Compact tree routing
Low memory preprocessing
Half-full tree
Online Access:https://hdl.handle.net/2134/10260602.v1
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items