Path similarity evaluation using Bloom filters - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computer Networks Year : 2011

Path similarity evaluation using Bloom filters


The performance of several Internet applications often relies on the measurability of path similarity between different participants. In particular, the performance of content distribution networks mainly relies on the awareness of content sources topology information. It is commonly admitted nowadays that, in order to ensure either path redundancy or efficient content replication, topological similarities between sources is evaluated by exchanging raw traceroute data, and by a hop by hop comparison of the IP topology observed from the sources to the several hundred or thousands of destinations. In this paper, based on real data we collected, we advocate that path similarity comparisons between different Internet entities can be much simplified using lossy coding techniques, such as Bloom filters, to exchange compressed topology information. The technique we introduce to evaluate path similarity enforces both scalability and data confidentiality while maintaining a high level of accuracy. In addition, we demonstrate that our technique is scalable as it requires a small amount of active probing and is not targets dependent.
Fichier principal
Vignette du fichier
paper.pdf (386.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00748208 , version 1 (29-01-2013)



B. Donnet, B. Gueye, Mohamed Ali Kaafar. Path similarity evaluation using Bloom filters. Computer Networks, 2011, ⟨10.1016/j.comnet.2011.11.003⟩. ⟨hal-00748208⟩
100 View
491 Download



Gmail Facebook X LinkedIn More