Abstract: Methods and systems for load balancing of a communication network are described. Examples of the disclosed methods and systems may be topology agnostic (not specific to a particular network topology). Congestion information is obtained for a plurality of paths between two switches in the communication network. A selection probability is obtained for each path using the congestion information. A flowlet is assigned to a path based on the selection probabilities. Each path may be assigned to a path group, where each path group comprises paths of equal length. The selection probabilities may be computed for each path group and for each path within each path group, and the flowlet may be assigned by selecting a path group based on the selection probabilities of the path groups, and selecting a path within the selected path group.

Abstract: Methods and systems for load balancing of a communication network are described. Examples of the disclosed methods and systems may be topology agnostic (not specific to a particular network topology). Congestion information is obtained for a plurality of paths between two switches in the communication network. A selection probability is obtained for each path using the congestion information. A flowlet is assigned to a path based on the selection probabilities. Each path may be assigned to a path group, where each path group comprises paths of equal length. The selection probabilities may be computed for each path group and for each path within each path group, and the flowlet may be assigned by selecting a path group based on the selection probabilities of the path groups, and selecting a path within the selected path group.

Abstract: Methods, systems and media for network model checking using entropy based binary decision diagram (BDD) compression are described. Two related compression techniques are described: bit level reduction to reduce the number of bits required for each network field according to its nature, and field level reduction to reduce the size of the BDD tree by finding a near-optimum ordering of the fields in the BDD space. These two techniques, separately or together, may alleviate the state explosion problem the limits application of BDD based model checking. The two techniques complement each other synergistically, particularly in the domain of computer network checking and verification.

Abstract: Methods, systems and media for network model checking using entropy based binary decision diagram (BDD) compression are described. Two related compression techniques are described: bit level reduction to reduce the number of bits required for each network field according to its nature, and field level reduction to reduce the size of the BDD tree by finding a near-optimum ordering of the fields in the BDD space. These two techniques, separately or together, may alleviate the state explosion problem the limits application of BDD based model checking. The two techniques complement each other synergistically, particularly in the domain of computer network checking and verification.