Amortized efficiency of list update and paging rules
Communications of the ACM
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
A two-phase approach to predictably scheduling real-time transactions
Performance of concurrency control mechanisms in centralized database 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
Principles of distributed database systems (2nd ed.)
Principles of distributed database systems (2nd ed.)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Implementing atomic actions on decentralized data
ACM Transactions on Computer Systems (TOCS)
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs
IEEE Transactions on Parallel and Distributed Systems
Data Management for Mobile Computing
Data Management for Mobile Computing
Distributed Systems for System Architects
Distributed Systems for System Architects
A Competitive Dynamic Data Replication Algorithm
Proceedings of the Ninth International Conference on Data Engineering
Page Migration with Limited Local Memory Capacity
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
A Dynamic Object Replication and Migration Protocol for an Internet Hosting Service
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Object Management in Distributed Database Systems for Stationary and Mobile Computing Environments: A Competitive Approach (Network Theory and Applications)
Content and service replication strategies in multi-hop wireless mesh networks
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
QoS-Aware Replica Placement for Content Distribution
IEEE Transactions on Parallel and Distributed Systems
Distributed Systems: Principles and Paradigms (2nd Edition)
Distributed Systems: Principles and Paradigms (2nd Edition)
CLEAR: an efficient context and location-based dynamic replication scheme for mobile-p2p networks
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Object replication strategies in content distribution networks
Computer Communications
| Hi-index | 0.24 |
In this paper, we propose an adaptive object replication algorithm for distributed network systems, analyze its performance from both theoretical and experimental standpoints. We first present a mathematical cost model that considers all the costs associated with servicing a request, i.e., I/O cost, control-message transferring cost, and data-message transferring cost. Using this cost model, we develop an adaptive object replication algorithm, referred to as Adaptive Distributed Request Window (ADRW) algorithm. Our objective is to dynamically adjust the allocation schemes of objects based on the decision of ADRW algorithm, i.e., whether the system is read-intensive or write-intensive, so as to minimize the total servicing cost of the arriving requests. Competitive analysis is carried out to study the performance of ADRW algorithm theoretically. We then implement our proposed algorithm in a PC based network system. The experimental results convincingly demonstrate that ADRW algorithm is adaptive and is superior to several related algorithms in the literature in terms of the average request servicing cost.