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.


Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here


PROJECT TITLE : Joint Routing and Resource Allocation for Delay Minimization in Cognitive Radio Based Mesh Networks - 2014 ABSTRACT: This paper studies the joint design of routing and resource allocation algorithms in cognitive
PROJECT TITLE : Efficient Data Collection for Large-Scale Mobile Monitoring Applications - 2014 ABSTRACT: Radio frequency identification (RFID) and wireless sensor networks (WSNs) have been popular in the industrial field,
PROJECT TITLE : Distributed Mobile Sink Routing for Wireless Sensor Networks A Survey - 2014 ABSTRACT: The concentration of data traffic towards the sink in a wireless sensor network causes the nearby nodes to deplete their
PROJECT TITLE :Power Allocation for Statistical QoS Provisioning in Opportunistic Multi-Relay DF Cognitive Networks - 2013ABSTRACT:In this letter, we propose a power allocation scheme for statistical quality-of-service (QoS) provisioning
PROJECT TITLE :Distributed Processing of Probabilistic Top-k Queries in Wireless Sensor Networks - 2013ABSTRACT:In this paper, we introduce the notion of sufficient set and necessary set for distributed processing of probabilistic

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry