제목: ‘A Dirty-Slate Approach to Scaling BGP’
■ 연사: Paul Francis (a tenured faculty at the Max Planck Institute for Software Systems in Germany)
■ 일시: 4월 7일 화요일 오전11시~ 12시
■ 장소: 301동 520호
■요약:
It is generally accepted that a ‘clean slate’ redesign of the Internet isneeded to solve problems like routing scalability. Given that suchdesigns are unlikely to ever be deployed, we believe it is equally
important to find solutions that are economically attractive. In thistalk, we describe Virtual Aggregation, a technique that allows us toshrink hardware routing tables by at least an order-of-magnitude, thatrequires no changes to routing protocols or even to router software, and
that can be deployed autonomously by individual ISPs. The economicmotivation behind Virtual Aggregation is that it allows ISPs to extend thelifetime of their existing router base by years. We describe how Virtual
Aggregation works, show performance estimates based on a measurement studydone on a large Tier-1 ISP, and describe how this work has led to IETFproposals.
■약력:
Paul Francis is a tenured faculty at the Max Planck Institute for SoftwareSystems in Germany. Paul has held research positions at CornellUniversity, ACIRI, NTT Software Labs, Bellcore,and MITRE, and was Chief
Scientist at two Silicon Valley startups. Paul’s research centers aroundrouting and addressing problems in the Internet and P2P networks. Paul’sinnovations include NAT, shared-tree multicast, the first P2P multicast
system, the first DHT (as part of landmark routing), and VirtualAggregation.