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!
|
| Summary: | 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 of content store. Secondly, the packets and the fast routing tables were designed. Finally, the best path was chosen to send the interest packets. The theoretical analysis and 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%. |
|---|---|
| ISSN: | 1000-0801 |