Basser Seminar Series

Network Routing Robust Against Byzantine Failures

Dr Radia Perlman
Distinguished Engineer
Sun Microsystems Laboratories

Wednesday 30 November 2005, 4-5pm

Eastern Avenue Lecture Theatre (Note venue change)

Abstract

This talk presents a network design for large hierarchical networks that guarantees that packets between honest nodes will flow, with some fair share of network resources, despite arbitrarily malicious failures (Byzantine failures) of some of the routers, provided that at least one non faulty path exists between those nodes. The network guarantees delivery of every packet of every traffic flow set up on an honest path, even in the presence of DDOS attacks or arbitrary congestion. Each node S can participate in a fixed number of simultaneous outgoing flows (flows that S initiates), and an arbitrary number of simultaneous flows which other nodes have initiated to S. This design does not require any router to maintain state larger than necessary to support its portion of the hierarchy.

Speaker's biography

Dr. 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 co-author 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.