NDLI: Optimal placement of replicas in trees with read, write, and storage costs

Content Provider	IEEE Xplore Digital Library
Author	Kalpakis, K. Dasgupta, K. Wolfson, O.
Copyright Year	1990
Abstract	We consider the problem of placing copies of objects in a tree network in order to minimize the cost of servicing read and write requests to objects when the tree nodes have limited storage and the number of copies permitted is limited. The set of nodes that have a copy of the object is the residence set of the object. A node wishing to read the object will read the object from the closest node in the residence set. A node wishing to update the object will update the copy of the object at all the nodes in the residence set. Updates are propagated over a certain minimum spanning tree. The cost associated with a residence set equals the cost of servicing all the read and write requests and the storage costs for those copies. We describe an O(n/sup 3/p/sup 2/)-time algorithm for finding an optimal residence set of size p for an object in a tree with n nodes, taking into consideration the read, write, and storage costs. Furthermore, we describe a O(n/sup 3/p/sup 2//spl Lambda//sub max//sup 2/)-time algorithm for finding a minimum cost normal p-residence set for an object in a tree, this time also taking into account the load imposed by the nodes of the tree on the nodes in a residence set and their capacity constraints, where /spl Lambda//sub max/ is an upper bound on the capacity of each node of the tree.
Sponsorship	IEEE Computer Society
Starting Page	628
Ending Page	637
Page Count	10
File Size	766463
File Format	PDF
ISSN	10459219
Volume Number	12
Issue Number	6
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2001-06-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Cost function Multiprocessor interconnection networks Tree graphs Intelligent networks Computer Society Upper bound Helium Web sites Information systems Web pages
Content Type	Text
Resource Type	Article
Subject	Signal Processing Computational Theory and Mathematics Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Steiner-optimal data replication in tree networks with storage costs

Optimal placement of replicas in trees with write, and storage costs.

Optimal Placement of Replicas in Trees with Write, and Storage Costs

Toward optimal broadcast in a star graph using multiple spanning trees

Embedding Hamiltonian paths in faulty arrangement graphs with the backtracking method

Generalized algorithm for parallel sorting on product networks

Balanced spanning trees in complete and incomplete star graphs

FTRAID: A Fat-tree Based Parallel Storage Architecture for Very Large Disk Array

Constructing edge-disjoint spanning trees in product networks

Optimal placement of replicas in trees with read, write, and storage costs

Similar Documents

Steiner-optimal data replication in tree networks with storage costs

Optimal placement of replicas in trees with write, and storage costs.

Optimal Placement of Replicas in Trees with Write, and Storage Costs

Toward optimal broadcast in a star graph using multiple spanning trees

Embedding Hamiltonian paths in faulty arrangement graphs with the backtracking method

Generalized algorithm for parallel sorting on product networks

Balanced spanning trees in complete and incomplete star graphs

FTRAID: A Fat-tree Based Parallel Storage Architecture for Very Large Disk Array

Constructing edge-disjoint spanning trees in product networks

Optimal placement of replicas in trees with read, write, and storage costs