IEICE TRANSACTIONS on Communications
SpliTable: Toward Routing Scalability through Distributed BGP Routing Tables
Summary :
The Internet has grown extremely fast in the last two decades. The number of routes to be supported by the routers has become very large. Moreover, the number of messages exchanged to distribute the routes has increased even faster. In this paper, we propose SpliTable, a scalable way to support the Internet routes in a Service Provider network. In our proposal, BGP route selection is done by distributed servers on behalf of the routers. They are called route selection servers. The selected routes are then stored in distributed routing tables. Each router maintains only its share of Internet routes, not the routes for each Internet prefix as it is the case today. We adapted the concept of Distributed Hash Tables (DHT) for that purpose. We show analytically that our proposal is more scalable in the number of routes supported in each router than current iBGP route distribution solutions. Moreover, the number of control messages exchanged with our proposal is bounded contrary to current sparse iBGP route distribution solutions which may never converge. We confirm these findings in an evaluation of a prototype implementation.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E94-B No.1 pp.64-76
- Publication Date
- 2011/01/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E94.B.64
- Type of Manuscript
- Special Section PAPER (IEICE/IEEE Joint Special Section on Autonomous Decentralized Systems Technologies and Their Application to Networked Systems)
- Category
- Scalability & Timeliness
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Akeo MASUDA, Cristel PELSSER, Kohei SHIOMOTO, "SpliTable: Toward Routing Scalability through Distributed BGP Routing Tables" in IEICE TRANSACTIONS on Communications,
vol. E94-B, no. 1, pp. 64-76, January 2011, doi: 10.1587/transcom.E94.B.64.
Abstract: The Internet has grown extremely fast in the last two decades. The number of routes to be supported by the routers has become very large. Moreover, the number of messages exchanged to distribute the routes has increased even faster. In this paper, we propose SpliTable, a scalable way to support the Internet routes in a Service Provider network. In our proposal, BGP route selection is done by distributed servers on behalf of the routers. They are called route selection servers. The selected routes are then stored in distributed routing tables. Each router maintains only its share of Internet routes, not the routes for each Internet prefix as it is the case today. We adapted the concept of Distributed Hash Tables (DHT) for that purpose. We show analytically that our proposal is more scalable in the number of routes supported in each router than current iBGP route distribution solutions. Moreover, the number of control messages exchanged with our proposal is bounded contrary to current sparse iBGP route distribution solutions which may never converge. We confirm these findings in an evaluation of a prototype implementation.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E94.B.64/_p
Copy
@ARTICLE{e94-b_1_64,
author={Akeo MASUDA, Cristel PELSSER, Kohei SHIOMOTO, },
journal={IEICE TRANSACTIONS on Communications},
title={SpliTable: Toward Routing Scalability through Distributed BGP Routing Tables},
year={2011},
volume={E94-B},
number={1},
pages={64-76},
abstract={The Internet has grown extremely fast in the last two decades. The number of routes to be supported by the routers has become very large. Moreover, the number of messages exchanged to distribute the routes has increased even faster. In this paper, we propose SpliTable, a scalable way to support the Internet routes in a Service Provider network. In our proposal, BGP route selection is done by distributed servers on behalf of the routers. They are called route selection servers. The selected routes are then stored in distributed routing tables. Each router maintains only its share of Internet routes, not the routes for each Internet prefix as it is the case today. We adapted the concept of Distributed Hash Tables (DHT) for that purpose. We show analytically that our proposal is more scalable in the number of routes supported in each router than current iBGP route distribution solutions. Moreover, the number of control messages exchanged with our proposal is bounded contrary to current sparse iBGP route distribution solutions which may never converge. We confirm these findings in an evaluation of a prototype implementation.},
keywords={},
doi={10.1587/transcom.E94.B.64},
ISSN={1745-1345},
month={January},}
Copy
TY - JOUR
TI - SpliTable: Toward Routing Scalability through Distributed BGP Routing Tables
T2 - IEICE TRANSACTIONS on Communications
SP - 64
EP - 76
AU - Akeo MASUDA
AU - Cristel PELSSER
AU - Kohei SHIOMOTO
PY - 2011
DO - 10.1587/transcom.E94.B.64
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E94-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2011
AB - The Internet has grown extremely fast in the last two decades. The number of routes to be supported by the routers has become very large. Moreover, the number of messages exchanged to distribute the routes has increased even faster. In this paper, we propose SpliTable, a scalable way to support the Internet routes in a Service Provider network. In our proposal, BGP route selection is done by distributed servers on behalf of the routers. They are called route selection servers. The selected routes are then stored in distributed routing tables. Each router maintains only its share of Internet routes, not the routes for each Internet prefix as it is the case today. We adapted the concept of Distributed Hash Tables (DHT) for that purpose. We show analytically that our proposal is more scalable in the number of routes supported in each router than current iBGP route distribution solutions. Moreover, the number of control messages exchanged with our proposal is bounded contrary to current sparse iBGP route distribution solutions which may never converge. We confirm these findings in an evaluation of a prototype implementation.
ER -
English
