Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Efficient LRU-Based Buffering in a LAN Remote Caching Architecture
IEEE Transactions on Parallel and Distributed Systems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Placement algorithms for hierarchical cooperative caching
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Approximation algorithms for data placement in arbitrary networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs
IEEE Transactions on Parallel and Distributed Systems
Replication Algorithms in a Remote Caching Architecture
IEEE Transactions on Parallel and Distributed Systems
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology
HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking
Market-Based Resource Allocation for Content Delivery in the Internet
IEEE Transactions on Computers
An overview of DNS-based server selections in content distribution networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Joint object placement and node dimensioning for internet content distribution
Information Processing Letters
Selfish caching in distributed systems: a game-theoretic analysis
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Comparing economic incentives in peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Internet economics: Pricing and policies
Informed content delivery across adaptive overlay networks
IEEE/ACM Transactions on Networking (TON)
Static and adaptive distributed data replication using genetic algorithms
Journal of Parallel and Distributed Computing
On the optimization of storage capacity allocation for content distribution
Computer Networks: The International Journal of Computer and Telecommunications Networking
Object replication strategies in content distribution networks
Computer Communications
IEEE Journal on Selected Areas in Communications
Constrained mirror placement on the Internet
IEEE Journal on Selected Areas in Communications
Traffic analysis of a Web proxy caching hierarchy
IEEE Network: The Magazine of Global Internetworking
A Distributed Algorithm for Sharing Web Cache Disk Capacity
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
A survey of autonomic communications
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Mistreatment-resilient distributed caching
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Parallel and Distributed Systems
ECHOS: edge capacity hosting overlays of nano data centers
ACM SIGCOMM Computer Communication Review
Formal Model and Scheduling Heuristics for the Replica Migration Problem
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Modeling replication strategies in data grid systems with arbitrary clustered demands
Proceedings of the 3rd international conference on Scalable information systems
Cooperation in Multiorganization Matching
Approximation and Online Algorithms
On the social cost of distributed selfish content replication
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Cooperative replication in content networks with nodes under churn
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Distributed and Parallel Databases
Selfish content replication on graphs
Proceedings of the 23rd International Teletraffic Congress
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
A feedback control approach to mitigating mistreatment in distributed caching groups
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Cooperative content replication in networks with autonomous nodes
Computer Communications
Cache me if you can: capacitated selfish replication games
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Accelerating Web Service Workflow Execution via Intelligent Allocation of Services to Servers
Journal of Database Management
| Hi-index | 0.00 |
A commonly employed abstraction for studying the object placement problem for the purpose of Internet content distribution is that of a distributed replication group. In this work, the initial model of the distributed replication group of Leff et al. [CHECK END OF SENTENCE] is extended to the case that individual nodes act selfishly, i.e., cater to the optimization of their individual local utilities. Our main contribution is the derivation of equilibrium object placement strategies that 1) can guarantee improved local utilities for all nodes concurrently as compared to the corresponding local utilities under greedy local object placement, 2) do not suffer from potential mistreatment problems, inherent to centralized strategies that aim at optimizing the social utility, and 3) do not require the existence of complete information at all nodes. We develop a baseline computationally efficient algorithm for obtaining the aforementioned equilibrium strategies and then extend it to improve its performance with respect to fairness. Both algorithms are realizable, in practice, through a distributed protocol that requires only a limited exchange of information.