Skip to Main Content
The problem of aggregating large data files from distributed databases and address the corresponding challenges involved from a network architecture perspective is considered. We model this problem as one of identifying a time-path schedule (TPS) in a graph representation of the network. We prove that the TPS problem (TPSP) is NP-complete. We then propose a mixed integer linear programming (MILP)-based approach and three heuristics longest-file-first (LFF), disjoint-paths (DP), and most-distant-file-first (MDFF) - to solve TPSP.