skip to main content

In-advance path reservation for file transfers In e-Science applications

Yan Li ; Ranka, S ; Sahni, S

2009 IEEE Symposium on Computers and Communications, July 2009, pp.176-181

Texto completo disponível

Citações Citado por
  • Título:
    In-advance path reservation for file transfers In e-Science applications
  • Autor: Yan Li ; Ranka, S ; Sahni, S
  • Assuntos: Processor Scheduling ; Scheduling Algorithm ; Bandwidth ; Optical Fiber Networks ; Linear Programming ; Multiprotocol Label Switching ; Application Software ; Computer Networks ; Optical Computing ; Information Science ; Engineering ; Computer Science
  • É parte de: 2009 IEEE Symposium on Computers and Communications, July 2009, pp.176-181
  • Descrição: We develop multi-path reservation algorithms for in advance scheduling of large file transfers in connection-oriented optical networks. Specifically, to schedule a single file transfer to complete at the earliest possible time, a new max-flow based greedy algorithm (GOS) and four variants that adapt the k shortest paths and k-disjoint paths algorithms are proposed. Meanwhile, to find an earliest-finishing schedule for a batch of file transfers, a linear programming based algorithm (BATCH) is developed. Extensive experiments using both real world and random networks show that our GOS algorithm provides a good balance among maximum finish time, average finish time, and computational complexity. Although our BATCH algorithm results in the smallest maximum finish time, this algorithm has a significantly larger computational requirement than our other algorithms. GOS yields file transfer schedules with similar maximum finish time and reduces average finish time while having a significantly less computational requirement.
  • Idioma: Inglês

Buscando em bases de dados remotas. Favor aguardar.