Abstract:
Systems and methods for managing computer network activity are disclosed. A data flow to be transmitted between a source node and a destination node can be identified. An initial graph representing the computer network can be determined. A shortest path between the source node and the destination node can be identified based on the graph. Bandwidth can be allocated to communication links along the shortest path between the source node and the destination node. It can be determined whether a bandwidth requirement associated with the data flow is satisfied by the allocated bandwidth. A residual graph can be determined. The steps of identifying a shortest path between the source node and the destination node based on the residual graph and allocating bandwidth to communication links along the shortest path between the source node and the destination node can be repeated.
Abstract:
Systems and methods for reassigning and implementing communication links in a network are described herein. The systems and methods described herein, reduce the amount of throughput loss that results when a network is expanded. The systems and methods generate distributions for the communication links that, when implemented, reduce the number of broken paths that occur in the expanding network. More practically, the systems and methods provide a heuristic for remapping communication links from a first link distribution to a second link distribution.