Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing.
Max NoormohammadpourAjitesh SrivastavaCauligi S. RaghavendraPublished in: Allerton (2019)
Keyphrases
- worst case
- completion times
- absolute deviation
- single machine scheduling problem
- scheduling problem
- single machine
- processing times
- weighted sum
- np hard
- average case
- arrival times
- upper bound
- lower bound
- release times
- flowshop
- routing algorithm
- branch and bound algorithm
- routing protocol
- approximation algorithms
- shortest path
- computational complexity
- queue length
- data access
- special case