Replica placement in content delivery networks with stochastic demands and M/M/1 servers

Author(s):  
Chenkai Yang ◽  
Liusheng Huang ◽  
Bing Leng ◽  
Hongli Xu ◽  
Xinglong Wang
2006 ◽  
Vol 29 (16) ◽  
pp. 3313-3326 ◽  
Author(s):  
Tim Wauters ◽  
Jan Coppens ◽  
Filip De Turck ◽  
Bart Dhoedt ◽  
Piet Demeester

Author(s):  
Prabir Bhattacharya ◽  
Minzhe Guo

Content delivery is a key technology on the Internet to achieve large scale, low-latency, reliable, and intelligent data delivery. Replica placement (RP) is a key machinery in content delivery systems to achieve efficient and effective content delivery. This work proposes a novel decentralized algorithm for the replica placement in peer-assisted content delivery networks with simultaneous considerations for peer incentives. By applying techniques from the algorithmic mechanism design theory, the authors show the incentive compatibility of the proposed algorithm. Experiments were conducted to validate the properties of the proposed method and comparisons were made with the state-of-the-art RP algorithms.


Sign in / Sign up

Export Citation Format

Share Document