Patents by Inventor Tal Anker

Tal Anker 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: 7646717
    Abstract: A methods, apparatus and computer memory are provided for packet scheduling. A processor polls queues in a round robin fashion and schedules for transmission onto a link a packet in each queue with no deficit before scheduling for transmission onto the link a packet in each queue with a deficit. A credit is allocated to each queue with the deficit based on a proportional weight, until each queue with the deficit has a credit.
    Type: Grant
    Filed: October 29, 2004
    Date of Patent: January 12, 2010
    Assignee: Marvell International Ltd.
    Inventors: Tal Anker, Tasahi Daniel
  • Publication number: 20090323383
    Abstract: A search engine includes a storage module to store a plurality of data patterns, a plurality of busses to receive a plurality of representations of a search word, a selector corresponding to at least one of the plurality of data patterns to select one of the plurality of representations of the search word for comparing to the at least one of the plurality of data patterns, and a logic circuit operatively coupled to the storage module, to the plurality of busses, and to the selector to compare the selected one of the plurality of representations of the search word to the at least one of the plurality of data patterns.
    Type: Application
    Filed: April 22, 2008
    Publication date: December 31, 2009
    Inventors: Maxim Mondaeev, Tal Anker
  • Patent number: 7593320
    Abstract: A method, apparatus, and computer-readable media for a stackable multi-layer switch comprises a first set of stack units comprising a master stack unit, wherein one of the stack units in the first set comprises a first port to communicate with a network using a first Internet Protocol address; and a second set of the stack units comprising a backup master stack unit, wherein one of the stack units in the second set comprises a second port to communicate with the network using the first Internet Protocol address; wherein each of the stack units comprises a control plane processor, one or more ports, a stacking interface, and a forwarding engine to communicate with the control plane processor, the ports, and the stacking interface; wherein the stack units communicate with each other through the stacking interfaces; and wherein, when the master stack unit is unable to communicate with the backup master stack unit through the stacking interfaces, the first and second ports attempt to communicate with each other o
    Type: Grant
    Filed: April 30, 2004
    Date of Patent: September 22, 2009
    Assignee: Marvell International, Ltd.
    Inventors: Yuval Cohen, Tal Anker
  • Patent number: 7466653
    Abstract: A method, apparatus, and computer-readable media for a first stack unit in a stackable network device comprises a plurality of the stack units interconnected by a plurality of stacking links, the first stack unit comprising a control plane processor to receive, from a third stack unit, a path message that identifies a second stack unit; wherein the control plane processor transmits the path message to the second stack unit; wherein the control plane processor receives, from the second stack unit, a reserve message; wherein the reserve messages identifies a requested resources for a planned data flow within the stackable network device, wherein the planned data flow has a quality of service; a plurality of ports to receive and transmit packets of data; and a forwarding engine to transfer the packets of data between the ports in accordance with the control plane processor.
    Type: Grant
    Filed: June 30, 2004
    Date of Patent: December 16, 2008
    Assignee: Marvell International Ltd.
    Inventors: Yuval Cohen, Tal Anker
  • Publication number: 20080282246
    Abstract: A method of scheduling tasks for execution in a computer system includes determining a dynamic worst case execution time for a non-periodic task. The dynamic worst case execution time is based on an actual execution path of the non-periodic task. An available time period is also determined, wherein the available time period is an amount of time available for execution of the non-periodic task. The non-periodic task is scheduled for execution if the dynamic worst case execution time is less than the available time period.
    Type: Application
    Filed: May 7, 2007
    Publication date: November 13, 2008
    Inventors: Danny Dolev, Tal Anker, Yaron Weinsberg
  • Publication number: 20080201772
    Abstract: In a method of determining whether a data stream includes unauthorized data, the data stream is analyzed using a hardware filter to detect a presence of one or more of a first set of patterns in the data stream. It is determined whether a packet in the data stream belongs to one of a plurality of data flows to be further inspected based on the analysis of the data stream by the hardware filter. A set of rules is applied to the packet to produce rule match status data if it is determined that the packet belongs to one of the plurality of data flows to be further inspected. The packet is analyzed to determine if the packet includes unauthorized data using software stored on a computer-readable medium and implemented on a processor if the rule match status data indicates that the packet potentially includes unauthorized data.
    Type: Application
    Filed: February 14, 2008
    Publication date: August 21, 2008
    Inventors: Maxim Mondaeev, Tal Anker, Yosef Meyouhas