Patents by Inventor Rohith Basavaraja

Rohith Basavaraja 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: 11394686
    Abstract: A method for network communication includes receiving from a first network a data packet having a header specifying a first source address in the first network and a destination address in a second network and looking up the first source address in a network address translation (NAT) table. Upon finding, in response to looking up the first source address, that the first source address is not listed in the NAT table, an entry is added to the NAT table specifying a corresponding second source address in the second network. One or more additional first source addresses that are not listed in the NAT table are predictively selected, and one or more further entries are added to the NAT table specifying one or more second source addresses in the public network corresponding to the one or more additional first source addresses.
    Type: Grant
    Filed: April 13, 2021
    Date of Patent: July 19, 2022
    Assignee: NVIDIA CORPORATION
    Inventors: Rohith Basavaraja, Sharath Ramamurthy
  • Patent number: 9813344
    Abstract: In one embodiment, a method for load balancing in a software-define networking (SDN) system includes, upon receiving a packet, determining whether a matching entry for the packet in a server distribution table contains both a current and new server selection. If the matching entry contains both, it is determined whether there is a matching entry for the packet in a transient flow table, where the transient flow table maintains server selections when at least one of the plurality of servers is reconfigured. Upon determining that there is no matching entry for the packet in the transient flow table, the method determines whether the packet is a first packet of a traffic flow. If the packet is the first packet of a traffic flow, the packet is forwarded according to the new server selection of the matching entry in the server distribution table, and the transient flow table is updated.
    Type: Grant
    Filed: October 5, 2016
    Date of Patent: November 7, 2017
    Assignee: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
    Inventors: Rohith Basavaraja, Prashant Anand, Mustafa Arisoylu, Himanshu Asnani, Myna Vajha, Arvind Mukundan
  • Publication number: 20170026294
    Abstract: In one embodiment, a method for load balancing in a software-define networking (SDN) system includes, upon receiving a packet, determining whether a matching entry for the packet in a server distribution table contains both a current and new server selection. If the matching entry contains both, it is determined whether there is a matching entry for the packet in a transient flow table, where the transient flow table maintains server selections when at least one of the plurality of servers is reconfigured. Upon determining that there is no matching entry for the packet in the transient flow table, the method determines whether the packet is a first packet of a traffic flow. If the packet is the first packet of a traffic flow, the packet is forwarded according to the new server selection of the matching entry in the server distribution table, and the transient flow table is updated.
    Type: Application
    Filed: October 5, 2016
    Publication date: January 26, 2017
    Inventors: Rohith BASAVARAJA, Prashant ANAND, Mustafa ARISOYLU, Himanshu ASNANI, Myna VAJHA, Arvind MUKUNDAN
  • Patent number: 9497123
    Abstract: In one embodiment, a method for load balancing in a software-define networking (SDN) system includes, upon receiving a packet, determining whether a matching entry for the packet in a server distribution table contains both a current and new server selection. If the matching entry contains both, it is determined whether there is a matching entry for the packet in a transient flow table, where the transient flow table maintains server selections when at least one of the plurality of servers is reconfigured. Upon determining that there is no matching entry for the packet in the transient flow table, the method determines whether the packet is a first packet of a traffic flow. If the packet is the first packet of a traffic flow, the packet is forwarded according to the new server selection of the matching entry in the server distribution table, and the transient flow table is updated.
    Type: Grant
    Filed: December 18, 2014
    Date of Patent: November 15, 2016
    Assignee: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)
    Inventors: Rohith Basavaraja, Prashant Anand, Mustafa Arisoylu, Himanshu Asnani, Myna Vajha, Arvind Mukundan
  • Publication number: 20160182378
    Abstract: In one embodiment, a method for load balancing in a software-define networking (SDN) system includes, upon receiving a packet, determining whether a matching entry for the packet in a server distribution table contains both a current and new server selection. If the matching entry contains both, it is determined whether there is a matching entry for the packet in a transient flow table, where the transient flow table maintains server selections when at least one of the plurality of servers is reconfigured. Upon determining that there is no matching entry for the packet in the transient flow table, the method determines whether the packet is a first packet of a traffic flow. If the packet is the first packet of a traffic flow, the packet is forwarded according to the new server selection of the matching entry in the server distribution table, and the transient flow table is updated.
    Type: Application
    Filed: December 18, 2014
    Publication date: June 23, 2016
    Inventors: Rohith BASAVARAJA, Prashant ANAND, Mustafa ARISOYLU, Himanshu ASNANI, Myna VAJHA, Arvind MUKUNDAN
  • Publication number: 20080250421
    Abstract: A method of forming a cluster from a plurality of potential clusters that share a common node, the method comprising determining a criticality factor of each potential cluster by combining criticality factors of the nodes of each potential cluster; and forming the cluster from the potential cluster with the highest criticality factor.
    Type: Application
    Filed: March 20, 2008
    Publication date: October 9, 2008
    Applicant: Hewlett Packard Development Co, L.P.
    Inventors: Rohith Basavaraja, Palanisamy Periyasamy, Rahul Sahgal