Decentralized Approximation Algorithm for Data Placement Problem in Content Delivery Networks - Technological Innovation for Value Creation Access content directly
Conference Papers Year : 2012

Decentralized Approximation Algorithm for Data Placement Problem in Content Delivery Networks

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 O(log n) in decentralized environment, assuming asynchronous message passing of bounded sizes.
Fichier principal
Vignette du fichier
978-3-642-28255-3_10_Chapter.pdf (4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01365572 , version 1 (13-09-2016)

Licence

Attribution

Identifiers

Cite

Maciej Drwal, Jerzy Józefczyk. Decentralized Approximation Algorithm for Data Placement Problem in Content Delivery Networks. 3rd Doctoral Conference on Computing, Electrical and Industrial Systems (DoCEIS), Feb 2012, Costa de Caparica, Portugal. pp.85-92, ⟨10.1007/978-3-642-28255-3_10⟩. ⟨hal-01365572⟩
35 View
52 Download

Altmetric

Share

Gmail Facebook X LinkedIn More