A Highly-efficient Approach of Parallel Access to Routing Table on TBGP  

作　　者：GAO Lei LAI Mingche GONG Zhenghu 

机构地区：[1]Department of Computer, National University of Defense Technology, Changsha 410073, China

出　　处：《Chinese Journal of Electronics》2010年第1期13-17,共5页电子学报（英文版）

基　　金：This work is supported by the National Basic Research Program of China （No.2003CB314802）, the National Hight Technology Research and Decelopment Program of China （No.2008AA01A325） and the National Natural Science Foundation of China （No.60803153）.

摘　　要：The urgent requirement for the highefficiency of routing protocol on Internet will be satisfied by exploiting the Threaded border gateway protocol （TBGP） on multicores. Since TBGP performance is restricted by a mass of contentions when accessing routing table, an efficient parallel access approach is proposed to achieve the ultra-high route processing. This paper presents a novel routing table structure including two-level tries,and a heuristic-based divide-and-recombine algorithm is devised to balance the accesses and release the contentions by multi-threading. Experimental results on Intel Xeon server show that the parallel access contentions under different thread configurations decrease by 98.77% averagely. Meanwhile,the maximal update time per thread is obviously reduced and the throughput of update message is improved by 153% delivering significant performance improvement of BGP.

关 键 词：Threaded border gateway protocol（TBGP） PROTOCOL Parallel access Routing table. 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论] TP393[自动化与计算机技术—计算机科学与技术]