University of Cambridge > > Computer Laboratory Systems Research Group Seminar > A Dirty-slate Approach to Routing Scalability

A Dirty-slate Approach to Routing Scalability

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Eiko Yoneki.

The Internet routing table has been growing rapidly for the past few years. Further, as the IPv4 address space runs out, this growth will see substantial acceleration. Such routing table growth has several harmful implications, and led a recent Internet Architecture Board workshop to conclude that scaling the routing system is one of the most critical challenges of near-term Internet design. To this effect, there have been a number of proposals in the IETF and research community to address the problem through novel architectures.

This talk presents ViAggre (Virtual Aggregation), a ``configuration-only’’ approach to shrinking the routing table on routers. ViAggre does not require any changes to router software and routing protocols and can be deployed independently and autonomously by any ISP . ViAggre is effectively a scalability technique that allows an ISP to partition the global routing table such that individual routers in the ISP ’s network only maintain a fraction of the routing table. We find that ISPs today can use ViAggre to shrink the routing table on their routers by an order of magnitude. Beyond performance results, I will detail the deployment of ViAggre and show that ViAggre can also yield faster route convergence.

Bio: Hitesh Ballani has recently joined Microsoft Research Cambridge as a Researcher. He received a Ph.D. from Cornell University in 2009 and a B.Tech degree from IIT Roorkee, India in 2003. His research interests are in networked systems with his work striking a balance between clean-slate and dirty-slate proposals. Past projects include research in network management, routing, security and network architecture.

This talk is part of the Computer Laboratory Systems Research Group Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity