The compactness of adaptive routing tables
type: Item
instance of: scholarly article
title: The compactness of adaptive routing tables
zbMATH Open document ID: 1100.68002
DOI: 10.1016/S1570-8667(03)00027-3
author: Cyril Gavoille
author: A. Zemmari
published in: Journal of Discrete Algorithms
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 2082316
zbMATH Keywords: Compact routing tables
zbMATH Keywords: Adaptive routing
zbMATH Keywords: Interval routing
MaRDI profile type: Publication
cites work: The complexity of the characterization of networks supporting shortest-path interval routing.
cites work: Q4262693
cites work: Interval routing schemes
cites work: On devising Boolean Routing Schemes
cites work: Characterization results of all shortest paths interval routing schemes
cites work: The Complexity of Interval Routing on Random Graphs
cites work: Space-Efficient Message Routing inc-Decomposable Networks
cites work: Q4509345
cites work: A survey on interval routing
cites work: Worst Case Bounds for Shortest Path Interval Routing
cites work: The Compactness of Interval Routing
cites work: Memory requirement for routing in distributed networks
cites work: Lower bounds for compact routing
cites work: The complexity of shortest path and dilation bounded interval routing
cites work: Compact routing on chordal rings of degree 4
cites work: A trade-off between space and efficiency for routing tables
cites work: On the complexity of multi-dimensional interval routing schemes
cites work: Labelling and Implicit Routing in Networks
cites work: Q3711761
cites work: Interval Routing
description: scientific article; zbMATH DE number 2082316