26. Hierarchical Cluster-Based Routing
David Peleg · Society for Industrial and Applied Mathematics eBooks · 2000
The problem of efficient (low-dilation) message routing with succinct (low-memory) routing tables is one of the most natural candidate problems for clustered hierarchical treatment (and indeed, the first problem for which such an approach was considered). In this chapter, we explore the extent to which the performance of routing schemes can be optimized.