Decentralized Approximation Algorithm for Data Placement Problem in Content Delivery NetworksReport as inadecuate




Decentralized Approximation Algorithm for Data Placement Problem in Content Delivery Networks - Download this document for free, or read online. Document in PDF available to download.

1 Wroclaw University of Technology

Abstract : Recent advancements in Internet technology research, as well as the widespread of commercial content delivery networks, motivates the need for optimization algorithms designed to work in decentralized manner. In this paper we formulate data placement problem, a special case of universal facility location problem with quadratic terms in objective function. The considered combinatorial optimization problem is NP-hard. A randomized algorithm is presented that approximates the solution within factor Olog n in decentralized environment, assuming asynchronous message passing of bounded sizes.

Keywords : computer networks facility location randomized rounding





Author: Maciej Drwal - Jerzy Józefczyk -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents