Interactivity-constrained server provisioning in large-scale distributed virtual environments

Duong, Nguyen Binh Ta and Nguyen, Thang and Zhou, Suiping and Tang, Xueyan and Cai, Wentong and Ayani, R. (2012) Interactivity-constrained server provisioning in large-scale distributed virtual environments. IEEE Transactions on Parallel and Distributed Systems, 23 (2). pp. 304-312. ISSN 1045-9219

Full text is not in this repository.

This item is available in: Library Catalogue

Abstract

Maintaining interactivity is one of the key challenges in distributed virtual environments (DVEs). In this paper, we consider a new problem, termed the interactivity-constrained server provisioning problem, whose goal is to minimize the number of distributed servers needed to achieve a prespecified level of interactivity. We identify and formulate two variants of this new problem and show that they are both NP-hard via reductions to the set covering problem. We then propose several computationally efficient approximation algorithms for solving the problem. The main algorithms exploit dependencies among distributed servers to make provisioning decisions. We conduct extensive experiments to evaluate the performance of the proposed algorithms. Specifically, we use both static Internet latency data available from prior measurements and topology generators, as well as the most recent, dynamic latency data collected via our own large-scale deployment of a DVE performance monitoring system over PlanetLab. The results show that the newly proposed algorithms that take into account interserver dependencies significantly outperform the well-established set covering algorithm for both problem variants.

Item Type: Article
Research Areas: A. > School of Science and Technology > Computer Science
Item ID: 12069
Useful Links:
Depositing User: Users 3197 not found.
Date Deposited: 26 Sep 2013 15:31
Last Modified: 13 Oct 2016 14:28
URI: http://eprints.mdx.ac.uk/id/eprint/12069

Actions (login required)

Edit Item Edit Item