Brief announcement: complexity and solution of the send-receive correlation problem

Authors:
Benito van der Zander;Egon Wanke;Wolfgang Kiess;Björn Scheuermann
Affiliations:
Heinrich Heine University, Düsseldorf, Germany;Heinrich Heine University, Düsseldorf, Germany;Heinrich Heine University, Düsseldorf, Germany;Heinrich Heine University, Düsseldorf, Germany
Venue:
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Year:
2010

Citing 6
Cited 0

Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A framework for wireless LAN monitoring and its applications

Proceedings of the 3rd ACM workshop on Wireless security
Analyzing the MAC-level behavior of wireless networks in the wild

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
On the time synchronization of distributed log files in networks with local broadcast media

IEEE/ACM Transactions on Networking (TON)
Who said that?: the send-receive correlation problem in network log analysis

ACM SIGMETRICS Performance Evaluation Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events. We discuss this send-receive correlation problem for networks with local broadcast media. We can prove that assigning send and receive events is an NP-complete problem. However, there is a solution algorithm that is exponential only in the number of nodes; if the number of network nodes is fixed, its complexity is polynomial.