GUALIFYING EXAM GUIDELINES Each student will be assigned two (2) research papers (not from the reading list) by the area chair on the first day of classes. Students will be informed by the chair's secretary about the assigned papers.   Each student is expected to read the two research papers, related work around the two assigned research papers, and all papers from the reading list prior to the qualifying exam.   Each student is expected to prepare one presentation per research paper and present the research papers during the qualifying exam. The guideline here is that the student should prepare no more than 10 slides and no more than 20 minutes long presentation per paper. Furthermore, the student should be aware that he/she may not present all prepared slides, due to questions and time constraints of the overall qualifying exam.   Each student will be examined on the two research papers in great depth. Each student must be prepared to be interrupted during the presentation(s) and take any questions related to the assigned papers and/or to the related work of the presented papers and/or reading list papers that are related to the assigned two research papers. Each student should be prepared to answer all kinds of questions around the two research papers, for example, hard ball questions (e.g., prove the correctness of the algorithm X), easy questions (e.g., what is the principle of behavior Y), main idea questions and other related questions.   Each student will be examined on the papers in the reading list, posted on the web site. For the papers on the reading list that are in the area of student's research (e.g., if the student declares that he/she is working in security, then the student's research area is 'security'), the qualifying exam committee will ask any types of questions (hard ball, easy, main idea,...). For example, if the student declares networking to be his/her research area, then the committee will test the student on networking papers in great depth. For the papers on the reading list that are outside of the declared research area(s), the student must know the answers to questions related to main ideas of the papers, easy questions and concept questions. READING LIST Distributed Systems "Impossibility of distributed consensus with one faulty process", Fisher, Lynch and Patterson, Journal of ACM 1985 "Time clocks and the ordering of events in a distributed system", Lamport, Communications of ACM, 1978 "Epidemic algorithms for replicated database maintenance", Demers et al. ACM PODC, 1987 "Distributed Snapshots: Determining Global States of Distributed Systems" . M. Chandy and L. Lamport. ACM TOCS, Feb. 1985 "Chord: a scalable peer-to-peer lookup service for Internet applications", Stoica et al. ACM SIGCOMM 2001 Networking "Cross-layer design for multi-hop wireless networks: a loose coupling perspective", X. Lin and N. B. Shroff, Proc. of IEEE INFOCOM 2005. March 2005 "Internet Indirection Infrastructure", Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, and Sonesh Surana, IEEE/ACM Trans. on Networking, Vol. 12, No. 2, April 2004  "Does Topology Control Reduce Interference?", M. Burkhart, P.v. Rickenbach, R. Wattenhofer, and A. Zollinger, ACM MobiHoc, 2004 "Throughput Capacity of Random Ad Hoc Networks with Infrastructure Support", U. Kozat and L. Tassiulas, ACM MobiCom, 2003 "Performance Analysis of the IEEE 802.11 Distributed Coordination Function", G. Bianchi, IEEE JSAC, vol.18, no.3, 2000 Real-time Systems "Distributed Scheduling of Tasks with Deadlines and Resource requirements", Ramamrithan, Stankovic and Zhao, IEEE Transactions on Computers, Vol. 18, No. 8. August 1989 "Algorithms for Scheduling Imprecise Computation with Timing Constraints to Minimize Maximum Error", W-K. Shih, J.W.S. Liu, IEEE Transactions on Computers, Vol. 44, No. 3, March 1995 "Scheduling for Overhead in Real-Time Systems", S.K. Baruah, J.R. Haritsa, IEEE Transactions on Computers, Vol, 46. Nom 9, September 1997 "FAST: Frequency-Aware Static Timing Analysis", K. Seth, A. Anantaramn, F. Mueller, E. Rotenberg, IEEE 24th International Real-Time Systems Symposium (RTSS), 2003 "Scheduling Algorithms for Multiprogramming in a Hard-real-time Environment", C.L. Liu, J.W. Layland, Journal of the ACM, Vol. 20, No. 1, January 1993, pp. 46-61 OS/Systems "End-to-end arguments in system design" , Saltzer, Reed and Clark, ACM TOCS, 1984 "The design and implementation of a log-structured file system", Rosenblum, Ousterhout, ACM SOSP 1991 "Open, Closed and Mixed Networks of Queues with Different Classes of Customers", Baskett, Chandy, Muntz, Palacios, Journal of the ACM, Vol. 22, No. 2, April 1975, pp. 248-260 "A Class of Generalized Stochastic Petri Nets for the Performance Evaluation of Multiprocessor Systems", Marsan, Conte, Balbo, ACM Transactions on Computer Systems, Vol. 2, No. 2, pp. 93-122, 1984  "TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems", Keleher, Cox, Dwarkadas, Zwaenepoel, Proceedings of the 1994 Winter USENIX Conference , 1994, pp. 115-131 Security "DoS-limiting Network Architecture", Yang, Wetherall, Anderson, ACM SIGCOMM 2005 "Terra: A Virtual Machine-Based Platform for Trusted Computing", Garfinkel, Pfaff, Chow, Rosenblum, Boneh, ACM SOSP 2003 "Understanding and Developing Role-based Administrative Models", Crampton, CCS 2005 "Power analysis attacks of modular exponentiaion in smartcards", Messerges, Dabbish, Sloan, CHES 1999 (C.K. Koc and C. Paar, editors), LNCS 1717, pp. 144-157, 1999 "Efficient, DoS-Resistant, Secure Key Exchange for Internet Protocols", Aiello, Bellowin, Blaze, Canetti, Ioannidis, Keromytis, Reingold, ACM CCS 2002, November 2002, Washington, DC