Coflows for geo-distributed computer sites that communicate via wide area network
AssigneeInternational Business Machines Corporation
InventorsAnand Eswaran, Mudit Verma, Aishwariya Chakraborty, Praveen Jayachandran, Pankaj Thorat
Life of this patent
Estimating the term…
Abstract
A coflow is mapped to a plurality of geo-distributed computer sites that can communicate via wide area network (WAN), where the mapping is subject to one or more location-dependent constraints. Multiple candidate data paths are identified for each of a plurality of source-destination pairs of the plurality of geo-distributed computer sites. A mathematical optimization is performed to find a set of paths from the candidate data paths based on total flow completion time and at least one additional objective of the coflow.
Claims20
A computer-implemented method comprising:
- mapping a coflow to a plurality of geo-distributed computer sites that can communicate via wide area network (WAN), wherein the mapping is subject to one or more location-dependent constraints;
- identifying multiple candidate data paths for each of a plurality of source-destination pairs of the plurality of geo-distributed computer sites;
- and
- performing a mathematical optimization to find a set of paths from the candidate data paths based on a total flow completion time and at least one additional objective of the coflow.
A computing device comprising a memory having computer readable instructions;
- and one or more processors for executing the computer readable instructions to configure the computing device to perform acts comprising:
- mapping a coflow to a plurality of geo-distributed computer sites that can communicate via wide area network (WAN), the mapping subject to one or more location-dependent constraints;
- identifying multiple candidate data paths for each of a plurality of source-destination pairs of the plurality of geo-distributed computer sites;
- and
- performing a mathematical optimization to find a set of paths from the candidate data paths based on total flow completion time and at least one additional objective of the coflow.
A computer program product comprising one or more computer-readable memory devices encoded with data including instructions that, when executed, causes a processor set to perform a method, comprising:
- mapping a coflow to a plurality of geo-distributed computer sites that can communicate via wide area network (WAN), the mapping subject to one or more location-dependent constraints;
- identifying multiple candidate data paths for each of a plurality of source-destination pairs of the plurality of geo-distributed computer sites;
- and
- performing a mathematical optimization to find a set of paths from the candidate paths based on flow completion time and at least one additional objective of the coflow.
A computer-implemented method, comprising:
- handling a first coflow and at least one additional coflow for a plurality of networked computer sites, wherein the first coflow has a plurality of flows;
- predicting a time at which a slowest flow of the plurality of flows will be ready for scheduling;
- and
- reducing bandwidth of the first coflow such that each of the plurality of flows will be scheduled at the predicted time.
Dependencies are inferred from the claim text.