Algorithm for Server Allocation in Delay-Sensitive Internet-of-Things Monitoring Services
Shoya Imanaka, Akio Kawabata, Bijoy Chand Chatterjee, Eiji Oki · 2024
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 proposed algorithm comprises two components. The initial phase involves the selection of usage servers for both the database and the application. Subsequently, the second phase entails matching each usage server and its corresponding IoT device. The proposed algorithm obtains an optimal allocation solution in polynomial time. Numerical results show that the proposed algorithm obtains the optimal solution faster than an integer linear programming approach.