research-article

Pro-Diluvian: Understanding Scoped-Flooding for Content Discovery in Information-Centric Networking

Authors:

Jussi Kangasharju,

Arjuna Sathiaseelan,

Jon CrowcroftAuthors Info & Claims

ACM-ICN '15: Proceedings of the 2nd ACM Conference on Information-Centric Networking

Pages 9 - 18

https://doi.org/10.1145/2810156.2810162

Published: 30 September 2015 Publication History

Abstract

Scoped-flooding is a technique for content discovery in a broad networking context. This paper investigates the effects of scoped-flooding on various topologies in information- centric networking. Using the proposed ring model, we show that flooding can be constrained within a very small neighbourhood to achieve most of the gains which come from areas where the growth rate is relatively low, i.e., the net- work edge. We also study two flooding strategies and com- pare their behaviours. Given that caching schemes favour more popular items in competition for cache space, popular items are expected to be stored in diverse parts of the network compared to the less popular items. We propose to exploit the resulting divergence in availability along with the routers' topological properties to fine tune the flooding radius. Our results shed light on designing efficient con- tent discovery mechanism for future information-centric net- works.

References

[1]

V. Jacobson, et al., "Networking named content," in Proceedings of the 5th ACM Conext. ACM, 2009.

Digital Library

[2]

C. Dannewitz, et al., "Netinf - an information-centric networking architecture," Comput. Commun., 2013.

Digital Library

[3]

M. D'Ambrosio, et al., "MDHT: a hierarchical name resolution service for information-centric networks," in ACM SIGCOMM workshop on ICN, ACM, 2011.

Digital Library

[4]

D. Trossen, et al., "PURSUIT conceptual architecture: pinciples, patterns and sub-components descriptions," 2011.

[5]

T. Koponen, et al., "A data-oriented (and beyond) network architecture," Comput. Commun. Rev., 2007.

Digital Library

[6]

D. G. Thaler, et al., "Using name-based mappings to increase hit rates," Transactions on Networking, 1998.

Digital Library

[7]

L. Wang, et al., "MobiCCN: Mobility support with greedy routing in Content-Centric Networks," in Globecom, 2013.

[8]

S. Roos, et al., "Enhancing Compact Routing in CCN with Prefix Embedding and Topology-aware Hashing," in Mobicom workshop on MobiArch'14, 2014.

Digital Library

[9]

M. Varvello, et al., "On the design of content-centric MANETs," in WONS, 2011.

[10]

W. Wong, et al., "Neighborhood search and admission control in cooperative caching networks," in Globecom, IEEE, 2012.

[11]

P. Eugster, et al., "Epidemic information dissemination in distributed systems," Computer, 2004.

Digital Library

[12]

S. Traverso, et al., "Temporal locality in today's content caching: why it matters and how to model it," Computer Communication Review, ACM, 2013.

Digital Library

[13]

E. Baccelli, et al., "Information centric networking in the IoT: Experiments with NDN in the wild," in ICN'14.

Digital Library

[14]

PARC, "CCNx 1.0 protocol specifications," 2014.

[15]

M. Badov, et al., "Congestion-aware caching and search in information-centric networks," in ICN'14.

Digital Library

[16]

R. Chiocchetti, et al.,"Exploit the known or explore the unknown? Hamlet-like doubts in ICN," in ICN'12.

Digital Library

[17]

J. Garcia-Luna-Aceves, "Name-based content routing in information centric networks using distance information," in ICN'14, ACM, 2014.

Digital Library

[18]

Q. Lv, et al., "Search and replication in unstructured peer-to-peer networks," in ICS'02, ACM, 2002.

Digital Library

[19]

H. Barjini, et al., "Shortcoming, problems and analytical comparison for flooding-based search techniques in unstructured P2P networks," P2P Netw. and Appl., 2012.

[20]

J. Hassan, et al., "Optimising expanding ring search for multi-hop wireless networks," in GLOBECOM'04.

[21]

J. Deng, et al., "On search sets of expanding ring search in wireless networks," Ad Hoc Netw., 2008.

Digital Library

[22]

M. Newman, "Random graphs as models of networks", Wiley, 2003.

[23]

S. Bornholdt, et al., "Handbook of graphs and networks", Wiley, 2003.

Digital Library

[24]

M. Molloy, et al., "A critical point for random graphs with a given degree sequence," Random Struct. Algorithms, 1995.

Digital Library

[25]

S. L. Feld, "Why your friends have more friends than you do," The American Journal of Sociology, 1991.

[26]

S. Hoory, et al., "Expander graphs and their applications", Bulletin of the American Mathematical Society, 2006.

[27]

N. Spring, et al., "Measuring ISP topologies with Rocketfuel," in SIGCOMM, ACM, 2002.

Digital Library

[28]

D. Vega, et al., "Topology patterns of a community network: Guifi.net," in WiMob, IEEE, 2012.

Digital Library

[29]

R. Hekmat, et al., "Connectivity in wireless ad-hoc networks with a log-normal radio model," Mob. Netw. Appl., 2006.

Digital Library

[30]

E. Yoneki, et al., "Distinct types of hubs in human dynamic networks," in Social Network Systems, 2008.

Digital Library

[31]

A. Clauset, et al., "Power-law distributions in empirical data," SIAM review, 2009.

Digital Library

[32]

E. Hyyti\"a, et al., "Searching a needle in (linear) opportunistic networks," in MSWiM '14, ACM, 2014.

Digital Library

[33]

M. Cha, et al., "I tube, you tube, everybody tubes: analyzing the world's largest user generated content video system," in IMC'07, ACM, 2007.

Digital Library

[34]

A. Dabirmoghaddam, et al., "Understanding optimal caching and opportunistic caching at "the edge" of information-centric networks," in ICN'14, 2014.

Digital Library

[35]

M. Lee, et al., "Content discovery for information -centric networking," Computer Networks, 2014.

Digital Library

[36]

N. Chang, et al., "Controlled flooding search in a large network," Transactions on Networking, 2007.

Digital Library

[37]

G. Rossini, et al., "Coupling caching and forwarding: Benefits, analysis, and implementation," in ICN'14.

Digital Library

[38]

C. Liu, et al., "An optimal probabilistic forwarding protocolin delay tolerant networks," in MobiHoc'09.

Digital Library

[39]

J. Broch, et al., "The dynamic source routing protocol for mobile ad hoc networks," IETF draft, 1999.

[40]

C. Perkins, et al., "Ad-hoc on-demand distance vector routing," in WMCSA'99, 1999.

Digital Library

[41]

A. Sathiaseelan, et al., "SCANDEX: Service Centric Networking for Challenged Decentralised Networks," in Mobisys workshop on DIYNet, 2015.

Digital Library

[42]

L. Wang, et al., "Effects of Cooperation Policy and Network Topology on Performance of In-Network Caching," in Communications Letters, IEEE, 2014.

Cited By

Kondo DAnsquer TTanigawa YTode H(2024)Resource Breadcrumbs: Discovering Edge Computing Resources Over Named Data NetworkingIEEE Transactions on Network and Service Management10.1109/TNSM.2024.338159121:3(3305-3316)Online publication date: 1-Jun-2024
https://dl.acm.org/doi/10.1109/TNSM.2024.3381591
Rene SPavlou GAscigil O(2023)Scalable Content-centric Routing for Hybrid ICN2023 IEEE 29th International Symposium on Local and Metropolitan Area Networks (LANMAN)10.1109/LANMAN58293.2023.10189421(1-6)Online publication date: 10-Jul-2023
https://doi.org/10.1109/LANMAN58293.2023.10189421
Lebre ANédelec BVan Kempen A(2023)AS-cast: Lock Down the Traffic of Decentralized Content Indexing at the EdgeAlgorithms and Architectures for Parallel Processing10.1007/978-3-031-22677-9_23(433-454)Online publication date: 11-Jan-2023
https://doi.org/10.1007/978-3-031-22677-9_23
Show More Cited By

Index Terms

Pro-Diluvian: Understanding Scoped-Flooding for Content Discovery in Information-Centric Networking
1. Computing methodologies
  1. Modeling and simulation
    1. Model development and analysis
      1. Modeling methodologies
2. Networks
  1. Network protocols

Recommendations

Content discovery for information-centric networking

The information-centric networking (ICN) adopts a content name as a network identifier and utilizes in-network storages to cache the contents. With the name-based routing and content caching, ICN can provide substantial benefits such as faster content ...
Using a Network Analysis Approach for Organizing Social Bookmarking Tags and Enabling Web Content Discovery

This article describes an innovative approach to reorganizing the tag space generated by social bookmarking services. The objective of this work is to enable effective search and discovery of Web content using social bookmarking tags. Tags are metadata ...
Performance analysis of in-network caching for content-centric networking

With the explosion of multimedia content, Internet bandwidth is wasted by repeated downloads of popular content. Recently, Content-Centric Networking (CCN), or the so-called Information-Centric Networking (ICN), has been proposed for efficient content ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ACM-ICN '15: Proceedings of the 2nd ACM Conference on Information-Centric Networking

September 2015

236 pages

ISBN:9781450338554

DOI:10.1145/2810156

General Chair:
Ignacio Solis
PARC, USA
,
Program Chairs:
Antonio Carzaniga
USI, Switzerland
,
K. K. Ramakrishnan
UC Riverside, USA

Copyright © 2015 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: 30 September 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Badges

Best Paper

Author Tags

Qualifiers

Research-article

Funding Sources

European Union's (EU) Horizon 2020 research and innovation programme: RIFE
European Union's (EU) Horizon 2020 research and innovation programme: UMOBILE

Conference

ICN'15

Sponsor:

SIGCOMM

ICN'15: 2nd International Conference on Information-Centric Networking

September 30 - October 2, 2015

California, San Francisco, USA

Acceptance Rates

ACM-ICN '15 Paper Acceptance Rate 18 of 55 submissions, 33%;

Overall Acceptance Rate 133 of 482 submissions, 28%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

41
Total Citations
View Citations
248
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)0

Reflects downloads up to 02 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Kondo DAnsquer TTanigawa YTode H(2024)Resource Breadcrumbs: Discovering Edge Computing Resources Over Named Data NetworkingIEEE Transactions on Network and Service Management10.1109/TNSM.2024.338159121:3(3305-3316)Online publication date: 1-Jun-2024
https://dl.acm.org/doi/10.1109/TNSM.2024.3381591
Rene SPavlou GAscigil O(2023)Scalable Content-centric Routing for Hybrid ICN2023 IEEE 29th International Symposium on Local and Metropolitan Area Networks (LANMAN)10.1109/LANMAN58293.2023.10189421(1-6)Online publication date: 10-Jul-2023
https://doi.org/10.1109/LANMAN58293.2023.10189421
Lebre ANédelec BVan Kempen A(2023)AS-cast: Lock Down the Traffic of Decentralized Content Indexing at the EdgeAlgorithms and Architectures for Parallel Processing10.1007/978-3-031-22677-9_23(433-454)Online publication date: 11-Jan-2023
https://doi.org/10.1007/978-3-031-22677-9_23
Jahanian MRamakrishnan K(2022)CoNICE: Consensus in Intermittently-Connected Environments by Exploiting Naming With Application to Emergency ResponseIEEE/ACM Transactions on Networking10.1109/TNET.2022.315610130:5(1926-1939)Online publication date: Oct-2022
https://doi.org/10.1109/TNET.2022.3156101
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
Dutta N(2022)An approach for FIB construction and Interest packet forwarding in information centric networkFuture Generation Computer Systems10.1016/j.future.2022.01.005130:C(269-278)Online publication date: 1-May-2022
https://dl.acm.org/doi/10.1016/j.future.2022.01.005
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
Corneo LMohan NZavodovski AWong WRohner CGunningberg PKangasharju J(2021)(How Much) Can Edge Computing Change Network Latency?2021 IFIP Networking Conference (IFIP Networking)10.23919/IFIPNetworking52078.2021.9472847(1-9)Online publication date: 21-Jun-2021
https://doi.org/10.23919/IFIPNetworking52078.2021.9472847
Suwannasa ABroadbent MMauthe A(2021)Effectiveness of Vicinity-based Content Finding in Mobile NDN Environments2021 International Conference on Information Networking (ICOIN)10.1109/ICOIN50884.2021.9333948(343-348)Online publication date: 13-Jan-2021
https://doi.org/10.1109/ICOIN50884.2021.9333948
Kondo DAnsquer TTanigawa YTode H(2021)Resource Discovery for Edge Computing over Named Data Networking2021 IEEE 45th Annual Computers, Software, and Applications Conference (COMPSAC)10.1109/COMPSAC51774.2021.00082(552-559)Online publication date: Jul-2021
https://doi.org/10.1109/COMPSAC51774.2021.00082
Show More Cited By

View Options

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten