Locality-aware request distribution in cluster-based network servers
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
Web caching and replication
Dynamically Selecting Optimal Distribution Strategies for Web Documents
IEEE Transactions on Computers
Globally Distributed Content Delivery
IEEE Internet Computing
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Achieving Scalability in Hierarchical Location Services
COMPSAC '02 Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment
Globule: A Platform for Self-Replicating Web Documents
PROMS 2001 Proceedings of the 6th International Conference on Protocols for Multimedia Systems
Design and Implementation of a User-Centered Content Distribution Network
WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications
Scalable Cooperative Latency Estimation
ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
Replicating Web Applications On-Demand
SCC '04 Proceedings of the 2004 IEEE International Conference on Services Computing
A fragment-based approach for efficiently creating dynamic web content
ACM Transactions on Internet Technology (TOIT)
TCP/IP Illustrated: The Protocols v. 1
TCP/IP Illustrated: The Protocols v. 1
Transport capacity for a catch-up television service
Proceedings of the seventh european conference on European interactive television conference
Hi-index | 0.02 |
Replication in the World-Wide Web covers a wide range of techniques. Often, the redirection of a client browser towards a given replica of a Web page is performed after the client's request has reached the Web server storing the requested page. As an alternative, we propose to perform the redirection as close to the client as possible in a fully distributed and transparent manner. Distributed redirection ensures that we find a replica wherever it is stored and that the closest possible replica is always found first. By exploiting locality, we can keep latency low.