Optimistic Synchronization-Based Server Allocation With Preventive Start-Time Optimization Under Server Failure in Delay-Sensitive Applications
Open Access
- 20 March 2026
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 3497-3520
Abstract
Real-time applications require low latency and strict event ordering to ensure seamless operation. Distributed server processing is effective for this purpose, and there are two synchronization algorithms: a conservative synchronization algorithm (CSA) and an optimistic synchronization algorithm (OSA). OSA improves delay performance compared to CSA. While prior studies have considered OSA, they have not incorporated the impact of server failures. This paper proposes an OSA-based server allocation model for delay-sensitive applications with preventive start-time optimization (PreSO) under single-server failures (OSA-PreSO). The proposed OSA-PreSO model minimizes the largest total delay across all failure scenarios while satisfying constraints in OSA with PreSO under single-server failures. We formulate the proposed model as an integer linear programming (ILP) problem. In OSA-PreSO, the objective is to minimize the largest total delay across all failure scenarios, without giving special consideration to the total delay in the no-failure scenario. As a result, a penalty arises in the form of an increased total delay in the no-failure scenario. To reduce the penalty, we develop an improved OSA-PreSO model, OSA-PreSO-LP (low-penalty), which reduces the total delay in the nofailure scenario while maintaining the same delay characteristics in failure scenarios. We prove that the decision version of OSA-PreSO is NP-complete. We introduce heuristic algorithms to handle large-scale problems. Numerical results show that the proposed OSA-PreSO model reduces the delay compared to the conventional CSA-based model by effectively utilizing server memory resources. We observe that the proposed model achieves a lower largest total delay than start-time optimization and provides greater stability by preventing unnecessary user reassignments compared to run-time optimization. Numerical results also show that OSA-PreSO-LP reduces the penalty at most by 83%, while maintaining the same delay characteristics in failure scenarios.Keywords
Funding Information
- Japan Society for the Promotion of Science (JSPS) Kakenhi (25K22800)
- Japan Society for the Promotion of Science (JSPS) Kakenhi (25KF0055)
This publication has 43 references indexed in Scilit:
- Polynomial-time server allocation algorithm in delay-sensitive internet-of-things monitoring servicesComputer Networks, 2024
- A Network Design Approach Considering Data Consistency for Delay-Sensitive Distributed Processing Systems2023
- Distributed Server Allocation Model with Preventive Start-Time Optimization against Single Failure2020
- A Real-Time Delay-Sensitive Communication Approach Based on Distributed ProcessingIEEE Access, 2017
- Strengthened preventive start‐time optimisation that reduces congestion ratio under no failure scenarioThe Journal of Engineering, 2016
- Failure Analysis of Virtual and Physical Machines: Patterns, Causes and Characteristics2014
- A hybrid edge-cloud architecture for reducing on-demand gaming latencyMultimedia Systems, 2014
- Preventive start-time optimization against network failure2014
- Dynamic Power- and Failure-Aware Cloud Resources Allocation for Sets of Independent Tasks2013
- Reliable Task Allocation in Heterogeneous Distributed System with Random Node Failure: Load Sharing Approach2012