Binary search on range of IPv6 prefix sets
The general and special types of IPv6 routing algorithms were studied.Focusing on the imbalance problems in lookup and update process in routing algorithm,a novel method called BSRPS (binary search on range of prefix sets) was presented.By range-partition (K) and set-partition (M) on routing table (...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2013-06-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436X.2013.06.004/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539796247248896 |
|---|---|
| author | Yu CUI Zhi-hong TIAN GHong-li ZHAN Bin-xing FANG |
| author_facet | Yu CUI Zhi-hong TIAN GHong-li ZHAN Bin-xing FANG |
| author_sort | Yu CUI |
| collection | DOAJ |
| description | The general and special types of IPv6 routing algorithms were studied.Focusing on the imbalance problems in lookup and update process in routing algorithm,a novel method called BSRPS (binary search on range of prefix sets) was presented.By range-partition (K) and set-partition (M) on routing table (N),and self-recovery after updating,this method enhanced the lookup speed and reduced the impact of imbalance in updating.Time complexity in lookup and update process is O(log2N/K) and O(log2N/K+2M),and space complexity is O(K+2N) where N is the size of routing table.Experiment re-sults show that this method is efficient in lookup and reduces the impact of imbalance after updating effectively. |
| format | Article |
| id | doaj-art-34eaad8f9a244ccbb6f2df248879eed7 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2013-06-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-34eaad8f9a244ccbb6f2df248879eed72025-01-14T06:35:25ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2013-06-0134293759672598Binary search on range of IPv6 prefix setsYu CUIZhi-hong TIANGHong-li ZHANBin-xing FANGThe general and special types of IPv6 routing algorithms were studied.Focusing on the imbalance problems in lookup and update process in routing algorithm,a novel method called BSRPS (binary search on range of prefix sets) was presented.By range-partition (K) and set-partition (M) on routing table (N),and self-recovery after updating,this method enhanced the lookup speed and reduced the impact of imbalance in updating.Time complexity in lookup and update process is O(log2N/K) and O(log2N/K+2M),and space complexity is O(K+2N) where N is the size of routing table.Experiment re-sults show that this method is efficient in lookup and reduces the impact of imbalance after updating effectively.http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436X.2013.06.004/routeIPv6range of prefix setsself-recovery |
| spellingShingle | Yu CUI Zhi-hong TIAN GHong-li ZHAN Bin-xing FANG Binary search on range of IPv6 prefix sets Tongxin xuebao route IPv6 range of prefix sets self-recovery |
| title | Binary search on range of IPv6 prefix sets |
| title_full | Binary search on range of IPv6 prefix sets |
| title_fullStr | Binary search on range of IPv6 prefix sets |
| title_full_unstemmed | Binary search on range of IPv6 prefix sets |
| title_short | Binary search on range of IPv6 prefix sets |
| title_sort | binary search on range of ipv6 prefix sets |
| topic | route IPv6 range of prefix sets self-recovery |
| url | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436X.2013.06.004/ |
| work_keys_str_mv | AT yucui binarysearchonrangeofipv6prefixsets AT zhihongtian binarysearchonrangeofipv6prefixsets AT ghonglizhan binarysearchonrangeofipv6prefixsets AT binxingfang binarysearchonrangeofipv6prefixsets |