| Item type |
会議発表論文 / Conference Paper(1) |
| 公開日 |
2024-04-23 |
| タイトル |
|
|
タイトル |
A Distributed Processing Communication Scheme for Real-Time Applications over Wide-Area Networks |
|
言語 |
en |
| 言語 |
|
|
言語 |
eng |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
Delay sensitive service |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
distributed processing |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
middleware |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
optimistic synchronization |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
conservative synchronization |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_5794 |
|
資源タイプ |
conference paper |
| 著者 |
平木, 志虎
Bijoy, Chand Chatterjee
大木,英司
川端,明生
|
| 著者(英） |
Hiragi, Sanetora
Bijoy, Chand Chatterjee
Oki, Eiji
Kawabata, Akio
|
| 抄録 |
|
|
内容記述タイプ |
Abstract |
|
内容記述 |
Low-delay networking and edge computing will enable mission-critical applications to be delivered over widearea networks. We consider this trend to be the realization that all users can share an application space without feeling any distance difference. We propose a distributed processing scheme that keeps the order of event occurrence regardless of the distance between users and an application server. The proposed scheme can be applied to both optimistic synchronization algorithms (OSA) and conservative synchronization algorithms (CSA). In the proposed scheme, arrival events with a delay within a predefined set time (correction time) are sorted in order of occurrence before application processing. We formulate the proposed scheme as an integer linear programming (ILP) problem. The objective function of ILP consists of the number of users excluded from the delay quality, the amount of memory consumed for a rollback in OSA, and the maximum end-to-end delay. The three parts of the objective function are set weight and the sum of parts with weight is minimized. We evaluate the proposed scheme for 1000 users distributed in two types of network models. Numerical results indicate that the proposed scheme reduces memory consumption compared to that of the conventional OSA scheme. The proposed scheme works as CSA in which all events are sorted in the occurrence order if the correction time is set above the delay for the slowest event to arrive at the server. |
|
言語 |
en |
| 書誌情報 |
IEEE Consumer Communications & Networking Conference (CCNC), Las Vegas, NV, 2024
p. 25-30
|
| 出版者 |
|
|
出版者 |
IEEE |
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
23319860 |
| DOI |
|
|
関連タイプ |
isVersionOf |
|
|
識別子タイプ |
DOI |
|
|
関連識別子 |
10.1109/CCNC51664.2024.10454684 |
| 権利 |
|
|
権利情報 |
This is the accepted version of the work. © 2024 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. |
| 関連サイト |
|
|
|
識別子タイプ |
URI |
|
|
関連識別子 |
https://ieeexplore.ieee.org/document/10454684 |
|
|
関連名称 |
IEEExplore |
| 著者版フラグ |
|
|
出版タイプ |
AM |
|
出版タイプResource |
http://purl.org/coar/version/c_ab4af688f83e57aa |
ccnc2024-25.pdf (280 KB)
.png)
