.png){kind=icon}
.png){kind=icon}
Return
Participating-Domain Segmentation Based Delay-Sensitive Distributed Server Selection Scheme
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2897986.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a participating-domain segmentation based server selection scheme in a delay-sensitive distributed communication approach to reducing the computational time for solving the server selection problem. The proposed scheme divides the user's participation domain into a number of regions. The delay between a region and a server is a function of locations of the region and the server. The length between the region and the server is considered based on conservative approximation. The location of the region is determined regardless of the number of users and their participation location. The proposed scheme includes two phases. The first phase uses the server finding process and determines the number of users that are accommodated from each region by each server, instead of actual server selection, to reduce the computational complexity. The second phase uses the delay improvement process and determines the overall delay and the selected server for each user. We formulate an integer linear programming problem for the server selection in the proposed scheme and evaluate the performance in terms of computation time and delay. The numerical results indicate that the computational time using the proposed scheme is smaller than that of the conventional scheme, and the effectiveness of the proposed scheme enhances as the number of users increases.
Keywords:
Real-time application
distributed processing
edge computing
dividing user's participation domain
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W