Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing.
Max NoormohammadpourAjitesh SrivastavaCauligi S. RaghavendraPublished in: CoRR (2019)
Keyphrases
- worst case
- completion times
- absolute deviation
- single machine
- single machine scheduling problem
- scheduling problem
- processing times
- weighted sum
- np hard
- lower bound
- average case
- arrival times
- upper bound
- release times
- routing protocol
- flowshop
- routing algorithm
- resource consumption
- approximation algorithms
- linear combination
- objective function
- search procedure
- multipath
- genetic algorithm
- computational efficiency
- resource allocation
- search algorithm