Name-independent compact routing in trees

DOI10.1016/j.ipl.2007.02.015zbMath1184.68354OpenAlexW1974678299MaRDI QIDQ2379942

Kofi A. Laing

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.02.015

zbMATH Keywords

combinatorial problemsdistributed computingstretchdistributed lookup tablesname-independent compact routing

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items

Compact roundtrip routing with topology-independent node names

Cites Work

• Compact name-independent routing with minimum stretch
• Routing with Improved Communication-Space Trade-Off
• Compact Routing with Name Independence
• Unnamed Item
• Unnamed Item
• Unnamed Item