Kanekar; Bhushan Mangesh

Patent Applications and Registrations

Patent applications and USPTO patent grants for Kanekar; Bhushan Mangesh.The latest application filed is for "reducing packet drops during a switch restart".

Company Profile

1.12.10

Kanekar; Bhushan Mangesh - Saratoga CA
Kanekar; Bhushan Mangesh - San Jose CA US

*profile and listings may contain filings by different individuals or companies with the same name. Review application materials to confirm ownership/assignment.

Patent Activity

Patent	Date
Reducing Packet Drops During A Switch Restart App 20220124022 - Shenbagam; Jayaramakrishnan ; et al.	2022-04-21
Load sharing and redundancy scheme Grant 9,276,834 - Kanekar , et al. March 1, 2	2016-03-01
Using Fabric Port-Channels to Scale IP Connectivity to Hosts in Directly Connected Subnets in Massive Scale Data Centers App 20140064270 - Kapadia; Shyam ; et al.	2014-03-06
Load Sharing And Redundancy Scheme App 20120076048 - Kanekar; Bhushan Mangesh ; et al.	2012-03-29
Load sharing and redundancy scheme Grant 8,077,604 - Kanekar , et al. December 13, 2	2011-12-13
Extending sso for DHCP snooping to two box redundancy Grant 7,903,647 - Kanekar , et al. March 8, 2	2011-03-08
Generating accounting data based on access control list entries Grant 7,689,485 - Kanekar , et al. March 30, 2	2010-03-30
Generating and merging lookup results to apply multiple features Grant 7,350,020 - Kanekar , et al. March 25, 2	2008-03-25
Performing lookup operations on associative memory entries Grant 7,237,059 - Eatherton , et al. June 26, 2	2007-06-26
Extending sso for DHCP snooping to two box redundancy App 20070121617 - Kanekar; Bhushan Mangesh ; et al.	2007-05-31
Generating and merging lookup results to apply multiple features Grant 7,177,978 - Kanekar , et al. February 13, 2	2007-02-13
Generating and merging lookup results to apply multiple features App 20070002862 - Kanekar; Bhushan Mangesh ; et al.	2007-01-04
Performing Lookup Operations Using Associative Memories Optionally Including Modifying A Search Key In Generating A Lookup Word And Possibly Forcing A No-hit Indication In Response To Matching A Particular Entry Grant 7,103,708 - Eatherton , et al. September 5, 2	2006-09-05
Associative memory entries with force no-hit and priority indications of particular use in implementing policy maps in communication devices Grant 7,082,492 - Pullela , et al. July 25, 2	2006-07-25
Performing lookup operations on associative memory entries App 20060106977 - Eatherton; William N. ; et al.	2006-05-18
Load sharing and redundancy scheme Grant 7,006,431 - Kanekar , et al. February 28, 2	2006-02-28
Associative memory entries with force no-hit and priority indications of particular use in implementing policy maps in communication devices App 20040170172 - Pullela, Venkateshwar Rao ; et al.	2004-09-02
Generating and merging lookup results to apply multiple features App 20040170171 - Kanekar, Bhushan Mangesh ; et al.	2004-09-02
Generating accounting data based on access control list entries App 20040172346 - Kanekar, Bhushan Mangesh ; et al.	2004-09-02
Load sharing and redundancy scheme Grant 6,751,191 - Kanekar , et al. June 15, 2	2004-06-15

uspto.report is an independent third-party trademark research tool that is not affiliated, endorsed, or sponsored by the United States Patent and Trademark Office (USPTO) or any other governmental organization. The information provided by uspto.report is based on publicly available data at the time of writing and is intended for informational purposes only.

While we strive to provide accurate and up-to-date information, we do not guarantee the accuracy, completeness, reliability, or suitability of the information displayed on this site. The use of this site is at your own risk. Any reliance you place on such information is therefore strictly at your own risk.

All official trademark data, including owner information, should be verified by visiting the official USPTO website at www.uspto.gov. This site is not intended to replace professional legal advice and should not be used as a substitute for consulting with a legal professional who is knowledgeable about trademark law.