The Community for Technology Leaders
Database Engineering and Applications Symposium, International (2001)
Grenoble, France
July 16, 2001 to July 18, 2001
ISBN: 0-7695-1140-6
pp: 0285
Konstantinos Kalpakis , University of Maryland at Baltimore County
Koustuv Dasgupta , University of Maryland at Baltimore County
Ouri Wolfson , University of Illinois at Chicago
ABSTRACT
Abstract: We consider the problem of placing copies of objects at multiple locations in a distributed system, whose interconnection network is a tree, in order to minimize the cost of servicing read and write requests to the objects. We assume that the tree nodes have limited storage and the number of copies permitted may be limited. The set of nodes that have a copy of the object, called replica nodes, constitute the replica set of the object. Read requests of a node are serviced from the closest replica node. Write requests of a node are propagated to all the replicas of the object using a minimum cost Steiner tree that includes the writer and all replica nodes. The total cost associated with a replica set equals the cost of servicing all the read and write requests, plus the storage cost at all the replica nodes. We are interested in finding a replica set with minimum total cost, i.e. a Steiner-optimal replica set. Given a tree with n nodes, we provide an O(n6p2)-time algorithm for finding a Steiner-optimal replica set of size p, taking into consideration the read, write, and storage costs. Our algorithm can also find a Steiner-optimal replica set for a tree with n nodes in time O(n8). We also demonstrate that the policy used to propagate write requests to all the replica nodes in the network affects the cost and configuration of the optimal replica set for the object.
INDEX TERMS
CITATION

K. Kalpakis, O. Wolfson and K. Dasgupta, "Steiner-Optimal Data Replication in Tree Networks with Storage Costs," Database Engineering and Applications Symposium, International(IDEAS), Grenoble, France, 2001, pp. 0285.
doi:10.1109/IDEAS.2001.938096
95 ms
(Ver 3.3 (11022016))