Nitin R Karkhanis, 5446170 Paseo Padre Pkwy, Fremont, CA 94539

6401127, Jun 4, 2002

May 4, 1999

09/304395

Alan Lei - Fremont CA
Nitin Karkhanis - San Francisco CA
Richard Livingston - Hollister CA
Uwe Sellentin - San Jose′ CA

Cisco Technology, Inc. - San Jose CA

G06F 1300

709235, 709232

A method for computing an ACK timing interval for an ACK timer in a protocol layer LLC type 2 session first measures a time interval between transmission of a frame by a source computer joined to a to a destination computer by an intermediate link, and receipt of a corresponding acknowledgment frame by the source computer from the destination computer. The two events at the source computer, starting a timer upon commencement of transmission of a frame or sequence of frames and the later reception of an acknowledge message indicating receipt of those frames, permits calculation of a measured time interval. The measured time interval is used to compute the bandwidth of the intermediate link. The required ACK timing interval for the ACK timer is then computed in response to the bandwidth, the number of bytes transmitted after starting the ACK timer, and the return time for an acknowledgment message. The ACK timing interval may be recomputed after every transmission of frames and receipt of a corresponding ACK message. The ACK timing interval is thereby dynamically adjusted to conditions on the intermediate link, including natural bandwidth for either a slow or fast link, congestion due to other traffic on the link, etc.

2023007, Mar 9, 2023

Aug 31, 2022

17/900461

- Santa Clara CA, US
Arup Raton Roy - Burnaby, CA
Thejesh Panchappa - Santa Clara CA, US
Nitin Karkhanis - Santa Clara CA, US

H04L 45/74
H04L 45/00

A method and system for propagating network traffic flows between end points based on service and priority policies. Specifically, the method and system disclosed herein entail configuring network elements with network-disseminated traffic management policies. Each traffic management policy guides the handling of a network traffic flow between origination and termination end points (i.e., source and destination hosts), which may be defined through data link layer, network layer, and/or transport layer header information, as well as group assignment information, associated with the source and destination hosts.

2023003, Feb 2, 2023

Jul 30, 2021

17/389835

- Redwood Shores CA, US
Giridhar Ravipati - Foster City CA, US
Ian Neall - Henley-on-Thames, GB
Frank Lange - Woerden, NL
Jing Zheng - Foster City CA, US
Mahesh Girkar - Los Altos CA, US
David Gagne - Goffstown NH, US
Nitin Karkhanis - Nashua NH, US
Sadhana Kyathappala - Westford MA, US
Qingguang Cui - Redwood Shores CA, US

G06F 16/27
G06F 16/23
G06F 11/14

Herein is high availability for online transaction processing with redundancy and redo for a federation of pluggable databases and container databases. In an embodiment of a federation of container database management systems that includes a first container database, first redo data of a first pluggable database in a second container database is obtained based on a database dictionary in the first container database. To the first pluggable database in the first container database, the first redo data of the first pluggable database in the second container database is applied. Based on the database dictionary in the first container database, second redo data of a second pluggable database in a third container database is obtained. To the second pluggable database in the first container database, without modifying content of the first pluggable database in the first container database, the second redo data of the second pluggable database in the third container database is applied.

2021034, Nov 4, 2021

May 1, 2020

16/864716

- Santa Clara CA, US
Nitin Karkhanis - Fremont CA, US
Anuraag Mittal - Livermore CA, US
Purushothaman Nandakumaran - Milpitas CA, US
Manjula Gopalakrishnan - Cupertino CA, US

H04L 12/743
H04L 12/721
H04L 12/741
H04L 29/06

Systems and methods are provided herein for implementing multi-table OpenFlow flows that have combinations of packet edits. This may be accomplished by a network device receiving a first flow entry with a first set of actions to be installed into a flow table. The network device may determine that the first set of actions includes edits to a plurality of fields of a matched data packet. In response, the network device may change the first set of actions of the first flow entry to edit a first field of the data packet and create a second flow entry with a second set of actions to edit a second field of the data packet. The network device may install the first and second flow entries into one or more flow tables of the network device.

2021015, May 20, 2021

Jan 28, 2021

17/160458

- Santa Clara CA, US
Arup Raton Roy - Burnaby, CA
Thejesh Panchappa - Santa Clara CA, US
Nitin Karkhanis - Santa Clara CA, US

H04L 12/741
H04L 12/707
H04L 12/721

A method and system for propagating network traffic flows between end points based on service and priority policies. Specifically, the method and system disclosed herein entail configuring network elements with network-disseminated traffic management policies. Each traffic management policy guides the handling of a network traffic flow between origination and termination end points (i.e., source and destination hosts), which may be defined through data link layer, network layer, and/or transport layer header information, as well as group assignment information, associated with the source and destination hosts.

2021013, May 6, 2021

Nov 1, 2019

16/672249

- Santa Clara CA, US
Tula Kraiser - Sunnyvale CA, US
Nitin Karkhanis - Fremont CA, US

H04L 12/743
H04L 12/715
H04L 12/707

Techniques for ensuring that, in the context of network traffic load-balanced across a plurality of service devices connected to a network device, all of the bi-directional traffic between a given pair of hosts residing in different domains is sent to the same service device, where a “domain” is a group of one or more hosts/subnets that is reachable by a service device via an interface of that device. In one set of embodiments, these techniques can include (1) creating a load balancer group on the network device for each domain defined on the service devices, such that the load balancer group for a given domain D includes all of the service device interfaces mapped to D, (2) enabling symmetric hashing with respect to each load balancer group, and (3) synchronizing the hash tables of the load balancer groups such that a given hash bucket (across all hash tables) maps to an interface of a single service device.

2021011, Apr 22, 2021

Jul 1, 2020

16/918569

- Santa Clara CA, US
Nitin Karkhanis - Fremont CA, US
Anuraag Mittal - Livermore CA, US

H04L 12/743

Systems and methods are provided for programming a network device. A method includes receiving a wild card entry at the network device, the network device including a ternary content addressable memory (TCAM) table and an exact match (EM) table. The method determines whether the wild card entry is compatible with the EM table. In response to determining that the wild card entry is compatible with the EM table, the method determines the available space in the EM table, the usage of the TCAM table, and at least one flow characteristic of the wild card entry. The method evaluates the determined available space in the EM table, usage of the TCAM table, and the at least one flow characteristic against a set of stored rules that select the EM table or the TCAM table. The method programs the wild card entry in the EM table or TCAM table based upon the selection.

2021011, Apr 22, 2021

Dec 4, 2019

16/703741

- Santa Clara CA, US
Nitin Karkhanis - Fremont CA, US
Anuraag Mittal - Livermore CA, US

H04L 12/851
H04L 12/721
H04L 12/743
H04L 29/06
H04L 12/935

Techniques for implementing multi-table OpenFlow using a parallel hardware table lookup architecture are provided. In certain embodiments, these techniques include receiving, at a network device from a software-defined networking (SDN) controller, flow entries for installation into flow tables of the network device, where the flow entries are structured in a manner that assumes the flow tables can be looked-up serially by a packet processor of the network device, but where the flow tables are implemented using hardware lookup tables (e.g., TCAMs) that can only be looked-up in parallel by the packet processor. The techniques further include converting, by the network device, the received flow entries into a format that enables the packet processor to process ingress network traffic correctly using the flow entries, despite the packet processor's parallel lookup architecture, and installing the converted flow entries into the flow tables/hardware lookup tables.