Patents by Inventor Kumar Shashank

Kumar Shashank 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: 10333816
    Abstract: A method includes receiving, for each of a plurality of entities in a network, device information associated with the entity, and network traffic information regarding data packets associated with the entity. The method also includes determining, using a processor, a priority score for each of the plurality of entities in the network based on the device information and the traffic information. The method additionally includes determining a polling frequency for each of the plurality of entities based on each priority score, wherein the polling frequency for a first entity having a first priority score is greater than the polling frequency for a second entity having a second priority score that is lower than the first priority score. The method further includes polling each of the plurality of entities at its polling frequency.
    Type: Grant
    Filed: September 22, 2015
    Date of Patent: June 25, 2019
    Assignee: CA, Inc.
    Inventors: Richard Bennett Whitner, Kumar Shashank, Saurabh Grade
  • Patent number: 10020983
    Abstract: A fault isolation system asynchronously builds a fault domain graph to identify fault domains to isolate a root cause of a problem in a computer network. Basically, when the fault isolation system receives a notification that an entity of the network is unreachable (i.e., in a down status), the fault isolation system requests neighbor lists and statuses for the neighbors to asynchronously build a fault domain graph. From that topology, the fault isolation system determines a root cause of the problem with the network.
    Type: Grant
    Filed: July 31, 2015
    Date of Patent: July 10, 2018
    Assignee: CA, Inc.
    Inventor: Kumar Shashank
  • Publication number: 20170085456
    Abstract: A method includes receiving, for each of a plurality of entities in a network, device information associated with the entity, and network traffic information regarding data packets associated with the entity. The method also includes determining, using a processor, a priority score for each of the plurality of entities in the network based on the device information and the traffic information. The method additionally includes determining a polling frequency for each of the plurality of entities based on each priority score, wherein the polling frequency for a first entity having a first priority score is greater than the polling frequency for a second entity having a second priority score that is lower than the first priority score. The method further includes polling each of the plurality of entities at its polling frequency.
    Type: Application
    Filed: September 22, 2015
    Publication date: March 23, 2017
    Applicant: CA, Inc.
    Inventors: Richard Bennett WHITNER, Kumar SHASHANK, Saurabh GRADE
  • Publication number: 20170033974
    Abstract: A fault isolation system asynchronously builds a fault domain graph to identify fault domains to isolate a root cause of a problem in a computer network. Basically, when the fault isolation system receives a notification that an entity of the network is unreachable (i.e., in a down status), the fault isolation system requests neighbor lists and statuses for the neighbors to asynchronously build a fault domain graph. From that topology, the fault isolation system determines a root cause of the problem with the network.
    Type: Application
    Filed: July 31, 2015
    Publication date: February 2, 2017
    Inventor: Kumar Shashank