1. CSC 401 Data and Computer Communication Networks Fall 2011, Section 001 Rudra Dutta

2. Copyright Fall 2010, Rudra Dutta, NCSU2 Course Introduction First course in Computer Networking – Provide all round perspective of the field – Also prepare for further study – but may be only course Instructional Objectives – Describe the OSI and TCP/IP layered protocol architectures – Describe and analyze the functions and operations of a data link protocol such as flow control, error detection, and error recovery. – Explain and evaluate the fundamental concepts of circuit-switching, virtual-circuit-switching and packet-switching architectures in wide area networks. – Describe the fundamentals of the Ethernet, TCP/IP and ATM protocol architectures. – Explain and evaluate methods of congestion control and traffic management in data networks. – Apply statistical and simulation methods to perform basic performance analysis of generic ARQ and MAC protocols. – Discuss advanced and emergent topics: security, virtualization, cross- layer

3. Copyright Fall 2009, Rudra Dutta, NCSU3 Grading Work Products – Classwork+Homeworks (50%) – Tests (25% each) Quizzes - in-class – Usually announced – Topic or question samples given beforehand Homework assignments – Somewhat longer – Include programming – Use WolfWare submit OPNET simulation OpenFlow experiments Midterm test – Open book, open notes (BYON) – One hour – Answer on test provided – May attach additional sheets for space if needed – Considering “open web” Final test – Comprehensive, three-hour

4. Feedback from 2007 Copyright Fall 2009, Rudra Dutta, NCSU4 Mixed, as always Preponderance of frustrated comments, as always Nevertheless, some commonalities in frustration Homeworks too difficult – lecture does not adequately prepare Need to distinguish between “exercises” (straight applications of previously learned skill) and “exploration” (solidify encountered knowledge by attempted use)

5. Copyright Fall 2009, Rudra Dutta, NCSU5 Contents Descriptive – Basic concepts, Protocol descriptions – Goal: “Know” (be able to repeat, apply) – Read (mostly on your own) – know what to read! – Think through and explore “concept” problems Analytical – Modeling, predictions, equations – Goal: Solve problems by applying – Work out examples Algorithmic (incl. Simulation, OpenFlow) – Goal: Solve problems by programming – Ditto

6. Concept Problems “Test your comprehension” Take bubblesort, as an example – Start at bottom – {pairwise test and [swap]} till top – Repeat N times [each time stopping one palce short] Questions: – What initial pattern of numbers will cause greatest number of swaps? – What initial pattern of numbers will cause exactly N swaps? Value lies in doing it (attempting, succeeding) Copyright Fall 2009, Rudra Dutta, NCSU6

7. Topics of Interest? You might come into this course with some expectation – different for different students Let me know about – Topics you would hope to learn about in this course (or at least learn the context of), otherwise would be disappointed – Topics you would similarly expect in this course, but already know about Messageboards for the purpose Will remain open, but significant for the first part of the semester only Copyright Fall 2009, Rudra Dutta, NCSU7

8. 8 Website Information Detailed Outline Course Communication Reading List

9. Copyright Fall 2009, Rudra Dutta, NCSU9 Administration and Communication WolfWare website WolfWare Message board – Not instantaneous, but regular – Primary means of communicating with instructor – Archived after each homework Email – only when specifically private matter WolfWare submit WolfWare GradeBook – Only to communicate your scores to you – NOT updated instantly – authoritative copy with instructor – NO letter grades Teaching Assistant – Ahmet Can Babaoglu (half duty)