Nicira, Inc.

Vmware, Inc.

Other

Michael M Hu

Teemu Koponen

Ronghua Zhang

Yong Wang

Xinhua Hong

Sai Samrat Karlapudi

Bo Lin

Shadab Shah

Kai-Wei Fan

Ansis Atteka

Yi Zeng

Ramsés V Morales

Dongping Chen

Haihua Luo

Jerry Cheng

Ramsès V Morales

The present disclosure relates to querying data cores for data items that correspond to a specified time range. Probabilistic data structures corresponding to associated data cores are used to filter the plurality of data cores to identify a subset of data cores that contain data items corresponding to the specified time range. Only the subset of the plurality of data cores determined to contain relevant data items are searched.

Efficient time-range queries on databases in distributed computing systems

Systems and methods described herein provide a high availability DHCP server capable of serving multiple tenants in a data center. The DHCP server may use a different logical DHCP server instance for each tenant, and may be implemented as one process without the use of namespaces. A DHCP server is executed on a gateway virtual machine (VM) that is capable of hosting a plurality of logical DHCP servers. For each tenant in a data center, a logical network and a corresponding logical DHCP server instance are implemented. The DHCP server may service requests for DHCP services from VMs via their physical host by determining the tenant that the VM originates from and leasing a DHCP resource from that tenant's corresponding logical DHCP server instance.

Systems and methods for providing multi-tenant dynamic host configuration protocol services

A method for cooperative active-standby failover between service routers based on health of services configured on the service routers is presented. In an embodiment, a method comprises determining, by a first service router ('SR') of a SR cluster, a plurality of aggregate score values for a plurality of SRs of the SR clusters. The SR cluster comprises the first SR which is active, and a second SR. An aggregate score value, of the plurality of aggregate score values, indicates health of one or more services configured on a SR. The method further comprises determining, based on the plurality of aggregate score values, whether the first SR, of the SR cluster, is healthier than the second SR. In response to determining that the first SR is healthier than the second SR, the first SR continues to operate in the active mode; otherwise, the first SR switches to a standby mode.

Method of cooperative active-standby failover between logical routers based on health of attached services

A novel design of a gateway that handles traffic in and out of a network by using a datapath daemon is provided. The datapath daemon is a run-to-completion process that performs various data-plane packet-processing operations at the edge of the network. In some embodiments, the datapath daemon dispatches packets to other processes or processing threads outside of the daemon. In some embodiments, the datapath daemon dispatches packets to a kernel network stack in order to support packet traffic monitoring.

Edge datapath using user-kernel transports

A novel design of a gateway that handles traffic in and out of a network by using a datapath daemon is provided. The datapath daemon is a run-to-completion process that performs various data-plane packet-processing operations at the edge of the network. The datapath daemon dispatches packets to other processes or processing threads outside of the daemon. At least one of these other processes is a control plane process that consumes the packet.

Edge datapath using inter-process transports for control plane processes

A novel design of a gateway that handles traffic in and out of a network by using a datapath daemon is provided. The datapath daemon is a run-to-completion process that performs various data-plane packet-processing operations at the edge of the network. The datapath daemon dispatches packets to other processes or processing threads outside of the daemon. At least one of these other processes is a data plane process that returns a resulting packet to the datapath daemon.

Edge datapath using inter-process transports for data plane processes

Parallel and reflective coding structures inclusive of data from both parties to a transaction are propagated beginning with an algorithm derived maker's code, an item code unique to and associated with a single article made by a maker, and data identifying both the maker and the legitimate acquirer. Use of secure hash algorithms, single and double key encryption are suggested to obtain two virtually irreversible parallel coding structures that reflect the identities of the current and previous owner and are also mathematically reflective in that one code is derivable by either code structure in verification of both authenticity and ownership. Multiple modes of verification with coding printed on a receipt for the article are provided including Internet, offline computer, land line and SMS cellular telephone. Authenticity, non-repudiation, proof of legitimate ownership and provenance are provided for any article of value including pharmaceuticals and other consumable product warranting authentification.

Pedigree code enabling authentification through computer generated unbroken chain reflective coding including transaction party data

A binary code printed upon documents and articles includes: an origin code referring to pertinent data including category, creator identity, creation time; and an algorithm derived authentification code based upon the origin code. A world wide web (WWW) accessible registry provides authentification with input of the origin and authentification codes. A third ownership code possesses status which is similarly accessible. The authentification code is verified algorithmically from the origin code. Ownership code status indicates, at minimum, 'home' or 'field' for paper currency and &lsquo;inventory&rsquo; or &lsquo;sold&rsquo; for goods which status is only modifiable by authorized access. For suitable categories a secret code is available to the first purchaser after authorized release from inventory with WWW input of the printed origin and authentification binary code. This secret code is inaccessible without input of the full trinary code including the secret code. Ownership is hence verifiable and subsequent purchasers may replace the secret code with disclosure of the predecessor which capability verifies registered ownership.

Growing community of inventors

Fremont, CA, United States of America

Michael M Hu