Compact routing messages in self-healing trees

DOI10.1016/j.tcs.2016.11.022zbMath1383.68010arXiv1508.04234OpenAlexW4205962324WikidataQ115036516 ScholiaQ115036516MaRDI QIDQ1686108

Danny Dolev, Armando Castañeda, Amitabh Trehan

Publication date: 20 December 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.04234

zbMATH Keywords

internet of thingscompact forgiving treecompact Thorup-Zwick routingdistributed message passing algorithmlow memory compact algorithmself-healing fault-tolerant P2P algorithm

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Uses Software

• Xheal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast and compact self-stabilizing verification, computation, and fault detection of an MST
• A self-stabilizing transformer for population protocols with covering
• \(f\)-sensitivity distance oracles and routing schemes
• Labeling schemes for dynamic tree networks
• Stabilization, safety, and security of distributed systems. 16th international symposium, SSS 2014, Paderborn, Germany, September 28 -- October 1, 2014. Proceedings
• Self-stabilizing depth-first search
• The forgiving graph: a distributed data structure for low stretch under adversarial attack
• Fault-tolerant compact routing schemes for general graphs
• General compact labeling schemes for dynamic trees
• Xheal: a localized self-healing algorithm using expanders
• Labeling schemes for weighted dynamic trees
• Compact Routing with Minimum Stretch
• Distributed computation in dynamic networks
• The forgiving tree
• Improved routing strategies with succinct tables
• Labelling and Implicit Routing in Networks
• A trade-off between information and communication in broadcast protocols
• Compact Forbidden-Set Routing
• Self-stabilizing systems in spite of distributed control
• Compact routing schemes with improved stretch
• A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
• Routing with guaranteed delivery in ad hoc wireless networks
• A fault-tolerant routing scheme in dynamic networks

This page was built for publication: Compact routing messages in self-healing trees