Patents by Inventor Abhishek Ranjan Singh

Abhishek Ranjan Singh 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).

  • Publication number: 20160359704
    Abstract: Systems, methods, and computer-readable media for collector high availability. In some embodiments, a system receives, from a first collector device, a first data report generated by a capturing agent deployed on a host system in a network. The system can also receive, from a second collector device, a second data report generated by the capturing agent deployed on the host system. The first and second data reports can include traffic data captured at the host system by the capturing agent during a period of time. The system can determine that the first data report and the second data report are both associated with the capturing agent, and identify duplicate data contained in the first data report and the second data report. The system can then deduplicate the first and second data reports to yield a deduplicated data report.
    Type: Application
    Filed: June 2, 2016
    Publication date: December 8, 2016
    Inventors: Shashidhar Gandham, Rohit Chandra Prasad, Abhishek Ranjan Singh, Navindra Yadav, Khawar Deen, Varun Sagar Malhotra
  • Publication number: 20160359708
    Abstract: Systems, methods, and computer-readable media for hierarchichal sharding of flows from sensors to collectors. A first collector can receive a first portion of a network flow from a first capturing agent and determine that a second portion of the network flow was not received from the first capturing agent. The first collector can then send the first portion of the network flow to a second collector. A third collector can receive the second portion of the network flow from a second capturing agent and determine that the third collector did not receive the first portion of the network flow. The third collector can then send the second portion of the network flow to the second collector. The second collector can then aggregate the first portion and second portion of the network flow to yield the entire portion of the network flow.
    Type: Application
    Filed: June 2, 2016
    Publication date: December 8, 2016
    Inventors: Shashidhar Gandham, Rohit Chandra Prasad, Abhishek Ranjan Singh, Navindra Yadav, Khawar Deen, Varun Sagar Malhotra
  • Publication number: 20160359658
    Abstract: Systems, methods, and computer-readable media for updating configurations in sensors deployed in multi-layer virtualized environments. In some examples, a system can track information of sensors and collectors in the network. In response to determining that a specific collector becomes unavailable (e.g., the specific collector is down, offline or becomes unsupported), the system can determine affected sensors corresponding to the specific collector, determine a new collector among active collectors of the network for each of the affected sensors, and dynamically update configuration and settings of the affected sensors to maintain proper collector-to-sensor mappings and other settings on the affected sensors.
    Type: Application
    Filed: June 1, 2016
    Publication date: December 8, 2016
    Inventors: Navindra Yadav, Abhishek Ranjan Singh, Anubhav Gupta, Shashidhar Gandham, Jackson Ngoc Ki Pang, Shih-Chun Chang, Hai Trong Vu
  • Publication number: 20160359699
    Abstract: Systems, methods, and computer-readable media for identifying bogon addresses. A system can obtain an indication of address spaces in a network. The indication can be based on route advertisements transmitted by routers associated with the network. The system can receive a report generated by a capturing agent deployed on a host. The report can identify a flow captured by the capturing agent at the host. The system can identify a network address associated with the flow and, based on the indication of address spaces, the system can determine whether the network address is within the address spaces in the network. When the network address is not within the address spaces in the network, the system can determine that the network address is a bogon address. When the network address is within the address spaces in the network, the system can determine that the network address is not a bogon address.
    Type: Application
    Filed: June 2, 2016
    Publication date: December 8, 2016
    Inventors: Shashidhar Gandham, Rohit Chandra Prasad, Abhishek Ranjan Singh, Navindra Yadav, Khawar Deen, Varun Sagar Malhotra
  • Publication number: 20160357957
    Abstract: Systems, methods, and computer-readable media for managing compromised sensors in multi-tiered virtualized environments. A method includes determining a lineage for a process within the network and then evaluating, through knowledge of the lineage, the source of the command that initiated the process. The method includes capturing data from a plurality of capture agents at different layers of a network, each capture agent of the plurality of capture agents configured to observe network activity at a particular location in the network, developing, based on the data, a lineage for a process associated with the network activity and, based on the lineage, identifying an anomaly within the network.
    Type: Application
    Filed: June 2, 2016
    Publication date: December 8, 2016
    Inventors: Khawar Deen, Navindra Yadav, Anubhav Gupta, Shashidhar Gandham, Rohit Chandra Prasad, Abhishek Ranjan Singh, Shih-Chun Chang
  • Publication number: 20160359698
    Abstract: A method includes analyzing, via a first capturing agent, packets processed in a first environment associated with a first host to yield first data. The method includes analyzing, via a second capturing agent, packets processed by a second environment associated with a second host to yield second data, collecting the first data and the second data at a collector to yield aggregated data, transmitting the aggregated data to an analysis engine which analyzes the aggregated data to yield an analysis. Based on the analysis, the method includes identifying first packet loss at the first environment and second packet loss at the second environment.
    Type: Application
    Filed: June 2, 2016
    Publication date: December 8, 2016
    Inventors: Khawar Deen, Navindra Yadav, Anubhav Gupta, Shashidhar Gandham, Rohit Chandra Prasad, Abhishek Ranjan Singh, Shih-Chun Chang
  • Publication number: 20160359712
    Abstract: Systems, methods, and computer-readable media are provided for determining a packet's round trip time (RTT) in a network. A system can receive information of a packet sent by a component of the network and further determine an expected acknowledgement (ACK) sequence number associated with the packet based upon received information of the packet. The system can receive information of a subsequent packet received by the component and determine an ACK sequence number and a receiving time of the subsequent packet. In response to determining that the ACK sequence number of the subsequent TCP packet matches the expected ACK sequence number, the system can determine a round trip time (RTT) of the packet based upon the received information of the packet and the received information of the subsequent packet.
    Type: Application
    Filed: June 1, 2016
    Publication date: December 8, 2016
    Inventors: Mohammadreza Alizadeh Attar, Navindra Yadav, Abhishek Ranjan Singh, Vimalkumar Jeyakumar, Shashidhar Gandham, Roberto Fernando Spadaro
  • Publication number: 20160359890
    Abstract: 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.
    Type: Application
    Filed: June 2, 2016
    Publication date: December 8, 2016
    Inventors: Khawar Deen, Navindra Yadav, Anubhav Gupta, Shashidhar Gandham, Rohit Chandra Prasad, Abhishek Ranjan Singh, Shih-Chun Chang
  • Publication number: 20160357587
    Abstract: Systems, methods, and computer-readable media for annotating process and user information for network flows. In some embodiments, a capturing agent, executing on a first device in a network, can monitor a network flow associated with the first device. The first device can be, for example, a virtual machine, a hypervisor, a server, or a network device. Next, the capturing agent can generate a control flow based on the network flow. The control flow may include metadata that describes the network flow. The capturing agent can then determine which process executing on the first device is associated with the network flow and label the control flow with this information. Finally, the capturing agent can transmit the labeled control flow to a second device, such as a collector, in the network.
    Type: Application
    Filed: May 11, 2016
    Publication date: December 8, 2016
    Inventors: Navindra Yadav, Abhishek Ranjan Singh, Anubhav Gupta, Shashidhar Gandham, Jackson Ngoc Ki Pang, Shih-Chun Chang, Hai Trong Vu
  • Publication number: 20160359686
    Abstract: Systems, methods, and computer-readable media are provided for determining whether a node in a network is a server or a client. In some examples, a system can collect, from one or more sensors that monitor at least part of data traffic being transmitted via a pair of nodes in a network, information of the data traffic. The system can analyze attributes of the data traffic such as timing, port magnitude, degree of communication, historical data, etc. Based on analysis results and a predetermined rule associated with the attributes, the system can determine which node of the pair of nodes is a client and which node is a server.
    Type: Application
    Filed: April 27, 2016
    Publication date: December 8, 2016
    Inventors: Ali Parandehgheibi, Abhishek Ranjan Singh, Omid Madani, Vimalkumar Jeyakumar, Ellen Christine Scheib, Navindra Yadav, Mohammadreza Alizadeh Attar
  • Publication number: 20160359759
    Abstract: Systems, methods, and computer-readable media are provided for de-duplicating sensed data packets in a network. As data packets of a particular network flow move through the network, the data packets can be sensed and reported by various sensors across the network. An optimal sensor of the network can be determined based upon data packets reported by the various sensors. Data packets sensed and reported by the optimal sensor can be preserved for network analysis. Duplicative data packets of the particular network flow sensed and reported by other sensors of the network can be discarded to save storage capacity and processing power of network-flow analysis tools. Analysis of the particular network flow can be performed based upon the data packets sensed by the optimal sensor and non-duplicative data packets of the particular network-flow sensed by other sensors of the network.
    Type: Application
    Filed: May 24, 2016
    Publication date: December 8, 2016
    Inventors: Abhishek Ranjan Singh, Shih-Chun Chang, Varun Sagar Malhotra, Hai Trong Vu, Jackson Ngoc Ki Pang, Anubhav Gupta
  • Publication number: 20160359711
    Abstract: Systems, methods, and non-transitory computer-readable storage media for synchronizing timestamps of a sensor report to the clock of a device. In one embodiment, the device receives a report from a sensor of a node. The report can include a network activity of the node captured by the sensor and a first timestamp relative to the clock of the node. The device can then determine a second timestamp relative to the clock of the collector indicating receipt of the report by the device and from the sensor at the node. The device can also determine a delta between the first timestamp and the second timestamp, and a communication latency associated with a communication channel between the device and the sensor. Next, the device can adjust the delta based on the communication latency, and generate a third timestamp based on the adjusted delta.
    Type: Application
    Filed: February 10, 2016
    Publication date: December 8, 2016
    Inventors: Khawar Deen, Navindra Yadav, Anubhav Gupta, Shashidhar Gandham, Rohit Chandra Prasad, Abhishek Ranjan Singh, Shih-Chun Chang
  • Publication number: 20160359628
    Abstract: Systems, methods, and computer-readable media are provided for generating a unique ID for a sensor in a network. Once the sensor is installed on a component of the network, the sensor can send attributes of the sensor to a control server of the network. The attributes of the sensor can include at least one unique identifier of the sensor or the host component of the sensor. The control server can determine a hash value using a one-way hash function and a secret key, send the hash value to the sensor, and designate the hash value as a sensor ID of the sensor. In response to receiving the sensor ID, the sensor can incorporate the sensor ID in subsequent communication messages. Other components of the network can verify the validity of the sensor using a hash of the at least one unique identifier of the sensor and the secret key.
    Type: Application
    Filed: May 24, 2016
    Publication date: December 8, 2016
    Inventors: Abhishek Ranjan Singh, Shih-Chun Chang, Varun Sagar Malhotra, Hai Trong Vu, Jackson Ngoc Ki Pang
  • Publication number: 20030031167
    Abstract: A method and system for performing a route lookup in a routing system, including a plurality of routes places a bound on the number of accesses to the memory necessary to perform a route lookup and guarantees the minimal amount of memory to achieve a particular bound. For each node the memory required to meet a bound on the depth of the tree rooted at that node is computed, given the distribution of routes in the network.
    Type: Application
    Filed: January 2, 2002
    Publication date: February 13, 2003
    Inventors: Abhishek Ranjan Singh, Vishnu Natchu