A space lower bound for routing in trees

38Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The design of compact routing schemes in trees form the kernel of sophisticated strategies for compact routing in arbitrary graphs. This paper focuses on the space complexity for routing messages along shortest paths in trees. It was recently shown that the family of n-node trees supports routing schemes using addresses and routing tables of size O(log2 n/ log log n) bits per node, if the output port numbers of each node are chosen by an adversary. This paper shows that this result is tight, that is the sum of the sizes of the address and of the local routing table is at least Ω(log2n/log log n) bits for some node of some tree.

Cite

CITATION STYLE

APA

Fraigniaud, P., & Gavoille, C. (2002). A space lower bound for routing in trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2285, pp. 65–75). Springer Verlag. https://doi.org/10.1007/3-540-45841-7_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free