The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Cet article propose un modèle de conception de réseau, prenant en compte la cohérence des données pour un système de traitement distribué sensible aux délais. La cohérence des données est déterminée par la comparaison de l'état propre et de celui des serveurs esclaves. Si l'état ne correspond pas à celui des autres serveurs, le processus de restauration est lancé pour modifier l'état afin de garantir la cohérence des données. Dans le modèle proposé, les serveurs sélectionnés et les paires de serveurs maître-esclave sont déterminés pour minimiser le délai de bout en bout et le délai de cohérence des données. Nous formulons le modèle proposé comme un problème de programmation linéaire en nombres entiers. Nous évaluons les performances du retard et le temps de calcul. Nous évaluons le modèle proposé dans deux modèles de réseau avec deux, trois et quatre serveurs esclaves. Le modèle proposé réduit le délai de cohérence des données jusqu'à 31 % par rapport à celui d'un modèle classique qui rassemble l'état de tous les serveurs sur un seul serveur maître. Le temps de calcul est de quelques secondes, ce qui est un délai acceptable pour la conception du réseau avant le lancement du service. Ces résultats indiquent que le modèle proposé est efficace pour les applications sensibles aux délais.
Akio KAWABATA
Toyohashi University of Technology
Bijoy CHAND CHATTERJEE
South Asian University
Eiji OKI
Kyoto University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Akio KAWABATA, Bijoy CHAND CHATTERJEE, Eiji OKI, "CMND: Consistent-Aware Multi-Server Network Design Model for Delay-Sensitive Applications" in IEICE TRANSACTIONS on Communications,
vol. E107-B, no. 3, pp. 321-329, March 2024, doi: 10.23919/transcom.2023EBP3112.
Abstract: This paper proposes a network design model, considering data consistency for a delay-sensitive distributed processing system. The data consistency is determined by collating the own state and the 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 model, the selected 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 model as an integer linear programming problem. We evaluate the delay performance and computation time. We evaluate the proposed model in two network models with two, three, and four slave servers. The proposed model reduces the delay for data consistency by up to 31 percent compared to that of a typical model that collates the status of all servers at one 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 model is effective for delay-sensitive applications.
URL: https://global.ieice.org/en_transactions/communications/10.23919/transcom.2023EBP3112/_p
Copier
@ARTICLE{e107-b_3_321,
author={Akio KAWABATA, Bijoy CHAND CHATTERJEE, Eiji OKI, },
journal={IEICE TRANSACTIONS on Communications},
title={CMND: Consistent-Aware Multi-Server Network Design Model for Delay-Sensitive Applications},
year={2024},
volume={E107-B},
number={3},
pages={321-329},
abstract={This paper proposes a network design model, considering data consistency for a delay-sensitive distributed processing system. The data consistency is determined by collating the own state and the 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 model, the selected 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 model as an integer linear programming problem. We evaluate the delay performance and computation time. We evaluate the proposed model in two network models with two, three, and four slave servers. The proposed model reduces the delay for data consistency by up to 31 percent compared to that of a typical model that collates the status of all servers at one 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 model is effective for delay-sensitive applications.},
keywords={},
doi={10.23919/transcom.2023EBP3112},
ISSN={1745-1345},
month={March},}
Copier
TY - JOUR
TI - CMND: Consistent-Aware Multi-Server Network Design Model for Delay-Sensitive Applications
T2 - IEICE TRANSACTIONS on Communications
SP - 321
EP - 329
AU - Akio KAWABATA
AU - Bijoy CHAND CHATTERJEE
AU - Eiji OKI
PY - 2024
DO - 10.23919/transcom.2023EBP3112
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E107-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2024
AB - This paper proposes a network design model, considering data consistency for a delay-sensitive distributed processing system. The data consistency is determined by collating the own state and the 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 model, the selected 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 model as an integer linear programming problem. We evaluate the delay performance and computation time. We evaluate the proposed model in two network models with two, three, and four slave servers. The proposed model reduces the delay for data consistency by up to 31 percent compared to that of a typical model that collates the status of all servers at one 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 model is effective for delay-sensitive applications.
ER -