Fully-Distributed and highly-parallelized implementation model of BGP4 based on clustered routers

Authors:
Xiao-Zhe Zhang;Pei-dong Zhu;Xi-cheng Lu
Affiliations:
School of Computer, National University of Defense Technology, Changsha, China;School of Computer, National University of Defense Technology, Changsha, China;School of Computer, National University of Defense Technology, Changsha, China
Venue:
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Year:
2005

Citing 2
Cited 3

Internet routing instability

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Parallel Routing Table Computation for Scalable IP Routers

CANPC '98 Proceedings of the Second International Workshop on Network-Based Parallel Computing: Communication, Architecture, and Applications

A Canonical Multicore Architecture for Network Routers

Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems
A tree-based distributed model for BGP route processing

HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
ARS: an synchronization algorithm maintaining single image among nodes' forwarding tables of clustered router

ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing

Quantified Score

Hi-index	0.02

Visualization

Abstract

With the explosive growth of the service providers topologies, the size of routing table and number of routing sessions have experienced a sharp increase, which makes the scaling of BGP implementation in backbone routers a rather stressing problem. Clustered router is a promising architecture in terms of forwarding capability. But traditional BGP implementation, based on single-processor architecture cannot utilize the distributed computing and memory resources to enhance the protocol's performance. Borrowing the idea of team working from Multi-Agent technology, this paper proposes a new fully-distributed and highly-parallelized implementation model of BGP, which gives equal chance to each routing node of the cluster to participate in routing selection and stores route entries among routing nodes. Chief algorithms are presented related with session dispatch and partition of prefixes computing and storage. Theory analysis and experiment show that the algorithm can achieve linear speedup over central control model and increase system reliability greatly.