This course is about distributed computing in general, and distributed network algorithms in particular. With the emergence of the Internet and other modern networking technologies such as peer-to-peer networks, overlay networks, and ad hoc wireless and sensor networks, it is has become all the more important to design and analyze efficient distributed algorithms for solving various key distributed computing problems. This course will start with the basics of distributed algorithms. We will then cover distributed network algorithms for solving fundamental network optimization problems. The last part of the course will deal with recent cutting-edge stuff in the area from journals and conferences. This course will be of importance not only to algorithms and theory students, but also to students interested in networking and distributed systems including those working in the Internet, peer-to-peer, wireless and sensor networks. The course is aimed towards graduate students and advanced undergraduate students in Computer Science and ECE. There are no real prerequisites, but CS 580 (graduate-level algorithms course) or equivalent is highly recommended. For more information, please see http://www.cs.purdue.edu/homes/gopal/CS590A-2007/

Homepage	http://www.cs.purdue.edu/homes/gopal/CS590A-2007/
Usually Offered:	Fall
Credit:	3 hours (class)
Prerequisite:	CS 580 or equivalent is highly recommended
University Catalog:	CS 590A
Schedule:	Fall 2007 Instructor: Gopal Pandurangan