Patents by Inventor Harish Sankaran

Harish Sankaran 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: 11314742
    Abstract: A system for low latency caching of time-sensitive data is disclosed. The system comprises a database, one or more processors, and non-transitory memory. The non-transitory memory comprises instructions that cause the one or more processors to divide a table of the database into a plurality of logical partitions; during a first interval of time, insert new records exclusively into a first partition of the plurality of logical partitions; during a second interval of time, insert new records exclusively into a second partition of the plurality of logical partitions; during a subsequent interval of time, determine that a predetermined period of time has passed since conclusion of the first interval of time; and responsive to the determination that the predetermined period of time has passed, delete records from the first partition without changing contents of the second partition or any other partition of the plurality of logical partitions.
    Type: Grant
    Filed: December 26, 2019
    Date of Patent: April 26, 2022
    Assignee: Morgan Stanley Services Group Inc.
    Inventors: Rakesh Kumar Pandey, Harish Sankaran, Gaurav Garg
  • Publication number: 20210200770
    Abstract: A system for low latency caching of time-sensitive data is disclosed. The system comprises a database, one or more processors, and non-transitory memory. The non-transitory memory comprises instructions that cause the one or more processors to divide a table of the database into a plurality of logical partitions; during a first interval of time, insert new records exclusively into a first partition of the plurality of logical partitions; during a second interval of time, insert new records exclusively into a second partition of the plurality of logical partitions; during a subsequent interval of time, determine that a predetermined period of time has passed since conclusion of the first interval of time; and responsive to the determination that the predetermined period of time has passed, delete records from the first partition without changing contents of the second partition or any other partition of the plurality of logical partitions.
    Type: Application
    Filed: December 26, 2019
    Publication date: July 1, 2021
    Inventors: Rakesh Kumar Pandey, Harish Sankaran, Gaurav Garg
  • Patent number: 8010696
    Abstract: Safe and efficient passing of information from a forwarding-plane to a control-plane is provided. The information can be passed from a forwarding-plane process to a control-plane process without having to modify the control-plane process and without requiring the processes to pass information via shared memory. The information is encoded in the forwarding-plane process. The encoded information is passed to the operating system, wherein the operating system interprets the encoded information and reports the information to the control plane process. The present invention can be advantageously utilized in passing multicast events from a forwarding-plane process to a control-plane process. Multicast events can be passed from a forwarding-plane process to a control-plane process without having to modify the control-plane process and without requiring the processes to pass messages via shared memory.
    Type: Grant
    Filed: June 6, 2006
    Date of Patent: August 30, 2011
    Assignee: Avaya Inc.
    Inventors: Harish Sankaran, Janet Doong, Arun Kudur
  • Patent number: 7924743
    Abstract: Described are a method and a device for efficiently switching multicast data flows from a shared distribution tree to a shortest path distribution tree. The method achieves an efficient and scalable tree switch that reduces the latency of multicast data transmitted from the source to receivers. A determination is made for each source group (S,G) entry in a portion of a forwarding plane database of a router as to whether a byte count for that entry exceeds a threshold value. A message sent from the forwarding plane to the router control plane indicates the (S,G) entries determined to have byte counts exceeding the respective threshold values. For each message entry, the respective shared distribution tree is switched to a shortest path distribution tree. The method achieves a substantial reduction in the number of inter-process messages exchanged between the control plane and the forwarding plane compared to conventional tree switchover techniques.
    Type: Grant
    Filed: October 16, 2006
    Date of Patent: April 12, 2011
    Assignee: Avaya Holdings Limited
    Inventors: Janet Doong, Arun Kudur, Harish Sankaran
  • Publication number: 20080267181
    Abstract: Described is a method for reliable transmission of sensor data and sensor commands. The method is particularly useful for shared packet networks and lossy wireless networks where the rate of packet drops can be significant. A network access node receives a data packet that includes the sensor data and multicasts the data packet towards an aggregation node. Each data packet preferably is transmitted over a unique network path. The number of multicast data packets is determined according to one or more network parameters such as network congestion, packet drop probability, the priority and class of service of the data packet, and the number of unique network paths between the network access node and an aggregation node. The first data packet to arrive at the aggregation node is forwarded to the application node and subsequently received data packets with identical sensor data are discarded.
    Type: Application
    Filed: November 6, 2006
    Publication date: October 30, 2008
    Applicant: NORTEL NETWORKS LIMITED
    Inventors: Indermohan Monga, Garth Jenkins, Harish Sankaran
  • Publication number: 20080089234
    Abstract: Described are a method and a device for efficiently switching multicast data flows from a shared distribution tree to a shortest path distribution tree. The method achieves an efficient and scalable tree switch that reduces the latency of multicast data transmitted from the source to receivers. A determination is made for each source group (S,G) entry in a portion of a forwarding plane database of a router as to whether a byte count for that entry exceeds a threshold value. A message sent from the forwarding plane to the router control plane indicates the (S,G) entries determined to have byte counts exceeding the respective threshold values. For each message entry, the respective shared distribution tree is switched to a shortest path distribution tree. The method achieves a substantial reduction in the number of inter-process messages exchanged between the control plane and the forwarding plane compared to conventional tree switchover techniques.
    Type: Application
    Filed: October 16, 2006
    Publication date: April 17, 2008
    Inventors: Janet Doong, Arun Kudur, Harish Sankaran
  • Publication number: 20070280231
    Abstract: Safe and efficient passing of information from a forwarding-plane to a control-plane is provided. The information can be passed from a forwarding-plane process to a control-plane process without having to modify the control-plane process and without requiring the processes to pass information via shared memory. The information is encoded in the forwarding-plane process. The encoded information is passed to the operating system, wherein the operating system interprets the encoded information and reports the information to the control plane process. The present invention can be advantageously utilized in passing multicast events from a forwarding-plane process to a control-plane process. Multicast events can be passed from a forwarding-plane process to a control-plane process without having to modify the control-plane process and without requiring the processes to pass messages via shared memory.
    Type: Application
    Filed: June 6, 2006
    Publication date: December 6, 2007
    Inventors: Harish Sankaran, Janet Doong, Arun Kudur