Polynomial-time server allocation algorithm in delay-sensitive internet-of-things monitoring services

Abstract

This paper proposes a polynomial-time algorithm for a server allocation problem in delay-sensitive Internet-of-Things (IoT) monitoring services. The server allocation problem determines the appropriate servers to which the database and application are allocated to minimize the maximum delay between the latest update of reference data and the start of application processing for monitoring data. The server allocation problem was previously handled by expressing it as an integer linear programming (ILP) problem. Nevertheless, it fails to meet the computational time complexity needed to solve the problem, and it does not offer a more efficient technique than the ILP approach. The proposed algorithm consists of two components. The first step entails choosing utilization servers for both the database and the application. Next, the second phase entails matching each usage server and its corresponding IoT device. We prove that the proposed algorithm obtains an optimal solution in polynomial time. We compare computation times between the ILP approach and the proposed algorithm. Numerical results show that the proposed algorithm obtains the optimal solution faster than the ILP approach.