Michael J Dalton

US Patent:

20220393977, Dec 8, 2022

Filed:

Aug 18, 2022

Appl. No.:

17/890348

Inventors:

- Mountain View CA, US
Balakrishna Raghunath - San Jose CA, US
Uday Ramakrishna Naik - Pleasanton CA, US
Michael Dalton - San Francisco CA, US

International Classification:

H04L 45/586
G06F 9/455
H04L 45/64
H04L 45/745
H04L 69/22
H04L 61/5007

Abstract:

Systems and methods of offloading multicast virtual network packet processing to a network interface card are provided. In an example implementation, a network interface card can route packets in a virtual network. The network interface card can be configured to receive a data packet having a multicast header for transmission to a plurality of destination virtual machines. The network interface card can retrieve a list of next hop destinations for the data packet. The network interface card can replicate the packet for each next hop destination. The network interface card can encapsulate each replicated packet with a unicast header that includes a next hop destination virtual IP address indicating the next hop destination and a source virtual IP address, and transmit the encapsulated packets.

US Patent:

20210099383, Apr 1, 2021

Filed:

Dec 11, 2020

Appl. No.:

17/119275

Inventors:

- Mountain View CA, US
Balakrishna Raghunath - San Jose CA, US
Uday Ramakrishna Naik - Pleasanton CA, US
Michael Dalton - San Francisco CA, US

Assignee:

Google LLC - Mountain View CA

International Classification:

H04L 12/713
H04L 12/741
H04L 29/12
H04L 12/715
H04L 29/06
G06F 9/455

Abstract:

Systems and methods of offloading multicast virtual network packet processing to a network interface card are provided. In an example implementation, a network interface card can route packets in a virtual network. The network interface card can be configured to receive a data packet having a multicast header for transmission to a plurality of destination virtual machines. The network interface card can retrieve a list of next hop destinations for the data packet. The network interface card can replicate the packet for each next hop destination. The network interface card can encapsulate each replicated packet with a unicast header that includes a next hop destination virtual IP address indicating the next hop destination and a source virtual IP address, and transmit the encapsulated packets.

US Patent:

20210014161, Jan 14, 2021

Filed:

Feb 11, 2019

Appl. No.:

16/272518

Inventors:

- Mountain View CA, US
Balakrishna Raghunath - San Jose CA, US
Uday Ramakrishna Naik - Pleasanton CA, US
Michael Dalton - San Francisco CA, US

International Classification:

H04L 12/713
H04L 12/741
H04L 29/06
H04L 29/12
H04L 12/715
G06F 9/455

Abstract:

Systems and methods of offloading multicast virtual network packet processing to a network interface card are provided. In an example implementation, a network interface card can route packets in a virtual network. The network interface card can be configured to receive a data packet having a multicast header for transmission to a plurality of destination virtual machines. The network interface card can retrieve a list of next hop destinations for the data packet. The network interface card can replicate the packet for each next hop destination. The network interface card can encapsulate each replicated packet with a unicast header that includes a next hop destination virtual IP address indicating the next hop destination and a source virtual IP address, and transmit the encapsulated packets.

US Patent:

20160321295, Nov 3, 2016

Filed:

May 10, 2016

Appl. No.:

15/150706

Inventors:

- Mountain View CA, US
Michael W. Dalton - San Francisco CA, US

International Classification:

G06F 17/30

Abstract:

A computer-implemented distributed file-system in a distributed data network in which metadata related to the files and directories of the file-system is distributed. A unique and non-reusable inode number is assigned to each file/directory of the file-system. A key-value store built up in rows is created for the distributed metadata. Each of the rows has a composite row key and a row value (key-value pair) where the composite row key for each file/directory includes the inode number of the parent directory, and a name of the file/directory. For files below the maximum file size, the entire file or portion thereof is encoded in the corresponding row value of the key-value pair. In this case, the corresponding composite row key holds the inode number of the file itself and an offset information of the data of the file in the row value. Files above maximum file size are stored in a large-scale storage.

US Patent:

20150092550, Apr 2, 2015

Filed:

Sep 27, 2013

Appl. No.:

14/040181

Inventors:

Brian P. Christian - Santa Cruz CA, US
Michael W. Dalton - San Francisco CA, US
Timothy Demarest - San Jose CA, US
Michael A. Ware - Santa Cruz CA, US

International Classification:

H04L 12/833

US Classification:

370235

Abstract:

A method and high availability cluster configuration for capture of data packets propagating in an external network into the cluster through a wired-tap connection between the cluster and at least one router of the external network. Captured packets are supplied with popularity tags and striped over high-access-rate non-transitory storage media belonging to a capture pool of serving nodes that are specially provisioned and selected by the master node. The captured packets are either devolved or demoted to low-access-rate non-transitory storage media of at least two serving nodes not including any backup master based on popularity metrics contained their tags. The demotion, devolution as well as determination of popularity metrics and setting of a popularity threshold are managed by a distributed management protocol.

US Patent:

20140188794, Jul 3, 2014

Filed:

Nov 12, 2013

Appl. No.:

14/078488

Inventors:

- Mountain View CA, US
Michael W. Dalton - San Francisco CA, US

Assignee:

Zettaset, Inc. - Mountain View CA

International Classification:

G06F 17/30

US Classification:

707611

Abstract:

Method and high availability clusters that support synchronous state replication to provide for failover between nodes, and more precisely, between the master candidate machines at the corresponding nodes. There are at least two master candidates (m=2) in the high availability cluster and the election of the current master is performed by a quorum-based majority vote among quorum machines, whose number n is at least three and odd (n≧3 and n is odd). The current master is issued a current time-limited lease to be measured off by the current master's local clock. In setting the duration or period of the lease, a relative clock skew is used to bound the duration to an upper bound, thus ensuring resistance to split brain situations during failover events.