Abstract: Identifying a component within an application executed in a network includes obtaining a traffic matrix, the traffic matrix defining a rate for which packets of data are exchanged between VMs corresponding to an application, analyzing the traffic matrix to identify VMs within a component, modifying the traffic matrix to create a modified traffic matrix, and defining, for the application, a tenant application graph (TAG) model based on the modified traffic matrix.

Abstract: Example embodiments relate to providing efficient routing in software defined networks. In example embodiments, an indirect group table includes a first group entry that is associated with a first route tree in a software defined network. A failure is detected in the first route tree during a data transmission, and a notification of the failure is sent to a remote controller device, where the remote controller device identifies a second route tree that does not include the failure. After the remote controller device updates the first group entry to be associated with the second route tree, the data transmission is performed using the second route tree.

Abstract: Disclosed herein are a system, non-transitory computer readable medium, and method for governing communications of a bare metal guest in a cloud network. A network interface handles packets of data in accordance with commands by a control agent.

Abstract: According to an example, a cloud bandwidth modeling system may determine components for an application, create a vertex for each component in a graph representing a bandwidth model for the application, determine bandwidth requirements between each component, and create directed edges between the components to represent the bandwidth requirements.

Abstract: Managing non-congestion-controlled message traffic in a datacenter. Any non-congestion-controlled packets originating in a sending server and intended for a receiving server are encapsulated in the sending server and transmitted through a virtual circuit having a message transport protocol with rate control. The packets are decapsulated in the receiving server.

Abstract: Illustrated is a system and method to generate a teaching message with a host device address that impersonates a device source address, the impersonation to instruct an additional network device as to the host device address. It further include a transmitter to transmit the teaching message to the additional network device. It also includes traversing a forwarding table to identify an additional network device that has yet to receive a teaching message since an expiration of a predefined threshold value, the teaching message to relate to a source device. It also includes a transmitter to transmit a teaching message to the additional network device.

Abstract: Packet processing for packets from a virtual machine includes receiving a packet from an external switch at a computer system hosting a plurality of virtual machines. If the received packet is a learning packet, storing a packet signature determined from the learning packet. For a packet to be transmitted from a virtual machine in the computer system, determining if the packet's signature matches the stored packet signature. If the packet's signature matches the stored packet signature, performing an action associated with the packet signature.

Abstract: According to an example, a method for virtual machine (VM) data packet encapsulation and decapsulation may include receiving a data packet including a media access control (MAC) header and an internet protocol (IP) header. The method may further include encapsulating, by a processor, the received data packet to include an encapsulating MAC header, an encapsulating IP header, a VM MAC header with a same content as the MAC header of the received data packet, and a VM IP header with a same content as the IP header of the received data packet.

Abstract: According to an example, a method for bandwidth guarantee and work conservation includes determining virtual machine (VM) bandwidth guarantees assigned to VMs in a network including a source VM that communicates with destination VMs. The method further includes assigning minimum bandwidth guarantees to communications between the source VM with the destination VMs by dividing a VM bandwidth guarantee assigned to the source VM between the destination VMs based on active VM-to-VM communications between the source VM and the destination VMs. The method also includes allocating, by a processor, spare bandwidth capacity in the network to a communication between the source VM and a destination VM based on the assigned minimum bandwidth guarantees.

Abstract: In a method (400) for routing packets between a plurality of top switches (110a-110n) and a plurality of leaf switches (120a-120n) using a balancing table (204, 208, 210) in a fat tree network (100), a failed link between at least one top switch (110n) and at least one leaf switch (120n) is detected (402). In addition, the balancing table (204, 208, 210) is modified (406) based on the detected failed link, and the packets are routed (408) between the plurality of top switches (110a-110n) and the plurality of leaf switches (120a-120n) in the fat tree network (100) based on the modified balancing table (204, 208, 210).

Abstract: Topology input is used to identify a set of data flows as between a set of virtual machines (VMs), as well as one or more network services for one or more of the data flows. A determination is made as to a minimal number of network service virtual machines (NSVMs) for use in providing the one or more network services. An arrangement is determined for server resources and network resources of the data center network on which a virtual network topology is provided for the tenant, including the set of VMs and the number of NSVMs.

Abstract: In a method for routing packets between a plurality of switches in a computer network, in which paths between the plurality of switches are identified as a plurality of virtual local area networks (VLANs) stored in a balancing table, a packet to be routed from a source switch to a destination switch is received. In addition, a VLAN is selected from the plurality of VLANs in the balancing table to route the packet through the computer network and the packet is routed through the selected VLAN.

Abstract: Remote memory can be used for a number idle pages located on a virtual machine. A number of idle pages can be sent to the remote memory according to a placement policy, where the placement policy can include a number of weighting factors. A hypervisor on a computing device can record a local size and a remote page fault frequency of the number of virtual machines. The hypervisor can scan local memory to determine the number of idle pages and a number of idle virtual machines. The number of idle pages, including a page map and a remote address destination for each idle page, can be sent to the remote memory by the hypervisor. The number of virtual machines can be analyzed to determine a per-virtual machine local memory allocation.

Abstract: In a method for managing a data structure in a memory, an accessor to access a version of the data structure is determined, in which the accessor includes a version number and a fat pointer, in which the version number corresponds to the most recent version of the data structure, and wherein the fat pointer is configured to enable for multiple versions of a linked-data structure to be maintained.

Abstract: Example embodiments relate to selective invalidation of packet filtering cache results based on rule priority. In example embodiments, a network node determines whether a rule identifier included in a cache entry of a cache of results of a packet filtering rule set is of a higher priority than a highest priority rule corresponding to a rule set version identifier included in the cache entry. If so, the network node may apply an action included in the cache entry.

Abstract: Topology input is used to identify a set of data flows as between a set of virtual machines (VMs), as well as one or more network services for one or more of the data flows. A determination is made as to a minimal number of network service virtual machines (NSVMs) for use in providing the one or more network services. An arrangement is determined for server resources and network resources of the data center network on which a virtual network topology is provided for the tenant, including the set of VMs and the number of NSVMs.

Abstract: Managing non-congestion-controlled message traffic in a datacenter. Any non-congestion-controlled packets originating in a sending server and intended for a receiving server are encapsulated in the sending server and transmitted through a virtual circuit having a message transport protocol with rate control. The packets are decapsulated in the receiving server.

Abstract: A first virtual machine is implemented on one or more computing devices to generate input/output (I/O) requests to a hardware device. A second virtual machine is also implemented on the computing devices. A mechanism is to switch between a direct mode and an indirect mode without switching between a first context and a second context of the hardware device. In the direct mode, the I/O requests generated by the first virtual machine are to be sent to the hardware device without being redirected to the second virtual machine. In the indirect mode, the I/O requests generated by the first virtual machine are to be redirected to the second virtual machine for processing. The second virtual machine is to, after processing the I/O requests redirected to the second virtual machine, send the I/O requests to the hardware device.

Abstract: In a method for processing packets among at least a first computing device and a second computing device, in which the first computing device is configured to transmit and receive packets through a Network Interface Card (NIC), in the second computing device, descriptors of packets to be one of transmitted and received by the first computing device through a device descriptor queue are received and placed in a virtualized descriptor queue accessible by the second computing device. In addition, the packets associated with the descriptors placed in the virtualized descriptor queue are processed prior to one of transmission and receipt of the packets by the first computing device.

Abstract: A memory has a page to store code executable by a processor. A management component is to inject the code into a virtual machine. The management component is to indicate within a memory table for the virtual machine that the page of the memory has an injected code type.