The Information-Centric Networking Challenge

Background, Open Issues and Research DirectionsReading Material - Tutorial at ITC 24, Krakow, Poland

Ioannis Psaras, University College London, UK, e-mail: i.psaras@ucl.ac.ukDirk Trossen, University of Cambridge, UK, e-mail: dirk.trossen@cl.cam.ac.uk

September 7, 2012

1 Introduction (I)

• I.1: D. Trossen, M. Sarela, K. Sollins, “Arguments for an Information-Centric Inter-networking Architecture, ACM Computer Communication Review, April 2010.

• I.2: A. Ghodsi, T. Koponen, B. Raghavan, S. Shenker, A. Singla, J. Wilcox, “Information-Centric Networking: Seeing the Forest for the Trees”, Proc. of ACM Hotnets work-shop, 2010.

2 Architecture (A)

• A.1: N. Fotiou, G. C. Polyzos, and D. Trossen. “Illustrating a publish-subscribe in-ternet architecture”, Journal on Telecommunication Systems, Springer, March, 2011.

• A.2: V. Jacobson and et al. “Networking Named Content”, In ACM CoNEXT 09,pages 112, 2009.

• A.3: K. Katsaros, G. Xylomenos, and G. C. Polyzos. “Multicache: An overlayarchitecture for information-centric networking”, Comput. Netw., 2011.

• A.4: T. Koponen, M. Chawla, B. Chun, A. Ermolinskiy, K. Kim, S. Shenker, and IonStoica. “A data-oriented (and beyond) network architecture”, In Proc. of SIGCOMM2007.

• A.5: D. Trossen, G. Parisis, “Designing and Realizing An Information-Centric In-ternet”, IEEE Communications Magazine, July 2012.

1

• A.6: J. Doyle, D. L. Alderson, L. Li, S. Low, M. Roughan, S. Shalunov, R. Tanaka,W. Willinger, “The robust yet fragile nature of the Internet”, Proceedings of theNational Academy of Science, 2005.

• A.7: Chiang M, Low SH, Calderbank AR, Doyle JC, “Layering as optimizationde-composition: A mathematical theory of architecture”, Proc IEEE 95:5256, 2007.

• A.8: David R. Cheriton and Mark Gritter, “TRIAD: a Scalable Deployable NAT-based Internet Architecture”, Technical Report, January 2000.

3 Naming (N) and Forwarding (F)

3.1 Naming

• N.1: A. Ghodsi and et al. “Naming in content-oriented architectures”, In ACMSIGCOMM ICN Workshop, pages 16, 2011.

• N.2: T. Koponen and et al. “A Data-Oriented (and beyond) Network Architecture”,SIGCOMM, 37(4):181192, 07.

• N.3: K. Sollins, “Pervasive Persistent Identification for Information Centric Net-working”, SIGCOMM workshop on ICN, 2012.

• N.4: Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and ScottShenker. “A scalable content-addressable network”, In Proceedings SIGCOMM ’01,ACM, pp. 161-172.

• N.5: Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Bal-akrishnan. “Chord: A scalable peer-to-peer lookup service for internet applications”,In Proceedings of SIGCOMM ’01, ACM, pp. 149-160.

• N.6: David R. Cheriton and Mark Gritter, “TRIAD: a Scalable Deployable NAT-based Internet Architecture”, Technical Report, January 2000.

3.2 Forwarding

• F.1: P. Jokela, A. Zahemszky, C. E. Rothenberg, S. Arianfar, and P. Nikander.“LIPSIN: line speed publish/subscribe inter-networking”, In Proc. of ACM SIG-COMM 2009.

• F.2: J. Tapolcai, A. Gulyas, Z. Heszberger, J. Biro, P. Babarczi, D. Trossen, “State-less multi-stage dissemination of information: Source routing revisited”, In Proc. ofIEEE Globecom, 2012.

2

• F.3: M. Sarela, C. E. Rothenberg, T. Aura, A. Zahemszky, P. Nikander, J. Ott,“Forwarding anomalies in Bloom filter-based multicast”, Proc. of INFOCOM 2011:2399-2407.

• F.4: B. H. Bloom, “Space/time trade-offs in hash coding with allowable errors”,Commun. ACM, 13(7):422-426, July 1970.

• F.5: P. Godfrey, I. Ganichev, S. Shenker, I. Stoica, “Pathlet Routing”, In Proceedingsof ACM SIGCOMM 2009.

• F.6: W. K. Chai, et al., “CURLING: Content-Ubiquitous Resolution and Deliv-ery Infrastructure for Next Generation Services”, IEEE Communications Magazine,Special Issue on Future Media Internet, pp. 112-120, March 2011.

4 Caching (C)

4.1 General Caching

• C.1: A. Anand and et al. “Packet caches on routers: the implications of universalredundant traffic elimination”. In ACM SIGCOMM, pages 219230, 2008.

• C.2: A. Anand, C. Muthukrishnan, A. Akella, and R. Ramjee. Redundancy innetwork traffic: findings and implications. In SIGMETRICS 09.

• C.3: L. Breslau and et al. “Web caching and zipf-like distributions: Evidence andimplications”, In INFOCOM, pages 126134, 1999.

• C.4: H. Che, Z. Wang, and Y. Tung. “Analysis and Design of Hierarchical WebCaching Systems”, In INFOCOM, pages 14161424. IEEE, 2001.

• C.5: A. Dan, D. Towsley. “An approximate analysis of the LRU and FIFO bufferreplacement schemes”, pp. 143152. SIGMETRICS 90 (1990).

• C.6: N. Fujita, Y. Ishikawa, A. Iwata, and R. Izmailov. “Coarse-grain replica man-agement strategies for dynamic replication of web contents”, Comput. Netw., 45(1),2004.

• C.7: A. A. Jiang and J. Bruck. “Optimal content placement for en-route webcaching”, In Proc. of IEEE NCA 03.

• C.8: P. Krishnan, D. Raz, and Y. Shavitt. “The cache location problem”, IEEE/ACMTrans. Netw., 8(5):568582, Oct. 2000.

• C.9: N. Laoutaris, H. Che, and I. Stavrakakis. “The LCD interconnection of LRUcaches and its analysis”, Perform. Eval., 63(7), July 2006.

3

• C.10: E. J. Rosensweig and J. Kurose. “Breadcrumbs: Efficient, Best-Effort ContentLocation in Cache Networks”, In INFOCOM, 09.

• C.11: E. J. Rosensweig, J. Kurose, and D. Towsley. “Approximate models for generalcache networks”, In IEEE INFOCOM, 2010.

• C.12: P.R. Jelenkovic. “Asymptotic approximation of the move-to-front search costdistribution and least-recently-used caching fault probabilities”, The Annals of Ap-plied Probability 9(2) (1999).

• C.13: P.R. Jelenkovic, A. Radovanovic, M.S. Squillante. “Critical sizing of LRUcaches with dependent requests”, Journal of Applied Probability 43(4), 10131027(2006).

4.2 CDNs

• C.14: David Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, andK. K. Ramakrishnan. “Optimal content placement for a large-scale VoD system”, InProceedings Co-NEXT ’10). ACM, Article 4.

• C.15: G. Pallis, A. Vakali, “Insight and perspectives for content delivery networks”,Commun. ACM 49(1), 101106 (2006).

4.3 ICN Caching

• C.16: S. Arianfar, P. Nikander, and J. Ott. “On content-centric router design andimplications”, In ReArch Workshop, volume 9, page 5. ACM, 2010.

• C.17: W. K. Chai, D. He, I. Psaras, and G. Pavlou. “Cache ’Less for More’ inInformation-centric Networks”, In Proc. of IFIP Networking, 2012.

• C.18: Kideok Cho et al. “WAVE: Popularity-based and Collaborative In-networkCaching for Content-Oriented Networks”, In IEEE NOMEN Workshop, 2012.

• C.19: C. Fricker, P. Robert, J. Roberts, and N. Sbihi. “Impact of traffic mix oncaching performance in a content-centric network”, In IEEE NOMEN, 2012.

• C.20: U. Lee, I. Rimac, and V. Hilt. “Greening the internet with content-centricnetworking”, eEnergy, 2010.

• C.21: L. Muscariello, G. Carofiglio, and M. Gallo. “Bandwidth and storage sharingperformance in information centric networking”, In ACM SIGCOMM ICN Workshop,pages 2631, 2011.

4

• C.22: D. Perino and M. Varvello. “A reality check for content centric networking”,In ACM SIGCOMM ICN Workshop, pages 4449, 2011.

• C.23: I. Psaras, R. G. Clegg, R. Landa, W. K. Chai, and G. Pavlou. “Modellingand Evaluation of CCN-Caching Trees”, In Proc. of IFIP NETWORKING, 2011.

• C.24: I. Psaras, W. K. Chai, G. Pavlou. “Probabilistic In-Network Caching forInformation-Centric Networks”, In Proc. of ACM SIGCOMM ICN Workshop, 2012.

• C.25: D. Rossi and G. Rossini. “Caching performance of content centric networksunder multi-path routing”, Technical Report, 2011.

• C.26: D. Rossi and G. Rossini. “On sizing CCN content stores by exploiting topo-logical information”, In IEEE NOMEN Workshop, 2012.

• C.27: Gareth Tyson, Sebastian Kaune, Simon Miles, Yehia El-Khatib, AndreasMauthe and Adel Taweel. “A Trace-Driven Analysis of Caching in Content-CentricNetworks”, In Proc. of ICCCN’12, Munich, Germany (2012).

• C.28: Yaogong Wang et. al. “Advertising Cached Contents in the Control Plane:Necessity and Feasibility”, In IEEE NOMEN Workshop, 2012.

• C.29: Zhongxing Ming, Mingwei Xu, Dan Wang. “Age-based Cooperative Cachingin Information-Centric Networks”, In IEEE NOMEN Workshop, 2012.

• C.30: V. Jacobson and et al. “Networking Named Content”, In ACM CoNEXT 09,pages 112, 2009.

• C.31: Sara Oueslati, James Roberts, Nada Sbihi. “Flow-aware traffic control for acontent-centric network”, in IEEE INFOCOM 2012.

5 Miscellaneous

• EU FP7 PURSUIT Project: http://www.fp7-pursuit.eu and SoA Report.

• EU FP7 COMET Project: http://www.comet-project.org/

• EU FP7 SAIL Project: http://www.sail-project.eu/

• US NDN Project: http://www.named-data.net/

• ANR CONNECT Project: http://www.anr-connect.org/

• ACM SIGCOMM Workshop on Information-Centric Networking (ICN-2011, 2012),http://www.neclab.eu/icn-2012/

• IEEE Infocom NOMEN Workshop 2012, http://www.ieee-infocom.org/2012/nomen/

5