Replication routing schedule with minimum update time for distributed database
Yasushi Wakahara · Electronics and Communications in Japan (Part I Communications) · 1999
Distributed databases in general-purpose business software such as groupware widely use a method for simultaneously updating the replicas of other databases owned by each database according to the replication routing schedule. In this paper, a replication routing schedule is discussed in which the time required for updating the replica is the minimum in the distributed database. Specifically, an optimization problem is first formulated for deriving the replication routing schedule with minimum update time. Next, in the cases of even and odd numbers of distributed databases, an algorithm providing a replication routing schedule as an optimum solution is presented in the even case, while a heuristic algorithm providing an approximate solution is shown for the odd case. These algorithms are extremely simple and are practical since the required amount of computational processing is small. © 1998 Scripta Technica, Electron Comm Jpn Pt 1, 82(2): 11–20, 1999