Introduction to algorithms
The multicast policy and its relationship to replicated data placement
ACM Transactions on Database Systems (TODS)
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Database Location in Computer Networks
Journal of the ACM (JACM)
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Decentralized Resource Management for a Distributed Continuous Media Server
IEEE Transactions on Parallel and Distributed Systems
Decentralized Resource Management for a Distributed Continuous Media Server
IEEE Transactions on Parallel and Distributed Systems
On the Optimal Placement of Secure Data Objects over Internet
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Network file storage with graceful performance degradation
ACM Transactions on Storage (TOS)
On Optimal Replication of Data Object at Hierarchical and Transparent Web Proxies
IEEE Transactions on Parallel and Distributed Systems
QoS-Aware Replica Placement for Content Distribution
IEEE Transactions on Parallel and Distributed Systems
An object replication algorithm for real-time distributed databases
Distributed and Parallel Databases
Optimal Placement of Replicas in Data Grid Environments with Locality Assurance
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
IEEE Transactions on Parallel and Distributed Systems
Distributed Selfish Replication
IEEE Transactions on Parallel and Distributed Systems
A new service overlays dimensioning approach based on stochastic geometry
Performance Evaluation
Adaptive data placement for wide-area sensing services
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
Optimal Replica Placement under TTL-Based Consistency
IEEE Transactions on Parallel and Distributed Systems
Design and analysis of an adaptive object replication algorithm in distributed network systems
Computer Communications
Optimal replica placement in hierarchical Data Grids with locality assurance
Journal of Parallel and Distributed Computing
A QoS-Aware Heuristic Algorithm for Replica Placement
GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
QoS-aware, access-efficient, and storage-efficient replica placement in grid environments
The Journal of Supercomputing
Comparison of Access Policies for Replica Placement in Tree Networks
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Reliable Communication Infrastructure for Adaptive Data Replication
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Self-organized service placement in ambient intelligence environments
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Replicating web contents using a hybrid particle swarm optimization
Information Processing and Management: an International Journal
Server placement in the presence of competition
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
Data replication at web proxies in content distribution network
APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications
Distributed and Parallel Databases
Optimizing server placement in distributed systems in the presence of competition
Journal of Parallel and Distributed Computing
Globe'11 Proceedings of the 4th international conference on Data management in grid and peer-to-peer systems
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
A cost-optimized detection system location scheme for DDoS attack
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
QoS-aware replica placement for grid computing
Concurrency and Computation: Practice & Experience
International Journal of Grid and Utility Computing
Hi-index | 0.00 |
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 a $O(n^3 p^2) \hbox {-} {\rm 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^3 p^2 \Lambda_{\max}^2) \hbox {-} {\rm 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 $\Lambda_{\rm max}$ is an upper bound on the capacity of each node of the tree.