Schedule and reading list for CMPSCI 791N

• Sepetember 16: Scheduling Communication with Deadlines I
  
  
  • Presentation by Micah Adler:
    
    • Micah Adler, Arnold L. Rosenberg, Ramesh K. Sitaraman, and Walter Unger, Scheduling Time-Constrained Communication in Linear Networks. In Proceedings of 10th ACM Symposium on Parallel Algorithms and Architectures (SPAA) 1998.
    • Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman and Adi Rosen, Time-Constrained Scheduling of Weighted Packets on Trees and Meshes. In Proceedings of 11th ACM Symposium on Parallel Algorithms and Architectures (SPAA) 1999.
    
    
• Sepetember 23: Scheduling Communication with Deadlines II
  
  
  • Presentation by Dan Rubenstein:
    M. Andrews, A. Fernandez, M. Harchol-Balter, F.T. Leighton, L. Zhang, General dynamic routing with per-packet delay guarantees of O(distance + 1/session rate). In 38th IEEE Symp. on Foundations of Computer Science 1997.
    
  • Presentation by Abhishek Chandra:
    M. Andrews and L. Zhang, Packet routing with arbitrary end-to-end delay requirements. In 31st ACM Symp. on Theory of Computing 1999.
  
  
• September 30: Reliable Message Delivery I
  
  
  • Presentation by Bing Wang:
    Micah Adler, Yair Bartal, John W. Byers, Michael Luby, and Danny Raz, A Modular Analysis of Network Transmission Protocols. In Proceedings of 5th Israeli Symposium on Theory of Computing and Systems (ISTCS) 1997.
  • Presentation by Matthew K. Wright:
    Kushilevitz, Ostrovsky, and Rosen, Log-Space Polynomial End-to-End Communication. In 28th STOC, 1995, pages 559--568.
  
  
• October 7: Reliable Message Delivery II
  
  
  • Presentation by William Hesse and Tian Bu:
    
    • Faith Fich, End-to-End Communication
    • Micah Adler and Faith Fich, The Complexity of End-to-End Communication in Memoryless Networks. In Proceedings of 18th ACM Symposium on Principles of Distributed Computing (PODC) 1999.
  
  
• October 14: Ad-Hoc Wireless Networks I
  
  
  • Presentation by Ellen (Xiaolan) Zhang and Matthew K. Wright:
    
    • R. Bar-Yehuda, O. Goldreich, A. Itai, On the time complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. J. Comput. and Syst. Sci. 45, pp. 104-126, 1992.
    • I. Gaber, Y. Mansour, Broadcast in radio networks. In Proceedings of Symposium on Discrete Algorithms, pp. 577-582, 1995.
  
  
• October 21: Ad-Hoc Wireless Networks II
  
  
  • Presentation by Suprakash Datta and Yunlei Yang:
    
    • L.M. Kirousis, E. Kranakis, D. Krizanc, A. Pelc, Power consumption in packet radio networks. In Proceedings of Symposium on Theoretical Aspects of Computer Science 1997.
    • Micah Adler and Christian Scheideler, Efficient Communication Strategies for Ad-Hoc Wireless Networks . In Proceedings of 10th ACM Symposium on Parallel Algorithms and Architectures (SPAA) 1998. Invited for submission to SPAA '98 special issue of Theory of Computing Systems.
  
  
• October 28: Fairness / Compression
  
  
  • Presentation by Bhuvan Urgaonkar:
    J. Kleinberg, Y. Rabani, E. Tardos. Fairness in Routing and Load Balancing. Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS), 1999.
    
  • Presentation by Micah Adler:
    Entropy and Compression
  
  
• November 4: Error Correcting Codes I
  
  
  • Presentation by Micah Adler:
    • Introduction.
    • Michael Sipser and Daniel A. Spielman, Expander Codes. In IEEE Transactions on Information Theory, 1996, Vol 42, No 6, pp. 1710-1722. Extended abstract in Proceedings of FOCS 94.
  
  
• November 15: Error Correcting Codes II
  Note that this meeting is on a Monday.
  
  
  • Presentation by William Hesse:
    Daniel A. Spielman, Linear-time encodable and decodable error-correcting codes. In IEEE Transactions on Information Theory, 1996, Vol 42, No 6, pp. 1723-1732. Extended abstract in Proceedings of STOC 95
  • Presentation by Dan Rubenstein:
    Michael G. Luby, Michael Mitzenmacher, M. Amin Shokrollahi, and Volker Stemann, Practical Loss-Resilient Codes. In the Twenty-Ninth Annual ACM Symposium on Theory of Computing STOC 97.
  
  
• November 18: Multicasting I
  
  
  • Presentation by Tian Bu:
    Sylvia Ratnasamy and Steven McCanne, Inference of Multicast Routing Trees and Bottleneck Bandwidths using End-to-end Measurements. Proceedings of INFOCOM '99, March 21, 1999, New York, NY.
  • Presentation by Yunlei Yang:
    R. Caceres, N.G. Duffield, J. Horowitz, F. Lo Presti, D. Towsley, Loss-based Inference of Multicast Network Topology, to appear at IEEE CDC'99, December 1999
  
  
• December 2: Multicasting II
  • Presentation by Abhishek Chandra and Bing Wang:
    and Yunlei Yang
    • Steven McCanne, Van Jacobson, and Martin Vetterli, Receiver-driven Layered Multicast. ACM SIGCOMM, August 1996, Stanford, CA, pp. 117-130.
    • L. Vicisano, J. Crowcroft & L. Rizzo, TCP-like congestion control for layered multicast data transfer, In Proceedings IEEE InfoCom'98, March/April 1998, San Francisco.
  
  
• December 9: Multicasting III
  
  
  • Presentation by Ellen (Xiaolan) Zhang:
    S. Paul, K. K. Sabnani, J. C. Lin and S. Bhattacharyya. Reliable Multicast Transport Protocol (RMTP). In IEEE Journal on Special Areas in Communications (JSAC), April 1997, 15:3 pp.407-421.
  • Presentation by Suprakash Datta:
    A. Bar-Noy, S. Guha, J. Naor, and B. Schieber, Multicasting in Heterogeneous Networks. In Proceedings of STOC 98.