import edu.uci.iotproject.trafficreassembly.layer2.Layer2FlowObserver;
import org.pcap4j.core.*;
-import java.util.ArrayList;
-import java.util.HashMap;
-import java.util.List;
-import java.util.Map;
+import java.util.*;
import java.util.function.Function;
/**
private int mLimitSkippedPackets;
+ /**
+ * Router's WLAN MAC.
+ */
+ private String mTrainingRouterWlanMac;
+ private String mRouterWlanMac;
+
+ /**
+ * Relaxed matching
+ */
+ private int mDelta;
+ private Set<Integer> mPacketSet;
+
/**
* Create a new {@link Layer2ClusterMatcher} that attempts to find occurrences of {@code cluster}'s members.
* @param cluster The sequence mutations that the new {@link Layer2ClusterMatcher} should search for.
*/
- public Layer2ClusterMatcher(List<List<PcapPacket>> cluster, int inclusionTimeMillis,
- boolean isRangeBased, double eps, int limitSkippedPackets) {
+ public Layer2ClusterMatcher(List<List<PcapPacket>> cluster, String trainingRouterWlanMac, String routerWlanMac, int inclusionTimeMillis,
+ boolean isRangeBased, double eps, int limitSkippedPackets, int delta, Set<Integer> packetSet) {
// Consider all flows if no flow filter specified.
- this(cluster, flow -> true, inclusionTimeMillis, isRangeBased, eps, limitSkippedPackets);
+ this(cluster, trainingRouterWlanMac, routerWlanMac, flow -> true, inclusionTimeMillis, isRangeBased, eps,
+ limitSkippedPackets, delta, packetSet);
}
/**
* Create a new {@link Layer2ClusterMatcher} that attempts to find occurrences of {@code cluster}'s members.
* @param cluster The sequence mutations that the new {@link Layer2ClusterMatcher} should search for.
+ * @param trainingRouterWlanMac The training router's WLAN MAC (used for determining the direction of packets).
+ * @param routerWlanMac The target trace router's WLAN MAC (used for determining the direction of packets).
* @param flowFilter A filter that defines what {@link Layer2Flow}s the new {@link Layer2ClusterMatcher} should
* search for {@code cluster}'s members in. If {@code flowFilter} returns {@code true}, the flow
* will be included (searched). Note that {@code flowFilter} is only queried once for each flow,
* @param isRangeBased The boolean that decides if it is range-based vs. strict matching.
* @param eps The epsilon value used in the DBSCAN algorithm.
*/
- public Layer2ClusterMatcher(List<List<PcapPacket>> cluster, Function<Layer2Flow, Boolean> flowFilter,
- int inclusionTimeMillis, boolean isRangeBased, double eps, int limitSkippedPackets) {
+ public Layer2ClusterMatcher(List<List<PcapPacket>> cluster, String trainingRouterWlanMac, String routerWlanMac,
+ Function<Layer2Flow, Boolean> flowFilter, int inclusionTimeMillis, boolean isRangeBased,
+ double eps, int limitSkippedPackets, int delta, Set<Integer> packetSet) {
super(cluster, isRangeBased);
mFlowFilter = flowFilter;
+ mTrainingRouterWlanMac = trainingRouterWlanMac;
+ mRouterWlanMac = routerWlanMac;
mRangeBased = isRangeBased;
mEps = eps;
mInclusionTimeMillis =
mSkippedPackets = new ArrayList<>();
// Give integer's MAX_VALUE if -1
mLimitSkippedPackets = limitSkippedPackets == -1 ? Integer.MAX_VALUE : limitSkippedPackets;
+ mDelta = delta;
+ mPacketSet = packetSet;
}
@Override
}
}
+ // TODO: Relaxed matching is applied in conservative matching
private void conservativeMatching(Layer2Flow flow, PcapPacket newPacket) {
if (mPerFlowSeqMatchers.get(flow) == null) {
// If this is the first time we encounter this flow, we need to set up sequence matchers for it.
Layer2SequenceMatcher[][] matchers = new Layer2SequenceMatcher[mCluster.size()][mCluster.get(0).size()];
// Prepare a "state 0" sequence matcher for each sequence variation in the cluster.
for (int i = 0; i < matchers.length; i++) {
- matchers[i][0] = new Layer2SequenceMatcher(mCluster.get(i), mInclusionTimeMillis);
+ matchers[i][0] = new Layer2SequenceMatcher(mCluster.get(i), mInclusionTimeMillis, mTrainingRouterWlanMac,
+ mRouterWlanMac, mDelta, mPacketSet);
}
// Associate the new sequence matcher table with the new flow
mPerFlowSeqMatchers.put(flow, matchers);
// We always want to have a sequence matcher in state 0, regardless of if the one that advanced
// from state zero completed its matching or if it replaced a different one in state 1 or not.
if (sm.getMatchedPacketsCount() == 1) {
- matchers[i][j] = new Layer2SequenceMatcher(sm.getTargetSequence(), mInclusionTimeMillis);
+ matchers[i][j] = new Layer2SequenceMatcher(sm.getTargetSequence(), mInclusionTimeMillis,
+ mTrainingRouterWlanMac, mRouterWlanMac, mDelta, mPacketSet);
}
}
}
}
}
- // Update the maximum number of skipped packets
+ // Update the maximum number of skipped packets.
private boolean checkMaxSkippedPackets(List<PcapPacket> flowPackets, List<PcapPacket> matchedPackets) {
// Count number of skipped packets by looking into
- // the difference of indices of two matched packets
+ // the difference of indices of two matched packets.
boolean stillMatch = true;
for(int i = 1; i < matchedPackets.size(); ++i) {
int currIndex = flowPackets.indexOf(matchedPackets.get(i-1));
List<Layer2RangeMatcher> listMatchers = new ArrayList<>();
// Prepare a "state 0" sequence matcher.
Layer2RangeMatcher matcher = new Layer2RangeMatcher(mCluster.get(0), mCluster.get(1),
- mInclusionTimeMillis, mEps);
+ mInclusionTimeMillis, mEps, mTrainingRouterWlanMac, mRouterWlanMac);
listMatchers.add(matcher);
// Associate the new sequence matcher table with the new flow.
mPerFlowRangeMatcher.put(flow, listMatchers);
// Add the new matcher into the list
if (addOneArray) {
Layer2RangeMatcher newMatcher = new Layer2RangeMatcher(mCluster.get(0), mCluster.get(1),
- mInclusionTimeMillis, mEps);
+ mInclusionTimeMillis, mEps, mTrainingRouterWlanMac, mRouterWlanMac);
listMatchers.add(newMatcher);
}
// Present packet to the sequence matchers.
// Make a shallow copy of the list so that we can clean up the actual list when a matcher is terminated.
// Otherwise, we would get an exception for changing the list while iterating on it.
List<Layer2RangeMatcher> listMatchersCopy = new ArrayList<>(listMatchers);
+ Layer2RangeMatcher previousMatcher = null;
for(Layer2RangeMatcher matcher : listMatchersCopy) {
Layer2RangeMatcher sm = matcher;
// Check if no packets are matched yet or if there are matched packets, the next packet to be matched
newPacket.getTimestamp().isAfter(sm.getLastPacket().getTimestamp())) {
boolean matched = sm.matchPacket(newPacket);
if (matched) {
+ // BUG: found on May 29, 2019
+ // We need to remove a previous match if the current match is later in time.
+ // This is done only if we have matched at least 1 packet (we are about to match the second or
+ // later packets) and we match for the same packet position in the signature (check the size!).
+ if (previousMatcher != null && sm.getMatchedPacketsCount() > 1 &&
+ previousMatcher.getMatchedPacketsCount() == sm.getMatchedPacketsCount()) {
+ List<PcapPacket> previouslyMatchedPackets = previousMatcher.getMatchedPackets();
+ List<PcapPacket> currentlyMatchedPackets = sm.getMatchedPackets();
+ // We need to check 1 packet before the last matched packet from the previous matcher.
+ int packetIndexToCheck = (sm.getMatchedPacketsCount() - 1) - 1;
+ if (currentlyMatchedPackets.get(packetIndexToCheck).getTimestamp().
+ isAfter(previouslyMatchedPackets.get(packetIndexToCheck).getTimestamp())) {
+ listMatchers.remove(previousMatcher);
+ }
+ }
if (sm.getMatchedPacketsCount() == sm.getTargetSequencePacketCount()) {
// Update maximum skipped packets
boolean stillMatch = checkMaxSkippedPackets(flow.getPackets(), sm.getMatchedPackets());
// Terminate sequence matcher since matching is complete.
listMatchers.remove(matcher);
}
+ previousMatcher = sm;
}
}
}
projects / pingpong.git / blobdiff