Placement algorithms for hierarchical cooperative caching
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for data placement in arbitrary networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Enabling dynamic content caching for database-driven web sites
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Bandwidth constrained placement in a WAN
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Evaluations of architectural designs and implementation for database-driven web sites
Data & Knowledge Engineering
Coordinated Placement and Replacement for Large-Scale Distributed Caches
IEEE Transactions on Knowledge and Data Engineering
Engineering High Performance Database-Driven E-commerce Web Sites through Dynamic Content Caching
EC-Web 2001 Proceedings of the Second International Conference on Electronic Commerce and Web Technologies
Engineering and hosting adaptive freshness-sensitive web applications on data centers
WWW '03 Proceedings of the 12th international conference on World Wide Web
Transparent Distributed Web Caching
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Freshness-driven adaptive caching for dynamic content web sites
Data & Knowledge Engineering
Replication algorithms for the World-Wide Web
Journal of Systems Architecture: the EUROMICRO Journal
On demand synchronization and load distribution for database grid-based web applications
Data & Knowledge Engineering
Static and adaptive distributed data replication using genetic algorithms
Journal of Parallel and Distributed Computing
Increasing the Performance of CDNs Using Replication and Caching: A Hybrid Approach
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
A traffic engineering approach for placement and selection of network services
IEEE/ACM Transactions on Networking (TON)
Combining replica placement and caching techniques in content distribution networks
Computer Communications
Replicating web contents using a hybrid particle swarm optimization
Information Processing and Management: an International Journal
Distributed and Parallel Databases
A greedy algorithm for capacity-constrained surrogate placement in CDNs
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
Dynamic replication of web servers using rent-a-servers
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
TPOT: translucent proxying of TCP
Computer Communications
Distributed caching with centralized control
Computer Communications
Cache "less for more" in information-centric networks (extended version)
Computer Communications
| Hi-index | 0.00 |
Document publication service over such a large network as the Internet challenges us to harness available server and network resources to meet fast growing demand. In this paper, we show that large-scale dynamic caching can be employed to globally minimize server idle time, and hence maximize the aggregate server throughput of the whole service. To be efficient, scalable and robust, a successful caching mechanism must have three properties: (1) maximize the global throughput of the system, (2) find cache copies without recourse to a directory service, or to a discovery protocol, and (3) be completely distributed in the sense of operating only on the basis of local information. In this paper, we develop a precise definition, which we call tree load-balance (TLB), of what it means for a mechanism to satisfy these three goals. We present an algorithm that computes TLB off-line, and a distributed protocol that induces a load distribution that converges quickly to a TLB one. Both algorithms place cache copies of immutable documents, on the routing tree that connects the cached document's home server to its clients, thus enabling requests to stumble on cache copies en route to the home server.