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

The urgent requirement for the high-efficiency 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.7% 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.