An Optimistic Synchronization Based Optimal Server Selection Scheme for Delay Sensitive Communication Services

• KAWABATA Akio

  NTT Network Technology Laboratories

• CHATTERJEE Bijoy Chand

  South Asian University

• OKI Eiji

  Kyoto University

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.

Journal

• IEICE Transactions on Communications

  IEICE Transactions on Communications E104.B (10), 1277-1287, 2021-10-01

  The Institute of Electronics, Information and Communication Engineers

Keywords

• real-time application
• distributed processing
• edge computing
• optimistic synchronize algorithm
• time warp
• and server selection problem

Details

• CRID: 1390852514694443008
• NII Article ID: 130008095510
• DOI: 10.1587/transcom.2020ebp3178
• ISSN: 17451345
• ISSN: 09168516
• Web Site: https://www.jstage.jst.go.jp/article/transcom/E104.B/10/E104.B_2020EBP3178/_pdf
• Text Lang: en
• Data Source:
  • JaLC
  • Crossref
  • CiNii Articles
  • KAKEN
• Abstract License Flag: Disallowed