Variable-size data item placement for load and storage balancing
Journal of Systems and Software
Document replication and distribution in extensible geographically distributed web servers
Journal of Parallel and Distributed Computing - Scalable web services and architecture
dg.o '05 Proceedings of the 2005 national conference on Digital government research
Approximate Algorithms for Document Placement in Distributed Web Servers
IEEE Transactions on Parallel and Distributed Systems
Online solutions for scalable file server systems
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
System support for scalable, reliable and highly manageable web hosting service
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Comparison and analysis of ten static heuristics-based Internet data replication techniques
Journal of Parallel and Distributed Computing
Online Balancing Two Independent Criteria
NPC '08 Proceedings of the IFIP International Conference on Network and Parallel Computing
Dynamic Data Migration Policies for Query-Intensive Distributed Data Environments
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Distributed and Parallel Databases
Load and storage balanced posting file partitioning for parallel information retrieval
Journal of Systems and Software
Hi-index | 0.00 |
- Narendran, B.; Rangarajan, S.; Yajnik, S. Abstract: Describes the design and analysis of RobustWeb, a scalable and fault-tolerant World Wide Web server cluster that is based on HTTP redirection. The system consists of a set of N back-end document servers and one or more redirection servers which receive the HTTP requests and redirect them to the document servers. A load distribution algorithm is used for initial distribution of the documents on the servers. Given a specific degree of replication k, the distribution algorithm guarantees that at least k replicas of each document are present after document distribution is complete. The redirection servers redirect requests to one of the replicas with a pre-computed redirection probability. When a server fails, the redirection probabilities are recomputed using a novel algorithm based on network flow. Theis enables the load to be approximately balanced among the remaining servers, allowing for graceful degradation of the service in the event of failures. A preliminary prototype of RobustWeb has been implemented.