Toronto Networking Seminar

Organized by Department of Computer Science and Department of Electrical and Computer Engineering, University of Toronto



On the Efficiency of Address Assignment in the Internet


Ken Calvert
Department of Computer Science
University of Kentucky

Date:  Friday, September  12,  2pm
Location: BA 1220 

Abstract:

For more than three decades, hierarchical topology-based addressing has been considered key to routing scalability. As interest turns to "clean-slate" Internetwork designs, however, other paradigms are being considered. In addition, multihoming and other routing trends are raising concerns about scalability in the global routing system. The question therefore arises regarding the effectiveness of the current address assignment. We propose a definition of "efficiency" for address assignment and apply it to the present interdomain graph of the Internet, in an attempt to answer that and other questions.

Bio:

Ken Calvert is Professor and Chairman in the Department of Computer Science at the University of Kentucky. His research deals with the design and implementation of advanced network protocols and services. Current research interests include novel approaches to addressing, routing and forwarding; human-centered networking for the home; and lightweight network programmability. He is one of the developers of the GT-ITM Internet topology modeling tool. Dr. Calvert was an associate editor of IEEE/ACM Transactions on Networking from 1999 to 2005. From 1979 to 1984 he was a Member of Technical Staff at Bell Telephone Laboratories in Holmdel, NJ, and from 1991 to 1998 he was a faculty member in the College of Computing at Georgia Tech. Dr. Calvert holds degrees from MIT, Stanford, and the University of Texas at Austin.

Host of the talk

Jörg Liebeherr (jorg@comm.toronto.edu)