Distributed algorithms for finding centers and medians in networks
ACM Transactions on Programming Languages and Systems (TOPLAS)
Adaptive File Allocation in Star Computer Network
IEEE Transactions on Software Engineering - Special issue on COMPSAC 1982 and 1983
Transaction commitment at minimal communication cost
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Distributed process groups in the V Kernel
ACM Transactions on Computer Systems (TOCS)
An algorithm for distributed computation of a spanningtree in an extended LAN
SIGCOMM '85 Proceedings of the ninth symposium on Data communications
Host groups: a multicast extension for datagram internetworks
SIGCOMM '85 Proceedings of the ninth symposium on Data communications
Optimal allocation of resources in distributed information networks
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Database Location in Computer Networks
Journal of the ACM (JACM)
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Optimal program and data locations in computer networks
Communications of the ACM
Reverse path forwarding of broadcast packets
Communications of the ACM
Multicast Routing in Internetworks and Extended LANs
Multicast Routing in Internetworks and Extended LANs
Broadcast protocols in packet switched computer networks.
Broadcast protocols in packet switched computer networks.
Distributed algorithms for dynamic replication of data
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Data replication for mobile computers
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
Delay-Optimal Quorum Consensus for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Minimization of Communication Cost Through Caching in Mobile Environments
IEEE Transactions on Parallel and Distributed Systems
Competitive Analysis of Caching in Distributed Databases
IEEE Transactions on Parallel and Distributed Systems
Data replication for external searching in static tree structures
Proceedings of the ninth international conference on Information and knowledge management
Approximation algorithms for data management in networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs
IEEE Transactions on Parallel and Distributed Systems
Optimal replication algorithms for hierarchical mobility management in PCS networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal Allocation for Partially Replicated Database Systems on Ring Networks
IEEE Transactions on Knowledge and Data Engineering
Allocating Data and Operations to Nodes in Distributed Database Design
IEEE Transactions on Knowledge and Data Engineering
Flow Control for Limited Buffer Multicast
IEEE Transactions on Software Engineering
Optimizing Index Allocation for Sequential Data Broadcasting in Wireless Mobile Computing
IEEE Transactions on Knowledge and Data Engineering
Budget Constrained Minimum Cost Connected Medians
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Service-constrained network design problems
Nordic Journal of Computing
Replica allocation methods in ad hoc networks with data update
Mobile Networks and Applications
The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy
Distributed Computing
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
Coordinated enroute multimedia object caching in transcoding proxies for tree networks
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Optimal methods for coordinated enroute web caching for tree networks
ACM Transactions on Internet Technology (TOIT)
QoS-Aware Replica Placement for Content Distribution
IEEE Transactions on Parallel and Distributed Systems
Efficient algorithms for a constrained k-tree core problem in a tree network
Journal of Algorithms
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
Analysis of Replica Placement under Expiration-Based Consistency Management
IEEE Transactions on Parallel and Distributed Systems
Data Replication for Improving Data Accessibility in Ad Hoc Networks
IEEE Transactions on Mobile Computing
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
Multimedia Object Placement for Transparent Data Replication
IEEE Transactions on Parallel and Distributed Systems
Optimal Replica Placement under TTL-Based Consistency
IEEE Transactions on Parallel and Distributed Systems
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
An algorithm for dynamic data allocation in distributed systems
Information Processing Letters
Efficient algorithms for a constrained k-tree core problem in a tree network
Journal of Algorithms
Data replication at web proxies in content distribution network
APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications
Optimizing server placement in distributed systems in the presence of competition
Journal of Parallel and Distributed Computing
Journal of Systems and Software
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
A dynamic replica management strategy in data grid
Journal of Network and Computer Applications
Managing large dynamic graphs efficiently
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Database placement in communication networks for minimizing the overall transmission cost
Mathematical and Computer Modelling: An International Journal
QoS-aware replica placement for grid computing
Concurrency and Computation: Practice & Experience
| Hi-index | 0.00 |
In this paper we consider the communication complexity of maintaining the replicas of a logical data-item, in a database distributed over a computer network. We propose a new method, called the minimum spanning tree write, by which a processor in the network should multicast a write of a logical data-item, to all the processors that store replicas of the items. Then we show that the minimum spanning tree write is optimal from the communication cost point of view. We also demonstate that the method by which a write is multicast to all the replicas of a data-item affects the optimal replication scheme of the item, i.e., at which processors in the network the replicas should be located. Therefore, next we consider the problem of determining an optimal replicaiton scheme for a data item, assuming that each processor employs the minimum spanning tree write at run-time. The problem for general networks is shown NP-Complete, but we provide efficient algorithms to obtain an optimal allocation scheme for three common types of network topologies. They are completely-connected, tree, and ring networks. For these topologies, efficient algorithms are also provided for the case in which reliability considerations dictate a minimum number of replicas.