Fault-tolerant compact routing schemes for general graphs

Shiri Chechik*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


This paper considers compact fault-tolerant routing schemes for weighted general graphs, namely, routing schemes that avoid a set of failed (or forbidden) edges. We present a compact routing scheme capable of handling multiple edge failures. Assume a source node s contains a message M designated to a destination target t and assume a set F of edges crashes (unknown to s). Our scheme routes the message to t (provided that s and t are still connected in G \ F) over a path whose length is proportional to the distance between s and t in G \ F, to |F|3 and to some poly-log factor. The routing table required at a node v is of size proportional to the degree of v in G and some poly-log factor. This improves on the previously known fault-tolerant compact routing scheme for general graphs, which was capable of overcoming at most 2 edge failures.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings
Number of pages12
EditionPART 2
StatePublished - 2011
Externally publishedYes
Event38th International Colloquium on Automata, Languages and Programming, ICALP 2011 - Zurich, Switzerland
Duration: 4 Jul 20118 Jul 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume6756 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference38th International Colloquium on Automata, Languages and Programming, ICALP 2011


Dive into the research topics of 'Fault-tolerant compact routing schemes for general graphs'. Together they form a unique fingerprint.

Cite this