12:45PM, Thursday, November 3rd 2005.
Gates 104


Routing in Large Networks Despite Byzantine Failures
 

Radia Perlman
SUN Labs


About the talk:
 
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.

About the speaker:
 
 Radia Perlman is a Distinguished Engineer at Sun Microsystems Laboratories. Her work on bridging (spanning tree algorithm) and routing (robust and scalable link state routing) is fundamental to today's networks. She has also made significant contributions to security, including credentials download, key management, authentication and authorization models, and assured delete.  She is the author of "Interconnections: Bridges, Routers, Switches, and Internetworking Protocols", and coauthor of "Network Security: Private Communication in a Public World".  Holding about 80 patents, she was named SVIPLA (Silicon Valley Intellectual Property Law Association) 2004 Inventor of the Year. She has a PhD from MIT in computer science, and an honorary doctorate from KTH, Sweden's Royal Institute of Technology.