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!
|
| _version_ | 1841529367783538688 |
|---|---|
| author | Chuanzhen Du Julong Lan Ming Tian |
| author_facet | Chuanzhen Du Julong Lan Ming Tian |
| author_sort | Chuanzhen Du |
| collection | DOAJ |
| description | 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%. |
| format | Article |
| id | doaj-art-c9fe9e2f1a574d85bfaebc15dc42d918 |
| institution | Kabale University |
| issn | 1000-0801 |
| language | zho |
| publishDate | 2014-04-01 |
| publisher | Beijing Xintong Media Co., Ltd |
| record_format | Article |
| series | Dianxin kexue |
| spelling | doaj-art-c9fe9e2f1a574d85bfaebc15dc42d9182025-01-15T03:20:02ZzhoBeijing Xintong Media Co., LtdDianxin kexue1000-08012014-04-0130465359622248A Leading Routing Mechanism for Neighbor Content StoreChuanzhen DuJulong LanMing TianIt 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%.http://www.telecomsci.com/zh/article/doi/10.3969/j.issn.1000-0801.2014.04.007/named data networkingcontent routinginterest clusterneighbor content store |
| spellingShingle | Chuanzhen Du Julong Lan Ming Tian A Leading Routing Mechanism for Neighbor Content Store Dianxin kexue named data networking content routing interest cluster neighbor content store |
| title | A Leading Routing Mechanism for Neighbor Content Store |
| title_full | A Leading Routing Mechanism for Neighbor Content Store |
| title_fullStr | A Leading Routing Mechanism for Neighbor Content Store |
| title_full_unstemmed | A Leading Routing Mechanism for Neighbor Content Store |
| title_short | A Leading Routing Mechanism for Neighbor Content Store |
| title_sort | leading routing mechanism for neighbor content store |
| topic | named data networking content routing interest cluster neighbor content store |
| url | http://www.telecomsci.com/zh/article/doi/10.3969/j.issn.1000-0801.2014.04.007/ |
| work_keys_str_mv | AT chuanzhendu aleadingroutingmechanismforneighborcontentstore AT julonglan aleadingroutingmechanismforneighborcontentstore AT mingtian aleadingroutingmechanismforneighborcontentstore AT chuanzhendu leadingroutingmechanismforneighborcontentstore AT julonglan leadingroutingmechanismforneighborcontentstore AT mingtian leadingroutingmechanismforneighborcontentstore |