Polynomial-time Algorithm for Distributed Server Allocation Problem

Abstract

This paper proposes an algorithm for the distributed server allocation problem, namely Minimizing the Maximum Delay (MMD), where an optimal solution is obtained when all server-server delays are the same constant value. We prove that MMD obtains an optimal solution with the polynomial time complexity.