Email this article METHOD OF ROUTING TABLE OPTIMIZATION
- Authors: Smagin AA1, Shigotarov AV1
-
Affiliations:
- Issue: Vol 7, No 3 (2009)
- Pages: 59-62
- Section: Articles
- URL: https://journals.eco-vector.com/2073-3909/article/view/55712
- ID: 55712
Cite item
Full Text
Abstract
In this paper we consider the method of routing table optimization based on the boolean function minimization algorithm. The experimental results obtained on the routing table information from large Internet exchange points show high performance of the method for high dimension tasks. Keywords: routing table optimization, boolean function minimization, binary decision diagram, set cover problem.
References
- Coudert O., Madre J.C. Implicit and incremental computation of primes and essential primes of Boolean functions // Proc. of the Design Automation Conf. Anaheim, CA, 1992. - P. 36-39.
- Coudert O., Madre J.C. New ideas for solving covering problems // Proc. of the Design Automation Conference, 1995. - P. 641-645.
- Hayashi T., Miyazaki T. High-Speed Table Lookup Engine for IPv6 Longest Prefix Match // Proc. IEEE Globecom, vol. 2, IEEE Press, Piscataway, N. J., 1999. - P. 1576-1581.
- Liu H. Routing Table Compaction in Ternary-CAM // IEEE Micro. Jan/Feb, 2002. - P. 58-64.
- Meinel C., Theobald T. Algorithms and data structures in VLSI design. Springer-Verlag NY, 1998. - 267 p.
- McAuley A., Francis P. Fast Routing Table Lookup Using CAMs // Proc. IEEE Infocom. Vol. 3. IEEE CS Press, Los Alamitos, Calif., 1993. - P. 1382-1391.
- Rudell R. Multiple-valued minimization for PLA synthesis. UCB technical report M86/65, 1986.
- http://www.ee.pdx.edu/~alanmi/research/extra.htm
- http://www.routeviews.org/vlsi.colorado. edu/~fabio/
Supplementary files
