Making paths explicit in the Scout operating system
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
Route servers for inter-domain routing
Computer Networks and ISDN Systems
Router plugins: a software architecture for next-generation routers
IEEE/ACM Transactions on Networking (TON)
ACM Transactions on Computer Systems (TOCS)
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
Analysis of the parallel packet switch architecture
IEEE/ACM Transactions on Networking (TON)
NIRA: a new Internet routing architecture
FDNA '03 Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
Declarative routing: extensible routing with declarative queries
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Implementing declarative overlays
Proceedings of the twentieth ACM symposium on Operating systems principles
Design and implementation of a routing control platform
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Fully-Distributed and highly-parallelized implementation model of BGP4 based on clustered routers
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
PetaStar: a petabit photonic packet switch
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
The scalable architecture is one of the key issues of the next generation routers. The distributed routing protocol computing model is one of the most difficult challenges on the router control plane. This paper studies the route processing model of BGP, which has been deployed in backbone widely. A tree-based distributed computing model is discovered, based on the inherent parallel features of BGP. The model is described in two structures for two different system configurations. And the related algorithms are given. The performance promotion is analyzed theoretically. Finally, the promotion is proved by experiments.