Title :
A periodic combined-content distribution mechanism in peer-assisted content delivery networks
Author :
Maki, N. ; Shinkuma, Ryoichi ; Mori, Takayoshi ; Kamiyama, Noriaki ; Kawahara, Ryoichi
Author_Institution :
Grad. Sch. of Inf., Kyoto Univ., Kyoto, Japan
Abstract :
The concept of peer-assisted content delivery networks (CDNs) lets other nearby altruistic clients forward requested content files instead of the source servers, which works to localize overall traffic. Our prior work proposed a traffic engineering scheme to localize traffic in peer-assisted CDNs. To induce altruistic clients to download content files that are most likely to contribute to localizing network traffic, this scheme combines the content files and allows them to obtain the combined content file while keeping the price unchanged from the single-content price. Although we have discussed how much traffic only a set of combined content files can theoretically reduce, we can expect further traffic localization by distributing combined content files to multiple altruistic clients. This paper proposes a periodic combined-content distribution mechanism based on our scheme. This mechanism determines when combined content files should be provided by considering the network cache state. Computer simulations confirmed that our new mechanism could double performance.
Keywords :
cache storage; content management; peer-to-peer computing; telecommunication traffic; altruistic clients; content delivery network; content file downloading; network cache state; network traffic localization; peer assisted CDN; periodic combined content distribution mechanism; source server; traffic engineering scheme; Algorithm design and analysis; Approximation algorithms; Communities; Content distribution networks; Optimization; Peer-to-peer computing; Servers; Communication system traffic control; Content distribution networks; Web service;
Conference_Titel :
ITU Kaleidoscope: Building Sustainable Communities (K-2013), 2013 Proceedings of
Conference_Location :
Kyoto
Print_ISBN :
978-1-4673-4676-4