1 / 11

Data Communication and Networks

Data Communication and Networks. Lecture 0 Administrivia September 7, 2006. Adminstrivia. You must be registered in G22-2262-001 to receive a grade How to reach me: jconron@cs.nyu.edu Office hours: Thursdays 6:00 – 7:00. Class Mailing List.

Download Presentation

Data Communication and Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Data Communication and Networks Lecture 0 Administrivia September 7, 2006

  2. Adminstrivia • You must be registered in G22-2262-001 to receive a grade • How to reach me: jconron@cs.nyu.edu • Office hours: Thursdays 6:00 – 7:00

  3. Class Mailing List • All students should register themselves with the class list, which is used for all technical discussions concerning the course. To register, go to the following web page, and follow the instructions: cs.nyu.edu/mailman/listinfo/g22_2262_001_fa06 • You will be notified in return that you are a list participant. Please send all of your questions to this list (not to the instructor) so that everyone can participate.  

  4. Computer Accounts • Students that do not already have a CIMS network account should follow these instructions: CIMS network account • Solaris Machines: courses1, courses2, courses3

  5. Grading • No Examinations! • Final grade will be determined by: • scores on a series of homework assignment • class participation. • assignments will consist of: • problems similar to those in the text • small (less than 500 lines of code) programs • packet analysis using Ethereal packet sniffer • Since some assignments will be more difficult than others, the percent that each represents of your final grade will vary.

  6. Rules for Working on Assignments • All assignments must be done individually (see Cheating below). • Unless stated otherwise in the assignment, all writing and coding must be original. • All assignments must be emailed to the appropriate grader. To avoid problems with "lost emails" ("the Internet ate my homework") you should save a copy of your EMAIL (not simply the assignment itself).

  7. Cheating Policy You should NOT • Copy any part of another student's homework answers. • Allow another student to copy your homework. • Copy any part of code found in a book, magazine, the Internet, or other resource.Present the work of another as your own. If you use the idea of another in your work, you MUST provide appropriate attribution (that is, cite the work and the author). • The penalty for first cheating offense will be a grade of F for the course. Computer Science Department Academic Integrity Policy.

  8. How to hand in Assignments+Late Assignments • Homework problems must be submitted by email to the designated grader. Please include: • Your name • Your SID • Assignment number (1, 2, …) in subject • Example, “assignment 1” • NO credit will be given for ANY assignment after the due date.

  9. Books • Required texts • Computer Networking: A Top-Down Approach Featuring the Internet, 3rd Edition, James Kurose and Keith Ross, Addison Wesley, 2004, ISBN: 0-321-22735-2 • Recommended texts • Data & Computer Communications Seventh Edition, William Stallings, Prentice Hall, 2003, ISBN 0131006819 • Douglas Comer, Computer Networks And Internets with Internet Applications, 3rd Edition, Prentice Hall, ISBN 0130914495 • Comer, D.E. and Stevens, D.L. Internetworking with TCP/IP: Volume III: Client-Server Programming and Applications, BSD socket version, Second Edition, Prentice Hall, ISBN 0-13-260969-X, 1996. Most of the readings will come from the required text. The text will also be useful in solving some of the assigned problems.

  10. What We Will Cover • Fundamental Data Structures: queues, ring buffers, finite state machines • Data Encoding and Transmission • Local Area Networks and Data Link Control • Wireless Communications • Packet Switching • OSI and Internet Protocol Architecture • Congestion Control and Flow Control Methods • Internet Protocols (IP, ARP, UDP, TCP) • Network (packet) Routing Algorithms (OSPF, Distance Vector) • IP Multicast • Sockets

  11. Questions?

More Related