Patents by Inventor Mark Dunaevsky

Mark Dunaevsky 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: 9749255
    Abstract: Aspects of the disclosure provide a method for communicating queue information. The method includes determining a queue state for each one of a plurality of queues at least partially based on respective queue length, selecting a queue with a greatest difference between the queue state of the queue and a last reported queue state of the queue, and reporting the queue state of the selected queue to at least one node.
    Type: Grant
    Filed: June 21, 2012
    Date of Patent: August 29, 2017
    Assignee: Marvell World Trade Ltd.
    Inventors: Vitaly Sukonik, Sarig Livne, Mark Dunaevsky, Jakob Carlström
  • Patent number: 9246823
    Abstract: A distributed network device and method for policing a flow of traffic in the chassis switch in communication networks. The distributed network device incudes a first processor configured to perform an egress processing operation on data packets received from a plurality second processor units in the distributed network switch, the data packets being destined for a receiving device coupled to the distributed network switch. Further, the distributed network device includes a metering unit associated with the first processor, the meting unit configured to meter a flow of the data packets to the receiving device and output a metering result. Also, the distributed network device includes a message generator configured to communicate to the plurality of second processors in the distributed network device a notification message indicative of the metering result.
    Type: Grant
    Filed: December 20, 2012
    Date of Patent: January 26, 2016
    Assignee: MARVELL ISRAEL (M.I.S.L.) LTD.
    Inventors: Vitaly Sukonik, Mark Dunaevsky, Rafi Tamir
  • Patent number: 9154437
    Abstract: There is provided a network device comprising a physical queue management processor configured to manage attributes of physical queues of data packets. The network device further comprises a scheduling processor which is configured to manage scheduling nodes that establish a scheduling hierarchy among the physical queues in a network, utilizing a bi-directional mapping of the physical queues to logical queues. The network device further comprises a traffic management processor which is configured to modify the bi-directional mapping mentioned above.
    Type: Grant
    Filed: January 28, 2013
    Date of Patent: October 6, 2015
    Assignee: MARVELL ISRAEL (M.I.S.L) LTD.
    Inventors: Vitaly Sukonik, Einat Ophir, Rafi Tamir, Mark Dunaevsky
  • Patent number: 9088507
    Abstract: In a method of processing packets in a network, a packet is received at an ingress port of a network device. A traffic class associated with the packet is determined. Based on the traffic class, it is determined whether the packet should transmitted without being enqueued by a traffic manager of the network device. When it is determined that that the packet should be transmitted without being enqueued by the traffic manager, the packet is sent to an egress port of the network device without enqueuing the packet by the traffic manager. When it is determined that the packet should not be transmitted without being enqueued in the network device, the packet is enqueued in a queue in the traffic manager of the network device. The packet sent to the egress port without being enqueued by the traffic manager is accounted for in the traffic manager.
    Type: Grant
    Filed: March 19, 2013
    Date of Patent: July 21, 2015
    Assignee: Marvell Israel (M.I.S.L) Ltd.
    Inventors: Vitaly Sukonik, Mark Dunaevsky, Rafi Tamir, Emil Marinov
  • Publication number: 20130003752
    Abstract: Aspects of the disclosure provide a method for communicating queue information. The method includes determining a queue state for each one of a plurality of queues at least partially based on respective queue length, selecting a queue with a greatest difference between the queue state of the queue and a last reported queue state of the queue, and reporting the queue state of the selected queue to at least one node.
    Type: Application
    Filed: June 21, 2012
    Publication date: January 3, 2013
    Inventors: Vitaly Sukonik, Sarig Livne, Mark Dunaevsky, Jakob Carlström