Lower bounds for compact routing (extended abstract)

DOI10.1007/3-540-60922-9_43MaRDI QIDQ4593958zbMATH OpenOpenAlexFDO

Authors Evangelos Kranakis, D. Krizanc

Publication date 16 November 2017

Published in STACS 96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60922-9_43

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Universal routing schemes
• The complexity of shortest path and dilation bounded interval routing
• scientific article; zbMATH DE number 2086374
• scientific article; zbMATH DE number 1760012
• Worst Case Bounds for Shortest Path Interval Routing

Cited in

(12)

• The complexity of shortest path and dilation bounded interval routing
• A survey on interval routing
• On the complexity of multi-dimensional interval routing schemes
• The compactness of adaptive routing tables
• Interval routing \(\and\) layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Beneš networks
• scientific article; zbMATH DE number 1340883 (Why is no real title available?)
• Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
• scientific article; zbMATH DE number 2086374 (Why is no real title available?)
• Interval routing schemes allow broadcasting with linear message-complexity
• Compact and localized distributed data structures
• Distributed Computing
• Constraint satisfaction, packet routing, and the lovasz local lemma

This page was built for publication: Lower bounds for compact routing (extended abstract)

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