AKAkio Kawabata

Akio Kawabata

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Akio Kawabata has a total of 20 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Optimistic Synchronization-Based Server Allocation With Preventive Start-Time Optimization Under Server Failure in Delay-Sensitive Applications

    by Masaki Oda, Imran Ahmed, Akio Kawabata, Eiji Oki

    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.

  • Open Access

    Consistency-Aware Multi-Server Network Design for Delay-Sensitive Applications Under Multiple-Server Failures

    by Masaki Oda, Imran Ahmed, Akio Kawabata, Eiji Oki

    Delay-sensitive applications demand minimal latency and strict event ordering. Distributing processing to multiple edge servers can reduce access delay, but it is essential to ensure a consistent state across those servers and handle server failures. Existing models address consistency with only single-server failures, but multiple-server failures can occur in real networks. This paper proposes a server allocation model for a consistency-aware multi-server network in delay-sensitive applications with preventive start-time optimization (PSO) under multiple-server failures. PSO determines the assignment to minimize the worst-case delay across all considered failure scenarios without introducing service disruption for users connected to non-failed servers. We formulate the proposed model as an integer linear programming problem. We prove the decision version of the server allocation problem is NP-hard. Numerical results show that the proposed model outperforms start-time optimization in terms of the largest total delay and run-time optimization in terms of avoiding instability.

  • Open Access

    Consistency-Aware Multi-Server Network Design for Delay-Sensitive Applications Under Server Failures

    by Masaki Oda, Akio Kawabata, Eiji Oki

    Real-time applications require low latency and event order guarantees. Distributed server processing is effective for this purpose, and data consistency between servers is crucial. Although existing models in previous work handle data consistency, they do not address server failures. This paper proposes a server allocation model for a consistency-aware multi-server network for delay-sensitive applications with preventive start-time optimization (PSO) under single-server failures. The proposed model considers data consistency between servers and handles single-server failures with PSO. PSO determines the assignment to minimize the worst-case delay over all possible failure scenarios while avoiding service disruption for users connected to non-failed servers. We formulate the proposed model as an integer linear programming (ILP) problem. The decision version of the server allocation problem is proven to be NP-complete, and it becomes difficult to solve in a practical time when the problem size is large. We develop two polynomial-time approximation algorithms with theoretical performance analysis. Numerical results show that the proposed model outperforms start-time optimization in terms of the largest total delay and run-time optimization in terms of avoiding instability. The results also show that the faster of our two developed algorithms achieves a speedup ranging from $2.26 \times 10^{3}$ to $4.37 \times 10^{6}$ times compared to the ILP approach, while the maximum delay is, on average, only 1.029 times the optimal value. The results indicate that the speedup effect becomes more significant as the number of users and servers increases.

  • Open Access

    Robust Distributed Server Selection Model Against Delay Uncertainty

    by Chenlu Zhang, Akio Kawabata, Eiji Oki

    In real-time applications under wide-area networks, providing a demanded quality of service for end users is an issue. Recent studies adopt distributed processing for server selection problems to reduce data synchronization delay and total interaction delay, assuming that link delays over the distributed system are exactly known. No study has addressed the problem of such a distributed server selection in properly handling the delay uncertainty. This paper proposes a robust optimization model for the distributed server selection problem against the delay uncertainty. We handle the delay uncertainty of user-server and server-server links by defining two -ellipsoidal uncertainty sets. The proposed model determines allocated servers for multiple users to minimize the weighted sum of data synchronization delay and total interaction delay over the distributed system. We formulate the proposed model as a mixed integer second-order cone programming problem. We prove that the distributed server selection problem with uncertain delays is NP-complete. We compare the proposed model with baseline models, focusing on delay uncertainty and distributed processing. The numerical results show that the proposed model can achieve a lower objective value than the baseline models, indicating the benefit of utilizing -ellipsoidal uncertainty sets to handle delay uncertainty.


  • Distributed Processing Network Design Scheme for Virtual Application Processing Platform

    by Akio Kawabata, Sanetora Hiragi, Bijoy Chand Chatterjee, Eiji Oki

    Delay-sensitive applications have been provided through a low-delay network utilizing multiple edge clouds. For applications that involve sharing status among multiple users, it is crucial to prevent longer communication delays for users who are farther from the application server compared to those who are closer. To address this issue, this paper proposes a distributed processing network design scheme for virtual processing platforms using low-delay networks and widely distributed servers. The proposed scheme introduces Tapl as a given parameter for correcting events in occurrence order. Events within Tapl delay are sorted in occurrence order. The proposed scheme can change its operation mode from a conservative synchronization to an optimistic synchronization depending on the setting of Tapl. The proposed scheme is formulated as a mixed-integer linear programming problem to determine users’ and servers’ distributed processing network configuration. We evaluate the proposed scheme on two different network topologies. Numerical results indicate that, depending on the setting of Tapl, the proposed scheme can reduce the maximum amount of memory used for rollback processes in optimistic synchronization-based applications or realize a conservative synchronization algorithm. The computation time under the condition of 1000 users is within a maximum of nine sec, an acceptable amount of time for preparation before starting a planned service. These results indicate that the proposed scheme realizes event order correction with excellent delay characteristics and applies to virtual processing platforms.


  • Open Access

    Distributed Server Allocation for Internet-of-Things Monitoring Services With Preventive Start-Time Optimization Against Server Failure

    by Shoya Imanaka, Akio Kawabata, Bijoy Chand Chatterjee, Eiji Oki

    Internet-of-Things (IoT) services require high performance regarding low delay and fault tolerance. Distributed server allocation is well-suited for meeting these requirements in IoT monitoring services. Previous work focused on reducing delay but overlooked the need for fault tolerance in distributed server allocation. This paper proposes a distributed server allocation model based on preventive start-time optimization (PSO) for IoT monitoring services against server failure. The proposed model preventively determines the server allocation to minimize the largest maximum delay between IoT devices and application servers and between database and application servers among all failure patterns. We formulate the proposed model as an integer linear programming (ILP) problem. We introduce a server allocation algorithm based on PSO to accelerate the computation to obtain an optimal server allocation, compared to the ILP approach. We prove that the introduced algorithm obtains a PSO-based optimal allocation in polynomial time. Numerical results show that the introduced algorithm outputs an optimal server allocation faster than the ILP approach. We compare the PSO-based server allocation with allocations based on the start-time and run-time optimization. We observe that the PSO-based allocation reduces the largest maximum delay by 5.5% for a network model with eleven servers compared to the start-time optimization and avoids unnecessary network disconnections while increasing the maximum delay by 5.1% compared to the run-time optimization.


  • Open Access

    Approximation Polynomial-Time Algorithms for Consistency-Aware Multi-Server Network Design in Delay-Sensitive Applications

    by Masaki Oda, Akio Kawabata, Eiji Oki

    This paper proposes two polynomial-time approximation algorithms for allocating servers to design a consistency-aware multi-server network for delay-sensitive applications. Each algorithm selects servers and determines the main-secondary server pairs to minimize the total delay. Previous work has not provided any polynomial-time algorithm. The proposed algorithms are theoretically guaranteed to output an approximate value within three times the optimal value. Numerical results show that the more computationally efficient of the two algorithms is 46.4 to 5.26×104 times faster than an integer linear programming technique, while the maximum delay is, on average, merely 1.0196 times the optimal value.


  • DSND: Delay-Sensitive Network Design Scheme for Multi-Service Slice Networks

    by Akio Kawabata, Bijoy Chand Chatterjee, Eiji Oki

    This letter proposes a delay-sensitive network design scheme, DSND, for multi-service slice networks. DSND contributes to a virtual processing system where users can share the same application space regardless of distance-related delays. DSND introduces the service slice and service virtual time concepts. A service slice is a virtual network comprising user and server nodes. A service virtual time is a time for eliminating the difference in delay caused by distance, and the user’s events are reordered in occurrence order. The difference between the current time and the service virtual time is the end-to-end delay shared by all users within the same service slice. We formulate DSND as an integer linear programming problem and compare the delays between DSND to a benchmark scheme where each user selects the closest server. Numerical results indicate that DSND can reduce the delay by 4–38 percent compared to the benchmark scheme.