Traffic Engineering of Peer-Assisted Content Delivery Network with Content-Oriented Incentive Mechanism

被引:1
作者
Maki, Naoya [1 ]
Nishio, Takayuki [1 ]
Shinkuma, Ryoichi [1 ]
Mori, Tatsuya [2 ]
Kamiyama, Noriaki [2 ]
Kawahara, Ryoichi [2 ]
Takahashi, Tatsuro [1 ]
机构
[1] Kyoto Univ, Grad Sch Informat, Kyoto 6068501, Japan
[2] NTT Corp, NTT Network Technol Labs, Musashino, Tokyo 1808585, Japan
关键词
content delivery network; peer-assisted network; contents combinations; combining contents; traffic localization; EFFICIENT;
D O I
10.1587/transinf.E95.D.2860
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In content services where people purchase and download large-volume contents, minimizing network traffic is crucial for the service provider and the network operator since they want to lower the cost charged for bandwidth and the cost for network infrastructure, respectively. Traffic localization is an effective way of reducing network traffic. Network traffic is localized when a client can obtain the requested content files from other a near-by altruistic client instead of the source servers. The concept of the peer-assisted content distribution network (CDN) can reduce the overall traffic with this mechanism and enable service providers to minimize traffic without deploying or borrowing distributed storage. To localize traffic effectively, content files that are likely to be requested by many clients should be cached locally. This paper presents a novel traffic engineering scheme for peer-assisted CDN models. Its key idea is to control the behavior of clients by using content-oriented incentive mechanism. This approach enables us to optimize traffic flows by letting altruistic clients download content files that are most likely contributed to localizing traffic among clients. In order to let altruistic clients request the desired files, we combine content files while keeping the price equal to the one for a single content. This paper presents a solution for optimizing the selection of content files to be combined so that cross traffic in a network is minimized. We also give a model for analyzing the upper-bound performance and the numerical results.
引用
收藏
页码:2860 / 2869
页数:10
相关论文
共 25 条
[1]  
[Anonymous], 2000, 1 MONDAY
[2]  
[Anonymous], 2005, ACM SIGCOMM WORKSH E
[3]  
Bocek T, 2008, 2008 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL & DISTRIBUTED PROCESSING, VOLS 1-8, P653
[4]  
Breslau L., 2002, P INFOCOM 99 NEW YOR, V1, P126
[5]   Efficient and adaptive Web replication using content clustering [J].
Chen, Y ;
Qiu, LL ;
Chen, WY ;
Nguyen, L ;
Katz, RH .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2003, 21 (06) :979-994
[6]  
Cheng R., 2005, Proceedings of the 38th Hawaii International Conference on System Sciences, P193, DOI DOI 10.1109/HICSS.2005.653
[7]  
Chi Wang, 2010, 2010 International Conference on Computer Design and Applications (ICCDA 2010), P403, DOI 10.1109/ICCDA.2010.5540937
[8]   The impact and implications of the growth in residential user-to-user traffic [J].
Cho, Kenjiro ;
Fukuda, Kensuke ;
Esaki, Hiroshi ;
Kato, Akira .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2006, 36 (04) :207-218
[9]  
Cohen E., 2002, P ACM SIGCOMM 02 PIT
[10]  
Cuevas R., 2010, ACM CONEXT