|
CS/EE145b: Networking Basic Information: 9 units Time
and place: MWF Instructors: Tracey Ho (tho@caltech.edu)
Lijun Chen (chen@cds.caltech.edu) Teaching Assistant: Tao Cui (taocui@caltech.edu) Office hours: by appointment Course
Description: This course covers networking topics in areas of current research interest, including network coding, network security, peer-to-peer networks, and traffic engineering. If time allows, we will cover one or more additional topics to be determined by student interests. Format: The class will meet three times per week. The instructors will give overviews of the topics during the first several weeks. Thereafter, students will present and discuss papers of their choice from a given reading list, interspersed with guest lectures and additional instructor lectures as needed. Prerequisites: Familiarity with networking at the level of CS/EE145a. Prior exposure to information theory and optimization theory will be useful for some of the papers, but is not required. The former CS/EE145a webpage is http://www.its.caltech.edu/~eecs145/145a.html Schedule: Students should submit their choice of papers by January 18, along with dates that they cannot present. The instructors will then put together the class schedule. The preliminary schedule:
Grading: Paper presentations and one-page writeups 60% Final report (a critical/comparative survey of a few papers on a specific topic or a project proposal suitable for CS/EE145c) 40% Grading will be based on the understanding and insight shown in the presentation and summary, and the organization and quality of the presentation. If you are not used to giving presentations, you are encouraged to approach the instructors/TA for advice. Paper Presentations and Review Summaries: Each student will be responsible for presenting two papers from the suggested list, and writing review summaries of these and two other papers. If you have other papers in mind you'd like to present, please let the instructors know by 1/15, to give us time to look at the papers and get back to you. Please send e-mail to the TA by Friday 1/18 listing your top five paper choices, in order of preference, and also listing any dates that you are unavailable. Papers are assigned on a first-come first-served basis. We will then post the chosen papers and seek your preferences regarding which two other papers you'll review; assignments are again on a first-come first-served basis. The presentations should be about 40 minutes long (50 minutes with questions/comments from the audience), and the review summaries should be one page or less. Both should cover the problem addressed, main contributions, any assumptions made, etc., and give a thoroughly-considered assessment of the strengths and weaknesses of the paper. The presentation should also cover any background material or related papers that aid understanding of the paper and its contributions. The presentation slides or transparencies, and the review summaries, should be submitted to the TA at least 24 hours before class, to allow time for feedback if any. The presenter and reviewer are encouraged to discuss the paper in advance, but each review should be written up independently without looking at the other. The reviews will be posted on the class webpage by the morning of class. Other students are encouraged to read the papers and summaries, and think of questions or comments to discuss in class. Presentation Schedule:
Suggested Network Coding and Security: 1. Y. E. Sagduyu, A. Ephremides, "Some Optimization Trade-offs in Wireless Network Coding," in Proc. Conference on Information Sciences and Systems, Mar. 2006. 2. Alex Dimakis, Vinod Prabhakaran and Kannan Ramchandran, "Decentralized Erasure Codes for Distributed Networked Storage," IEEE Transactions on Information Theory, June 2006. 3. Stuart Staniford, Vern Paxson, Nicholas Weaver, "How to Own the Internet in Your Spare Time," in Proc. of USENIX Security Symposium, 2002. 4. Haowen Chan, Adrian Perrig, Dawn Song, "Random Key Predistribution Schemes for Sensor Networks," in Proc. of IEEE Symposium on Security and Privacy, 2003. 5. Jiejun Kong, Petros Zerfos, Haiyun Luo, Songwu Lu, Lixia Zhang, "Providing Robust and Ubiquitous Security Support for Mobile Ad-Hoc Networks," in Proc. of International Conference on Network Protocols, 2001 Peer-to-Peer 1. Bram Cohen, ¡°Incentives Build Robustness in BitTorrent.¡± 2. Matthias Bender, Sebastian Michel, Christian Zimmer, Peter Triantafillou, Gerhard Weikum, ¡°P2P Content Search: Give the Web Back to the People,¡± in Proc. of International Workshop on Peer-to-Peer Systems, 2006. 3. L. Massoulie, M. Vojnovic, "Coupon Replication Systems," in Proc. of ACM SIGMETRICS, 2005. 4.
H. Balakrishnan, F. M.
Kaashoek, D. Karger, R. Morris, and 5. J. Shneidman, D. C. Parkes, and L. Massouli¨¦, ¡°Faithfulness in Internet Algorithms,¡± in Proc. of ACM SIGCOMM, Aug. 2004. Traffic Engineering 1. B. Fortz, J. Rexford, and M. Thorup, ¡°Traffic Engineering with Traditional IP Routing Protocols,¡± IEEE Communication Magazine, Oct. 2002. 2. D.O. Awduche, ¡°MPLS and Traffic Engineering in IP Networks,¡± IEEE Communications Magazine, December 1999. 3. Jennifer Rexford, ¡°Route Optimization in IP networks,¡± Chapter in Handbook of Optimization in Telecommunications, Springer, February 2006. 4. B. Fortz and M. Thorup, "Internet Traffic Engineering by Optimizing OSPF Weights," in Proc. of IEEE INFOCOM, 2000. 5.
A. Elwalid, C. Jin, S. Low,
and 6.
Dahai Xu, Mung Chiang,
and Jennifer Rexford, ¡°Link-State Routing with
Hop-By-Hop Forwarding Can Achieve Optimal Traffic Engineering,¡± in Proc. of IEEE INFOCOM, April 2008. |