Rotating Escalators upon Deletions for Improving Online Bicriteria Load Balancing

Abstract

We study the online load balancing problem for two independent criteria upon deletion in this paper. For convenience, we choose a system of distributed homogeneous file servers located in a cluster as the scenario, and propose a solution for balancing their loads and required storage spaces for any sequence of document placements and deletions. The upper bounds of load and storage space are extremely close to the best existing online result for sole placements which do not allow reallocation and replication.