research-article

Free access

Exploit the known or explore the unknown?: hamlet-like doubts in ICN

Authors:

Raffaele Chiocchetti,

Giuseppe Rossini,

Giovanna Carofiglio,

Diego PerinoAuthors Info & Claims

ICN '12: Proceedings of the second edition of the ICN workshop on Information-centric networking

Pages 7 - 12

https://doi.org/10.1145/2342488.2342491

Published: 17 August 2012 Publication History

Abstract

Most Information Centric Networking designs propose the usage of widely distributed in-network storage. However, the huge amount of content exchanged in the Internet, and the volatility of content replicas cached across the network pose significant challenges to the definition of a scalable routing protocol able to address all available copies. In addition, the number of available copies of a given content item and their distribution among caches is clearly impacted by the request forwarding policy.

In this paper we gather initial design considerations for an ICN request forwarding strategy by spanning over two extremes: a deterministic exploitation of forwarding information towards a "known" copy and a random network exploration towards an "unknown" copy, via request flooding. By means of packet-level simulations, we investigate the performance trade-offs of exploitation/exploration approaches, and introduce an hybrid solution. Our forwarding scheme shows a good potential, whether carefully tuned, in terms of delivery performance, implicit cache coordination and possible reduction of forwarding table size.

References

[1]

ccnsim homepage. http://www.telecom-paristech.fr/~drossi/ccnSim.

[2]

B. Ahlgren, C. Dannewitz, C. Imbrenda, D. Kutscher, and B. Ohlman. A Survey of Information-Centric Networking. In Dagstuhl ICN Seminar, 2011.

[3]

T. Bektaş, J.F. Cordeau, E. Erkut, and G. Laporte. Exact algorithms for the joint object placement and request routing problem in content distribution networks. Comput. Oper. Res., 35(12):3860--3884, 2008.

Digital Library

[4]

M. Bjorkqvist, L. Chen, M. Vukolic, and X. Zhang. Minimizing retrieval latency for content cloud. In IEEE INFOCOM, 2011.

[5]

S. Borst, V. Gupta, and A. Walid. Distributed caching algorithms for content distribution networks. In IEEE INFOCOM, pages 1478--1486, 2010.

Digital Library

[6]

J. Dai, Z. Hu, B. Li, J. Liu, and B. Li. Collaborative hierarchical caching with dynamic request routing for massive content distribution. In IEEE INFOCOM, 2012.

[7]

A. Ghodsi, S. Shenker, T. Koponen, A. Singla, B. Raghavan, and J. Wilcox. Information-centric networking: seeing the forest for the trees. In ACM HotNets, New York, NY, USA, 2011. ACM.

Digital Library

[8]

V. Jacobson, D. Smetters, J. Thornton, M. F. Plass, N. Briggs, and R. Braynard. Networking named content. In Proceedings of ACM CoNEXT, Rome, Italy, 2009.

Digital Library

[9]

D. Karger, E. Lehman, T. Leighton, R. Panigrahy, M. Levine, and D. Lewin. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web. In ACM STOC, pages 654--663, 1997.

Digital Library

[10]

T. Koponen, M. Chawla, B.-G. Chun, A. Ermolinskiy, K. H. Kim, S. Shenker, and I. Stoica. A Data-Oriented (and Beyond) Network Architecture. In ACM SIGCOMM '07, Kyoto, Japan, Aug. 2007.

Digital Library

[11]

N. Laoutaris, G. Zervas, A. Bestavros, and G. Kollios. The cache inference problem and its application to content and request routing. In IEEE INFOCOM, 2007.

Digital Library

[12]

Z. Li and G. Simon. Time-shifted tv in content centric networks: The case for cooperative in-network caching. In IEEE ICC, 2011.

[13]

A. Narayanan and D. Oran. Content Routing using Internet Routing Protocols: Can it scale? IETF-82, ICNRG BAR BOF, November 2011. URL: http://trac.tools.ietf.org/group/irtf/trac/wiki/icnrg.

[14]

E. J. Rosensweig and J. Kurose. Breadcrumbs: Efficient, best-effort content location in cache networks. In IEEE INFOCOM, 2009.

[15]

D. Thaler and C. V. Ravishankar. Using name-based mappings to increase hit rates. IEEE/ACM Trans. Networking, 6(1):1--14.

Digital Library

[16]

M. Varvello, I. Rimac, and U. Lee. On the design of content-centric manets. 2011.

[17]

Y. Wang and K. Lee. Advertising cached contents in the control plane: Necessity and feasibility. In IEEE INFOCOM, NOMEN Workshop, 2012.

Cited By

Hayamizu YYamamoto M(2024)Adaptability of Breadcrumbs Routing to Geographical Locality of Content Popularity in Information Centric NetworksIEICE Transactions on Communications10.23919/transcom.2024EBP3085E107-B:11(719-727)Online publication date: Nov-2024
https://doi.org/10.23919/transcom.2024EBP3085
Kohama KKamiyama N(2022)Scalable Naming in ICN2022 IEEE 8th World Forum on Internet of Things (WF-IoT)10.1109/WF-IoT54382.2022.10152095(1-6)Online publication date: 26-Oct-2022
https://doi.org/10.1109/WF-IoT54382.2022.10152095
Pal AKant K(2021)A Neighborhood Aware Caching and Interest Dissemination Scheme for Content Centric NetworksIEEE Transactions on Network and Service Management10.1109/TNSM.2021.307932618:3(3900-3917)Online publication date: Sep-2021
https://doi.org/10.1109/TNSM.2021.3079326
Show More Cited By

Index Terms

Exploit the known or explore the unknown?: hamlet-like doubts in ICN
1. Networks
  1. Network protocols
    1. Network layer protocols
      1. Routing protocols
  2. Network types
    1. Packet-switching networks

Recommendations

INFORM: a dynamic interest forwarding mechanism for information centric networking
ICN '13: Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking

Information Centric Networking is a new communication paradigm where network primitives are based on named-data rather than host identifiers. In ICN, data retrieval is triggered by user requests which are forwarded towards a copy of the desired content ...
N-DISE: NDN-based data distribution for large-scale data-intensive science
ICN '22: Proceedings of the 9th ACM Conference on Information-Centric Networking

To meet unprecedented challenges faced by the world's largest data- and network-intensive science programs, we design and implement a new, highly efficient and field-tested data distribution, caching, access and analysis system for the Large Hadron ...
Scaled VIP Algorithms for Joint Dynamic Forwarding and Caching in Named Data Networks
ACM-ICN '16: Proceedings of the 3rd ACM Conference on Information-Centric Networking

Emerging Information-Centric Networking (ICN) architectures seek to optimally utilize both bandwidth and storage for efficient content distribution over the network. The Virtual Interest Packet (VIP) framework has been proposed to enable joint design of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICN '12: Proceedings of the second edition of the ICN workshop on Information-centric networking

August 2012

106 pages

ISBN:9781450314794

DOI:10.1145/2342488

Program Chairs:
Dirk Kutscher
NEC Laboratories Europe
,
Börje Ohlman
Ericsson Research
,
Ignacio Solis
Palo Alto Research Center

Copyright © 2012 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 August 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGCOMM '12

Sponsor:

SIGCOMM

SIGCOMM '12: ACM SIGCOMM 2012 Conference

August 17, 2012

Helsinki, Finland

Acceptance Rates

Overall Acceptance Rate 133 of 482 submissions, 28%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

58
Total Citations
View Citations
549
Total Downloads

Downloads (Last 12 months)82
Downloads (Last 6 weeks)5

Reflects downloads up to 09 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Hayamizu YYamamoto M(2024)Adaptability of Breadcrumbs Routing to Geographical Locality of Content Popularity in Information Centric NetworksIEICE Transactions on Communications10.23919/transcom.2024EBP3085E107-B:11(719-727)Online publication date: Nov-2024
https://doi.org/10.23919/transcom.2024EBP3085
Kohama KKamiyama N(2022)Scalable Naming in ICN2022 IEEE 8th World Forum on Internet of Things (WF-IoT)10.1109/WF-IoT54382.2022.10152095(1-6)Online publication date: 26-Oct-2022
https://doi.org/10.1109/WF-IoT54382.2022.10152095
Pal AKant K(2021)A Neighborhood Aware Caching and Interest Dissemination Scheme for Content Centric NetworksIEEE Transactions on Network and Service Management10.1109/TNSM.2021.307932618:3(3900-3917)Online publication date: Sep-2021
https://doi.org/10.1109/TNSM.2021.3079326
Yang XZhang CChen CLiang H(2020)Community Preference-Based Information-Centric Networking Cache2020 16th International Conference on Mobility, Sensing and Networking (MSN)10.1109/MSN50589.2020.00109(654-658)Online publication date: Dec-2020
https://doi.org/10.1109/MSN50589.2020.00109
Zhang MHao BWang RWang Y(2020)A Pre-Caching Strategy Based on the Content Relevance of Smart Device’s Request in Information-Centric IoTIEEE Access10.1109/ACCESS.2020.29889268(75761-75771)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.2988926
MIYOSHI JKAWAUCHI SBANDAI MYAMAMOTO M(2019)Congestion Control for Multi-Source Content Retrieval in Content Centric NetworksIEICE Transactions on Communications10.1587/transcom.2018EIP0001E102.B:9(1832-1841)Online publication date: 1-Sep-2019
https://doi.org/10.1587/transcom.2018EIP0001
HAYAMIZU YSHIBUYA AYAMAMOTO M(2019)The Combination Effect of Cache Decision and Off-Path Cache Routing in Content Oriented NetworksIEICE Transactions on Communications10.1587/transcom.2018EBP3170E102.B:5(1010-1018)Online publication date: 1-May-2019
https://doi.org/10.1587/transcom.2018EBP3170
Pfender JValera ASeah W(2019)Easy as ABCProceedings of the 6th ACM Conference on Information-Centric Networking10.1145/3357150.3357405(100-111)Online publication date: 24-Sep-2019
https://dl.acm.org/doi/10.1145/3357150.3357405
Hu XZheng SZhao LCheng GGong J(2019)Exploration and Exploitation of Off-path Cached Content in Network Coding Enabled Named Data Networking2019 IEEE 27th International Conference on Network Protocols (ICNP)10.1109/ICNP.2019.8888053(1-6)Online publication date: Oct-2019
https://doi.org/10.1109/ICNP.2019.8888053
Shan SFeng CZhang TLoo J(2019)Proactive Caching Placement for Arbitrary Topology With Multi-Hop Forwarding in ICNIEEE Access10.1109/ACCESS.2019.29470647(149117-149131)Online publication date: 2019
https://doi.org/10.1109/ACCESS.2019.2947064
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents