Recent Changes - Search:

HomePage

Menu

Site Map

Spring 2015

IC522: Computer Networks (Spring 2015)


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
  • Suggested additional references:
    • 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 http://web.mit.edu/dimitrib/www/datanets.html).
  • Introduction to queueing theory
    • The ppt slides for queueing theory lectures are available here

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.

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

Announcement:

  • Assignment 1: Two questions on Page 30 of lecture slides of Chapter 1 and carry out simulation (due: March 19)
  • Assignment 2: Problems 2, 3, 5, 6, 8, 13, 19, 24, 25, 31 in Chapter 1 (due: March 31)
  • Assignment 3: Socket programming (due: April 23)
  • Assignment 4: Problems 9, 10, 23, 24, 31 in Chapter 2 (due: April 16)
  • Assignment 5: One fast server vs. multiple slow servers (due: April 16)
    • Compare M/M/1 with M/M/m by simulation. For simplicity, let m = 2, and carry out simulation when the system utilization is close to 0 and 1, respectively.
  • Assignment 6: Problems 12, 15, 26, 32, 40, 44, 45, 49, 52, 53 in Chapter 3 (due: June 2)
  • Assignment 7: Problems 7, 9, 14, 26, 28, 30 in Chapter 4 (due: June 16)
  • Assignment 8: Problems 8, 9, 10, 11, 12 in Chapter 5 (due: June 16)
  • Paper reading assignment 1 (There will be related problems in the final exam.)

Lectures:

  • [March 3] Overview of the state-of-the-art of networking
  • [March 5] No class (ICT Convergence Korea 2015)
  • [March 10] Introduction to computer networking: Network edge
  • [March 12] Introduction to computer networking: Network core
  • [March 17] Introduction to computer networking: Delay, loss, and throughput & protocol layers
  • [March 19] Application layer
  • [March 24] Application layer (cont'd)
  • [March 26] Modeling and discrete event system
  • [March 31] Introduction to queueing theory: Definition and basic notation of queues
  • [April 2] Introduction to queueing theory: Key components of queues, Little's theorem
  • [April 7] Introduction to queueing theory: Poisson process
  • [April 9] Introduction to queueing theory: M/M/1 queue
  • [April 14 & 16] No class (CPS Week 2015)
  • [April 21] Midterm exam
  • [April 23] Transport layer: UDP
  • [April 28 & 30] No class (Infocom 2015)
  • [May 1] Makeup class: Reliable data transfer (Class begins at 1 pm)
  • [May 7] Reliable data transfer
  • [May 12] TCP
  • [May 14] TCP congestion control
  • [May 19] Network layer: Virtual circuit and datagram networks
  • [May 21] Network layer: Inside of a router, IP
  • [May 26] Routing algorithms
  • [May 28] Routing in the Internet
  • [June 2] No class (GRL Workshop)
  • [June 4] No class (ISET 2015)
  • [June 9] Link layer: Introduction, error-detection
  • [June 11] Multiple access and wrap up
  • [June 16] Final exam
History - Print - Recent Changes - Search
Page last modified on April 28, 2016, at 07:51 PM EST