Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Summary cache: a scalable wide-area Web cache sharing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
RaDaR: a scalable architecture for a global Web hosting service
WWW '99 Proceedings of the eighth international conference on World Wide Web
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
A game theoretic framework for bandwidth allocation and pricing in broadband networks
IEEE/ACM Transactions on Networking (TON)
Resource pricing and the evolution of congestion control
Automatica (Journal of IFAC)
A Distributed Algorithm for Sharing Web Cache Disk Capacity
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
Selfish Grids: Game-Theoretic Modeling and NAS/PSA Benchmark Evaluation
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Dynamic resource allocation for joint grid user and provider optimisation in computational grid
International Journal of Computer Applications in Technology
Computers and Operations Research
Performance evaluation for implementations of a network of proxy caches
Decision Support Systems
A global optimization approach for three layers of computational grid stack
Advances in Engineering Software
EGOIST: overlay routing using selfish neighbor selection
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Utility-based scheduling for grid computing under constraints of energy budget and deadline
Computer Standards & Interfaces
Pricing strategies for differentiated services content delivery networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A mechanism for pricing and resource allocation in peer-to-peer networks
Electronic Commerce Research and Applications
Expert Systems with Applications: An International Journal
Cooperative content replication in networks with autonomous nodes
Computer Communications
Selfish overlay network creation and maintenance
IEEE/ACM Transactions on Networking (TON)
Hi-index | 14.98 |
Abstract--Caches have been used extensively to store the most popular/recent requested data to improve the user latency and reduce the network load. Recently, a more systematic approach to caching has been developed within the framework of Content Delivery Networks (CDN). A CDN is the network of caches, where the caches are geographically distributed and serve user requests on behalf of the subscriber Web sites. Users receive the requested information from the caching servers, which are closer to the users and usually much less loaded than the origin server. The objective is to minimize the user latency by intelligently distributing the content and serving the user requests from the most efficient sites. We realistically model the agents in a CDN with selfish self-maximizing behaviors and define the problem as a noncooperative game. We separate the distribution and routing subproblems and use games to solve each. We show that the subproblems have equilibrium solutions and, if the equilibrium of a subproblem is unique, we achieve the global optimum for that subproblem. We also determine that a unique equilibrium is reached if the content providers are not willing to pay high amounts and the cache sizes are sufficiently small. We noticed that the global system optimum requires the content providers to pay very high amounts, which in practice may prohibit the applicability of the distributed method. Thus, we consider an investment strategy for the content providers, which maximizes the publishers' net benefits and leads to a near-optimum system solution. We also show that the joint distribution and routing game has an equilibrium and demonstrate its performance by numerical examples.