Patents by Inventor Kamalkrishna Rameshan

Kamalkrishna Rameshan has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 11019143
    Abstract: Systems, methods, and computer-readable media for an adaptive gossip protocol. A node in a cluster can detect a gossip protocol synchronization triggering event which can include an indication that the node has received data from a second node via a gossip protocol, an update to data maintained by nodes in the cluster, and/or an operation. In response to the triggering event, the node can determine a dynamic gossip interval for disseminating data from the node to other nodes via a gossip protocol, the dynamic gossip interval being based on a synchronization state associated with the cluster and/or one or more gossip protocol events associated with the cluster. Next, the node can select a third node in the cluster for disseminating the data from the node to the third node. The node can then transmit the data to the third node via the gossip protocol based on the dynamic gossip interval.
    Type: Grant
    Filed: June 17, 2019
    Date of Patent: May 25, 2021
    Assignee: CISCO TECHNOLOGY, INC.
    Inventors: Abhishek Kumar, Harmanpreet Singh, Kamalkrishna Rameshan, Moiz Raja
  • Publication number: 20190306238
    Abstract: Systems, methods, and computer-readable media for an adaptive gossip protocol. A node in a cluster can detect a gossip protocol synchronization triggering event which can include an indication that the node has received data from a second node via a gossip protocol, an update to data maintained by nodes in the cluster, and/or an operation. In response to the triggering event, the node can determine a dynamic gossip interval for disseminating data from the node to other nodes via a gossip protocol, the dynamic gossip interval being based on a synchronization state associated with the cluster and/or one or more gossip protocol events associated with the cluster. Next, the node can select a third node in the cluster for disseminating the data from the node to the third node. The node can then transmit the data to the third node via the gossip protocol based on the dynamic gossip interval.
    Type: Application
    Filed: June 17, 2019
    Publication date: October 3, 2019
    Inventors: Abhishek Kumar, Harmanpreet Singh, Kamalkrishna Rameshan, Moiz Raja
  • Patent number: 10362106
    Abstract: Systems, methods, and computer-readable media for an adaptive gossip protocol. A node in a cluster can detect a gossip protocol synchronization triggering event which can include an indication that the node has received data from a second node via a gossip protocol, an update to data maintained by nodes in the cluster, and/or an operation. In response to the triggering event, the node can determine a dynamic gossip interval for disseminating data from the node to other nodes via a gossip protocol, the dynamic gossip interval being based on a synchronization state associated with the cluster and/or one or more gossip protocol events associated with the cluster. Next, the node can select a third node in the cluster for disseminating the data from the node to the third node. The node can then transmit the data to the third node via the gossip protocol based on the dynamic gossip interval.
    Type: Grant
    Filed: July 21, 2015
    Date of Patent: July 23, 2019
    Assignee: CISCO TECHNOLOGY, INC.
    Inventors: Abhishek Kumar, Harmanpreet Singh, Kamalkrishna Rameshan, Moiz Raja
  • Patent number: 10091087
    Abstract: Disclosed are systems, methods, and computer-readable storage media for load balance resources amongst computing nodes. Various embodiments of the present technology can be used to, prior to assigning a first data shard included in a first cluster of data shards as a leader of the first cluster of data shards, determine whether a first computing node storing the first data shard also stores a second data shard designated as a leader of a second cluster of data shards, yielding a determination, and when the determination indicates that the first computing node stores the second data shard designated as the leader of the second cluster of data shards, designate the first data shard as non-electable to be the leader of the first cluster of data shards and electing an alternate data shard included in the first cluster of data shards as the leader of the first cluster of data shards.
    Type: Grant
    Filed: July 20, 2015
    Date of Patent: October 2, 2018
    Assignee: Cisco Technology, Inc.
    Inventors: Moiz Raja, Abhishek Kumar, Kamalkrishna Rameshan, Harmanpreet Singh
  • Publication number: 20170026468
    Abstract: Systems, methods, and computer-readable media for an adaptive gossip protocol. A node in a cluster can detect a gossip protocol synchronization triggering event which can include an indication that the node has received data from a second node via a gossip protocol, an update to data maintained by nodes in the cluster, and/or an operation. In response to the triggering event, the node can determine a dynamic gossip interval for disseminating data from the node to other nodes via a gossip protocol, the dynamic gossip interval being based on a synchronization state associated with the cluster and/or one or more gossip protocol events associated with the cluster. Next, the node can select a third node in the cluster for disseminating the data from the node to the third node. The node can then transmit the data to the third node via the gossip protocol based on the dynamic gossip interval.
    Type: Application
    Filed: July 21, 2015
    Publication date: January 26, 2017
    Inventors: Abhishek Kumar, Harmanpreet Singh, Kamalkrishna Rameshan, Moiz Raja
  • Publication number: 20170024453
    Abstract: Disclosed are systems, methods, and computer-readable storage media for load balance resources amongst computing nodes. Various embodiments of the present technology can be used to, prior to assigning a first data shard included in a first cluster of data shards as a leader of the first cluster of data shards, determine whether a first computing node storing the first data shard also stores a second data shard designated as a leader of a second cluster of data shards, yielding a determination, and when the determination indicates that the first computing node stores the second data shard designated as the leader of the second cluster of data shards, designate the first data shard as non-electable to be the leader of the first cluster of data shards and electing an alternate data shard included in the first cluster of data shards as the leader of the first cluster of data shards.
    Type: Application
    Filed: July 20, 2015
    Publication date: January 26, 2017
    Inventors: Moiz Raja, Abhishek Kumar, Kamalkrishna Rameshan, Harmanpreet Singh