What Should Be Isolated, Randomized, and Monitored?
The central question for Open vSwitch (OVS) is no longer whether its cache hierarchy can leave a timing trace; the evidence says that it can under the tested conditions. The practical question is how to protect a virtualized environment without confusing three different goals: removing shared state, making state harder to predict, and limiting or detecting the traffic that reaches it. This conclusion matches each control to the OVS cache route it addresses, then places those controls beside NIST's guidance on segmentation, firewalls, monitoring, and redundancy. The result is a conditional judgment, not a universal verdict about every OVS deployment.
Match the defense to the cache route
The paper's three defenses start from different diagnoses. If the root problem is that two workloads use the same caching structures, one response is to stop sharing the OVS instance. If the problem is a stable mapping from packet headers to microflow locations, another response is to randomize that mapping. If the problem is a predictable relationship between traffic frequency and megaflow subtable position, a separate response is to randomize when reordering occurs. These controls are complementary because the attacks exploit different state transitions.
Separate the state owner
OVS instance isolation is the most direct response to the shared-state cause. The paper evaluates separate OVS instances for the victim and the co-located service. In that arrangement, the traffic of one instance no longer changes the cache structures used by the other in the demonstrated way. Both covert channels fall to about 50% accuracy, which is the level expected from random bit guessing. Header recovery reaches 0% success. Packet-rate monitoring falls to 10.83% accuracy; the authors explain that this largely reflects reporting no traffic, while 10.33% of the evaluated dataset has zero traffic, so the result does not represent successful observation of nonzero victim traffic.
The important claim is not the appearance of a particular percentage. It is that removing the common cache owner removes the mediator that all three demonstrations need. The defense addresses the shared exact-match and broader-rule paths together in the tested design. It does not prove that two separately configured processes have no other common resource, nor that instance separation removes every possible side channel. It removes the specific OVS cache-sharing route that the paper measured.
The cost is operational. Separate instances consume additional memory and CPU cycles, and they complicate network management and configuration. Operators must maintain more forwarding domains and ensure that the desired traffic still reaches the correct instance. Isolation can also affect how easily a host adapts to workload movement. The security benefit is therefore strongest when the risk of cross-tenant inference justifies the resource and management overhead, especially for workloads that share a host but have materially different confidentiality requirements.
Make microflow placement less predictable
Microflow hash randomization addresses a different weakness: the attacker benefits from a stable relationship between packet-header fields and a small set of candidate cache locations. The paper evaluates a design that gives each flow ten times as many candidate locations. That change does not make the cache private and does not remove timing differences. It makes a collision observed by the attacker less useful as a direct map back to a victim's flow.
In the evaluation, microflow-based and megaflow-based covert-channel accuracy both fall close to 50% under the randomized microflow mechanism. Header recovery succeeds in only 5 of 100 trials. Packet-rate monitoring is also defended in the tested design because the attacker can no longer force precise microflow eviction in the same way. This last result illustrates the connection between cache levels: changing the first-level placement can reduce the attacker's ability to expose and measure the second-level state.
The boundary is just as important as the result. Randomization does not encrypt cache state, guarantee that timing becomes indistinguishable, or prove that a different inference method could not be designed. The evaluated candidate multiplier and algorithm are part of the paper's experiment. A deployment would need to consider the performance cost and implementation compatibility of a less predictable placement policy, then test whether the intended forwarding benefit remains acceptable.
Break the megaflow frequency signal
Megaflow reorder randomization targets the ordering path. In the paper's proposal, OVS does not reorder subtables on a predictable roughly one-second schedule; it chooses a random time within a longer interval of 1 to 10 seconds. That weakens the attacker's ability to infer traffic rate from the position of a subtable at a known point in time.