Home // ICN 2012, The Eleventh International Conference on Networks // View article

How Many Cores Does Parallel BGP Need in a High-Speed Router

Authors:
Yaping Liu
Shuo Zhang
Zexin Lu
Baosheng Wang

Keywords: parallel BGP; speedup; multi-cores; performance; router.

Abstract:
The performance problem of BGP has raised great concerns both in industry and research. With rapid expansion of Internet, how to improve the performance of BGP to support more BGP neighbors in a high-speed router is a practical urgent problem. In this paper, we presented a Minimal Cores Computing (MCC) algorithm based on multi-root tree model to compute the minimal cores for parallel BGP in the context of the multi-cores platform. The algorithm is an approximation algorithm as the problem is a nonlinear programming problem. Simulation results show that MCC can get reasonable good speedup with minimal number of cores. MCC can give direction to the design of the control node in a core router.

Pages: 63 to 68

Copyright: Copyright (c) IARIA, 2012

Publication date: February 29, 2012

Published in: conference

ISSN: 2308-4413

ISBN: 978-1-61208-183-0

Location: Saint Gilles, Reunion

Dates: from February 29, 2012 to March 5, 2012