Efficient and scalable merging algorithms for wireless traces - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2009

Efficient and scalable merging algorithms for wireless traces

Abstract

Analysis of wireless experimentation results is a complex task to achieve. As multiple probes are needed in order to get a global view of a wireless experimentation, the resulting packet traces may be very large. In this paper we propose an algorithm that realizes trace synchronization and merging in a scalable way. The algorithm generates a database that only stores the information marked as relevant for post-processing analysis by the experimenter. Initial performance results are promising.
Fichier principal
Vignette du fichier
RR-6969.pdf (419.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00397832 , version 1 (25-06-2009)

Identifiers

  • HAL Id : inria-00397832 , version 1

Cite

Bilel Ben Romdhanne, Diego Dujovne, Thierry Turletti, Walid Dabbous. Efficient and scalable merging algorithms for wireless traces. [Research Report] RR-6969, INRIA. 2009, pp.15. ⟨inria-00397832⟩
216 View
236 Download

Share

Gmail Facebook X LinkedIn More