@inproceedings{oai:repo.lib.tut.ac.jp:02000011,
 author = {Kawabata, Akio and Bijoy, Chand Chatterjee and Oki, Eiji and 川端, 明生 and Bijoy, Chand Chatterjee and 大木, 英司},
 book = {IEEE International Conference on Communications, Rome, Italy, 2023},
 month = {2023-10, 2023-10-30},
 note = {This paper proposes a network design approach considering data consistency for a delay-sensitive distributed processing
system. The data consistency is determined by collating the own state and the two states of slave servers. If the state is
mismatched with other servers, the rollback process is initiated to modify the state to guarantee data consistency. In the proposed
approach, the select servers and the master-slave server pairs are determined to minimize the end-to-end delay and the delay
for data consistency. We formulate the proposed approach as an integer linear programming problem. We evaluate the delay
performance and computation time. The proposed approach reduces the delay for data consistency by 6.8-31.2% compared to
that of a typical approach that collates the status of all servers at the master server. The computation time is a few seconds, which
is an acceptable time for network design before service launch. These results indicate that the proposed approach is effective for
delay-sensitive applications.},
 pages = {3036--3041},
 publisher = {IEEE},
 title = {A Network Design Approach Considering Data Consistency for Delay-Sensitive Distributed Processing Systems},
 year = {}
}