A time-path scheduling problem (TPSP) for aggregating large data files from distributed databases using an optical burst-switched network

Amitabha Banerjee, Narendra K. Singhal, Jing Zhang, Dipak Ghosal, Chen-Nee Chuah, Biswanath Mukherjee

Abstract

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.
BibTeX
@inproceedings{banerjee2004time,
  author = {Amitabha Banerjee and Narendra K. Singhal and Jing Zhang and Dipak Ghosal and Chen-Nee Chuah and Biswanath Mukherjee},
  title = {{A time-path scheduling problem (TPSP) for aggregating large data files from distributed databases using an optical burst-switched network}},
  booktitle = {ICC},
  year = {2004},
  doi = {10.1109/icc.2004.1312774},
}

Loading related content...

Figure