An online placement mechanism for efficient delivery of User Generated Content

User Generated Content (UGC) is projected to make up a significant part of the total Internet traffic in the future. As such, it will significantly contribute to the total cost for Internet traffic worldwide. Arguably, UGC is a suitable content type for which the Internet Service Providers (ISPs) can take initiative and enter the content delivery market. However, despite its significance, UGC content management has attracted very little research attention, and the existing works stop short of developing placement and delivery solutions for UGC. Hence, we are motivated to address this content type, and exploit its properties to support ISPs in making optimal placement decisions. Specifically, we leverage the inherent tie between UGC and social networking context, take into consideration the persistence limitation of UGC (in contrast to commercial content), and derive model with the objective to minimize power usage. Also, derived from the problem formulation, we propose an online algorithm which enables each ISP to individually decide which contents should be placed and served locally. We provide simulation results showing that the proposed algorithm performs close to optimal in terms of power used for content delivery.

[1]  Jussi Kangasharju,et al.  Object replication strategies in content distribution networks , 2002, Comput. Commun..

[2]  Akira Ito,et al.  Optimal in-network cache allocation and content placement , 2015, 2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[3]  Elaine Wong,et al.  Energy efficient content distribution for VoD services , 2011, 2011 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference.

[4]  Jirí Sgall,et al.  Online Knapsack Revisited , 2013, Theory of Computing Systems.

[5]  Zhi Zhang,et al.  A study on energy used to deliver H.264/AVC and H.265/HEVC video content , 2016, 2016 IEEE 21st International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD).

[6]  Valentino Pacifici,et al.  Distributed algorithms for content allocation in interconnected content distribution networks , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[7]  Laurent Massoulié,et al.  Greening the internet with nano data centers , 2009, CoNEXT '09.

[8]  R.S. Tucker,et al.  Architectures for energy-efficient IPTV networks , 2009, 2009 Conference on Optical Fiber Communication - incudes post deadline papers.

[9]  Konstantinos Poularakis,et al.  On the Complexity of Optimal Content Placement in Hierarchical Caching Networks , 2016, IEEE Transactions on Communications.

[10]  Christos V. Verikoukis,et al.  Internet Service Providers vs. Over-the-Top Companies: Friends or Foes? - Short talk , 2017, PERV.

[11]  Daniel C. Kilper,et al.  On the Energy Efficiency of Content Delivery Architectures , 2011, 2011 IEEE International Conference on Communications Workshops (ICC).

[12]  Deeparnab Chakrabarty,et al.  Budget constrained bidding in keyword auctions and online knapsack problems , 2008, WINE.

[13]  Dennis Komm,et al.  The online knapsack problem: Advice and randomization , 2014, Theor. Comput. Sci..

[14]  Valerio Bioglio,et al.  On Energy-Efficient Edge Caching in Heterogeneous Networks , 2016, IEEE Journal on Selected Areas in Communications.

[15]  Yonggang Wen,et al.  Toward Cost-Efficient Content Placement in Media Cloud: Modeling and Analysis , 2016, IEEE Transactions on Multimedia.

[16]  Lars Backstrom,et al.  The Anatomy of the Facebook Social Graph , 2011, ArXiv.

[17]  Richard M. Karp,et al.  On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future? , 1992, IFIP Congress.

[18]  Noël Crespi,et al.  Video Content Delivery Enhancement in CDNs Based on Users' Social Information , 2016, 2016 IEEE Globecom Workshops (GC Wkshps).