CSU 677: Honors Adjunct: Network Algorithms

Spring 2005

240 WVH                                                                              Work: 617-373-2075
College of Computer Science                                                Email: rraj AT ccs DOT neu DOT edu
Northeastern University                                                         Fax:    617-373-5121

Meeting times/location: Thursdays, 5:15-6:15 PM

Course Description

Grading

Projects

Course Description

This honors adjunct (to CSU690) will study network algorithms; that is, algorithms for problems arising in networking applications and other scenarios that are modeled by networks. A tentative list of topics is:

Synchronous network model
Algorithms for leader election, minimum spanning trees, and maximal independent set in synchronous networks
Distributed consensus in synchronous networks
Asychronous network model
Basic asychronous network algorithms
Network flows
Advanced topics:

Distributed Hash Tables and applications to P2P systems
Google's PageRank algorithm
Algorithms for query processing in sensor networks
Multicommodity flows

Readings will be handed out per topic. The coverage first five topics listed above will be based on material from Nancy Lynch's textbook Distributed Algorithms. The other topics will be based on research papers and relevant chapters from other texts.

Prerequisites

Registration in CSU690 and an honors student.

Grading

The course grade will be based on problem sets and, possibly, a small term project at the end of the semester.