Efficient storage of nonadaptive routing tables
1988; Wiley; Volume: 18; Issue: 4 Linguagem: Inglês
10.1002/net.3230180402
ISSN1097-0037
Autores Tópico(s)Network Packet Processing and Optimization
ResumoAbstract An algorithm for improving storage utilization for nonadaptive routing tables in point‐to‐point networks is presented. It allows storage vs. access time tradeoffs. The algorithm is quite general, and it can be used for other applications to improve storage in tree‐like structures. The algorithm was applied to the UUCP routing tables resulting in a threefold storage improvement.
Referência(s)