IEICE TRANSACTIONS on Communications
Open Access
Participating-Domain Segmentation Based Server Selection Scheme for Real-Time Interactive Communication
-
Full Text Views
48
- Cite this
- Free PDF (2MB)
Summary :
This paper proposes an efficient server selection scheme in successive participation scenario with participating-domain segmentation. The scheme is utilized by distributed processing systems for real-time interactive communication to suppress the communication latency of a wide-area network. In the proposed scheme, users participate for server selection one after another. The proposed scheme determines a recommended server, and a new user selects the recommended server first. Before each user participates, the recommended servers are determined assuming that users exist in the considered regions. A recommended server is determined for each divided region to minimize the latency. The new user selects the recommended available server, where the user is located. We formulate an integer linear programming problem to determine the recommended servers. Numerical results indicate that, at the cost additional computation, the proposed scheme offers smaller latency than the conventional scheme. We investigate different policies to divide the users' participation for the recommended server finding process in the proposed scheme.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E103-B No.7 pp.736-747
- Publication Date
- 2020/07/01
- Publicized
- 2020/01/17
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.2019EBP3195
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Akio KAWABATA
the NTT Network Service Systems 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, "Participating-Domain Segmentation Based Server Selection Scheme for Real-Time Interactive Communication" in IEICE TRANSACTIONS on Communications,
vol. E103-B, no. 7, pp. 736-747, July 2020, doi: 10.1587/transcom.2019EBP3195.
Abstract: This paper proposes an efficient server selection scheme in successive participation scenario with participating-domain segmentation. The scheme is utilized by distributed processing systems for real-time interactive communication to suppress the communication latency of a wide-area network. In the proposed scheme, users participate for server selection one after another. The proposed scheme determines a recommended server, and a new user selects the recommended server first. Before each user participates, the recommended servers are determined assuming that users exist in the considered regions. A recommended server is determined for each divided region to minimize the latency. The new user selects the recommended available server, where the user is located. We formulate an integer linear programming problem to determine the recommended servers. Numerical results indicate that, at the cost additional computation, the proposed scheme offers smaller latency than the conventional scheme. We investigate different policies to divide the users' participation for the recommended server finding process in the proposed scheme.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2019EBP3195/_p
Copy
@ARTICLE{e103-b_7_736,
author={Akio KAWABATA, Bijoy CHAND CHATTERJEE, Eiji OKI, },
journal={IEICE TRANSACTIONS on Communications},
title={Participating-Domain Segmentation Based Server Selection Scheme for Real-Time Interactive Communication},
year={2020},
volume={E103-B},
number={7},
pages={736-747},
abstract={This paper proposes an efficient server selection scheme in successive participation scenario with participating-domain segmentation. The scheme is utilized by distributed processing systems for real-time interactive communication to suppress the communication latency of a wide-area network. In the proposed scheme, users participate for server selection one after another. The proposed scheme determines a recommended server, and a new user selects the recommended server first. Before each user participates, the recommended servers are determined assuming that users exist in the considered regions. A recommended server is determined for each divided region to minimize the latency. The new user selects the recommended available server, where the user is located. We formulate an integer linear programming problem to determine the recommended servers. Numerical results indicate that, at the cost additional computation, the proposed scheme offers smaller latency than the conventional scheme. We investigate different policies to divide the users' participation for the recommended server finding process in the proposed scheme.},
keywords={},
doi={10.1587/transcom.2019EBP3195},
ISSN={1745-1345},
month={July},}
Copy
TY - JOUR
TI - Participating-Domain Segmentation Based Server Selection Scheme for Real-Time Interactive Communication
T2 - IEICE TRANSACTIONS on Communications
SP - 736
EP - 747
AU - Akio KAWABATA
AU - Bijoy CHAND CHATTERJEE
AU - Eiji OKI
PY - 2020
DO - 10.1587/transcom.2019EBP3195
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E103-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2020
AB - This paper proposes an efficient server selection scheme in successive participation scenario with participating-domain segmentation. The scheme is utilized by distributed processing systems for real-time interactive communication to suppress the communication latency of a wide-area network. In the proposed scheme, users participate for server selection one after another. The proposed scheme determines a recommended server, and a new user selects the recommended server first. Before each user participates, the recommended servers are determined assuming that users exist in the considered regions. A recommended server is determined for each divided region to minimize the latency. The new user selects the recommended available server, where the user is located. We formulate an integer linear programming problem to determine the recommended servers. Numerical results indicate that, at the cost additional computation, the proposed scheme offers smaller latency than the conventional scheme. We investigate different policies to divide the users' participation for the recommended server finding process in the proposed scheme.
ER -
English
