A Highly-effcient Approach of Parallel Access toRouting Table on TBGP
-
Graphical Abstract
-
Abstract
The urgent requirement for the high-
e±ciency of routing protocol on Internet will be satis¯ed 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
e±cient 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 de-
vised to balance the accesses and release the contentions
by multi-threading. Experimental results on Intel Xeon
server show that the parallel access contentions under dif-
ferent thread con¯gurations decrease by 98.7% averagely.
Meanwhile, the maximal update time per thread is obvi-
ously reduced and the throughput of update message is
improved by 153%, delivering signi¯cant performance improvement of BGP.
-
-
DownLoad: