Experimental evaluations of algorithms for IP table minimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4525 LNCS, Issue , 2007, Pages 324-337

  Fanelli, Angelo ^a   Flammini, Michele ^a   Mango, Domenico ^a   Melideo, Giovanna ^a   Moscardelli, Luca ^a  

^a UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

Compression; IP protocol; Lookup times; Optimal and approximation algorithms; Routing

Indexed keywords

APPROXIMATION ALGORITHMS; DATA COMPRESSION; DATA STRUCTURES; HEURISTIC ALGORITHMS; INTERNET PROTOCOLS; ROUTING ALGORITHMS; TABLE LOOKUP;

COMPRESSION RATIOS; LOOKUP TIMES; ROUTING TABLES SIZES;

ROUTERS;

EID: 37149011780     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72845-0_25     Document Type: Conference Paper

References (19)

1. Bilò, V., Flammini, M.: On the ip routing tables minimization with addresses reassignments. In: Proc. of the 18th International Parallel and Distributed Processing Symposium (IPDPS) (2004)
2. Buchsbaum, A.L., Fowler, G.S., Krishnamurthy, B., Vo, K.-P., Wang, J.: Fast prefix matching of bounded strings. ACM Journal of Experimental Algorithms, vol. 8 (2003)
3. Crescenzi, P., Dardini, L., Grossi, R.: IP address lookup made fast and simple. In: Nešetřil, J. (ed.) ESA 1999. LNCS, vol. 1643, Springer, Heidelberg (1999)
4. Degermark, M., Brodnik, A., Carlsson, S., Pink, S.: Small forwarding tables for fast routing lookups. In: Proceedings of ACM Sigcomm, pp. 3-14 (1997)
5. Draves, R., King, C., Srinivasan, V., Zill, B.: Constructing optimal IP routing tables. In: Proceedings of The Conference on Computer Communications, 18th joint conference of the IEEE Computer and Communications Societies (INFOCOM) (1999)
6. Egevang, K., Francis, P.: The ip network address translator (NAT). Internet RFC 1631 (May 1994)
7. Ford, W., Topp, W.: Data Structures with C++. Prentice-Hall, Englewood Cliffs (1996)
8. Gupta, P., Lin, S., McKeown, N.: Routing lookups in hardware at memory access speeds. In: Proceedings of The Conference on Computer Communications, 17th joint conference of the IEEE Computer and Communications Societies (INFOCOM), pp. 1240-1247 (1998)
9. Gupta, P., Prabhakar, B., Boyd, S.P.: Near optimal routing lookups with bounded worst case performance. In: Proceedings of The Conference on Computer Communications, 19th joint conference of the IEEE Computer and Communications Societies (INFOCOM), pp. 1184-1192 (2000)
10. Kernen, T.: Traceroute org. http://www.traceroute.org/#Route Servers (2005)
11. Lampson, B., Srinivasan, V., Varghese, G.: IP lookups using multiway and multicolumn search. IEEE/ACM Transactions on Networking 7(3), 324-334 (1999)
12. NANOG. The north american network operators' group. http://www.nanog.org/ lookingglass.html (2005)
13. Nilsson, S.: Home page, http://www.nada.kth.se/snilsson
14. Nilsson, S., Karlsson, G.: Ip-address lookup using lc-tries. IEEE Journal of Selected Areas in Communications 17(6), 1083-1092 (1999)
15. Srinivasan, V.: Fast and efficient Internet lookups. PhD thesis, Washington University (1999)
16. Srinivasan, V., Varghese, G.: Faster ip lookups using controlled prefix expansion. ACM Transactions on Computer Systems 17(1), 1-40 (1999)
17. Michigan University and Merit Network. Internet performance and analysis (ipma) project, http://www.merit.edu
18. Waldvogel, M.: Fast Longest Prefix Matching: Algorithms, Analysis, and Applications. PhD thesis, Swiss Federal Institute of Technology - Zurich (2000)
19. Waldvogel, M., Varghese, G., Turner, J., Plattner, B.: Scalable high-speed ip routing lookups. In: Proceedings of ACM Sigcomm, pp. 25-36, (October 1997)