DCD—disk caching disk: a new approach for boosting I/O performance
ISCA '96 Proceedings of the 23rd annual international symposium on Computer architecture
Using name-based mappings to increase hit rates
IEEE/ACM Transactions on Networking (TON)
Replacement policies for a proxy cache
IEEE/ACM Transactions on Networking (TON)
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
Analysis of web caching architectures: hierarchical and distributed caching
IEEE/ACM Transactions on Networking (TON)
UCFS-A Novel User-Space, High Performance, Customized File System for Web Proxy Servers
IEEE Transactions on Computers
On Reliable and Scalable Peer-to-Peer Web Document Sharing
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Application-level document caching in the Internet
SDNE '95 Proceedings of the 2nd International Workshop on Services in Distributed and Networked Environments
A hierarchical internet object cache
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
Reducing the disk I/O of web proxy server caches
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
World Wide Web caching: the application-level view of the Internet
IEEE Communications Magazine
World Wide Web caching: trends and techniques
IEEE Communications Magazine
Web caching and content distribution: a view from the interior
Computer Communications
IEEE Journal on Selected Areas in Communications
Hash routing for collections of shared Web caches
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
With the exponential growth of WWW traffic, web proxy caching becomes a critical technique for Internet web services. Well-organized proxy caching systems with multiple servers can greatly reduce the user perceived latency and decrease the network bandwidth consumption. Thus, many research papers focused on improving web caching performance with the efficient coordination algorithms among multiple servers. Hash based algorithm is the most widely used server coordination mechanism, however, there's still a lot of technical issues need to be addressed. In this paper, we propose a new hash based web caching architecture, Tulip. Tulip aggregates web objects that are likely to be accessed together into object clusters and uses object clusters as the primary access units. Tulip extends the locality-based algorithm in UCFS to hash based web proxy systems and proposes a simple algorithm to reduce the data grouping overhead. It takes into consideration the access speed dispatch between memory and disk and replaces expensive small disk I/O with less large ones. In case a client request cannot be fulfilled by the server in the memory, the system fetches the whole cluster which contains the required object into memory, the future requests for other objects in the same cluster can be satisfied directly from memory and slow disk I/Os are avoided. It also introduces a simple and efficient data dupllication algorithm, few maintenance work need to be done in case of server join/leave or server failure. Along with the local caching strategy, Tulip achieves better fault tolerance and load balance capability with the minimal cost. Our simulation results show Tulip has better performance than previous approaches.