IEICE TRANSACTIONS on Communications
Open Access
An Optimistic Synchronization Based Optimal Server Selection Scheme for Delay Sensitive Communication Services
-
Full Text Views
49
- Cite this
- Free PDF (2MB)
Summary :
In distributed processing for communication services, a proper server selection scheme is required to reduce delay by ensuring the event occurrence order. Although a conservative synchronization algorithm (CSA) has been used to achieve this goal, an optimistic synchronization algorithm (OSA) can be feasible for synchronizing distributed systems. In comparison with CSA, which reproduces events in occurrence order before processing applications, OSA can be feasible to realize low delay communication as the processing events arrive sequentially. This paper proposes an optimal server selection scheme that uses OSA for distributed processing systems to minimize end-to-end delay under the condition that maximum status holding time is limited. In other words, the end-to-end delay is minimized based on the allowed rollback time, which is given according to the application designing aspects and availability of computing resources. Numerical results indicate that the proposed scheme reduces the delay compared to the conventional scheme.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E104-B No.10 pp.1277-1287
- Publication Date
- 2021/10/01
- Publicized
- 2021/04/09
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.2020EBP3178
- Type of Manuscript
- PAPER
- Category
- Network System
Authors
Akio KAWABATA
the NTT Network Technology Laboratories
Bijoy Chand CHATTERJEE
the South Asian University
Eiji OKI
the Kyoto University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Akio KAWABATA, Bijoy Chand CHATTERJEE, Eiji OKI, "An Optimistic Synchronization Based Optimal Server Selection Scheme for Delay Sensitive Communication Services" in IEICE TRANSACTIONS on Communications,
vol. E104-B, no. 10, pp. 1277-1287, October 2021, doi: 10.1587/transcom.2020EBP3178.
Abstract: In distributed processing for communication services, a proper server selection scheme is required to reduce delay by ensuring the event occurrence order. Although a conservative synchronization algorithm (CSA) has been used to achieve this goal, an optimistic synchronization algorithm (OSA) can be feasible for synchronizing distributed systems. In comparison with CSA, which reproduces events in occurrence order before processing applications, OSA can be feasible to realize low delay communication as the processing events arrive sequentially. This paper proposes an optimal server selection scheme that uses OSA for distributed processing systems to minimize end-to-end delay under the condition that maximum status holding time is limited. In other words, the end-to-end delay is minimized based on the allowed rollback time, which is given according to the application designing aspects and availability of computing resources. Numerical results indicate that the proposed scheme reduces the delay compared to the conventional scheme.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2020EBP3178/_p
Copy
@ARTICLE{e104-b_10_1277,
author={Akio KAWABATA, Bijoy Chand CHATTERJEE, Eiji OKI, },
journal={IEICE TRANSACTIONS on Communications},
title={An Optimistic Synchronization Based Optimal Server Selection Scheme for Delay Sensitive Communication Services},
year={2021},
volume={E104-B},
number={10},
pages={1277-1287},
abstract={In distributed processing for communication services, a proper server selection scheme is required to reduce delay by ensuring the event occurrence order. Although a conservative synchronization algorithm (CSA) has been used to achieve this goal, an optimistic synchronization algorithm (OSA) can be feasible for synchronizing distributed systems. In comparison with CSA, which reproduces events in occurrence order before processing applications, OSA can be feasible to realize low delay communication as the processing events arrive sequentially. This paper proposes an optimal server selection scheme that uses OSA for distributed processing systems to minimize end-to-end delay under the condition that maximum status holding time is limited. In other words, the end-to-end delay is minimized based on the allowed rollback time, which is given according to the application designing aspects and availability of computing resources. Numerical results indicate that the proposed scheme reduces the delay compared to the conventional scheme.},
keywords={},
doi={10.1587/transcom.2020EBP3178},
ISSN={1745-1345},
month={October},}
Copy
TY - JOUR
TI - An Optimistic Synchronization Based Optimal Server Selection Scheme for Delay Sensitive Communication Services
T2 - IEICE TRANSACTIONS on Communications
SP - 1277
EP - 1287
AU - Akio KAWABATA
AU - Bijoy Chand CHATTERJEE
AU - Eiji OKI
PY - 2021
DO - 10.1587/transcom.2020EBP3178
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E104-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2021
AB - In distributed processing for communication services, a proper server selection scheme is required to reduce delay by ensuring the event occurrence order. Although a conservative synchronization algorithm (CSA) has been used to achieve this goal, an optimistic synchronization algorithm (OSA) can be feasible for synchronizing distributed systems. In comparison with CSA, which reproduces events in occurrence order before processing applications, OSA can be feasible to realize low delay communication as the processing events arrive sequentially. This paper proposes an optimal server selection scheme that uses OSA for distributed processing systems to minimize end-to-end delay under the condition that maximum status holding time is limited. In other words, the end-to-end delay is minimized based on the allowed rollback time, which is given according to the application designing aspects and availability of computing resources. Numerical results indicate that the proposed scheme reduces the delay compared to the conventional scheme.
ER -
English
