# Lectures: Spring 2017

IC522: Computer Networks (Spring 2017)

Instructor:
Kyung-Joon Park
Office hours: By appointment, E3-513 DGIST

Textbooks:

• Computer Networking: A Top-Down Approach Featuring the Internet, by J. Kurose and K. Ross, Addison-Wesley
• Larry L. Peterson and Bruce S. Davie, Computer Networks: A Systems Approach, Morgan Kaufmann Publisher
• D. Bertsekas and R. Gallager, Data Networks, 2nd Edition, Prentice-Hall, 1992 (freely available at
• Introduction to queueing theory
• The ppt slides for queueing theory lectures are available

Course Description:
We will discuss various issues on computer networking in a top-down manner, by beginning at the application layer and moving towards the physical layer as in the main textbook. We will also cover basic concepts of queueing theory to have an ability to analyze packet networks. In addition, we will read several key research papers to deal with the state-of-the-art research on computer communication and networking areas. If time permits, we will carry out a research project to have a hand-on experience in computer networking systems and to understand how they work in an algorithm level.

30% - Midterm exam
40% - Final exam
30% - Homework

Announcement:

• The midterm exam is scheduled at 1:30 pm, April 20 (Chapter 1 & 2 and Queueing will be covered.)
• Assignment 1: Problems 2, 3, 5, 6, 8, 13, 19, 24, 25, 31 in Chapter 1 (due: April 3)
• Assignment 2: Socket programming (due: April 13)
• Assignment 3: M/M/1 queue simulation (due: April 20)
• Carry out M/M/1 queue simulation when the system utilization is 0.1 and 0.9, respectively. Plot the waiting time and the number of customers with respect to simulation time.
(Check this on how to simulate a queue. For the inverse CDF method, see this.)
• Assignment 4: Problems 9, 10, 23, 24, 31 in Chapter 2 (due: April 20)
• Assignment 5: Problems 12, 15, 26, 32, 40, 44, 45, 49, 52, 53 in Chapter 3 (due: May 18)
• Assignment 6: Problems 7, 9, 14, 26, 28, 30 in Chapter 4 (due: June 8)
• Assignment 7: Explain how cyclic redundancy check works and give representative examples of CRC (due: due: June 8)
• Assignment 8: Problems 8, 9, 10, 11, 12 in Chapter 5 (due: June 15)
• Paper reading assignment 1 (There will be related problems in the final exam.)

Lectures:

• [March 2] Class introduction and overview of computer networking
• [March 6] Introduction to computer networking Packet switching vs. circuit switching (cont'd)
• [March 9] Introduction to computer networking: Network performance metrics (cont'd)
• [March 13] Introduction to queueing theory: Definition and basic notation of queues, key components of queues, Little's theorem
• [March 16] Introduction to queueing theory: Poisson process
• [March 20] Introduction to queueing theory: M/M/1 queue
• [March 23] Introduction to queueing theory: Examples
• [March 27] Application layer
• [March 30] Application layer (cont'd) & Transport layer
• [April 3] Transport layer: UDP, reliable data transfer
• [April 6] Reliable data transfer (cont'd)
• [April 10] Reliable data transfer (cont'd)
• [April 13] TCP
• [April 17] No class (Midterm week)
• [April 20] Midterm exam
• [April 24] TCP congestion control
• [April 27] No class (JCCI 2017)
• [May 1] TCP congestion control (cont'd) and network layer: Virtual circuit and datagram networks (regular class + makeup class)
• [May 11] Network layer: Virtual circuit and datagram networks (cont'd)
• [May 15] Network layer: Inside of a router and routing algorithms (regular class + makeup class)
• [May 18] Routing in the Internet
• [May 22] Routing in the Internet (cont'd)
• [May 25] Link layer: Introduction, error-detection
• [May 29] Multiple access
• [June 1] No class (MOU signing ceremony at Seoul National Hospital)
• [June 5] Multiple access & Introduction to wireless networking
• [June 8] CSMA & Capacity of wireless networks
• [June 12] No class (Final week)
• [June 15] Final exam