Cited By
View all- Lal KKumar A(2017)An Efficient Lookup Search and Forwarding Mechanism for Information-Centric Networking (ICN)Arabian Journal for Science and Engineering10.1007/s13369-017-2903-643:12(6849-6861)Online publication date: 5-Nov-2017
Directed-Propagation Link-State Routing Protocol for Information-Centric Networks
Pages 56 - 61
Abstract
This paper presents the design of Directed-Propagation Link-State Routing Protocol (DPLSR), which tries to address the issue of prefix flooding storm in NDN Link-state Routing Protocol. Since the number of data object is several order of magnitude of that of routers, legacy Link State Advertisements (LSAs) flooding model is no more appropriate in NDN. This paper proposes a LSA directed-propagation scheme that LSA messages are only forwarded towards Root anchor, not flooding. Upon requesting a data object, a Look-up message is sent towards Root anchor. When it encounters a router with accroding anchor and prefix information, an anchor list is returned. Users are able to access the nearest copy or build one or multi-path connections to the anchors. In DPLSR, messages are propagated along some paths, and only parts of router store prefix and anchor information. Thus, the communication overhead and prefix storage are reduced significantly compared with the existing NDN routing protocols. Simulated experiments also verifies the performance gain of DPLSR.
References
[1]
Content centric networking project (ccn). http://www.ccnx.org.
[2]
Geant project website. http://www.geant.net/.
[3]
Named data network project. http://www.named-data.net/.
[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 Proceedings of the second edition of the ICN workshop on Information-centric networking, pages 7--12. ACM, 2012.
[5]
J. J. Garcia-Luna-Aceves. Name-based content routing in information centric networks using distance information. In Proceedings of the 1st international conference on Information-centric networking, pages 7--16. ACM, 2014.
[6]
E. Hemmati and J. Garcia-Luna-Aceves. A new approach to name-based link-state routing for information-centric networks. In Proceedings of the 2nd International Conference on Information-Centric Networking, pages 29--38. ACM, 2015.
[7]
A. Hoque, S. O. Amin, A. Alyyan, B. Zhang, L. Zhang, and L. Wang. Nlsr: named-data link state routing protocol. In Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking, pages 15--20. ACM, 2013.
[8]
D. Rossi and G. Rossini. Caching performance of content centric networks under multi-path routing (and more). Relatório técnico, Telecom ParisTech, 2011.
[9]
M. Tortelli, L. A. Grieco, and G. Boggia. Performance assessment of routing strategies in named data networking. In IEEE ICNP, 2013.
- Directed-Propagation Link-State Routing Protocol for Information-Centric Networks
Recommendations
A New Approach to Name-Based Link-State Routing for Information-Centric Networks
ACM-ICN '15: Proceedings of the 2nd ACM Conference on Information-Centric NetworkingThe Link State Content Routing (LSCR) protocol is presented, which supports routing over multiple paths to named content using link-state information. LSCR uses two types of link-state advertisements (LSAs): a RouterLSA that contains information about ...
Name-based content routing in information centric networks using distance information
ACM-ICN '14: Proceedings of the 1st ACM Conference on Information-Centric NetworkingThe Distance-based Content Routing (DCR) protocol is introduced, which enables routers to maintain multiple loop-free routes to the nearest instances of a named data object or name prefix in an information centric network (ICN), and establish content ...
Scalable routing for tag-based information-centric networking
ACM-ICN '14: Proceedings of the 1st ACM Conference on Information-Centric NetworkingRouting in information-centric networking remains an open problem. The main issue is scalability. Traditional IP routing can be used with name prefixes, but it is believed that the number of prefixes will grow too large. A related problem is the use of ...
Comments
Information & Contributors
Information
Published In
June 2016
126 pages
ISBN:9781450341813
DOI:10.1145/2935663
Copyright © 2016 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]
In-Cooperation
- AsiaFI: Asia Future Internet
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 15 June 2016
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Funding Sources
Conference
CFI '16
CFI '16: The 11th International Conference on Future Internet Technologies
June 15 - 17, 2016
Nanjing, China
Acceptance Rates
Overall Acceptance Rate 29 of 55 submissions, 53%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 118Total Downloads
- Downloads (Last 12 months)4
- Downloads (Last 6 weeks)1
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
Cited By
View all- Lal KKumar A(2017)An Efficient Lookup Search and Forwarding Mechanism for Information-Centric Networking (ICN)Arabian Journal for Science and Engineering10.1007/s13369-017-2903-643:12(6849-6861)Online publication date: 5-Nov-2017
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in