By Topic

A distributed parallel approach for BGP routing table partitioning in next generation routers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hamzeh, W. ; NRL, Univ. of Montreal, Montreal, QC, Canada ; Hafid, A.

The rapid growth of routing tables represents a major challenge facing the scalability of BGP and indeed the whole Internet infrastructure. In this paper, we introduce a novel distributed algorithmic scheme for partitioning the BGP routing table on multiple controller cards, where we exploit parallelism to enhance both the lookup speed and the scalability of the RIB (Routing Information Base). The proposed scheme increases the lookup performance by letting unrelated tasks, such as the Best Match Prefix (BMP) lookup and the BGP decision process to be executed in parallel at different controller cards. Simulations show that our proposal outperforms classical central lookup mechanisms with a reasonably acceptable cost, while it increases considerably the space scalability of the BGP routing table.

Published in:

Local Computer Networks (LCN), 2010 IEEE 35th Conference on

Date of Conference:

10-14 Oct. 2010