Multi-criteria decision algorithms for efficient content delivery in content networks

Today’s Internet is prominently used for content distribution. Various platforms such as content delivery networks (CDNs) have become an integral part of the digital content ecosystem. Most recently, the information-centric networking (ICN) paradigm proposes the adoption of native content naming for secure and efficient content delivery. This further enhances the flexibility of content access where a content request can be served by any source within the Internet. In this paper, we propose and evaluate a multi-criteria decision algorithm for efficient content delivery applicable for content networks in general (among others, CDN and ICN). Our algorithm computes the best available source and path for serving content requests taking into account information about content transfer requirements, location of the consumer, location of available content servers, content server load and content delivery paths between content servers and consumer. The proposed algorithm exploits two closely related processes. The first level discovers multiple content delivery paths and gathers their respective transfer characteristics. This discovery process is based on long-term network measurements and performed offline. The second process is invoked for each content request to find the best combined content server and delivery path. The cooperation between both levels allows our algorithm to increase the number of satisfied content requests thanks to efficient utilisation of network and server resources. The proposed decision algorithm was evaluated by simulation using Internet scale network model. The results confirm the effectiveness gain of content network architectures that introduce network awareness. Moreover, the simulation process allows for a comparison between different routing algorithms and, especially, between single and multipath routing algorithms.

[1]  Pablo Rodriguez,et al.  Watching television over an IP network , 2008, IMC '08.

[2]  Bernhard Plattner,et al.  Density-Based Anycast: A Robust Routing Strategy for Wireless Ad Hoc Networks , 2008, IEEE/ACM Transactions on Networking.

[3]  Gang Feng The revisit of QoS routing based on non-linear Lagrange relaxation , 2007, Int. J. Commun. Syst..

[4]  Chris Reade,et al.  Video placement and disk load balancing algorithm for VoD proxy server , 2009, 2009 IEEE International Conference on Internet Multimedia Services Architecture and Applications (IMSAA).

[5]  Giovanni Bartolomeo,et al.  Named Data Networking Project , 2013 .

[6]  W. Ames Mathematics in Science and Engineering , 1999 .

[7]  George Pavlou,et al.  Cache "Less for More" in Information-Centric Networks , 2012, Networking.

[8]  Piet Van Mieghem,et al.  Concepts of exact QoS routing algorithms , 2004, IEEE/ACM Transactions on Networking.

[9]  D. Katabi,et al.  A framework for scalable global IP-anycast (GIA) , 2001, CCRV.

[10]  Andrzej P. Wierzbicki,et al.  The Use of Reference Objectives in Multiobjective Optimization , 1979 .

[11]  Pekka Nikander,et al.  LIPSIN: line speed publish/subscribe inter-networking , 2009, SIGCOMM '09.

[12]  A. Messac,et al.  Aggregate Objective Functions and Pareto Frontiers: Required Relationships and Practical Implications , 2000 .

[13]  Jordi Domingo-Pascual,et al.  Research challenges in QoS routing , 2006, Comput. Commun..

[14]  Matthias Ehrgott,et al.  Multicriteria Optimization , 2005 .

[15]  Patrick Crowley,et al.  Named data networking , 2014, CCRV.

[16]  Pradyumn Kumar Shukla,et al.  On Gradient Based Local Search Methods in Unconstrained Evolutionary Multi-objective Optimization , 2007, EMO.

[17]  Ning Wang,et al.  Curling: Content-ubiquitous resolution and delivery infrastructure for next-generation services , 2011, IEEE Communications Magazine.

[18]  Ben Y. Zhao,et al.  Understanding user behavior in large-scale video-on-demand systems , 2006, EuroSys.

[19]  Krishna P. Gummadi,et al.  Measurement, modeling, and analysis of a peer-to-peer file-sharing workload , 2003, SOSP '03.

[20]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[21]  Kay A. Robbins,et al.  An empirical evaluation of client-side server selection algorithms , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[22]  Markus Hofmann,et al.  Content Networking - Architecture, Protocols, and Practice , 2005, The Morgan Kaufmann series in networking.

[23]  Yiping Chen,et al.  Optimization of the decision process in network and server-aware algorithms , 2012, 2012 15th International Telecommunications Network Strategy and Planning Symposium (NETWORKS).

[24]  Piet Van Mieghem,et al.  Performance evaluation of constraint-based path selection algorithms , 2004, IEEE Network.

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

[26]  Arun Venkataramani,et al.  The potential costs and benefits of long-term prefetching for content distribution , 2002, Comput. Commun..

[27]  Hirotaka Nakayama,et al.  Theory of Multiobjective Optimization , 1985 .

[28]  J. Famaey,et al.  Content Delivery Networks , 2012 .

[29]  Scott Shenker,et al.  A data-oriented (and beyond) network architecture , 2007, SIGCOMM '07.

[30]  Marek Makowski,et al.  Model-Based Decision Support Methodology with Environmental Applications , 2000 .

[31]  Ellen W. Zegura,et al.  Application-layer anycasting: a server selection architecture and use in a replicated Web service , 2000, TNET.

[32]  Terence D. Todd,et al.  Multi-constraint QoS routing using a new single mixed metric , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).