Efficient and scalable merging algorithms for wireless traces

Bilel Ben Romdhanne 1 Diego Dujovne 1 Thierry Turletti 1 Walid Dabbous 1
1 PLANETE - Protocols and applications for the Internet
Inria Grenoble - Rhône-Alpes, CRISAM - Inria Sophia Antipolis - Méditerranée
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.
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/inria-00397832
Contributor : Bilel Ben Romdhanne <>
Submitted on : Thursday, June 25, 2009 - 10:55:14 AM
Last modification on : Wednesday, April 11, 2018 - 1:54:17 AM
Long-term archiving on : Tuesday, June 15, 2010 - 6:26:35 PM

File

RR-6969.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00397832, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

821

Files downloads

501