A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems
IEEE Transactions on Computers
Semi-Distributed Load Balancing for Massively Parallel Multicomputer Systems
IEEE Transactions on Software Engineering
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
IEEE/ACM Transactions on Networking (TON)
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Analysis of a local search heuristic for facility location problems
Journal of Algorithms
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
Bandwidth constrained placement in a WAN
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
On the origin of power laws in Internet topologies
ACM SIGCOMM Computer Communication Review
File allocation in distributed systems
SIGMETRICS '76 Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
Data Distribution Algorithms For Load Balanced Fault-Tolerant Web Access
SRDS '97 Proceedings of the 16th Symposium on Reliable Distributed Systems
WebWave: Globally Load Balanced Fully Distributed Caching of Hot Published Documents
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
GLADE: A Framework for Building Large Object-Oriented Real-Time Distributed Systems
ISORC '00 Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
An Overview of Data Replication on the Internet
ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks
The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy
Distributed Computing
Towards capturing representative AS-level Internet topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Selfish caching in distributed systems: a game-theoretic analysis
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Static and adaptive distributed data replication using genetic algorithms
Journal of Parallel and Distributed Computing
A Powerful Direct Mechanism for Optimal WWW Content Replication
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Approximation techniques for utilitarian mechanism design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
RAMM: A Game Theoretical Replica Allocation and Management Mechanism
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
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
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Distributed Selfish Replication
IEEE Transactions on Parallel and Distributed Systems
Optimal File Allocation in a Multiple Computer System
IEEE Transactions on Computers
Computers and Operations Research
DADC '08 Proceedings of the 2008 international workshop on Data-aware distributed computing
A cooperative game theoretical replica placement technique
ICPADS '07 Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01
Allocation of copies of a file in an information network
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Topology-informed Internet replica placement
Computer Communications
Minimizing roundtrip response time in distributed databases with vertical fragmentation
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
Data object replication onto distributed servers can potentially alleviate bottlenecks, reduce network traffic, increase scalability, add robustness, and decrease user perceived access time. The decision of selecting data object and server pairs requires solving a constraint optimization problem that in general is NP-complete. In this paper, we abstract the distributed database system as an agent-based model, wherein agents continuously compete for allocation and reallocation of data objects. Each agent aims to replicate objects onto its server such that the communication cost is minimized. However, these agents do not have a global view of the system. Thereby, the optimization process becomes highly localized. Such localized optimization may severely affect the overall system performance. To cope with such localized optimization, we propose a "semi-distributed" axiomatic game theoretical mechanism. The mechanism's control is unique in its decision making process, wherein all the heavy processing is done on the servers of the distributed system and the central body is only required to take a binary decision: (0) not to replicate or (1) to replicate. The cost model used by the agents in the mechanism for the purpose of identifying beneficial data objects is tailored made so that even though the agents take decisions based on their local knowledge domain, the effect is translated into a system-wide performance enhancement. The proposed mechanism is extensively compared against seven well-known conventional and three game theoretical replica allocation methods, namely, branch and bound, greedy, genetic, data-aware replication, tree inspired bottom-up procedure, tree inspired min-max procedure, Benders' decomposition based procedure, game theoretical English auction, game theoretical Dutch auction, and game theoretical selfish replication procedure. The experimental setup incorporates GT-ITM, Inet network topology generators, Soccer World Cup 1998 access logs, and NASA Kennedy Space Center access logs to closely mimic the Web in its infrastructure and user access patterns. The experimental results reveal that the proposed technique despite its non-cooperative nature improves the solution quality and reduces the execution time compared to other techniques.