On the Availability of Replicated Contents in the Web with Server Capacity Constraints

摘要

This study considers the problem of locating proxies in the Web in order to maximize object availability. A read one/write-all protocol is used and a placement based on the Dynamic Progamming (DP) technique is presented. The study then analyses the availability of the resulting replicated system as a function of the read write ratio for uniform and non-uniform client request patterns.