6.266 Network Algorithms
Modern theory of networks from the algorithmic perspective with emphasis on the foundations in terms of modeling, performance analysis, and design. Topics include algorithmic questions arising in the context of scheduling, routing and congestion control in a communication network; information processing and data fusion in peer-to-peer, sensor and social networks; and efficient data storage/retrieval in a distributed storage network.
6.266 will not be offered this semester. It will be instructed by D. Shah.
This class counts for a total of 12 credits. This is a graduate-level class.
You can find more information at the Devavrat Shah site.
© Copyright 2015 Yasyf Mohamedali