Joint optimization of content replication and Traffic Engineering in ICN

In the current IP networks, content replication and inter-domain Traffic Engineering (TE) are manipulated by different entities with respective objectives, and work at different layers as well. In Information-Centric Networking (ICN), however, they can both be administered by Internet Service Providers (ISPs) and work at the same network layer. In this paper, we present our study of jointly optimizing content replication and inter-domain TE in ICN, which aims at maximizing the profit of inter-domain traffic for an ISP while constrained by the limits of link bandwidth and the availability of contents. Results show that our algorithms can increase the ISP's profit by 66% and reduce the link utilization by 23% on average, which are near-optimal and with much less running time.

[1]  Leandros Tassiulas,et al.  Cache-aware routing in Information-Centric Networks , 2013, 2013 IFIP/IEEE International Symposium on Integrated Network Management (IM 2013).

[2]  Daniel Massey,et al.  Routing policies in named data networking , 2011, ICN '11.

[3]  Bo Li,et al.  Collaborative hierarchical caching with dynamic request routing for massive content distribution , 2012, 2012 Proceedings IEEE INFOCOM.

[4]  Beichuan Zhang,et al.  Making CDN and ISP Routings Symbiotic , 2011, 2011 31st International Conference on Distributed Computing Systems.

[5]  Nick Feamster,et al.  Guidelines for interdomain traffic engineering , 2003, CCRV.

[6]  Dario Rossi,et al.  Design and evaluation of cost-aware information centric routers , 2014, ICN '14.

[7]  Weisong Shi,et al.  Modeling object characteristics of dynamic Web content , 2003, J. Parallel Distributed Comput..

[8]  Anja Feldmann,et al.  Pushing CDN-ISP collaboration to the limit , 2013, CCRV.

[9]  Wenzhong Li,et al.  Analysis and performance study for coordinated hierarchical cache placement strategies , 2010, Comput. Commun..

[10]  G. Voelker,et al.  On the scale and performance of cooperative Web proxy caching , 2000, OPSR.

[11]  Reuven Cohen,et al.  An efficient approximation for the Generalized Assignment Problem , 2006, Inf. Process. Lett..

[12]  Walter Willinger,et al.  To Peer or Not to Peer: Modeling the Evolution of the Internet's AS-Level Topology , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[13]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[14]  Abraham Silberschatz,et al.  P4p: provider portal for applications , 2008, SIGCOMM '08.

[15]  Mung Chiang,et al.  Cooperative content distribution and traffic engineering in an ISP network , 2009, SIGMETRICS '09.

[16]  Nick Feamster,et al.  Quantifying the benefits of joint content and network routing , 2013, SIGMETRICS '13.

[17]  Stephen Farrell,et al.  Network of Information (NetInf) - An information-centric networking architecture , 2013, Comput. Commun..

[18]  Jennifer Rexford,et al.  BGP routing policies in ISP networks , 2005, IEEE Network.

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

[20]  Sem C. Borst,et al.  Distributed Caching Algorithms for Content Distribution Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[21]  Raouf Boutaba,et al.  αRoute: A name based routing scheme for Information Centric Networks , 2013, 2013 Proceedings IEEE INFOCOM.

[22]  Deborah Estrin,et al.  Named Data Networking (NDN) Project , 2010 .

[23]  Janne Riihijärvi,et al.  On name-based inter-domain routing , 2011, Comput. Networks.

[24]  Dipankar Raychaudhuri,et al.  Content based traffic engineering in software defined information centric networks , 2013, 2013 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).