Google Inc.

Technion Research & Development Foundation Ltd

Dan Raz

Avinatan Hassidim

Michal Segalov

Dotan Emanuel

Alok Kumar

Amir Nahir

Emilie Jeanne Anne Danna

Tzvika Hartman

Ariel Orda

Eyal Soha

Eran Liberty

Ido Feldman

Aleksandr Smirnov

A method comprising, in a cloud computing system: receiving a new job at the cloud computing system; sampling VMs (Virtual Machines) of the cloud computing system for the load currently handled by each of the VMs; if the load currently handled by the VMs is within operational bounds, sending the new job to one of the VMs which currently handles the highest load compared to other ones of the VMs; and if the load currently handled by the VMs is beyond operational bounds, sending the new job to one of the VMs which currently handles the lowest load compared to other ones of the VMs.

Distributed cloud computing elasticity

Systems and methods for locating network errors. The system includes a plurality of host nodes in a network of host nodes and intermediary nodes, and a database storing route data for each of a plurality of host node pairs. The system includes a controller configured to identify a subject intermediary node to investigate for network errors and select, using route data stored in the database, a set of target probe paths. Each target probe path includes a respective pair of host nodes separated by a network path including at least one target intermediary node, which is either the subject intermediary node or an intermediary node that is a next-hop neighbor of the subject intermediary node. The controller is configured to test each target probe path in the set of target probe paths and to determine, based on a result of the testing, an operational status of the subject intermediary node.

Systems and methods for targeted probing to pinpoint failures in large scale networks

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.

Iterative max-min fairness algorithms

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.

Systems and methods for fault detection in large scale networks

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.

Splitting a network traffic flow

Growing community of inventors

Timrat, Israel

Dan Raz