Includes programming assignments that (1) build upon application(socket) programming knowledge from CS 555, and/or (2) involve the modelingof network systems and their performance evaluation using analysis and/orsimulation. See TentativeSyllabus and Schedule (subject to change).PrerequisitesBasic networking (CAS CS 555 or equivalent), including TCP/IP protocolsand Internet principles like addressing, routing,transport, naming andclient-server socket programming.Strong programming skills in C, C++, or Java. You will probablybe given the flexibility of doing the programming assignments in a languageof your choice. Knowledge of scripting languages such Tcl/Tk might alsobe helpful. If a sample skeleton code is given in a certain language aspart of an assignment, you may still choose to use another language.Algorithms and data structures (CAS CS 112 or 113 or equivalent).Working knowledge of probability theory (CAS MA 381 or 581 or equivalent).Background in operating and architectural issues should be helpful.No special assistance or consideration will be offered if yourbackground is inadequate.Office HoursTBA, or by appointment MCS 271.Teaching FellowTBA.GraderTBA.Textbooks (Not Required)These textbooks are not required. There is simply no single textbookthat either covers all the material in this course or covers them in areasonably detailed level. Some lecture slides/notes will be made availableon-line, and supplemented with papers, Internet RFCs and drafts. The followingare textbooks that can serve as reference to provide necessary background.You should be able to find most of these textbooks on reserve in the library.William Stallings. High-Speed Networks: TCP/IP and ATM Design Principles.Prentice-Hall, 1998.Mischa Schwartz. Broadband Integrated Networks. Prentice-Hall,1996.Franklin Kuo, W. Effelsberg and J.J. Garcia-Luna-Aceves. MultimediaCommunications: Protocols and Applications. Prentice-Hall, 1998.Paul Ferguson and Geoff Huston. Quality of Service. Wiley 1998.Joel Mambretti and Andrew Schmidt. Next Generation Internet.Wiley, 1999.Gary R. Wright and W. Richard Stevens. TCP/IP Illustrated, Volumes1, 2, 3. Addison-Wesley, 1994, 1995, 1996.Uyless Black. Advanced Internet Technologies. Prentice-Hall, 1999.William Stallings. ISDN and Broadband ISDN with Frame Relay and ATM.Prentice-Hall, 1999. There are many other networking textbooks, including:L. Peterson and B. Davie. Computer Networks: A Systems Approach.Morgan-Kaufmann, 1996.S. Keshav. An Engineering Approach to Computer Networking: ATM Networks,the Internet, and the Telephone Network. Addison-Wesley, 1997.Uyless Black. ATM: Foundation for Broadband Networks. Prentice-Hall,1995.F. Halsall. Multimedia Communications. Addison-Wesley, 2001.S.A. Thomas. IPng and the TCP/IP Protocols, Implementing the Next GenerationInternet. Wiley, 1996.Jean Walrand and Pravin Varaiya. High-Performance CommunicationNetworks. Morgan-Kaufman, 1996.D. Comer. Internetworking with TCP/IP, Volume 1, Third edition.Prentice-Hall, 1995.C. Huitema. Routing in the Internet. Prentice-Hall, 1995.W. R. Stevens. Unix Network Programming. Prentice-Hall, Secondedition, 1998.D. Comer and D. L. Stevens. Internetworking with TCP/IP, Client-ServerProgramming and Applications. Prentice-Hall, 2001.J. Kurose and K. Ross. Computer Networking, A Top-Down Approach Featuringthe Internet. Addison-Wesley, 2000.A.S. Tanenbaum. Computer Networks. Prentice-Hall, 1996.S. Paul. Multicasting on the Internet and its Applications.Kluwer-Academic, 1998.F. Halsall. Data Communications, Computer Networks and Open Systems.Addison-Wesley.W. Stallings. Data and Computer Communications. Prentice-Hall.J. Walrand. Communication Networks: A First Course. Aksen Associates.D. Comer. Computer Networks and Internets. Prentice-Hall.Course Requirements and Grading PolicyThere will be 2 in-class (midterm and final) exams to testyour basic understanding of the main concepts discussed in class and inassigned readings.Both exams will closed-books/notes. However, youwill be allowed to bring one 8.5"x11"sheet of notes to the midterm exam,and an additional sheet of notes to the final exam. Exams will be cummulative,i.e., they will include all material covered in class from the beginningto the day of the exam.There will be 3-4 written homeworks, which will require youto perform numerical computations. These homeworks are to completed individually.There will 2 programming assignments. You will be given about3 weeks to complete each assignment. These programming assignments canbe done in groups of 2.The course also requires you to complete a research paperin the format of a "real" scientific paper. A team of 2 studentsmay collaborate in submitting one paper. The choice of the topic is quiteflexible. A couple of possible projects will be provided. You can alsodefine your own project on a topic of interest to you. In this case, beforeyou start on a topic, I must approve of it first. Please stop by my officeor send me an e-mail and I will let you know if the topic is relevant andI may also point you to some references/ideas. You will be required tosubmit two reports. You will be given about 3 weeks to complete each report.In your research project, your solution approach may involve themodeling of a network system and its performance evaluation using analysisand/or simulation, or the implementation and testing of network serviceson a network testbed. Thus, to obtain results in support of your project,you may need good computer programming skills (e.g., in C, C++ or Java)and working knowledge of operating systems (e.g., Solaris, FreeBSD, Linux).Knowledge of basic queueing theory (as in CAS CS 470/670 or CAS MA 583)and simulation should also be helpful.The research paper may be based on your current Masters or PhD projectsif related to the subject matter of the course, or may serve as a startingpoint for a Masters or PhD thesis! Your overall grade will approximately be based on the followingpolicy:Two exams (March 15, 2001 and final exam week May 7-15, 2001): 40%(20% each)Homeworks: 10%Programming assignments: 20%Research Project: 30%More on Research Project For your research paper, you must submit two reports. In your firstreport, you should identify a particular problem that you propose to workon and also what your objectives are. You should also specify how you planto achieve your objectives -- whether by analysis, simulation or some othertechnique. So in your first report, you should precisely define your problemand clearly state the research question(s), and identify related work,your objectives and solution methodology. You are advised to start workingon your research project as soon as possible.Your second and final report must contain a complete descriptionof your project. So, it will include parts of the first report togetherwith some results/findings. You should obtain these results using the solutionmethodology you already specified in the first report. For this, you mayuse one of a number of tools (see below), including simulators, analytical/numericaltechniques (queueing theory, dynamic flow theory, worst-case analysis,etc.) and experimental tools (NeVoT, etc.). Your results should be feasibleto obtain by the deadline but not too trivial! Tools: You are free to use whatever tool you need. A populartool is discrete-event simulation. You can, of course, write your own simulatorfrom scratch. You can also use one of a number of network simulators alreadyavailable. Most of these network simulators are written in C or C++ andare documented. However, you may need to modify or extend the simulatoryou choose. Note that due to time constraints, it might not be feasibleto make major changes/extensions to obtain your results. Check the documentationfor the capabilities and flexibility of each simulator. Again, come seeme if you need help on which simulator to use. Following is a list of somesimulators:MaRS.A packet-level simulator for evaluating routing systems.REAL simulator.Developed by Keshav.UCB/LBNL/VINT Network Simulator- ns (version 2) NS provides substantial support for simulation ofTCP, routing, and multicast protocols. Includes links to topology generation,wireless network simulation, othersimulation packages, visualization tools, and traffic archives.UCB/LBNL Network Simulator:Contributed Code, WWW Traffic GeneratorNeVoT (audio conferencingtool) and other tools: Developed by Henning Schulzrinne.routesim.A flow-level routing simulator.We will provide an overview of discrete-event simulation and ns-2.You are expected to have strong programming skills, working knowledge ofoperating systems, and ability to learn new tools to complete your assignments.Academic HonestyYou must submit only your own work. A student violating this policywill receive a grade of ``F'' for the course. If you are having troublecompleting an assignment, see the instructor.
free java server programming black book wiley publication
2ff7e9595c
Comments