Unmanaged Internet Protocol: taming the edge network management crisis
ACM SIGCOMM Computer Communication Review
Measurement based characterization and provisioning of IP VPNs
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Scaling IP Routing with the Core Router-Integrated Overlay
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Configuration management at massive scale: system design and experience
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
Making routers last longer with ViAggre
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Building scalable virtual routers with trie braiding
INFOCOM'10 Proceedings of the 29th conference on Information communications
Multi-VPN optimization for scalable routing via relaying
IEEE/ACM Transactions on Networking (TON)
Demystifying configuration challenges and trade-offs in network-based ISP services
Proceedings of the ACM SIGCOMM 2011 conference
Efficient trie braiding in scalable virtual routers
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Enterprise customers are increasingly adopting MPLS (Multiprotocol Label Switching) VPN (Virtual Private Network) service that offers direct any-to-any reachability among the customer sites via a provider network. Unfortunately this direct reachability model makes the service provider's routing tables grow very large as the number of VPNs and the number of routes per customer increase. As a result, router memory in the provider's network has become a key bottleneck in provisioning new customers. This paper proposes Relaying, a scalable VPN routing architecture that the provider can implement simply by modifying the configuration of routers in the provider network, without requiring changes to the router hardware and software. Relaying substantially reduces the memory footprint of VPNs by choosing a small number of hub routers in each VPN that maintain full reachability information, and by allowing non-hub routers to reach other routers through a hub. Deploying Relaying in practice, however, poses a challenging optimization problem that involves minimizing router memory usage by having as few hubs as possible, while limiting the additional latency due to indirect delivery via a hub. We first investigate the fundamental tension between the two objectives and then develop algorithms to solve the optimization problem by leveraging some unique properties of VPNs, such as sparsity of traffic matrices and spatial locality of customer sites. Extensive evaluations using real traffic matrices, routing configurations, and VPN topologies demonstrate that Relaying is very promising and can reduce routing-table usage by up to 90%, while increasing the additional distances traversed by traffic by only a few hundred miles, and the backbone bandwidth usage by less than 10%.