Patents by Inventor Manoj K. Wadekar

Manoj K. Wadekar 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: 8488601
    Abstract: Method and system for a first network device and a second network device is provided. The first network device and the second network device communicate with each other via a first network link and a second network link. A traffic type between the first network device and the second network device is excluded from link aggregation. When a packet is received from the first network device; and if the packet is excluded from link aggregation, then the first network link or the second link is selected to transmit the packet based on a physical port identifier identifying a port of the first network device.
    Type: Grant
    Filed: July 12, 2011
    Date of Patent: July 16, 2013
    Assignee: QLOGIC, Corporation
    Inventors: Manoj K. Wadekar, Edward C. McGlaughlin, Gaurav Agarwal
  • Patent number: 8467395
    Abstract: Method and system for a first network device and a second network device is provided. The first network device and the second network device communicate with each other via a plurality of network links. A network packet field for applying a hashing technique for selecting one of the network links to transmit the network packet is negotiated between the first network device and the second network device. The hashing technique is identified for selecting the selected network link. The first network device and the second network device, prior to applying the hashing technique exchange hashing parameters.
    Type: Grant
    Filed: July 12, 2011
    Date of Patent: June 18, 2013
    Assignee: QLOGIC, Corporation
    Inventors: Manoj K. Wadekar, Edward C. McGlaughlin, Gaurav Agarwal
  • Patent number: 8359408
    Abstract: In one embodiment, the present invention includes a method for reading configuration information from a multi-function device (MFD), building a dependency tree of a functional dependency of functions performed by the MFD based on the configuration information, which indicates that the MFD is capable of performing at least one function dependent upon another function, and loading software associated with the functions in order based at least in part on the indicated functional dependency. Other embodiments are described and claimed.
    Type: Grant
    Filed: June 30, 2008
    Date of Patent: January 22, 2013
    Assignee: Intel Corporation
    Inventors: Ilango S. Ganga, Manoj K. Wadekar, Eric J. DeHaemer
  • Patent number: 7903552
    Abstract: A node uses a two dimensional array of transmit queues to store frames to be transmitted from the node to another node. The size of the array is governed by the number of directions to which the other node may forward frames once received from the node, and the number of priorities that may be associated with the frames. The transmit queues are distinguished from each other based on direction and priority. A transmitter transmits frames dequeued from the transmit queues to the other node. Control logic that controls the transmit queues receives an indication from the other node whether the other node is experiencing traffic congestion in any of the directions and the priority of frames at or below which the control logic is to control the dequeuing of frames from transmit queues corresponding to the directions in which the other node is experiencing traffic congestion.
    Type: Grant
    Filed: November 21, 2008
    Date of Patent: March 8, 2011
    Assignee: Intel Corporation
    Inventors: Gary L. McAlpine, Tanmay Gupta, Manoj K. Wadekar
  • Publication number: 20100005234
    Abstract: In one embodiment, the present invention includes a method for reading configuration information from a multi-function device (MFD), building a dependency tree of a functional dependency of functions performed by the MFD based on the configuration information, which indicates that the MFD is capable of performing at least one function dependent upon another function, and loading software associated with the functions in order based at least in part on the indicated functional dependency. Other embodiments are described and claimed.
    Type: Application
    Filed: June 30, 2008
    Publication date: January 7, 2010
    Inventors: Ilango S. Ganga, Manoj K. Wadekar, Eric J. DeHaemer
  • Publication number: 20090175168
    Abstract: Packet flow control techniques are disclosed. In one example case, a flow control method is provided that includes transmitting a plurality of packets with an inter-packet gap disposed between neighboring packets, and increasing the length of the inter-packet gap to decrease packet rate, wherein the increased length is selected based on severity of a congestion condition. In another example case, a flow control system is provided that includes circuitry for transmitting and/or receiving a plurality of packets with an inter-packet gap disposed between neighboring packets, and circuitry for increasing the length of the inter-packet gap to decrease packet rate, wherein the increased length is selected based on severity of a congestion condition. The techniques can be carried out at one node of a communication system (such as in a backplane switch) or multiple nodes (such as between a backplane switch and a circuit board operatively coupled to the backplane).
    Type: Application
    Filed: December 30, 2008
    Publication date: July 9, 2009
    Applicant: INTEL CORPORATION
    Inventors: Manoj K. Wadekar, Hitesh Rastogi
  • Publication number: 20090073882
    Abstract: A node uses a two dimensional array of transmit queues to store frames to be transmitted from the node to another node. The size of the array is governed by the number of directions to which the other node may forward frames once received from the node, and the number of priorities that may be associated with the frames. The transmit queues are distinguished from each other based on direction and priority. A transmitter transmits frames dequeued from the transmit queues to the other node. Control logic that controls the transmit queues receives an indication from the other node whether the other node is experiencing traffic congestion in any of the directions and the priority of frames at or below which the control logic is to control the dequeuing of frames from transmit queues corresponding to the directions in which the other node is experiencing traffic congestion.
    Type: Application
    Filed: November 21, 2008
    Publication date: March 19, 2009
    Applicant: Intel Corporation
    Inventors: Gary McAlpine, Tanmay Gupta, Manoj K. Wadekar
  • Patent number: 7492710
    Abstract: A flow control method according to one embodiment may include transmitting a first plurality of packets from a transmitting node to a receiving node at an initial packet rate, and transmitting a second plurality packets from the transmitting node to the receiving node at a congested packet rate less than the initial packet rate in response to a signal from the receiving node representative of a congestion condition at the receiving node. Of course, many alternatives, variations, and modifications are possible without departing from this embodiment.
    Type: Grant
    Filed: March 31, 2005
    Date of Patent: February 17, 2009
    Assignee: Intel Corporation
    Inventors: Manoj K Wadekar, Hitesh Rastogi
  • Patent number: 7461142
    Abstract: Numerous embodiments of a method and apparatus for address management in a network device are disclosed.
    Type: Grant
    Filed: December 23, 2002
    Date of Patent: December 2, 2008
    Assignee: Intel Corporation
    Inventor: Manoj K. Wadekar
  • Patent number: 7457245
    Abstract: A node uses a two dimensional array of transmit queues to store frames to be transmitted from the node to another node. The size of the array is governed by the number of directions to which the other node may forward frames once received from the node, and the number of priorities that may be associated with the frames. The transmit queues are distinguished from each other based on direction and priority. A transmitter transmits frames dequeued from the transmit queues to the other node. Control logic that controls the transmit queues receives an indication from the other node whether the other node is experiencing traffic congestion in any of the directions and the priority of frames at or below which the control logic is to control the dequeuing of frames from transmit queues corresponding to the directions in which the other node is experiencing traffic congestion.
    Type: Grant
    Filed: September 30, 2004
    Date of Patent: November 25, 2008
    Assignee: Intel Corporation
    Inventors: Gary McAlpine, Tanmay Gupta, Manoj K. Wadekar
  • Publication number: 20080002586
    Abstract: In an embodiment, a method is provided. The method of this embodiment provides monitoring on a system flow statistics to identify one or more non-compliant traffic flows on the system, each of the one or more non-compliant traffic flows having packets; assigning a tag to each of the one or more non-compliant traffic flows, each of the tags corresponding to one of at least one congestion management policy; and applying one of the tags to each of the packets associated with any of the non-compliant traffic flows.
    Type: Application
    Filed: June 30, 2006
    Publication date: January 3, 2008
    Inventors: Ravi Sahita, Karanvir S. Grewal, Manoj K. Wadekar, Uday R. Savagaonkar
  • Publication number: 20040122929
    Abstract: Numerous embodiments of a method and apparatus for address management in a network device are disclosed.
    Type: Application
    Filed: December 23, 2002
    Publication date: June 24, 2004
    Inventor: Manoj K. Wadekar
  • Publication number: 20030217141
    Abstract: A network includes a plurality of edge switches, one or more core switches, and a plurality of core links that couple the edge switches to the core switches. The core links at each of the edge switches are link aggregated together in order to compensate for any loops in the network.
    Type: Application
    Filed: May 14, 2002
    Publication date: November 20, 2003
    Inventors: Shiro Suzuki, Ravendra Gorijala, Manoj K. Wadekar