Recent Changes - Search:

HomePage

Menu

Site Map

Spring 2017

Lectures.Spring2017 History

Show minor edits - Show changes to output

Changed lines 80-81 from:
* [June 8]
* [June 12]
to:
* [June 8] CSMA & Capacity of wireless networks
* [June
12] No class (Final week)
Changed line 79 from:
* [June 5]
to:
* [June 5] Multiple access & Introduction to wireless networking
May 31, 2017, at 09:55 PM EST by 211.196.16.129 -
Changed line 78 from:
* [June 1]
to:
* [June 1] No class (MOU signing ceremony at Seoul National Hospital)
Added line 45:
* Assignment 8: Problems 8, 9, 10, 11, 12 in Chapter 5 (due: June 15)
Changed lines 43-44 from:
to:
* 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)
Changed lines 74-77 from:
* [May 22]
* [May 25]
* [May 29]
* [June 1]
to:
* [May 22] Routing in the Internet (cont'd)
* [May 25] Link layer: Introduction, error-detection
* [May 29] Multiple access
* [June 1]
May 15, 2017, at 05:32 AM EST by 220.122.36.33 -
Changed line 79 from:
* [June 15]
to:
* [June 15] Final exam
Changed lines 70-79 from:
* [May 15] Network layer: Inside of a router and routing algorithms (regular class + %font color=red%makeup class%font color=black%)
to:
* [May 15] Network layer: Inside of a router and routing algorithms (regular class + %font color=red%makeup class%font color=black%)
* [May 18] Routing in the Internet
* [May 22]
* [May 25]
* [May 29]
* [June 1]
* [June 5]
* [June 8]
* [June 12]
* [June 15]
Changed lines 68-70 from:
* [May 1] TCP congestion control (cont'd) and network layer: Virtual circuit and datagram networks (regular class + %font color=red%makeup class%font color=black%)
to:
* [May 1] TCP congestion control (cont'd) and network layer: Virtual circuit and datagram networks (regular class + %font color=red%makeup class%font color=black%)
* [May 11] Network layer: Virtual circuit and datagram networks (cont'd)
* [May 15] Network layer: Inside of a router and routing algorithms
(regular class + %font color=red%makeup class%font color=black%)
Changed line 68 from:
* [May 1] TCP congestion control (cont'd) and network layer: Virtual circuit and datagram networks
to:
* [May 1] TCP congestion control (cont'd) and network layer: Virtual circuit and datagram networks (regular class + %font color=red%makeup class%font color=black%)
Changed line 42 from:
to:
* Assignment 5: Problems 12, 15, 26, 32, 40, 44, 45, 49, 52, 53 in Chapter 3 (due: May 18)
Changed lines 65-68 from:
* [April 20] %font color=red% Midterm exam
to:
* [April 20] %font color=red% Midterm exam
* [April 24] TCP congestion control
* [April 27] No class ([[http://jcci.kr/main/ | JCCI 2017]])
* [May 1] TCP congestion control (cont'd) and network layer: Virtual circuit and datagram networks
Changed line 63 from:
* [April 13] TCP congestion control
to:
* [April 13] TCP
Changed line 34 from:
* The midterm exam is scheduled at 1:30 pm, April 20 (%font color=red% Chapter 1 & 2 and Queueing will be covered.%font color=black%)
to:
* The midterm exam is scheduled at 1:30 pm, April 20 (%font color=red%Chapter 1 & 2 and Queueing will be covered.%font color=black%)
Changed line 34 from:
* The midterm exam is scheduled at 1:30 pm, April 20 (Chapter 1 & 2 and Queueing will be covered.)
to:
* The midterm exam is scheduled at 1:30 pm, April 20 (%font color=red% Chapter 1 & 2 and Queueing will be covered.%font color=black%)
Changed lines 64-65 from:
* [April 20] Midterm exam
to:
* [April 17] No class (Midterm week)
* [April 20] %font color=red%
Midterm exam
Changed line 34 from:
* The midterm exam is scheduled at 1:30 pm, April 20
to:
* The midterm exam is scheduled at 1:30 pm, April 20 (Chapter 1 & 2 and Queueing will be covered.)
April 03, 2017, at 11:26 AM EST by 192.168.102.62 -
Added lines 34-35:
* The midterm exam is scheduled at 1:30 pm, April 20
April 03, 2017, at 11:25 AM EST by 192.168.102.62 -
Changed lines 61-63 from:
* [April 13] TCP congestion control
to:
* [April 13] TCP congestion control

* [April 20] Midterm exam
Changed lines 57-61 from:
* [March 30] Application layer (cont'd) & Transport layer
to:
* [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 congestion control
Added lines 40-45:



* Paper reading assignment 1 (%font color=red%There will be related problems in the final exam.%font color=black%)
*D.-M. Chiu, and R. Jain, "[[ http://ac.els-cdn.com/0169755289900196/1-s2.0-0169755289900196-main.pdf?_tid=6348d074-15d0-11e6-bc63-00000aab0f6b&acdnat=1462789724_0b8236d07f28bf99243ce5074da19ba7 | Analysis of the increase and decrease algorithms for congestion avoidance in computer networks]]," Computer Networks and ISDN Systems, vol. 17, no. 1, 1989.
Changed line 36 from:
* Assignment 3: M/M/1 queue simulation (due: April 18)
to:
* Assignment 3: M/M/1 queue simulation (due: April 20)
Changed line 38 from:
--> (Check [[http://pages.cs.wisc.edu/~dsmyers/cs547/simulation_handout.pdf|this]] on how to simulate a queue. For the inverse CDF method, see [[ http://blogs.sas.com/content/iml/2013/07/22/the-inverse-cdf-method.html | this]].)
to:
--> (Check [[http://pages.cs.wisc.edu/~dsmyers/cs547/simulation_handout.pdf|this]] on how to simulate a queue. For the inverse CDF method, see [[ https://www.youtube.com/watch?v=TR0biDues7k | this]].)
Added lines 36-40:
* Assignment 3: M/M/1 queue simulation (due: April 18)
* 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 [[http://pages.cs.wisc.edu/~dsmyers/cs547/simulation_handout.pdf|this]] on how to simulate a queue. For the inverse CDF method, see [[ http://blogs.sas.com/content/iml/2013/07/22/the-inverse-cdf-method.html | this]].)
* Assignment 4: Problems 9, 10, 23, 24, 31 in Chapter 2 (due: April 20)
Changed line 35 from:
to:
* [[ Assignment 2 (Spring 2017 | Assignment 2: Socket programming]] (due: April 13)
Changed lines 43-46 from:
* [March 20] Introduction to queueing theory: M/M/1 queue
to:
* [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
Changed line 34 from:
to:
* Assignment 1: Problems 2, 3, 5, 6, 8, 13, 19, 24, 25, 31 in Chapter 1 (due: April 3)
Changed line 38 from:
* [March 2] Introduction to computer networking
to:
* [March 2] Class introduction and overview of computer networking
Changed lines 39-42 from:
* [March 6] Introduction to computer networking (cont'd)
* [March 9] Introduction to queueing theory: Definition and basic notation of queues, key components of queues, Little
's theorem
*
[March 13] Introduction to queueing theory: Poisson process
* [March 16]
Introduction to queueing theory: M/M/1 queue
to:
* [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
Changed line 21 from:
* %font color=red% The ppt slides for queueing theory lectures are available %font color=blue% [[(Attach:)queuing-theory-revised-kjp.ppt|here]]
to:
* %font color=red% The ppt slides for queueing theory lectures are available %font color=blue% [[(Attach:)IC522 Spring Queueing Intro.ppt|here]]
Changed lines 28-30 from:
to:
30% - Midterm exam \\
40% - Final exam \\
30% - Homework
Added lines 36-40:
* [March 2] Introduction to computer networking
* [March 6] Introduction to computer networking (cont'd)
* [March 9] Introduction to queueing theory: Definition and basic notation of queues, key components of queues, Little's theorem
* [March 13] Introduction to queueing theory: Poisson process
* [March 16] Introduction to queueing theory: M/M/1 queue
Changed lines 28-30 from:
30% - Midterm exam \\
40% - Final exam \\
30% - Homework
to:
Deleted line 37:
* [March 3] Class introduction, modeling of engineering systems
Changed lines 34-45 from:
* Assignment 1: Problems 2, 3, 5, 6, 8, 13, 19, 24, 25, 31 in Chapter 1 (due: April 4)
* Assignment 2: M/M/1 queue simulation (due: April 18)
* 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 [[http://pages.cs.wisc.edu/~dsmyers/cs547/simulation_handout.pdf|this]] on how to simulate a queue. For the inverse CDF method, see [[ http://blogs.sas.com/content/iml/2013/07/22/the-inverse-cdf-method.html | this]].)
* Assignment 3: Problems 9, 10, 23, 24, 31 in Chapter 2 (due: April 18)
* [[ Assignment 4 (Spring 2016 | Assignment 4: Socket programming]] (due: April 28)
* Assignment 5: Problems 12, 15, 26, 32, 40, 44, 45, 49, 52, 53 in Chapter 3 (due: May 16)
* Assignment 6: Problems 7, 9, 14, 26, 28, 30 in Chapter 4 (due: June 9)
* Assignment 7: Problems 8, 9, 10, 11, 12 in Chapter 5 (due: June 13)

* Paper reading assignment 1 (%font color=red%There will be related problems in the final exam.%font color=black%)
*D.-M. Chiu, and R. Jain, "[[ http://ac.els-cdn.com/0169755289900196/1-s2.0-0169755289900196-main.pdf?_tid=6348d074-15d0-11e6-bc63-00000aab0f6b&acdnat=1462789724_0b8236d07f28bf99243ce5074da19ba7 | Analysis of the increase and decrease algorithms for congestion avoidance in computer networks]]," Computer Networks and ISDN Systems, vol. 17, no. 1, 1989.
to:
Deleted lines 49-74:
* [March 7] Introduction to queueing theory: Definition and basic notation of queues, key components of queues, Little's theorem
* [March 10] Introduction to queueing theory: Poisson process
* [March 14] Introduction to queueing theory: M/M/1 queue
* [March 17] No class ([[https://www.kics.or.kr/home/kor/Event/board/bulletin_view.aspx?BulletinUID=0df9fcbf-be8d-44fd-924e-fd84080113db&EventUID=b4753c76-1759-46bc-9dff-d50f151992dd&BillboardUID=33351942-7ca5-4ee9-a5f1-8203e71801d7| 2016 KICS Machine Learning & IoT Workshop]])
* [March 21] Introduction to queueing theory: Examples
* [March 24] Introduction to computer networking
* [March 28] Introduction to computer networking (cont'd)
* [March 31] Application layer
* [April 4] Transport layer: UDP, reliable data transfer (regular class + %font color=red%makeup class%font color=black%)
* [April 7] No class (ONK Spring & DevCon 2016)
* [April 11 & 14] No class ([[http://www.cpsweek.org/2016/ | CPS Week 2016]])
* [April 18] Q&A session before the midterm exam (makeup class)
* [April 21] Midterm exam
* [April 25] Reliable data transfer (cont'd)
* [April 28] TCP
* [May 2] TCP congestion control
* [May 9] TCP congestion control (cont'd) and network layer: Virtual circuit and datagram networks
* [May 12] Network layer: Virtual circuit and datagram networks (cont'd)
* [May 16] Network layer: Inside of a router and routing algorithms
* [May 19] Routing algorithms (cont'd)
* [May 23] Routing in the Internet
* [May 26] No class (한국통신학회 Smart Transportation 워크샵)
* [May 30] Link layer: Introduction, error-detection
* [June 2] Multiple access
* [June 9] Introduction to wireless networks and wrap up
* [June 13] Final exam
Added lines 1-75:
(:Title 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
* %font color=red%Powerpoint slides can be downloaded at %font color=blue% http://www-net.cs.umass.edu/kurose-ross-ppt-6e/
* 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 %font color=blue%[[http://web.mit.edu/dimitrib/www/datanets.html | http://web.mit.edu/dimitrib/www/datanets.html]]).
* Introduction to queueing theory
* %font color=red% The ppt slides for queueing theory lectures are available %font color=blue% [[(Attach:)queuing-theory-revised-kjp.ppt|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: Problems 2, 3, 5, 6, 8, 13, 19, 24, 25, 31 in Chapter 1 (due: April 4)
* Assignment 2: M/M/1 queue simulation (due: April 18)
* 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 [[http://pages.cs.wisc.edu/~dsmyers/cs547/simulation_handout.pdf|this]] on how to simulate a queue. For the inverse CDF method, see [[ http://blogs.sas.com/content/iml/2013/07/22/the-inverse-cdf-method.html | this]].)
* Assignment 3: Problems 9, 10, 23, 24, 31 in Chapter 2 (due: April 18)
* [[ Assignment 4 (Spring 2016 | Assignment 4: Socket programming]] (due: April 28)
* Assignment 5: Problems 12, 15, 26, 32, 40, 44, 45, 49, 52, 53 in Chapter 3 (due: May 16)
* Assignment 6: Problems 7, 9, 14, 26, 28, 30 in Chapter 4 (due: June 9)
* Assignment 7: Problems 8, 9, 10, 11, 12 in Chapter 5 (due: June 13)

* Paper reading assignment 1 (%font color=red%There will be related problems in the final exam.%font color=black%)
*D.-M. Chiu, and R. Jain, "[[ http://ac.els-cdn.com/0169755289900196/1-s2.0-0169755289900196-main.pdf?_tid=6348d074-15d0-11e6-bc63-00000aab0f6b&acdnat=1462789724_0b8236d07f28bf99243ce5074da19ba7 | Analysis of the increase and decrease algorithms for congestion avoidance in computer networks]]," Computer Networks and ISDN Systems, vol. 17, no. 1, 1989.


'''Lectures:'''
* [March 3] Class introduction, modeling of engineering systems
* [March 7] Introduction to queueing theory: Definition and basic notation of queues, key components of queues, Little's theorem
* [March 10] Introduction to queueing theory: Poisson process
* [March 14] Introduction to queueing theory: M/M/1 queue
* [March 17] No class ([[https://www.kics.or.kr/home/kor/Event/board/bulletin_view.aspx?BulletinUID=0df9fcbf-be8d-44fd-924e-fd84080113db&EventUID=b4753c76-1759-46bc-9dff-d50f151992dd&BillboardUID=33351942-7ca5-4ee9-a5f1-8203e71801d7| 2016 KICS Machine Learning & IoT Workshop]])
* [March 21] Introduction to queueing theory: Examples
* [March 24] Introduction to computer networking
* [March 28] Introduction to computer networking (cont'd)
* [March 31] Application layer
* [April 4] Transport layer: UDP, reliable data transfer (regular class + %font color=red%makeup class%font color=black%)
* [April 7] No class (ONK Spring & DevCon 2016)
* [April 11 & 14] No class ([[http://www.cpsweek.org/2016/ | CPS Week 2016]])
* [April 18] Q&A session before the midterm exam (makeup class)
* [April 21] Midterm exam
* [April 25] Reliable data transfer (cont'd)
* [April 28] TCP
* [May 2] TCP congestion control
* [May 9] TCP congestion control (cont'd) and network layer: Virtual circuit and datagram networks
* [May 12] Network layer: Virtual circuit and datagram networks (cont'd)
* [May 16] Network layer: Inside of a router and routing algorithms
* [May 19] Routing algorithms (cont'd)
* [May 23] Routing in the Internet
* [May 26] No class (한국통신학회 Smart Transportation 워크샵)
* [May 30] Link layer: Introduction, error-detection
* [June 2] Multiple access
* [June 9] Introduction to wireless networks and wrap up
* [June 13] Final exam
History - Print - Recent Changes - Search
Page last modified on June 08, 2017, at 09:17 AM EST