Patents by Inventor Lalit Merani

Lalit Merani 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).

  • Jitter buffer for a circuit emulation service over an internal protocol network
    Patent number: 7817545
    Abstract: A jitter buffer receives a plurality of data packets comprising a circuit emulation service over internet protocol (CESIP), buffers the plurality of data packets, and plays data from the plurality of data packets at a constant bit rate corresponding to the CESIP.
    Type: Grant
    Filed: September 27, 2006
    Date of Patent: October 19, 2010
    Assignee: Nokia Corporation
    Inventors: Chi Fai Ho, Raghu R. Kondapalli, Lalit Merani, Ravi Bail Bhat, Prabhas Kejriwal, Shashank Merchant
  • Jitter buffer for a circuit emulation service over an internet protocol network
    Patent number: 7170856
    Abstract: A jitter buffer receives a plurality of data packets comprising a circuit emulation service over internet protocol (CESIP), buffers the plurality of data packets, and plays data from the plurality of data packets at a constant bit rate corresponding to the CESIP.
    Type: Grant
    Filed: May 12, 2000
    Date of Patent: January 30, 2007
    Assignee: Nokia Inc.
    Inventors: Chi Fai Ho, Raghu R. Kondapalli, Lalit Merani, Ravi Bail Bhat, Prabhas Kejriwal, Shashank Merchant
  • Jitter buffer for a circuit emulation service over an internal protocol network
    Publication number: 20070019547
    Abstract: A jitter buffer receives a plurality of data packets comprising a circuit emulation service over internet protocol (CESIP), buffers the plurality of data packets, and plays data from the plurality of data packets at a constant bit rate corresponding to the CESIP.
    Type: Application
    Filed: September 27, 2006
    Publication date: January 25, 2007
    Inventors: Chi Ho, Raghu Kondapalli, Lalit Merani, Ravi Bhat, Prabhas Kejriwal, Shashank Merchant
  • Method and apparatus for improved queuing
    Patent number: 6914882
    Abstract: A queue scheduler that distributes a partition worth of bandwidth to a plurality of queues according to a weight assigned to each of the queues. The plurality of queues are arranged from a highest priority to a lowest priority. The queues are serviced by the scheduler until each of the corresponding weights is consumed for each queue. The higher priority queues are serviced before the lower priority queues.
    Type: Grant
    Filed: March 30, 2001
    Date of Patent: July 5, 2005
    Assignee: Nokia, Inc.
    Inventors: Lalit Merani, Ravi Bail Bhat
  • Method and apparatus for improved scheduling technique
    Patent number: 6904056
    Abstract: An apparatus that includes a node having a scheduling cycle. The scheduling cycle is partitioned into amounts of data such that one of the partitioned amounts of data serviced per scheduling cycle corresponds to a data rate that corresponds to a highest speed grade managed by the node.
    Type: Grant
    Filed: March 30, 2001
    Date of Patent: June 7, 2005
    Assignee: Nokia, Inc.
    Inventors: Lalit Merani, Umesh Kulkarni, Venu Madhav
  • Method and apparatus for improved scheduling technique
    Publication number: 20020141416
    Abstract: An apparatus that includes a node having a scheduling cycle. The scheduling cycle is partitioned into amounts of data such that one of the partitioned amounts of data serviced per scheduling cycle corresponds to a data rate that corresponds to a highest speed grade managed by the node.
    Type: Application
    Filed: March 30, 2001
    Publication date: October 3, 2002
    Inventors: Lalit Merani, Umesh Kulkarni, Venu Madhav
  • Method and apparatus for improved queuing
    Publication number: 20020141425
    Abstract: A queue scheduler that distributes a partition worth of bandwidth to a plurality of queues according to a weight assigned to each of the queues. The plurality of queues are arranged from a highest priority to a lowest priority. The queues are serviced by the scheduler until each of the corresponding weights is consumed for each queue. The higher priority queues are serviced before the lower priority queues.
    Type: Application
    Filed: March 30, 2001
    Publication date: October 3, 2002
    Inventors: Lalit Merani, Ravi Bail Bhat