|
Title:
|
SOLVING THE SANTA FE BAR PROBLEM TO REPLICATE DISTRIBUTED DATABASES |
|
Author(s):
|
Călin Ovidiu Cenan , Horea Adrian Greblă |
|
ISBN:
|
972-8924-09-7 |
|
Editors:
|
Nuno Guimarães, Pedro Isaías and Ambrosio Goikoetxea |
|
Year:
|
2006 |
|
Edition:
|
Single |
|
Keywords:
|
Distributed Systems, Database Replication, Games Theory, Q-Learning, |
|
Type:
|
Full Paper |
|
First Page:
|
99 |
|
Last Page:
|
106 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
Modern systems have extended their complexity and administration and design become almost impossible duties. The most frequent performance problems can be identified in database systems and more specifics in distributed ones. The problems of data replication and allocation in distributed database systems are considered. These problems still present a challenge because of the extension of Internet and the growth of distributed systems. Because of the possible wide distribution of such a system the replication problem in a distributed databases is considered by analogy with non-cooperative games. We were considering the Santa Fe bar problem as an instance of the problem to automatically configure the replication process of a distributed database system so that its elements do not work at cross-purposes. We recast the Santa Fe bar problem in a probabilistic framework and derive a simple adaptive strategy that learns Nash equilibrium. We argue that a system designed in accord with this theory performs nearly optimally and in particular avoids the tragedy of the commons for that problem achieving a global goal. |
|
|
|
|
|
|
