By Topic

Application of game theory and fictitious play in data placement

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

2 Author(s)
Indrayanto, A. ; Sch. of Comput. Sci., Univ. Sains Malaysia, Minden ; Huah Yong Chan

Data allocation comprises data placement or migration into or between the data servers in a distributed data sharing system. In the process of data placement, static equations would mostly select only the best data servers. This would overload some of the data servers. An algorithm for optimizing file-placement in data grid environment (DGE) is presented. The algorithm adapts game theory and fictitious play to provide a mechanism for load balancing. The algorithm considers the overall placement behaviours and dependencies. A discreet-time based simulator has been developed to test proposed algorithm. Initial simulation result showed that game theory and fictitious play can improve the overall performance of the system.

Published in:

Distributed Framework and Applications, 2008. DFmA 2008. First International Conference on

Date of Conference:

21-22 Oct. 2008