中文摘要：

对IPv6相关的通用型与特定型路由算法进行了分析，重点研究了以BSR为基础的IPv6路由算法在查找和更新时的不平衡问题，提出了基于前缀区间集合的IPv6路由算法。通过对路由前缀（Ⅳ）进行范围（K）、集合（J）lD划分以及更新节点自修复提高查询速度、降低不平衡性的影响，具有O（10g2N／K）和O（10g2N／K＋2M）的查询与更新时间复杂度，空间复杂度为D晖＋2忉。实验表明，该算法具有良好的查询性能，降低了更新不平衡性的影响。

英文摘要：

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 tookup 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.