TY - JOUR
T1 - An approximated selection algorithm for combinations of content with virtual local server for traffic localization in peer-assisted content delivery networks
AU - Maki, Naoya
AU - Shinkuma, Ryoichi
AU - Takahashi, Tatsuro
PY - 2013/12
Y1 - 2013/12
N2 - Our prior papers proposed a traffic engineering scheme to further localize traffic in peer-assisted content delivery networks (CDNs). This scheme periodically combines the content files and allows them to obtain the combined content files while keeping the price unchanged from the single-content price in order to induce altruistic clients to download content files that are most likely to contribute to localizing network traffic. However, the selection algorithm in our prior work determined which and when content files should be combined according to the cache states of all clients, which is a kind of unrealistic assumption in terms of computational complexity. This paper proposes a new concept of virtual local server to re-duce the computational complexity. We could say that the source server in our mechanism has a virtual caching network inside that reflects the cache states of all clients in the 'actual' caching network and combines content files based on the virtual caching network. In this paper, without determin-ing virtual caching network according to the cache states of all clients, we approximately estimated the virtual caching network from the cache states of the virtual local server of the local domain, which is the aggregated cache state of only altruistic clients in a local domain. Furthermore, we proposed a content selection algorithm based on a virtual caching network. In this paper, we used news life-cycle model as a content model that had the severe changes in cache states, which was a striking instance of dynamic content models. Computer simulations confirmed that our proposed algorithm suc-cessfully localized network traffic.
AB - Our prior papers proposed a traffic engineering scheme to further localize traffic in peer-assisted content delivery networks (CDNs). This scheme periodically combines the content files and allows them to obtain the combined content files while keeping the price unchanged from the single-content price in order to induce altruistic clients to download content files that are most likely to contribute to localizing network traffic. However, the selection algorithm in our prior work determined which and when content files should be combined according to the cache states of all clients, which is a kind of unrealistic assumption in terms of computational complexity. This paper proposes a new concept of virtual local server to re-duce the computational complexity. We could say that the source server in our mechanism has a virtual caching network inside that reflects the cache states of all clients in the 'actual' caching network and combines content files based on the virtual caching network. In this paper, without determin-ing virtual caching network according to the cache states of all clients, we approximately estimated the virtual caching network from the cache states of the virtual local server of the local domain, which is the aggregated cache state of only altruistic clients in a local domain. Furthermore, we proposed a content selection algorithm based on a virtual caching network. In this paper, we used news life-cycle model as a content model that had the severe changes in cache states, which was a striking instance of dynamic content models. Computer simulations confirmed that our proposed algorithm suc-cessfully localized network traffic.
KW - Content combination
KW - Content delivery network (CDN)
KW - Content-oriented incentive
KW - News life-cycle
KW - Peer-assisted network
KW - Traf-fic localization
UR - http://www.scopus.com/inward/record.url?scp=84888997983&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84888997983&partnerID=8YFLogxK
U2 - 10.1587/transinf.E96.D.2684
DO - 10.1587/transinf.E96.D.2684
M3 - Article
AN - SCOPUS:84888997983
VL - E96-D
SP - 2684
EP - 2695
JO - IEICE Transactions on Information and Systems
JF - IEICE Transactions on Information and Systems
SN - 0916-8532
IS - 12
ER -