@inproceedings{5c6bcca99be34c2ab176717d2f4defd5,

title = "Fault-tolerant compact routing schemes for general graphs",

abstract = "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.",

author = "Shiri Chechik",

year = "2011",

doi = "https://doi.org/10.1007/978-3-642-22012-8_7",

language = "الإنجليزيّة",

isbn = "9783642220111",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "PART 2",

pages = "101--112",

booktitle = "Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings",

edition = "PART 2",

note = "38th International Colloquium on Automata, Languages and Programming, ICALP 2011 ; Conference date: 04-07-2011 Through 08-07-2011",

}