Improved routing strategies with succinct tables

DOI10.1016/0196-6774(90)90017-9zbMath0724.68004OpenAlexW2006383304MaRDI QIDQ3212257

Amotz Bar-Noy, Nathan Linial, Baruch Awerbuch, David Peleg

Publication date: 1990

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(90)90017-9

zbMATH Keywords

routingpivotsstretch factorlocal memory

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (24)

An optimal message routing algorithm for double-loop networks ⋮ Routing among convex polygonal obstacles in the plane ⋮ Routing in polygonal domains ⋮ Average stretch analysis of compact routing schemes ⋮ Compact routing messages in self-healing trees ⋮ Multi-dimensional Interval Routing Schemes ⋮ Distributed distance computation and routing with small messages ⋮ Tree 3-spanners on generalized prisms of graphs ⋮ Interval routing in some planar networks. ⋮ On multi-label linear interval routing schemes ⋮ Distance estimation and object location via rings of neighbors ⋮ On the efficiency of routing in sensor networks ⋮ On efficient distributed construction of near optimal routing schemes ⋮ Fault-Tolerant Compact Routing Schemes for General Graphs ⋮ Compact Routing in Unit Disk Graphs ⋮ Space-efficient path-reporting approximate distance oracles ⋮ \(f\)-sensitivity distance oracles and routing schemes ⋮ Characterization of networks supporting multi-dimensional linear interval routing schemes ⋮ Interval routing schemes ⋮ Close to linear space routing schemes ⋮ Multidimensional interval routing schemes ⋮ Routing in Polygonal Domains ⋮ Static and dynamic low-congested interval routing schemes ⋮ Graph theoretical issues in computer networks

This page was built for publication: Improved routing strategies with succinct tables