Presentation	1997/4/22 Optimal replication routing schedule for distributed database : minimization of replication update time Yasushi WAKAHARA,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	In a distributed database for business software, the replication for each site is often updated according to a predefined routing schedule. The purpose of this paper is to discuss the optimization of the schedule from the viewpoint of minimizing the time required for the complete replication update. The optimization problem is formulated first to minimize the number of required copy steps, which is taken as a measure for the update time. Then, the theoretical analysis is given to derive the lower limit of the steps. Furthermore, some algorithms are proposed to derive the optimum schedule. The proposed algorithms and their replication schedules are characterized by their simplicity and practicability.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	routing / replica / schedule / distributed database / groupware
Paper #	IN97-29,CS97-10,MVE97-10
Date of Issue

Conference Information
Committee	MVE
Conference Date	1997/4/22(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Media Experience and Virtual Environment (MVE)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Optimal replication routing schedule for distributed database : minimization of replication update time
Sub Title (in English)
Keyword(1)	routing
Keyword(2)	replica
Keyword(3)	schedule
Keyword(4)	distributed database
Keyword(5)	groupware
1st Author's Name	Yasushi WAKAHARA
1st Author's Affiliation	R&D Laboratories., Kokusai Denshin Denwa Co., Ltd.()
Date	1997/4/22
Paper #	IN97-29,CS97-10,MVE97-10
Volume (vol)	vol.97
Number (no)	18
Page	pp.pp.-
#Pages	8
Date of Issue