research-article

Free access

INFORM: a dynamic interest forwarding mechanism for information centric networking

Authors:

Raffaele Chiocchetti,

Diego Perino,

Giovanna Carofiglio,

Dario Rossi,

Giuseppe RossiniAuthors Info & Claims

ICN '13: Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking

Pages 9 - 14

https://doi.org/10.1145/2491224.2491227

Published: 12 August 2013 Publication History

PDF eReader

Abstract

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 item. Data can be retrieved either from a server that permanently provides a content item,or from a temporary item copy opportunistically cached by an in-network node. As the availability of cached items dynamically varies over time, the request forwarding scheme should be adapted accordingly. In this paper we focus on dynamic request forwarding in ICN, and develop an approach, inspired by Q-routing framework, that we show to outperform algorithms currently available in the state of the art.

References

[1]

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

Google Scholar

[2]

B. Ahlgren, C Dannewitz, C. Imbrenda, D. Kutscher, and B. Ohlman. A survey of information-centric networking. IEEE Communications Magazine, 50(7):26--36, 2012.

Crossref

Google Scholar

[3]

J. A. Boyan and M. L. Littman. Packet routing in dynamically changing networks: A reinforcement learning approach. In Advances in Neural Information Processing Systems 6, pages 671--678. Morgan Kaufmann, 1994.

Google Scholar

[4]

R. Chiocchetti, D. Rossi, G. Rossini, G. Carofiglio,and D. Perino. Exploit the known or explore the unknown?: hamlet-like doubts in icn. In ACM SIGCOMM ICN, 2012.

Digital Library

Google Scholar

[5]

Edward Chlebus and Jordy Brazier. Nonstationary poisson modeling of web browsing session arrivals. Information Processing Letters, 102(5):187--190, 2007.

Digital Library

Google Scholar

[6]

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

Digital Library

Google Scholar

[7]

Littman M. Moore A.W. Pack Kaelbling, L. Reinforcement learning: a survey. Journal of Artificial Intelligence Research, 4:237--285, 1996.

Digital Library

Google Scholar

[8]

G. Rossini and D. Rossi. Evaluating ccn multi-path interest forwarding strategies. Computer Communications, 2013.

Digital Library

Google Scholar

[9]

L. Wang, A. K. M. Hoque, Cheng Yi, A. Alyyan, and B. Zhang. OSPFN: An OSPF based routing protocol for named data networking. Technical report, March 2012.

Google Scholar

[10]

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

Google Scholar

[11]

C. Yi, A. Afanasyev, I. Moiseenko, L. Wang, B. Zhang, and L. Zhang. A case for stateful forwarding plane. Computer Communications, 2013.

Digital Library

Google Scholar

Cited By

View all

Xu YNi HZhu X(2023)A Novel Multipath Transmission Scheme for Information-Centric NetworkingFuture Internet10.3390/fi1502008015:2(80)Online publication date: 17-Feb-2023
https://doi.org/10.3390/fi15020080
Tabei GIto YKimura THirata K(2023)Design of Multi-Armed Bandit-Based Routing for in-Network CachingIEEE Access10.1109/ACCESS.2023.330196111(82584-82600)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3301961
Abdi FAhmadi MGhanem M(2023)AM-IFFuture Generation Computer Systems10.1016/j.future.2023.06.021148:C(564-583)Online publication date: 1-Nov-2023
https://dl.acm.org/doi/10.1016/j.future.2023.06.021
Show More Cited By

Index Terms

INFORM: a dynamic interest forwarding mechanism for information centric networking
1. Networks
  1. Network protocols
  2. Network types
    1. Packet-switching networks

Recommendations

Exploit the known or explore the unknown?: hamlet-like doubts in ICN
ICN '12: Proceedings of the second edition of the ICN workshop on Information-centric networking

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 ...
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 ...
VIP: a framework for joint dynamic forwarding and caching in named data networks
ACM-ICN '14: Proceedings of the 1st ACM Conference on Information-Centric Networking

Emerging information-centric networking architectures seek to optimally utilize both bandwidth and storage for efficient content distribution. This highlights the need for joint design of traffic engineering and caching strategies, in order to optimize ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICN '13: Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking

August 2013

88 pages

ISBN:9781450321792

DOI:10.1145/2491224

Program Chairs:
Börje Ohlman
Ericsson Research
,
George C. Polyzos
AUEB & UCSD
,
Lixia Zhang
UCLA

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 the author(s) 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].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 August 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGCOMM'13

Sponsor:

SIGCOMM

SIGCOMM'13: ACM SIGCOMM 2013 Conference

August 12, 2013

Hong Kong, China

Acceptance Rates

ICN '13 Paper Acceptance Rate 20 of 57 submissions, 35%;

Overall Acceptance Rate 133 of 482 submissions, 28%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

82
Total Citations
View Citations
795
Total Downloads

Downloads (Last 12 months)94
Downloads (Last 6 weeks)27

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Xu YNi HZhu X(2023)A Novel Multipath Transmission Scheme for Information-Centric NetworkingFuture Internet10.3390/fi1502008015:2(80)Online publication date: 17-Feb-2023
https://doi.org/10.3390/fi15020080
Tabei GIto YKimura THirata K(2023)Design of Multi-Armed Bandit-Based Routing for in-Network CachingIEEE Access10.1109/ACCESS.2023.330196111(82584-82600)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3301961
Abdi FAhmadi MGhanem M(2023)AM-IFFuture Generation Computer Systems10.1016/j.future.2023.06.021148:C(564-583)Online publication date: 1-Nov-2023
https://dl.acm.org/doi/10.1016/j.future.2023.06.021
Fei YZhu HYin J(2023)Modeling and verifying NLSR protocol of NDN for CPS using UPPAALJournal of Software: Evolution and Process10.1002/smr.238435:7Online publication date: 2-Jul-2023
https://dl.acm.org/doi/10.1002/smr.2384
Akther NDhar KIqbal SHuda MAsaduzzaman (2022) Interest forwarding strategy in Named Data Networks (NDN) using Thompson SamplingJournal of Network and Computer Applications10.1016/j.jnca.2022.103458205:COnline publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1016/j.jnca.2022.103458
Abdi FAhmadi MGhanem M(2022)LA-MDPF: A forwarding strategy based on learning automata and Markov decision process in named data networkingFuture Generation Computer Systems10.1016/j.future.2022.03.038134(22-39)Online publication date: Sep-2022
https://doi.org/10.1016/j.future.2022.03.038
Iqbal SAsaduzzaman Hoque M(2022) A source‐driven probabilistic forwarding and caching strategy in NDN and SDN ‐based NDN International Journal of Communication Systems10.1002/dac.509335:6Online publication date: 22-Jan-2022
https://doi.org/10.1002/dac.5093
Dinh NKim Y(2021)An Efficient Content Store-Based Forwarding Scheme for Internet of ThingsSensors10.3390/s2122760721:22(7607)Online publication date: 16-Nov-2021
https://doi.org/10.3390/s21227607
Song YNi HZhu X(2021)An Enhanced Replica Selection Approach Based on Distance Constraint in ICNElectronics10.3390/electronics1004049010:4(490)Online publication date: 19-Feb-2021
https://doi.org/10.3390/electronics10040490
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

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Cited By

Index Terms

Recommendations

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

Scaled VIP Algorithms for Joint Dynamic Forwarding and Caching in Named Data Networks

VIP: a framework for joint dynamic forwarding and caching in named data networks