TY - JFULL AU - Samee Ullah Khan and C. Ardil PY - 2012/1/ TI - A Frugal Bidding Procedure for Replicating WWW Content T2 - International Journal of Computer and Information Engineering SP - 1780 EP - 1794 VL - 6 SN - 1307-6892 UR - https://publications.waset.org/pdf/15866 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 72, 2012 N2 - Fine-grained data replication over the Internet allows duplication of frequently accessed data objects, as opposed to entire sites, to certain locations so as to improve the performance of largescale content distribution systems. In a distributed system, agents representing their sites try to maximize their own benefit since they are driven by different goals such as to minimize their communication costs, latency, etc. In this paper, we will use game theoretical techniques and in particular auctions to identify a bidding mechanism that encapsulates the selfishness of the agents, while having a controlling hand over them. In essence, the proposed game theory based mechanism is the study of what happens when independent agents act selfishly and how to control them to maximize the overall performance. A bidding mechanism asks how one can design systems so that agents- selfish behavior results in the desired system-wide goals. Experimental results reveal that this mechanism provides excellent solution quality, while maintaining fast execution time. The comparisons are recorded against some well known techniques such as greedy, branch and bound, game theoretical auctions and genetic algorithms. ER -