By Topic

A Replica Placement Algorithm in Mobile Grid Environments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xiong Fu ; Coll. of Comput., Nanjing Univ. of Posts & Telecommun., Nanjing ; Ruchuan Wang ; Yang Wang ; Song Deng

With the advent of high bandwidth third-generation mobile networks and other wireless networks, grid computing has migrated from traditional parallel and distributed computing to pervasive and utility computing based on the wireless networks and mobile devices, which results in the emergence of a new computing paradigm named mobile grid. Data replication is widely used in mobile grid environments to reduce access cost and improve data availability. Therefore, replica placement becomes one of important challenges for the replica management in mobile grid environments. This paper addresses the QoS-aware replica placement problem in a tree based mobile grid environments. At the same time this paper proposes a two-step solution for this problem: the first step is a bottom-up dynamic programming approach for placing replicas to satisfy the QoS requirements of mobile users and workload constraint of replicas; then, a binary search based algorithm is used to finish the k replica placement problem in mobile grid environments. Experimental studies show this solution is feasible and efficient for the replica placement problem in mobile grid environments.

Published in:

Embedded Software and Systems, 2009. ICESS '09. International Conference on

Date of Conference:

25-27 May 2009