Nicira, Inc.

Aditya Krishna Sonthy

Samuel Jacob

Subin Cyriac Mathew

Rajeev Nair

Srikar Tati

Alex Tessmer

Ganesan Chandrashekhar

Boon Seong Ang

Alexander Tessmer

Wenyi Jiang

Rishi Mehta

Hongwei Zhu

Aditya Gajanana Holla

Shrikrishna Khare

An approach for improving throughput for encapsulated network traffic is provided. In an embodiment, a method comprises obtaining a plurality of network addresses of a plurality of intermediaries that facilitate communications between a plurality of virtual machines. A set of source-destination intermediary pairs is determined based on the plurality of network addresses, and for each source-destination intermediary pair, from the set of source-destination intermediary pairs, a precomputed encapsulated header is generated and included in a set of precomputed encapsulated headers. If a data packet from a particular source intermediary and destined to a particular destination intermediary is received, and a particular precomputed encapsulated header for the particular source intermediary and the particular destination intermediary is included in the set of precomputed encapsulated headers, then the particular precomputed encapsulated header is retrieved from the set of precomputed encapsulated headers and used to form a particular encapsulated packet.

Method for improving throughput for encapsulated network traffic

Described herein are systems, methods, and software to enhance flow operations on a host computing system. In one implementation, a virtual switch on a host identifies a packet from a virtual node. In response to identifying the packet, the virtual switch determines whether the packet corresponds to a cached result action based on traits of the packet. If the packet corresponds to a cached result action, then the virtual switch may process the packet in accordance with the cached result action. In contrast, if the packet does not correspond to a cached result action, then the virtual switch may process the packet in accordance with first flow operations to determine a result action, and cache the result action for use with future packets.

Caching flow operation results in software defined networks

An approach for dynamically distributing RSS engines to virtual machines based on flow data is disclosed. A method comprises receiving first absolute counts of data packets that belong to at least one data flow. Flow load indicator values are computed based on the first absolute counts, and stored in a lookup table. A sorted table is generated by sorting entries of the lookup table. A first count of filters that can be applied on RSS engines is determined. A second count of data flows in the sorted table and having corresponding flow load indicator values exceeding a threshold value is determined. If the second count exceeds the first count, then the first count of data flows is selected from the sorted table. The first count of filters that correspond to the data flows is determined, and the first count of the filters is assigned to at least one RSS engine.

Dynamic distribution of RSS engines to virtual machines based on flow data

Growing community of inventors

Milpitas, CA, United States of America

Aditya Krishna Sonthy