Experimental evaluations of algorithms for IP table minimization

Angelo Fanelli (), Michele Flammini (), Domenico Mango, Giovanna Melideo and Luca Moscardelli ()
Additional contact information
Angelo Fanelli: CREM - Centre de recherche en économie et management - UNICAEN - Université de Caen Normandie - NU - Normandie Université - UR - Université de Rennes - CNRS - Centre National de la Recherche Scientifique, DI - Dipartimento di Informatica [Italy] - UNIVAQ - Università degli Studi dell'Aquila = University of L'Aquila = Université de L'Aquila
Michele Flammini: DI - Dipartimento di Informatica [Italy] - UNIVAQ - Università degli Studi dell'Aquila = University of L'Aquila = Université de L'Aquila
Domenico Mango: DI - Dipartimento di Informatica [Italy] - UNIVAQ - Università degli Studi dell'Aquila = University of L'Aquila = Université de L'Aquila
Giovanna Melideo: DI - Dipartimento di Informatica [Italy] - UNIVAQ - Università degli Studi dell'Aquila = University of L'Aquila = Université de L'Aquila
Luca Moscardelli: Dipartimento di Economia [G. D'Annunzio] - Università di Chieti-Pescara

Post-Print from HAL

Abstract: Reducing the size of IP routing tables is one of the most compelling scaling problems affecting the Internet because of massive growth of routing table entries, increased traffic, and the migration to 128 bit IPv6 addresses. Various algorithms for IP table minimization have been proposed in the literature both for a single and for multiple tables, also with the possibility of performing address reassignments. In this paper we first introduce two new compression heuristics, the BFM and its evolution called BFM-Cluster, that exploit address reassignments for the minimization of multiple routing tables, and then we experimentally evaluate their performances together with the already existing techniques. Since a main problem posed by the growth of the routing tables sizes is the consequent general increase of the table lookup time during the routing of the IP packets, the aim is twofold: to measure and compare the compression ratios of the different algorithms, and to estimate the effects of the compression on the lookup times by measuring the induced improvement on the time of the main algorithms and data structures for the fast IP address lookup from the original tables to the compressed ones. Our point is that the existing techniques are efficient in different situations, with BFM-Cluster heuristic outperforming all other ones.

Keywords: Routing; IP protocol; lookup times; optimal and approximation algorithms (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

Published in Journal of Interconnection Networks, 2011, 12 (4), pp.299-318. ⟨10.1142/S0219265911003015⟩

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:halshs-00776400

DOI: 10.1142/S0219265911003015

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().