Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Decentralized Approximation Algorithm for Data Placement Problem in Content Delivery Networks
verfasst von : Maciej Drwal, Jerzy Józefczyk
Erschienen in: Technological Innovation for Value Creation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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
O
(log
n
) in decentralized environment, assuming asynchronous message passing of bounded sizes.