| | |
Summary: INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE 2004
1
Abstract--This paper addresses the problem of fine-grained data
replication on a set of Internet sites using the N+1st
price auction.
Specifically, we present an adaptive auction mechanism for
replication of objects in a distributed system. The mechanism is
adaptive in the sense that it changes the replica schema of the objects
by continuously moving the schema towards an optimal one, while
ensuring object concurrency control. The mechanism is
experimentally evaluated against three well-known techniques from
the literature: greedy, branch and bound, and genetic algorithms. The
experimental results reveal that the proposed approach outperforms
the three techniques in both the execution time and solution quality.
Keywords--Data replication, auctions, static allocation, pricing.
I. INTRODUCTION
INE-GRAINED (object based) replica schemas determine
how many replicas of each objects are created, and to
which sites they are assigned. These schemas critically
affect the performance of the distributed computing system
|
