Distributed Routing in Tree Networks with Few Landmarks

DOI10.1007/11922377_5MaRDI QIDQ5385932zbMATH OpenOpenAlexWikidataFDO

Authors Ioannis Z. Emiris, Euripides Markou, Aris Pagourtzis

Publication date 17 April 2008

Published in Combinatorial and Algorithmic Aspects of Networking (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11922377_5

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 1756017
• Near-optimal distributed routing with low memory
• Publication:4733694
• Space-efficiency for routing schemes of stretch factor three
• Routing with Polynomial Communication-Space Trade-Off

This page was built for publication: Distributed Routing in Tree Networks with Few Landmarks

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