A Leading Routing Mechanism for Neighbor Content Store
It is very easy for the nodes in named data networking to ignore the neighbor nodes. To solve this issue, a leading routing mechanism for neighbor content store was proposed. Firstly, through building the interest clusters, the nodes were partitioned to different reigns to announce the information o...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Beijing Xintong Media Co., Ltd
2014-04-01
|
| Series: | Dianxin kexue |
| Subjects: | |
| Online Access: | http://www.telecomsci.com/zh/article/doi/10.3969/j.issn.1000-0801.2014.04.007/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|