VMware, Inc.
Distributed computation of graph embeddings for network traffic in virtual networks

Abstract:

In one set of embodiments, a host system can perform a random walk along a graph representing network traffic in a virtual network, where the virtual network comprises a plurality of virtual machines (VMs) running on a plurality of host systems including the host system, and where the random walk starts from a node of the graph corresponding to a VM running on the host system. The host system can further construct, based on the random walk, a local neighborhood of VMs associated with the VM and determine, based on the local neighborhood, whether the VM is a localized VM. Upon determining that the VM is not a localized VM, the host system can transmit a random walk data entry identifying the VM and the local neighborhood to a server communicatively coupled with the plurality of host systems.