Patents by Inventor Michal Segalov

Michal Segalov 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: 20160301612
    Abstract: Systems and methods are provided for allocating resources of a network among a plurality of traffic demands to optimize fairness and network utilization. Methods based on flow-increase dynamics converge toward an upward max-min fair (UMMF) allocation, in which the value of each traffic demand cannot be increased, along any of its paths, even if larger traffic demands are removed from the network. An efficient iterative algorithm that converges to a UMMF solution is also provided. The described methods and systems can be implemented efficiently, distributively, and asynchronously.
    Type: Application
    Filed: June 21, 2016
    Publication date: October 13, 2016
    Inventors: Avinatan Hassidim, Emilie Jeanne Anne Danna, Alok Kumar, Dan Raz, Michal Segalov
  • Patent number: 9467362
    Abstract: In one general aspect, a method for determining utilization of a network includes calculating a flow value for each of multiple flows in a network, determining a growth factor for each of the flows in the network and determining a utilization of the network using the growth factors for each of the flows. In another general aspect, a method for determining utilization of a network includes calculating a flow value for each of multiple flows in a network and determining a risk factor for each of the flows in the network.
    Type: Grant
    Filed: March 18, 2014
    Date of Patent: October 11, 2016
    Assignee: Google Inc.
    Inventors: Michal Segalov, Danny Raz, Ariel Shaqed
  • Patent number: 9391920
    Abstract: Systems and methods are provided for allocating resources of a network among a plurality of traffic demands to optimize fairness and network utilization. Methods based on flow-increase dynamics converge toward an upward max-min fair (UMMF) allocation, in which the value of each traffic demand cannot be increased, along any of its paths, even if larger traffic demands are removed from the network. An efficient iterative algorithm that converges to a UMMF solution is also provided. The described methods and systems can be implemented efficiently, distributively, and asynchronously.
    Type: Grant
    Filed: August 30, 2012
    Date of Patent: July 12, 2016
    Assignee: Google Inc.
    Inventors: Avinatan Hassidim, Emilie Jeanne Anne Danna, Alok Kumar, Dan Raz, Michal Segalov
  • Patent number: 9369360
    Abstract: Systems and methods for fault detection in large scale networks are provided. Probing instructions are generated by a probing controller associated with a network having a plurality of nodes. The probing instructions include a specified source node and a specified destination node. Each probing instruction is transmitted to a probing agent coupled to the specified source node and a data packet is transmitted from the probing agent to the specified destination node. A fault detection module is informed of probing instructions associated with failed transmissions, identifies a plurality of nodes having a likelihood of being in a network path associated with failed transmissions, and processes the plurality of nodes having a likelihood of being in the network paths associated with failed transmissions to identify of a set of likely failed nodes.
    Type: Grant
    Filed: May 12, 2014
    Date of Patent: June 14, 2016
    Assignee: Google Inc.
    Inventors: Michal Segalov, Eyal Soha, Dan Raz, Ido Feldman, Dotan Emanuel, Avinatan Hassidim
  • Patent number: 9015340
    Abstract: Systems and methods for splitting a network traffic flow in a data network are described. A flow of traffic between a source node and a destination node in the data network is split into a set of data paths. A data path includes one or more data links between nodes in the data network. A submap of the data network that excludes at least one data link is used to determine the set of flow paths.
    Type: Grant
    Filed: August 22, 2012
    Date of Patent: April 21, 2015
    Assignee: Google Inc.
    Inventors: Avinatan Hassidim, Michal Segalov, Tzvika Hartman, Dan Raz
  • Publication number: 20130121146
    Abstract: Systems and methods are provided for allocating resources of a network among a plurality of traffic demands to optimize fairness and network utilization. Methods based on flow-increase dynamics converge toward an upward max-min fair (UMMF) allocation, in which the value of each traffic demand cannot be increased, along any of its paths, even if larger traffic demands are removed from the network. An efficient iterative algorithm that converges to a UMMF solution is also provided. The described methods and systems can be implemented efficiently, distributively, and asynchronously.
    Type: Application
    Filed: August 30, 2012
    Publication date: May 16, 2013
    Applicant: GOOGLE INC.
    Inventors: Avinatan Hassidim, Emilie Jeanne Anne Danna, Alok Kumar, Dan Raz, Michal Segalov
  • Publication number: 20130117466
    Abstract: Systems and methods for splitting a network traffic flow in a data network are described. A flow of traffic between a source node and a destination node in the data network is split into a set of data paths. A data path includes one or more data links between nodes in the data network. A submap of the data network that excludes at least one data link is used to determine the set of flow paths.
    Type: Application
    Filed: August 22, 2012
    Publication date: May 9, 2013
    Inventors: Avinatan Hassidim, Michal Segalov, Tzvika Hartman, Dan Raz