Chennai Mathematical Institute


10.45 am, Seminar Hall
Compact Routing Messages in Compact Self-Healing Trees

Amitabh Trehan
Queens University, UK.


Efficient routing is critical in current networks, and will be even more so in future networks especially with low memory devices in the future IOT (Internet of Things). Existing compact routing schemes, e.g., Thorup and Zwick [SPAA 2001] and Chechik [PODC 2013], often have no means to tolerate failures, once the system has been setup and started. We present, to our knowledge, the first self-healing compact routing scheme. This scheme needs only O(log^2 n) memory, and is thus, 'compact'.

We introduce two algorithms of independent interest:

i) CompactFT: a novel compact version (using only O(log n) local memory) of the self-healing algorithm Forgiving Tree of Hayes et al. [PODC 2008].

ii) CompactFTZ: a compact self-healing routing scheme that is a combination of CompactFT with Thorup-Zwick's tree-based compact routing scheme [SPAA 2001].

(Joint work with Armando Castaneda and Danny Dolev).

Search WWW Search