Bounding the locality of distributed routing algorithms

DOI10.1007/S00446-012-0179-3MaRDI QIDQ2375823zbMATH OpenOpenAlexFDO

Authors Prosenjit Bose, Paz Carmi, Stephane Durocher

Publication date 25 June 2013

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-012-0179-3

zbMATH Keywords

dilationdistributed algorithmslocal routing

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• Bounding the locality of distributed routing algorithms
• Distributed Multi-Destination Routing: The Constraints of Local Information
• Space-efficiency for routing schemes of stretch factor three
• Upper and lower bounds for online routing on Delaunay triangulations
• Improved routing strategies with succinct tables

Cites work

• scientific article; zbMATH DE number 2086374 (Why is no real title available?)
• A trade-off between space and efficiency for routing tables
• Balancing Traffic Load Using One-Turn Rectilinear Routing
• Bounding the locality of distributed routing algorithms
• Competitive online routing in geometric graphs
• Interval routing schemes
• Labelling and Implicit Routing in Networks
• Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
• Memoryless routing in convex subdivisions: random walks are optimal
• ONLINE ROUTING IN CONVEX SUBDIVISIONS
• On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks
• Online Routing in Triangulations
• Route discovery with constant memory in oriented planar geometric networks
• Routing with guaranteed delivery in ad hoc wireless networks

Cited in

(13)

• Local routing in convex subdivisions
• Bounds for the optimal decentralized access protocol in a local area network
• Bounding the locality of distributed routing algorithms
• New algorithmic aspects of the local lemma with applications to routing and partitioning
• The Space Requirement of Local Forwarding on Acyclic Networks
• Competitive online routing on Delaunay triangulations
• Cycle-maximal triangle-free graphs
• Triangle-free graphs with the maximum number of cycles
• Tight stretch factors for L₁- and L_-Delaunay triangulations
• scientific article; zbMATH DE number 7774260 (Why is no real title available?)
• Distributed Multi-Destination Routing: The Constraints of Local Information
• On local routing of two-terminal nets
• On the spanning and routing ratio of the directed theta-four graph

This page was built for publication: Bounding the locality of distributed routing algorithms

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