Efficient storage of nonadaptive routing tables

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Networks 1988-12, Vol.18 (4), p.263-272
Hauptverfasser: Manber, Udi, McVoy, Lawrence
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0028-3045
1097-0037
DOI:10.1002/net.3230180402