Replication management and cache-aware routing in information-centric networks

Content distribution in the Internet places content providers in a dominant position, with delivery happening directly between two end-points, that is, from content providers to consumers. Information-Centrism has been proposed as a paradigm shift from the host-to-host Internet to a host-to-content one, or in other words from an end-to-end communication system to a native distribution network. This trend has attracted the attention of the research community, which has argued that content, instead of end-points, must be at the center stage of attention. Given this emergence of information-centric solutions, the relevant management needs in terms of performance have not been adequately addressed, yet they are absolutely essential for relevant network operations and crucial for the information-centric approaches to succeed. Performance management and traffic engineering approaches are also required to control routing, to configure the logic for replacement policies in caches and to control decisions where to cache, for instance. Therefore, there is an urgent need to manage information-centric resources and in fact to constitute their missing management and control plane which is essential for their success as clean-slate technologies. In this thesis we aim to provide solutions to crucial problems that remain, such as the management of information-centric approaches which has not yet been addressed, focusing on the key aspect of route and cache management.

[1]  Anirban Mahanti,et al.  Traffic analysis of a Web proxy caching hierarchy , 2000 .

[2]  Tao Zhang,et al.  MorphCache: A Reconfigurable Adaptive Multi-level Cache hierarchy , 2011, 2011 IEEE 17th International Symposium on High Performance Computer Architecture.

[3]  Pascal Felber,et al.  A scalable protocol for content-based routing in overlay networks , 2003, Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003..

[4]  QiuLili,et al.  The content and access dynamics of a busy Web site , 2000 .

[5]  Ankit Singla,et al.  Information-centric networking: seeing the forest for the trees , 2011, HotNets-X.

[6]  Lazaros Gkatzikis,et al.  Autonomic cache management in Information-Centric Networks , 2012, 2012 IEEE Network Operations and Management Symposium.

[7]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[8]  George C. Polyzos,et al.  GlobeTraff: A Traffic Workload Generator for the Performance Evaluation of Future Internet Architectures , 2012, 2012 5th International Conference on New Technologies, Mobility and Security (NTMS).

[9]  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).

[10]  Jörg Ott,et al.  Enabling opportunistic storage for mobile DTNs , 2008, Pervasive Mob. Comput..

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

[12]  Philippe Robert,et al.  Impact of traffic mix on caching performance in a content-centric network , 2012, 2012 Proceedings IEEE INFOCOM Workshops.

[13]  George Parisis,et al.  Mobility work re-visited not considered harmful , 2011, 2011 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT).

[14]  Antti Ylä-Jääski,et al.  Cooperative caching through routing control in information-centric networks , 2013, 2013 Proceedings IEEE INFOCOM.

[15]  Nikos Fotiou,et al.  A Survey of Information-Centric Networking Research , 2014, IEEE Communications Surveys & Tutorials.

[16]  George Parisis,et al.  Storage replication in information-centric networking , 2013, 2013 International Conference on Computing, Networking and Communications (ICNC).

[17]  Vaidyanathan Ramaswami,et al.  Introduction to Matrix Analytic Methods in Stochastic Modeling , 1999, ASA-SIAM Series on Statistics and Applied Mathematics.

[18]  Leandros Tassiulas,et al.  Storing and Replication in Topic-Based Publish/Subscribe Networks , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[19]  Åke Arvidsson,et al.  On the effects of caching in access aggregation networks , 2012, ICN '12.

[20]  Duane Wessels,et al.  Internet Cache Protocol (ICP), version 2 , 1997, RFC.

[21]  Leandros Tassiulas,et al.  A novel cache aware routing scheme for Information-Centric Networks , 2014, Comput. Networks.

[22]  Marcos K. Aguilera,et al.  Matching events in a content-based subscription system , 1999, PODC '99.

[23]  Srinivasan Seshan,et al.  Packet caches on routers: the implications of universal redundant traffic elimination , 2008, SIGCOMM '08.

[24]  M. Newman Power laws, Pareto distributions and Zipf's law , 2005 .

[25]  Jiawei Zhang,et al.  Approximation algorithms for facility location problems , 2004 .

[26]  Leandros Tassiulas,et al.  Modeling the dynamics of caching in content-based publish/subscribe systems , 2011, SAC '11.

[27]  Magnus Karlsson,et al.  A Framework for Evaluating Replica Placement Algorithms , 2002 .

[28]  Lazaros Gkatzikis,et al.  Distributed Cache Management in Information-Centric Networks , 2013, IEEE Transactions on Network and Service Management.

[29]  Lada A. Adamic,et al.  Zipf's law and the Internet , 2002, Glottometrics.

[30]  Masayuki Murata,et al.  CATT: potential based routing with content caching for ICN , 2012, ICN '12.

[31]  Philippe Robert,et al.  A versatile and accurate approximation for LRU cache performance , 2012, 2012 24th International Teletraffic Congress (ITC 24).

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

[33]  Bo Li,et al.  On the optimal placement of web proxies in the Internet , 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).

[34]  Alexander L. Wolf,et al.  Design and Evaluation of a Support Service for Mobile, Wireless Publish/Subscribe Applications , 2003, IEEE Trans. Software Eng..

[35]  Keith W. Ross,et al.  Hash routing for collections of shared Web caches , 1997, IEEE Netw..

[36]  Nikolaos Laoutaris A Closed-Form Method for LRU Replacement under Generalized Power-Law Demand , 2007, ArXiv.

[37]  Duane Wessels,et al.  Cache Digests , 1998, Comput. Networks.

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

[39]  Gwendal Simon,et al.  Time-Shifted TV in Content Centric Networks: The Case for Cooperative In-Network Caching , 2011, 2011 IEEE International Conference on Communications (ICC).

[40]  Leandros Tassiulas,et al.  Mobility Support Through Caching in Content-Based Publish/Subscribe Networks , 2010, 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing.

[41]  Jianping Wu,et al.  Could in-network caching benefit information-centric networking? , 2011, AINTEC '11.

[42]  Yanghee Choi,et al.  How can an ISP merge with a CDN? , 2011, IEEE Communications Magazine.

[43]  G. Dantzig Discrete-Variable Extremum Problems , 1957 .

[44]  Jia Wang,et al.  A survey of web caching schemes for the Internet , 1999, CCRV.

[45]  James F. Kurose,et al.  Breadcrumbs: Efficient, Best-Effort Content Location in Cache Networks , 2009, IEEE INFOCOM 2009.

[46]  Nisheeth Shrivastava,et al.  Scalable Content-Based Routing in Pub/Sub Systems , 2009, IEEE INFOCOM 2009.

[47]  David S. Rosenblum,et al.  Design and evaluation of a wide-area event notification service , 2001, TOCS.

[48]  Hans-Arno Jacobsen,et al.  Historic data access in publish/subscribe , 2007, DEBS '07.

[49]  P. Jelenkovic,et al.  Critical sizing of LRU caches with dependent requests , 2006, Journal of Applied Probability.

[50]  Azer Bestavros,et al.  Distributed Selfish Caching , 2007, IEEE Transactions on Parallel and Distributed Systems.

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

[52]  A. Neumaier,et al.  Distance Regular Graphs , 1989 .

[53]  George Parisis,et al.  Designing and realizing an information-centric internet , 2012, IEEE Communications Magazine.

[54]  Kamesh Munagala,et al.  Local Search Heuristics for k-Median and Facility Location Problems , 2004, SIAM J. Comput..

[55]  Leandros Tassiulas,et al.  Storage planning and replica assignment in content-centric publish/subscribe networks , 2011, Comput. Networks.

[56]  Shay Kutten,et al.  Optimal allocation of electronic content , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[57]  Asit Dan,et al.  An approximate analysis of the LRU and FIFO buffer replacement schemes , 1990, SIGMETRICS '90.

[58]  Yuval Shavitt,et al.  Constrained mirror placement on the Internet , 2002, IEEE J. Sel. Areas Commun..

[59]  Leandros Tassiulas,et al.  Pursuing a Software Defined Information-centric Network , 2012, 2012 European Workshop on Software Defined Networking.

[60]  Nikolaos Laoutaris,et al.  Distributed Selfish Replication , 2006, IEEE Transactions on Parallel and Distributed Systems.

[61]  Leandros Tassiulas,et al.  Policy Distribution Using the Publish/Subscribe Paradigm for Managing MANETs , 2008 .

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

[63]  Hang Liu,et al.  A multi-level DHT routing framework with aggregation , 2012, ICN '12.

[64]  Alexander L. Wolf,et al.  A routing scheme for content-based networking , 2004, IEEE INFOCOM 2004.

[65]  Lazaros Gkatzikis,et al.  On-line storage management with distributed decision making for content-centric networks , 2011, 2011 7th EURO-NGI Conference on Next Generation Internet Networks.

[66]  Ishfaq Ahmad,et al.  Comparison and analysis of ten static heuristics-based Internet data replication techniques , 2008, J. Parallel Distributed Comput..

[67]  George Pavlou,et al.  Hash-routing schemes for information centric networking , 2013, ICN '13.

[68]  Randy H. Katz,et al.  Efficient and adaptive Web replication using content clustering , 2003, IEEE J. Sel. Areas Commun..

[69]  Atsushi Iwata,et al.  Coarse-grain replica management strategies for dynamic replication of Web contents , 2004, Comput. Networks.

[70]  Sudipto Guha,et al.  Improved combinatorial algorithms for the facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[71]  Leandros Tassiulas,et al.  A content-based publish/subscribe framework for large-scale content delivery , 2013, Comput. Networks.

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

[73]  Daniel Grosu,et al.  A Distributed Algorithm for the Replica Placement Problem , 2011, IEEE Transactions on Parallel and Distributed Systems.

[74]  Filip De Turck,et al.  Non-commercial Research and Educational Use including without Limitation Use in Instruction at Your Institution, Sending It to Specific Colleagues That You Know, and Providing a Copy to Your Institution's Administrator. All Other Uses, Reproduction and Distribution, including without Limitation Comm , 2022 .

[75]  Kamesh Munagala,et al.  Local search heuristic for k-median and facility location problems , 2001, STOC '01.

[76]  Tatsuya Mori,et al.  ISP-Operated CDN , 2009, IEEE INFOCOM Workshops 2009.

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

[78]  Alfonso Fuggetta,et al.  The JEDI Event-Based Infrastructure and Its Application to the Development of the OPSS WFMS , 2001, IEEE Trans. Software Eng..

[79]  Gian Pietro Picco,et al.  REDS: a reconfigurable dispatching system , 2006, SEM '06.

[80]  Leandros Tassiulas,et al.  Leveraging Caching for Internet-Scale Content-Based Publish/Subscribe Networks , 2011, 2011 IEEE International Conference on Communications (ICC).

[81]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[82]  Leandros Tassiulas,et al.  Content Replication and Delivery in Information‐Centric Networks , 2014 .

[83]  Nicola Blefari-Melazzi,et al.  CONET: a content centric inter-networking architecture , 2011, ICN '11.

[84]  Leandros Tassiulas,et al.  Effective cache management and performance limits in information-centric networks , 2013, 2013 International Conference on Computing, Networking and Communications (ICNC).

[85]  Mateusz Dzida,et al.  On popularity-based load balancing in content networks , 2012, 2012 24th International Teletraffic Congress (ITC 24).

[86]  S. RaijaSulthana Distributed caching algorithms for content distribution networks , 2015 .

[87]  Pablo Rodriguez,et al.  Analysis of web caching architectures: hierarchical and distributed caching , 2001, TNET.

[88]  Leandros Tassiulas,et al.  Caching in Content-Based Publish/Subscribe Systems , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

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

[90]  Akihiro Nakao,et al.  CONIC: Content-Oriented Network with Indexed Caching , 2010, 2010 INFOCOM IEEE Conference on Computer Communications Workshops.

[91]  Diego Perino,et al.  A reality check for content centric networking , 2011, ICN '11.

[92]  David B. Shmoys,et al.  Approximation algorithms for facility location problems , 2000, APPROX.

[93]  Bernhard Plattner,et al.  Service discovery in mobile ad hoc networks: a field theoretic approach , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[94]  Leandros Tassiulas,et al.  Store and Retrieve Management Policies on Wireless Ad-Hoc Networks using the Content Delivery Publish / Subscribe Paradigm , 2009 .

[95]  Le Gruenwald,et al.  A survey of data replication techniques for mobile ad hoc network databases , 2008, The VLDB Journal.

[96]  Jaswinder Pal Singh,et al.  Efficient event routing in content-based publish-subscribe service networks , 2004, IEEE INFOCOM 2004.

[97]  Matthew Roughan,et al.  The Internet Topology Zoo , 2011, IEEE Journal on Selected Areas in Communications.

[98]  Daniel Pérez Palomar,et al.  A tutorial on decomposition methods for network utility maximization , 2006, IEEE Journal on Selected Areas in Communications.

[99]  Luca Mottola,et al.  A Self-Repairing Tree Topology Enabling Content-Based Routing in Mobile Ad Hoc Networks , 2008, IEEE Transactions on Mobile Computing.

[100]  Andreas Mauthe,et al.  CacheCast: Eliminating Redundant Link Traffic for Single Source Multiple Destination Transfers , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[101]  Sasu Tarkoma,et al.  Optimizing content-based routers: posets and forests , 2006, Distributed Computing.

[102]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[103]  Hao Che,et al.  Analysis and design of hierarchical Web caching systems , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[104]  Jörg Ott,et al.  On content-centric router design and implications , 2010, ReARCH '10.

[105]  Hao Che,et al.  Hierarchical Web caching systems: modeling, design and experimental results , 2002, IEEE J. Sel. Areas Commun..

[106]  Sasu Tarkoma,et al.  Publish/Subscribe for Internet: PSIRP Perspective , 2010, Future Internet Assembly.