Sparse communication networks and efficient routing in the plane

DOI10.1007/S004460100054MaRDI QIDQ5138362zbMATH OpenOpenAlexFDO

Authors Yehuda Hassin, David Peleg

Publication date 3 December 2020

Published in Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

communication networksgeometric spannersrouting schemes

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Sparse communication networks and efficient routing in the plane (extended abstract)
• Compact routing on Euclidian metrics
• A trade-off between space and efficiency for routing tables
• Routing with Polynomial Communication-Space Trade-Off
• Space-efficiency for routing schemes of stretch factor three

Cites work

• Classes of graphs which approximate the complete Euclidean graph
• Distributed Computing: A Locality-Sensitive Approach
• Efficient construction of a bounded-degree spanner with low weight
• scientific article; zbMATH DE number 1263225 (Why is no real title available?)
• Labelling and Implicit Routing in Networks
• Memory requirement for universal routing schemes
• Routing with Polynomial Communication-Space Trade-Off

Cited in

(6)

• Projective planes and congestion-free networks
• A network topology with efficient balanced routing
• scientific article; zbMATH DE number 751136 (Why is no real title available?)
• Sparse communication networks and efficient routing in the plane (extended abstract)
• Compact routing on Euclidian metrics
• Physical network infrastructure design based on user communication patterns

This page was built for publication: Sparse communication networks and efficient routing in the plane

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