Compact routing schemes

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2001, Pages 1-10

  Thorup, M ^a   Zwick, U ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; NETWORK PROTOCOLS; PACKET NETWORKS; TREES (MATHEMATICS);

ROUTING SCHEMES;

ROUTERS;

EID: 0034824939     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378580.378581     Document Type: Conference Paper

References (28)

1. Compact labeling schemes for ancestor queries
2. Derandomization, witnesses for boolean matrix multiplication, and construction of perfect hash functions
3. Improved routing strategies with succinct tables
4. Routing with polynomial communication-space trade-off
5. Optimal bounds for the predecessor problem
6. Compact routing with minimum stretch
7. All pairs almost shortest paths
8. Compact routing schemes with low stretch factor
9. Extremal problems in graph theory
10. On power-law relationships of the internet topology
11. Memory requirements for univesal routing schemes
12. Interval routing schemes
13. Storing a sparse table with O(1) worst case access time
14. A survey on interval routing
15. Space-efficiency of routing schemes of stretch factor three
16. Memory requirements for routing in distributed networks
17. A trade-off between space and efficiency for routing tables
18. Labelling and implicit routing in networks
19. Approximate distance oracles
20. Preserving order in a forest in less than logarithmic time and linear space
21. Design and implementation of an efficient priority queue
22. Computer networks with compact routing tables