A leading routing mechanism for neighbor content store

Du Chuan-zhen; Zhang Yan; Lan Ju-long

Testbeds and Research Infrastructure: Development of Networks and Communities. 9th International ICST Conference, TridentCom 2014, Guangzhou, China, May 5-7, 2014, Revised Selected Papers

Research Article

A leading routing mechanism for neighbor content store

Download

660 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1007/978-3-319-13326-3_16,
    author={Du Chuan-zhen and Zhang Yan and Lan Ju-long},
    title={A leading routing mechanism for neighbor content store},
    proceedings={Testbeds and Research Infrastructure: Development of Networks and Communities. 9th International ICST Conference, TridentCom 2014, Guangzhou, China, May 5-7, 2014, Revised Selected Papers},
    proceedings_a={TRIDENTCOM},
    year={2014},
    month={11},
    keywords={NDN Content routing Interest cluster Neighbor content store},
    doi={10.1007/978-3-319-13326-3_16}
}

Du Chuan-zhen
Zhang Yan
Lan Ju-long
Year: 2014
A leading routing mechanism for neighbor content store
TRIDENTCOM
Springer
DOI: 10.1007/978-3-319-13326-3_16

Du Chuan-zhen¹, Zhang Yan¹^,*, Lan Ju-long¹

1: National Digital Switching System Engineering Technological R&D Center

*Contact email: duchzhen@126.com

Abstract

It is very easy for the nodes in Named Data Networking to ignore the neighbor nodes. To solve this issue, this paper proposes a leading routing mechanism for neighbor content store. Firstly, through building the interest clusters, the nodes are partitioned to different reigns to announce the information of content store. Secondly, the packets and the fast routing tables are designed. Finally, the best path is chosen to send the interest packets. The theoretical analysis and the simulation results show that this mechanism adequately uses the neighbor content and effectively decreases the average network delay. The server load is reduced by 30%.

Keywords: NDN Content routing Interest cluster Neighbor content store

Published: 2014-11-28

: http://dx.doi.org/10.1007/978-3-319-13326-3_16