Patents by Inventor Ameya Varde

Ameya Varde 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: 20050201398
    Abstract: A method and apparatus to receive a plurality of packet from an inflow of a single packet flow. In response to receiving the plurality of packets, a plurality of packet pointers is enqueued into multiple physical queues. Each of the plurality of packet pointers designates one of the plurality of packets from the single packet flow. The plurality of packet pointers are dequeued from the multiple physical queues to transmit the plurality of packets along an outflow of the single packet flow.
    Type: Application
    Filed: December 22, 2003
    Publication date: September 15, 2005
    Inventors: Uday Naik, Prashant Chandra, Alok Kumar, Ameya Varde
  • Publication number: 20050198361
    Abstract: A method and apparatus for meeting a given content throughput using at least one memory channel is generally described. In accordance with one example embodiment of the invention, a method to meet a given content throughput using at least one memory channel comprising, comparing the size of at least a portion of received content to a capacity of a single contiguous location within at least one memory channel to meet a given throughput and determining whether to distribute the at least portion of received content across the at least one memory channel, based at least in part, on the comparison.
    Type: Application
    Filed: December 29, 2003
    Publication date: September 8, 2005
    Inventors: Prashant Chandra, Uday Naik, Alok Kumar, Ameya Varde, Donald Hooper, Debra Bernstein, Myles Wilde, Mark Rosenbluth
  • Publication number: 20050147038
    Abstract: Techniques for optimizing queuing performance include passing, from a ring having M slots, one or more enqueue requests and one or more dequeue requests to a queue manager, and determining whether the ring is full, and if the ring is full, sending only an enqueue request to the queue manager when one of the M slots is next available, otherwise, sending both an enqueue request and a dequeue request to the queue manager.
    Type: Application
    Filed: December 24, 2003
    Publication date: July 7, 2005
    Inventors: Prashant Chandra, Uday Naik, Alok Kumar, Ameya Varde, David Romano
  • Publication number: 20050132078
    Abstract: According to some embodiments, a processing element arranges for a packet to be transmitted through a port without storing a packet identifier in a local transmit queue if a number of transmit buffers to be associated with the packet does not exceed a pre-determined threshold.
    Type: Application
    Filed: December 12, 2003
    Publication date: June 16, 2005
    Inventors: Alok Kumar, Prashant Chandra, Uday Naik, Ameya Varde, David Chou
  • Publication number: 20050066081
    Abstract: According to some embodiments, free packet buffers are allocated.
    Type: Application
    Filed: September 23, 2003
    Publication date: March 24, 2005
    Inventors: Prashant Chandra, Uday Naik, Alok Kumar, Ameya Varde