Summary: CMPSCI 791N: Algorithms for Communication Networks
Students should expect to present two papers on different topics from the following list. Please send
me email (firstname.lastname@example.org) by 5:00 PM on Friday September 10th indicating your preferences.
Send me a list of four papers, in order of preference, with no more than two on any one topic. If
you would like to present a pair of the combined presentations with someone, please indicate this
with your choices. If you list one of the combined presentations without such an indication, I shall
try to pair you up with someone.
The reading list:
Scheduling Communication with Deadlines
ffl Combined presentation:
-- Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman and Adi Rosen, TimeConstrained
Scheduling of Weighted Packets on Trees and Meshes. In Proceedings of 11th ACM
Symposium on Parallel Algorithms and Architectures (SPAA) 1999.
-- Micah Adler, Arnold L. Rosenberg, Ramesh K. Sitaraman, and Walter Unger, Scheduling
TimeConstrained Communication in Linear Networks. In Proceedings of 10th ACM
Symposium on Parallel Algorithms and Architectures (SPAA) 1998.
ffl M. Andrews, A. Fernandez, M. HarcholBalter, F.T. Leighton, L. Zhang, General dynamic
routing with perpacket delay guarantees of O(distance + 1/session rate). In 38th IEEE
Symp. on Foundations of Computer Science 1997.