Abstract: Local rules for managing flows devolved from a central controller are received at a switch. The central controller determines a global set of rules for managing flows. The switch receives a packet from a flow from a network and determines whether a metric for the flow satisfies a dynamic condition to trigger a metric report to the central controller. In response to a determination that the metric for the flow at the switch satisfies the dynamic condition to trigger a metric report to the central controller, the switch sends a metric report to the central controller, and the switch then receives an instruction to manage the flow from the central controller. In response to a determination that the metric for the flow at the switch does not satisfy the dynamic condition to trigger the metric report to the central controller, the switch manages the flow using the local rules for managing flows.

Abstract: A computer network (400) includes a first switch (435) and a neighboring switch (440), wherein the first switch (435) floods the computer network (400) as a result of a forwarding table miss and the neighboring switch (440) acts as a barrier to prevent the flood from propagating into unrelated areas of the computer network (400). A method of reducing flooding within a computer network (400) includes intentionally flooding the computer network when a new forwarding table entry is made by a first network switch (435), such that information contained within the new forwarding table entry is recorded by a neighboring network switch (440) which subsequently blocks messages which are received on a proper destination port.

Abstract: Forwarding a flow in a network includes receiving the flow at a switch, determining an optimized priority queue level of the flow at the switch, and forwarding the flow via the switch using an optimized priority queue level of the flow at the switch. The flow passes through a plurality of switches, including the switch, in the network, and the optimized priority queue level of the flow at the switch is different from a priority queue level of the flow at a second switch of the plurality of switches. The second switch routes the flow at the second switch using the different priority queue level for the flow.

Abstract: In a method for minimizing pathological flooding of a network using a destination node, a packet is received from a source node at the destination node. The packet is transmitted from the source node to the destination node along a path. A determination is made by a node whether the packet indicates a possibility of pathological flooding. In response to a determination that the packet indicates a possibility of pathological flooding, a dummy packet is forwarded along the path to the source node.

Abstract: Distances are determined between an identified node and landmark nodes and milestone nodes in a network. The closest milestone or landmark node associated with a shortest of the measured distances is determined. A corresponding distributed hash table (DHT) overlay node is queried for distances between observed nearest nodes for the closest milestone or landmark node and the identified node. Distances between the identified node and the observed nearest nodes are calculated from distances received from the DHT overlay node and the measured distance to the closest milestone or landmark node. K-closest nodes from the identified node are selected from at least one of the closest milestone or landmark node and one or more of the observed nearest nodes based on the calculated distances.

Abstract: Feature vectors for nodes in a network are computed based on a network metric. Clusters of the nodes are formed based on the feature vectors. A cluster head is selected for each cluster. Available bandwidths between the cluster head and nodes outside the cluster are determined. The available bandwidths between the cluster head and the nodes outside the cluster may be used as estimations of available bandwidths for the nodes in the cluster.

Abstract: In an embodiment, a system and method may manage network resources to provide a near zero-cost background replication of data. Such a system may be inhibited from causing interference with foreground data flows. Such a system may also utilize a large fraction of spare network bandwidth. A system configured to implement such a method may include one or more servers and at least one client in communication via a to network. Additionally the system may include a hint server, a monitor and/or a front-end application between a demand server and the network.

Abstract: Feature vectors for nodes in a network are computed based on a network metric. Clusters of the nodes are formed based on the feature vectors. A cluster head is selected for each cluster. Available bandwidths between the cluster head and nodes outside the cluster are determined. The available bandwidths between the cluster head and the nodes outside the cluster may be used as estimations of available bandwidths for the nodes in the cluster.

Abstract: In an embodiment, a system and method may manage network resources to provide a near zero-cost background replication of data. Such a system may be inhibited from causing interference with foreground data flows. Such a system may also utilize a large fraction of spare network bandwidth. A system configured to implement such a method may include one or more servers and at least one client in communication via a network. Additionally the system may include a hint server, a monitor and/or a front-end application between a demand server and the network.

Abstract: Distances are determined between an identified node and landmark nodes and milestone nodes in a network. The closest milestone or landmark node associated with a shortest of the measured distances is determined. A corresponding distributed hash table (DHT) overlay node is queried for distances between observed nearest nodes for the closest milestone or landmark node and the identified node. Distances between the identified node and the observed nearest nodes are calculated from distances received from the DHT overlay node and the measured distance to the closest milestone or landmark node. K-closest nodes from the identified node are selected from at least one of the closest milestone or landmark node and one or more of the observed nearest nodes based on the calculated distances.

Abstract: In an embodiment, a system and method may manage network resources to provide a near zero-cost background replication of data. Such a system may be inhibited from causing interference with foreground data flows. Such a system may also utilize a large fraction of spare network bandwidth. A system configured to implement such a method may include one or more servers and at least one client in communication via a network. Additionally the system may include a hint server, a monitor and/or a front-end application between a demand server and the network.