Rank-Based Routing Strategy for Named Data Network

Xiao Zeng; Ze Hua Gao

doi:10.4028/www.scientific.net/AMM.543-547.3320

Paper Titles

Fully Secure Codes Based Tracing and Revoking Scheme with Constant Ciphertext
p.3300

Research on Functional Structure and Database Platform for Enterprise OA System
p.3308

Scheme Selection of Software Quality Based on Support Vector Machine
p.3312

The Design and Implementation of Resources Sharing System Based on the Cloud Computing
p.3316

Rank-Based Routing Strategy for Named Data Network
p.3320

Common Modeling Method for Simulation Training Software
p.3324

Research for Reusable Component Technology Base on Virtual Simulation System
p.3330

Wireless LAN Security Vulnerabilities and Improvement Measures
p.3335

A Test Case Reuse Strategy on GUI Software
p.3339

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 543-547Rank-Based Routing Strategy for Named Data Network

Rank-Based Routing Strategy for Named Data Network

Abstract:

NDN (Named Data Networking) is clean-slate architecture for future networking, in which packets carry data names rather than source or destination addresses, being a sharp contrast to today IP architecture. The default routing strategy for NDN is flooding the interest packets to all the possible interfaces which could reach for the data provider or data cache container. Obviously, the default routing strategy is not best way in the actual networking for the heavy load of routing items. This article proposes an interface rank-based routing strategy (RBRS), in which the PIT and FIB structures are detailed and expanded to satisfy the Interest and Data packets transmission, and the interfaces are ranked through a cumulative algorithm for route selection. Through the simulation, RBRS has been proved an adaptive routing mechanism with better performance of network load balance, while reducing the average routing hops and the centric nodes load.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 543-547)

Pages:

3320-3323

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.543-547.3320

Citation:

Cite this paper

Online since:

March 2014

Authors:

Xiao Zeng*, Ze Hua Gao

Keywords:

Cumulative Algorithm, Load Balance, NDN Routing, RBRS

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Zhang L X. Named data networking (ndn) project. PARC Technical Report, NDN-0001, (2010).

Google Scholar

[2] Jacobson V, Smetters D K, Thornton J D, et al. Networking named content. Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies(CoNEXT'09), Dec 1−4, 2009, Rome, Italy. New York, NY, USA: ACM, 2009: 12p.

DOI: 10.1145/1658939.1658941

Google Scholar

[3] Shanbhag, Shashank, et al. SoCCeR: Services over content-centric routing., ACM SIGCOMM Information-Centric Networking (ICN) workshop, Toronto, Canada. (2011).

DOI: 10.1145/2018584.2018600

Google Scholar

[4] ZHANG Y, HUANG T, LIU J, et al. Reverse-trace routing scheme in content centric networking [J]. The Journal of China Universities of Posts and Telecommunications, 2013, 20(5): 22-29.

DOI: 10.1016/s1005-8885(13)60085-0

Google Scholar

[5] Yi, Cheng, et al. Adaptive forwarding in named data networking., ACM SIGCOMM Computer Communication Review 42. 3 (2012): 62-67.

DOI: 10.1145/2317307.2317319

Google Scholar