Anubhav Gupta, 45Sunnyvale, CA

8249088, Aug 21, 2012

Apr 29, 2009

12/432383

Anubhav Gupta - Santa Clara CA, US
Arunkumar M. Desigan - Santa Clara CA, US
Arun Sharma - Pleasanton CA, US

Telefonaktiebolaget L M Ericsson (publ) - Stockholm

H04L 12/28

370419

Line cards receive control packets and perform a hierarchical rate limiting on those control packets. A set of identifier keys are extracted from the control packets and the protocol of those control packets are determined. At a first level, the control packets are rate limited per unique set of identifier keys per protocol. Those packets which fail the first rate limiting level are dropped. Those packets which pass the first rate limiting level are rate limited at a second level per protocol type. Those packets which fail the second level rate limiting are dropped while those packets which pass the second level rate limiting are sent to the control card for further processing.

8341567, Dec 25, 2012

Dec 29, 2008

12/345449

Saurabh K. Tiwary - Berkeley CA, US
Anubhav Gupta - Berkeley CA, US
Joel R. Phillips - Oakland CA, US
Claudio Pinello - Berkeley CA, US
Radu Zlatanovici - Oakland CA, US

Cadence Design Systems, Inc. - San Jose CA

G06F 9/455
G06F 17/50

716106, 716111

A method is provided to formally verify a property of a circuit design comprising: receiving a description of at least a portion of the circuit; receiving an indication of search accuracy criteria; receiving a description of a relationship between current and voltage (I-V relationship) for one or more of devices of the circuit; converting each I-V relationship to a conservative approximation of such I-V relationship; assigning voltage labels to one or more terminals of one or more identified devices that indicate voltage relationships among the one or more terminals consistent with KVL; defining a respective current relationship among one or more respective sets of currents of the one or more of the identified devices that is consistent with KCL; searching for one or more combinations of current and voltage values that are within at least one region of each conservative approximation and that are consistent with the voltage labels and that are consistent with each respective defined current relationship; converting each region determined to have a searched for combination of current and voltage values to multiple respective smaller regions; and repeating the acts of searching and converting until regions are obtained that meet the received search accuracy criteria.

8355319, Jan 15, 2013

Feb 2, 2011

13/019836

Anubhav Gupta - Fremont CA, US
Veluchamy Dinakaran - Sunnyvale CA, US
Avoy Nanda - Milpitas CA, US
Avinash Sridharan - Santa Clara CA, US

Telefonaktiebolaget L M Ericsson (Publ) - Stockholm

H04L 12/26
H04H 20/71
H04L 12/28
H04J 3/26

370222, 370225, 370312, 370390, 370432

A network node includes a primary incoming interface, a secondary incoming interface and a data flow control unit. The primary incoming interface is operable to receive traffic associated with a particular source and multicast group. The secondary incoming interface is operable to serve as a backup interface if the primary incoming interface or a transmission path coupled to the primary incoming interface is inoperative. The data flow control unit is operable to determine whether the network node is part of a ring topology and if so, forward traffic received on the primary incoming interface associated with the source and multicast group to both a host which joined the multicast group and the secondary incoming interface and forward traffic received on the secondary incoming interface associated with the source and multicast group to the primary incoming interface.

8576866, Nov 5, 2013

Apr 10, 2012

13/443753

Anubhav Gupta - Santa Clara CA, US
Arunkumar M. Desigan - Santa Clara CA, US
Arun Sharma - Pleasanton CA, US
Mukund Srinivasan - Mountain View CA, US

Telefonaktiebolaget L M Ericsson (Publ) - Stockholm

H04L 12/28

370419

Line cards receive control packets and perform a hierarchical rate limiting on those control packets. A set of identifier keys are extracted from the control packets and the protocol of those control packets are determined. At a first level, the control packets are rate limited per unique set of identifier keys per protocol. Those packets which fail the first rate limiting level are dropped. Those packets which pass the first rate limiting level are rate limited at a second level per protocol type. Those packets which fail the second level rate limiting are dropped while those packets which pass the second level rate limiting are sent to the control card for further processing.

7685547, Mar 23, 2010

Jul 2, 2007

11/772792

Anubhav Gupta - Berkeley CA, US
Ken L. McMillan - Berkeley CA, US

Cadence Design Systems, Inc. - San Jose CA

G06F 17/50
G06F 9/45

716 5

Disclosed are methods, systems, and computer program products for computing an exact minimal automaton to act as an intermediate assertion in assume-guarantee reasoning. In one embodiment, the computing an exact minimal automaton is performed by using a sampling approach and a Boolean satisfiability. The methods described herein may be used as part of a tool for formal verification.

2022040, Dec 22, 2022

Aug 26, 2022

17/822656

- San Jose CA, US
Navindra Yadav - Cupertino CA, US
Anubhav Gupta - Fremont CA, US
Shashidhar Gandham - Fremont CA, US
Rohit Chandra Prasad - Sunnyvale CA, US
Abhishek Ranjan Singh - Pleasanton CA, US
Shih-Chun Chang - San Jose CA, US

H04L 43/045
H04L 9/40
G06F 9/455
G06N 20/00
G06F 21/55
G06F 21/56
G06F 16/28
G06F 16/2457
G06F 16/248
G06F 16/29
G06F 16/16
G06F 16/17
G06F 16/11
G06F 16/13
G06F 16/174
G06F 16/23
G06F 16/9535
G06N 99/00
H04L 9/32
H04L 41/0668
H04L 43/0805
H04L 43/0811
H04L 43/0852
H04L 43/106
H04L 45/00
H04L 45/50
H04L 67/12
H04L 43/026
H04L 61/5007
H04L 67/01
H04L 67/51
H04L 67/75
H04L 67/1001
H04L 43/062
H04L 43/10
H04L 47/2441
H04L 41/0893
H04L 43/08
H04L 43/04
H04W 84/18
H04L 67/10
H04L 41/046
H04L 43/0876
H04L 41/12
H04L 41/16
H04L 41/0816
G06F 21/53
H04L 41/22
G06F 3/04842
G06F 3/04847
H04L 41/0803
H04L 43/0829
H04L 43/16
H04L 1/24
H04W 72/08
H04L 9/08
H04J 3/06
H04J 3/14
H04L 47/20
H04L 47/32
H04L 43/0864
H04L 47/11
H04L 69/22
H04L 45/74
H04L 47/2483
H04L 43/0882
H04L 41/0806
H04L 43/0888
H04L 43/12
H04L 47/31
G06F 3/0482
G06T 11/20
H04L 43/02
H04L 47/28
H04L 69/16
H04L 45/302

A method includes capturing first data associated with a first packet flow originating from a first host using a first capture agent deployed at the first host to yield first flow data, capturing second data associated with a second packet flow originating from the first host from a second capture agent deployed on a second host to yield second flow data and comparing the first flow data and the second flow data to yield a difference. When the difference is above a threshold value, the method includes determining that the second packet flow was transmitted by a component that bypassed an operating stack of the first host or a packet capture agent at the device to yield a determination, detecting that hidden network traffic exists, and predicting a malware issue with the first host based on the determination.

2022025, Aug 11, 2022

Feb 10, 2021

17/173009

- San Jose CA, US
Prashant Gothi - San Jose CA, US
Anubhav Gupta - Sunnyvale CA, US
Manoj Singhal - Sunnyvale CA, US

H04L 12/26
H04L 29/08

Data chunks sent to a content destination are tracked. It is determined whether content of a portion of an object to be sent to the content destination matches one of the data chunks previously sent to the content destination. In response to the determination that the portion of the object to be sent to the content destination matches one of the data chunks previously sent to the content destination, a source reference to the matching previously sent data chunk where the content destination can locally obtain the content for the portion of the object is provided to the content destination.

2023007, Mar 16, 2023

Sep 16, 2021

17/476876

- San Jose CA, US
Aiswarya Bhavani Shankar - San Jose CA, US
Anubhav Gupta - Sunnyvale CA, US

G06F 16/11
G06F 16/174
G06F 11/14

An indication to store to a remote storage a new archive of a snapshot of a source storage is received. At least one shared data chunk of the new archive is determined to be already stored in an existing chunk object of the remote storage storing data chunks of a previous archive. One or more evaluation metrics for the existing chunk object are determined based at least in part on a retention period associated with one or more individual chunks stored in the chunk object and a data lock period associated with the entire existing chunk object. It is determined based on the one or more evaluation metrics whether to reference the at least one shared data chunk of the new archive from the existing chunk object or store the at least one shared data chunk in a new chunk object of the remote storage.