Premium
Efficient storage of nonadaptive routing tables
Author(s) -
Manber Udi,
McVoy Lawrence
Publication year - 1988
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230180402
Subject(s) - computer science , routing (electronic design automation) , routing table , point (geometry) , computer data storage , tree (set theory) , algorithm , mathematical optimization , computer network , routing protocol , mathematics , geometry , operating system , mathematical analysis
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.