The Server Provisioning Problem for Continuous Distributed Interactive Applications

In this paper, we study the server provisioning problem for continuous Distributed Interactive Applications (DIAs) whose application states not only change because of the operations performed by participants, but also evolve along with the passing of time. We focus on finding the locations of server...

Full description

Saved in:
Bibliographic Details
Main Authors: Zheng, Hanying, Tang, Xueyan
Other Authors: School of Computer Science and Engineering
Format: Article
Language:English
Published: 2017
Subjects:
Online Access:https://hdl.handle.net/10356/82194
http://hdl.handle.net/10220/43500
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-82194
record_format dspace
spelling sg-ntu-dr.10356-821942020-03-07T11:48:57Z The Server Provisioning Problem for Continuous Distributed Interactive Applications Zheng, Hanying Tang, Xueyan School of Computer Science and Engineering Distributed interactive application Server placement In this paper, we study the server provisioning problem for continuous Distributed Interactive Applications (DIAs) whose application states not only change because of the operations performed by participants, but also evolve along with the passing of time. We focus on finding the locations of servers for hosting continuous DIAs, with the goals of optimizing the interactivity performance while fulfilling the consistency and fairness requirements. We show that the server provisioning problem is challenging by presenting its NP-hardness and non-approximability results under several conditions. We propose two efficient server placement algorithms and analyze their approximation ratios. The approximation ratio of the proposed M-BETTER algorithm is quite close to a lower bound for any polynomial-time algorithm. We also conduct experimental evaluations to compare the proposed algorithms with several baseline server placements. MOE (Min. of Education, S’pore) Accepted version 2017-07-31T05:17:36Z 2019-12-06T14:48:21Z 2017-07-31T05:17:36Z 2019-12-06T14:48:21Z 2015 Journal Article Zheng, H., & Tang, X. (2016). The Server Provisioning Problem for Continuous Distributed Interactive Applications. IEEE Transactions on Parallel and Distributed Systems, 27(1), 271-285. 1045-9219 https://hdl.handle.net/10356/82194 http://hdl.handle.net/10220/43500 10.1109/TPDS.2015.2388473 en IEEE Transactions on Parallel and Distributed Systems © 2015 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. The published version is available at: [http://dx.doi.org/10.1109/TPDS.2015.2388473]. 14 p. application/pdf
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic Distributed interactive application
Server placement
spellingShingle Distributed interactive application
Server placement
Zheng, Hanying
Tang, Xueyan
The Server Provisioning Problem for Continuous Distributed Interactive Applications
description In this paper, we study the server provisioning problem for continuous Distributed Interactive Applications (DIAs) whose application states not only change because of the operations performed by participants, but also evolve along with the passing of time. We focus on finding the locations of servers for hosting continuous DIAs, with the goals of optimizing the interactivity performance while fulfilling the consistency and fairness requirements. We show that the server provisioning problem is challenging by presenting its NP-hardness and non-approximability results under several conditions. We propose two efficient server placement algorithms and analyze their approximation ratios. The approximation ratio of the proposed M-BETTER algorithm is quite close to a lower bound for any polynomial-time algorithm. We also conduct experimental evaluations to compare the proposed algorithms with several baseline server placements.
author2 School of Computer Science and Engineering
author_facet School of Computer Science and Engineering
Zheng, Hanying
Tang, Xueyan
format Article
author Zheng, Hanying
Tang, Xueyan
author_sort Zheng, Hanying
title The Server Provisioning Problem for Continuous Distributed Interactive Applications
title_short The Server Provisioning Problem for Continuous Distributed Interactive Applications
title_full The Server Provisioning Problem for Continuous Distributed Interactive Applications
title_fullStr The Server Provisioning Problem for Continuous Distributed Interactive Applications
title_full_unstemmed The Server Provisioning Problem for Continuous Distributed Interactive Applications
title_sort server provisioning problem for continuous distributed interactive applications
publishDate 2017
url https://hdl.handle.net/10356/82194
http://hdl.handle.net/10220/43500
_version_ 1681043570181537792