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

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. Categories and Subject Descriptors: C.2 [Computer-Communication Networks]: General; C.4 [Performance of Systems]: Measurement Techniques; F.2.2 [Algorithm Analysis, Complexity]: Nonnumerical Algorithms and Problems General Terms: Algorithms, Experimentation, Theory

• Type: Conference
• Year: 2010
• Where: PODC
• Authors: Benito van der Zander, Egon Wanke, Wolfgang Kieß, Björn Scheuermann
• Keywords: Binary Identical Send, Distributed And Parallel Computing, Packet Log files, PODC 2010, Send-receive Correlation Problem