Research on CFR algorithm for Internet
At first vast data were counted, then the small world and scale-free character in Internet was computed and analyzed. Based on those a new searching method for Internet resources was put forward –the connection first routing （CFR）. This method made the best use of the characters, which were the aver...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2006-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/74660058/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841537393324195840 |
|---|---|
| author | ZHANG Xin1 ZHAO Hai1 ZHANG Wen-bo2 LI Chao1 |
| author_facet | ZHANG Xin1 ZHAO Hai1 ZHANG Wen-bo2 LI Chao1 |
| author_sort | ZHANG Xin1 |
| collection | DOAJ |
| description | At first vast data were counted, then the small world and scale-free character in Internet was computed and analyzed. Based on those a new searching method for Internet resources was put forward –the connection first routing （CFR）. This method made the best use of the characters, which were the average shortest path between nodes and existing a few nodes with huge connection degree in Internet. So it could realize an efficient search for Internet resources. Finally by implementing Internet topology creator and conducting emulation experiments, the method was verified to be highly efficient, less time consumption and less network load. |
| format | Article |
| id | doaj-art-72d3e5a795e84b91ba744b9b18fcc25d |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2006-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-72d3e5a795e84b91ba744b9b18fcc25d2025-01-14T08:37:38ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2006-01-01586574660058Research on CFR algorithm for InternetZHANG Xin1ZHAO Hai1ZHANG Wen-bo2LI Chao1At first vast data were counted, then the small world and scale-free character in Internet was computed and analyzed. Based on those a new searching method for Internet resources was put forward –the connection first routing （CFR）. This method made the best use of the characters, which were the average shortest path between nodes and existing a few nodes with huge connection degree in Internet. So it could realize an efficient search for Internet resources. Finally by implementing Internet topology creator and conducting emulation experiments, the method was verified to be highly efficient, less time consumption and less network load.http://www.joconline.com.cn/zh/article/74660058/small worldscale-freeCFR |
| spellingShingle | ZHANG Xin1 ZHAO Hai1 ZHANG Wen-bo2 LI Chao1 Research on CFR algorithm for Internet Tongxin xuebao small world scale-free CFR |
| title | Research on CFR algorithm for Internet |
| title_full | Research on CFR algorithm for Internet |
| title_fullStr | Research on CFR algorithm for Internet |
| title_full_unstemmed | Research on CFR algorithm for Internet |
| title_short | Research on CFR algorithm for Internet |
| title_sort | research on cfr algorithm for internet |
| topic | small world scale-free CFR |
| url | http://www.joconline.com.cn/zh/article/74660058/ |
| work_keys_str_mv | AT zhangxin1 researchoncfralgorithmforinternet AT zhaohai1 researchoncfralgorithmforinternet AT zhangwenbo2 researchoncfralgorithmforinternet AT lichao1 researchoncfralgorithmforinternet |