A Real-Time Delay-Sensitive Communication Approach Based on Distributed Processing

Kawabata, Akio; Chatterjee, Bijoy Chand; Ba, Seydou; Oki, Eiji

doi:10.1109/access.2017.2758803

Cited by 21 publications

(33 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Taking this direction, the work in [3] presented a real-time network application based distributed processing communication scheme, which offers interactive services for different users. The application is processed at the distributed servers, each of which is accessed by the nearest user.…”

Section: Introductionmentioning

confidence: 99%

“…To minimize the end-to-end delay, the delay-sensitive communication scheme selects appropriate servers among multiple distributed servers for executing applications. The server selection problem in [3] is an NP-complete problem. The server selection problem in [3] is intractable when the number of participating users becomes large.…”

Section: Introductionmentioning

confidence: 99%

“…The server selection problem in [3] is an NP-complete problem. The server selection problem in [3] is intractable when the number of participating users becomes large. To solve this issue, the work in [5] introduced approximate algorithms, which achieve better scalability compared to the ILP for server selection introduced in [3].…”

Section: Introductionmentioning

confidence: 99%

“…The server selection problem in [3] is intractable when the number of participating users becomes large. To solve this issue, the work in [5] introduced approximate algorithms, which achieve better scalability compared to the ILP for server selection introduced in [3]. When the participating users' domain becomes large, the delay using the approximate algorithms introduced in [5] increases.…”

Section: Introductionmentioning

confidence: 99%

“…This paper aims to circumvent the drawback of the server selection problem introduced in [3] and [5] by pursuing an efficient server selection scheme that is based on the segmentation of participating users' domain. The proposed scheme divides the users' participation domain into a number of regions in order to reduce the computational time for solving the server selection problem.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Participating-Domain Segmentation Based Delay-Sensitive Distributed Server Selection Scheme

2019

Self Cite

View full text Add to dashboard Cite

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 users' 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. INDEX TERMS Real-time application, distributed processing, edge computing, and dividing users' participation domain.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%