Title: Routing in large networks despite Byzantine failures
Speaker: Radia Perlman Sun Fellow, Sun Microsystems Inc.
Time: 2008-04-03 11:00-2008-04-03 12:00
Venue: FIT Building 4-603, Tsinghua University

Abstract:

Routing resilient to Byzantine failures goes beyond securing the routing protocol itself. It is also essential to assure that packets get delivered. Perlman's thesis (NPBR) showed how to do this in a network small enough so that every router could keep track of all flows, and that paths are sufficiently short that a source can choose a nonfaulty path We show how to provide the same guarantees in a large hierarchical network. This is done in a way that no node needs state more than would be necessary to support its portion of the hierarchy and the source only needs to make a small number of choices to find a path. This work not only works as a solution for routing in the presence of Byzantine failures of routers, but also works to assure no flow gets starved even in the presence of DDOS attacks.
 



Short Bio:

Dr. Radia Perlman is a Sun Fellow at Sun Microsystems, working on network and security protocols. She invented many of the basic algorithms that make today's network infrastructure robust and scalable. Her current research interests include assured delete, making large networks robust against Byzantine failures, and replacing bridges/switch with technology which is upwardly compatible, but more robust, flexible, and scalable. She is author of "Interconnections: Bridges, Routers, Switches, and Internetworking Protocols", and coauthor of "Network Security: Private Communication in a Public World", which are widely used both as textbooks in universities and for engineers to learn the field. She holds over 90 patents, a PhD in computer science from MIT, and an honorary doctorate from KTH, the Royal Institute of Technology, Sweden. She recently was given a lifetime achievement award by Usenix, and named SVIPLA (Silicon Valley Intellectual Property Law Association) Inventor of the year.