On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
A comparison of scaling techniques for BGP
ACM SIGCOMM Computer Communication Review
BGP4: Inter-Domain Routing in the Internet
BGP4: Inter-Domain Routing in the Internet
Route oscillations in I-BGP with route reflection
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
BGP routing stability of popular destinations
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
An empirical study of router response to large BGP routing table load
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
IPv4 address allocation and the BGP routing table evolution
ACM SIGCOMM Computer Communication Review
Design and implementation of a routing control platform
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Scaling IP Routing with the Core Router-Integrated Overlay
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Making routers last longer with ViAggre
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Scalable routing on flat names
Proceedings of the 6th International COnference
Address-based route reflection
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
Mobility Management in Identifier/Locator Split Networks
Wireless Personal Communications: An International Journal
Percolation-based routing in the Internet
Journal of Systems and Software
Sequential aggregate signatures with lazy verification from trapdoor permutations
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
| Hi-index | 0.00 |
Running the Border Gateway Protocol (BGP), the Internet's interdomain routing protocol, consumes a large amount of memory. A BGP-speaking router typically stores one or more routes, each with multiple attributes, for more than 170,000 address blocks, and growing. When the router does not have enough memory to store a new route, it may crash or enter into other unspecified behavior, causing serious disruptions for the data traffic. In this paper, we propose a new mechanism for routers to handle memory limitations without modifying the underlying routing protocol and without negatively affecting convergence delay. Upon running out of memory, the router simply discards information about some alternate routes, and requests a "refresh" from its neighbors later if necessary. We present an optimal offline algorithm for deciding which alternate routes to evict, and explore the trade-off between memory size and refresh overhead using a large BGP message trace. Based on these promising results, we design and evaluate efficient online algorithms that achieve most of the performance benefits. We believe that our scheme can significantly improve the scalability and robustness of IP routers in the future.