Advertisement
Published in:
2018 | OriginalPaper | Chapter
Jointly Optimizing Replica Placement, Requests Distribution and Server Storage Capacity on Content Distribution Networks
Authors : Raquel Gerhardt, Tiago Neves, Luis Rangel
Published in: Combinatorial Optimization
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
A Content Distribution Network includes dedicated servers creating an architecture that moves the content to servers that are closer to the user, reducing delays and traffic. In this structure several problems are studied, including the Problem of Allocation of Storage Capacity (SCAP) and the Replica Placement and Request Distribution Problem (RPRDP). This work analyzes these problems in an integrated way and proposes the creation of a new problem named Capacities, Replicas and Requests Distribution Problem (CRRDP), which enables the dynamic allocation of disk space on the servers and distribution of replicas and requests. The main contributions of this work are the creation of a new problem and a new formulation which associates variables and restrictions presents in mathematical formulations for this problems. The Mathematical formulation was analyzed and computational results shows that operational costs can be reduced and that it is possible to disable unused servers over the network.