Tutorial

Tutorial Description

This tutorial describes the protocols and algorithms involved in moving data around in a network. It discusses both the endnode view of the network as well as the protocols performed by switches, both layer 2 (bridges) and layer 3 (routers).

This tutorial will consist of two half-day sessions. It will start with layer 2 and describe addressing, multiplexing, and the spanning tree algorithm. Then it will describe layer 3 alternatives, including connection-oriented vs connectionless and reliable vs unreliable, and illustrate with IP, ATM, and X.25. It describes routing protocols, and the two main types (distance vector vs link state) along with many examples including RIP, IS-IS, and OSPF. It also discusses issues such as neighbor discovery and layer 3 to layer 2 address mapping (ARP).

About the Tutor

Radia Perlman is a distinguished engineer at Sun Microsystems. She is known for her contributions to bridging (spanning tree algorithm) and routing (stable and efficient link state routing) as well as security (sabotage-proof networks). She was recently featured in the 25th anniversary edition of Data Communications magazine as one of the 25 people whose work most influenced the industry. Radia is the author of the textbook "Interconnections: Bridges and Routers", and is co-author of "Network Security: Private Communication in a Public World", published by Prentice Hall. She has about 35 issued patents in the fields of routing and security. She is a series editor for Prentice Hall, a former member of the Internet Architecture Board, and is currently serving on the program committees of SigComm and ACM Conference on Computer and Communications Security.

Radia Perlman has a PhD in computer science from MIT as well as S.B. and S.M. in mathematics from MIT.