®®®® SIIA Público

Título del libro: Acm International Conference Proceeding Series
Título del capítulo: Compact routing messages in self-healing trees

Autores UNAM:
ARMANDO CASTAÑEDA ROJANO;
Autores externos:

Idioma:
Inglés
Año de publicación:
2016
Palabras clave:

Algorithms; Internet of things; Network routing; Parallel algorithms; Routing protocols; Trees (mathematics); Compact routing; Compact schemes; Forgiving Tree; Graph diameter; Low memory; Maximum degree; Routing scheme; Self-healing; Distributed computer systems


Resumen:

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. This paper presents, to our knowledge, the first self-healing compact routing scheme. Besides, our schemes are developed for low memory nodes, i.e., nodes need only O(log2 n) memory, and are thus, compact schemes. We introduce two algorithms of independent interest: The first is 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]. The second algorithm (CompactFTZ) combines CompactFT with Thorup-Zwick's tree-based compact routing scheme [SPAA 2001] to produce a fully compact self-healing routing scheme. In the self-healing model, the adversary deletes nodes one at a time with the affected nodes self-healing locally by adding few edges. CompactFT recovers from each attack in only O(1) time and messages, with only +3 degree increase and O(log ) graph diameter increase, over any sequence of deletions ( is the initial maximum degree). Additionally, CompactFTZ guarantees delivery of a packet sent from sender s as long as the receiver t has not been deleted, with only an additional O(y log ) latency, where y is the number of nodes that have been deleted on the path between s and t. If t has been deleted, s gets informed and the packet removed from the network. © 2016 ACM.


Entidades citadas de la UNAM: