On the IP routing tables minimization with addresses reassignments

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

Volumn 18, Issue , 2004, Pages 253-260

  Bilò, Vittorio ^a   Flammini, Michele ^a  

^a UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ADDRESS TRANSLATORS; CLASSLESS INTER-DOMAIN ROUTING (CIDR); INTERNET PROTOCOL (IP); NETWORK ADDRESS TRANSLATORS (NAT);

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; NETWORK PROTOCOLS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; WIRELESS TELECOMMUNICATION SYSTEMS;

ROUTERS;

EID: 12444289557     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. How nat works, http://www.cisco.com/warp/public/natcisco.shtml.
2. N. Christofides. Worst case analysis of a new heuristic for the travelling salesman problem. Technical Report 388, GSIA Carnegie-Mellon University, Pittsburgh, PA, 1976.
3. M. Degermark, A. Brodnik, S. Carlsson, and S. Pink. Small forwarding tables for fast routing lookups. Computer Communications Review, October 1997.
4. R. Draves, C. King, S. Venkatachary, and B. Zill. Constructing optimal IP routing tables. Proceedings of the IEEE INFOCOM, March 1999.
5. K. Egevang and P. Francis. The IP network address translator (NAT). RFC 1631, May 1994.
6. V. Fuller, T. Li, J. Yu, and K. Varadhan. Supernetting: an address assignment and aggregation strategy. RFC 1338, June 1992.
7. V. Fuller, T. Li, J. Yu, and K. Varadhan. Classless inter-domain routing. RFC 1519, June 1993.
8. M. Garey and D. Johnson. Computers and Intractability. A guide to the theory of NP-completeness. W.H. Freeman, San Francisco, 1979.
9. P. Gupta, B. Prabhakar, and S. Boyd. Near optimal routing lookups with bounded worst case performance. Proceedings of the IEEE INFOCOM, March 2000.
10. N. Huang, S. Zhao, J. Pan, and C. Su. A fast IP routing lookup scheme for gigabit switching routers. Proceedings of the IEEE INFOCOM, March 1999.
11. L. Kleinrock and F. Kamoun. Hierarchical routing for large networks. Computer Networks, 1:155-174, 1977.
12. B. Lampson, V. Srinivasan, and G. Varghese. IP lookups using multiway and multicolumn search. Proceedings of the IEEE INFOCOM, March/April 1998.
13. J. Mogul and J. Postel. Internet standard subnetting procedure. RFC 950, August 1985.
14. J. Turner, Q. Bian, and M. Waldvogel. Routing table compression using binary tree collapse. Technical Report 98-13, Washington University in St. Louis, May 1998.