Name-independent compact routing in trees

DOI10.1016/J.IPL.2007.02.015MaRDI QIDQ2379942zbMATH OpenOpenAlexFDO

Authors 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 computingdistributed lookup tablesname-independent compact routingstretch

Mathematics Subject Classification ID

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

Cites work

• Compact name-independent routing with minimum stretch
• Compact Routing with Name Independence
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1756017 (Why is no real title available?)
• scientific article; zbMATH DE number 4119974 (Why is no real title available?)
• Routing with Improved Communication-Space Trade-Off

Cited in

(1)

• Compact roundtrip routing with topology-independent node names

This page was built for publication: Name-independent compact routing in trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379942)