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.

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.

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.

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.

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.

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.

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.