Recent Changes - Search:

HomePage

Menu

Site Map

Spring 2016

Lectures.Spring2016 History

Hide minor edits - Show changes to output

June 08, 2016, at 11:27 PM EST by 114.199.44.103 -
Changed lines 72-74 from:
* [May 30]
* [June 2]
* [June 9
]
to:
* [May 30] Link layer: Introduction, error-detection
* [June 2
] Multiple access
* [June 9] Introduction to wireless networks and wrap up
May 25, 2016, at 12:41 AM EST by 114.199.44.103 -
Added line 42:
* Assignment 7: Problems 8, 9, 10, 11, 12 in Chapter 5 (due: June 13)
May 25, 2016, at 12:40 AM EST by 114.199.44.103 -
Changed line 41 from:
Assignment 6: Problems 7, 9, 14, 26, 28, 30 in Chapter 4 (due: June 9)
to:
* Assignment 6: Problems 7, 9, 14, 26, 28, 30 in Chapter 4 (due: June 9)
May 25, 2016, at 12:40 AM EST by 114.199.44.103 -
Added line 41:
Assignment 6: Problems 7, 9, 14, 26, 28, 30 in Chapter 4 (due: June 9)
Changed lines 66-67 from:
* [May 16] Network layer: Inside of a router, IP
* [May 19] Routing algorithms
to:
* [May 16] Network layer: Inside of a router and routing algorithms
* [May 19] Routing algorithms (cont'd)
Changed lines 65-68 from:
* [May 12]
* [May 16]
* [May 19]
* [May 23
]
to:
* [May 12] Network layer: Virtual circuit and datagram networks (cont'd)
* [May 16
] Network layer: Inside of a router, IP
* [May 19] Routing algorithms
* [May 23] Routing in the Internet
Added lines 41-43:

* 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 61 from:
* [May 9] TCP congestion control (cont'd) and Network layer: Virtual circuit and datagram networks
to:
* [May 9] TCP congestion control (cont'd) and network layer: Virtual circuit and datagram networks
Changed lines 61-70 from:
* [May 9] Network layer: Virtual circuit and datagram networks
to:
* [May 9] TCP congestion control (cont'd) and Network layer: Virtual circuit and datagram networks
* [May 12]
* [May 16]
* [May 19]
* [May 23]
* [May 26] No class (한국통신학회 Smart Transportation 워크샵)
* [May 30]
* [June 2]
* [June 9]
* [June 13] Final exam
Changed lines 40-41 from:
to:
* Assignment 5: Problems 12, 15, 26, 32, 40, 44, 45, 49, 52, 53 in Chapter 3 (due: May 16)
Changed lines 57-61 from:
* [April 21] Midterm exam
to:
* [April 21] Midterm exam
* [April 25] Reliable data transfer (cont'd)
* [April 28] TCP
* [May 2] TCP congestion control
* [May 9] Network layer: Virtual circuit and datagram networks
April 06, 2016, at 12:36 AM EST by 114.199.44.103 -
Changed line 39 from:
* [[ Assignment 4 (Spring 2016 | Assignment 4: Socket programming]] (due: April 18)
to:
* [[ Assignment 4 (Spring 2016 | Assignment 4: Socket programming]] (due: April 28)
Added line 39:
* [[ Assignment 4 (Spring 2016 | Assignment 4: Socket programming]] (due: April 18)
April 04, 2016, at 09:21 PM EST by 114.199.44.103 -
Changed line 35 from:
* Assignment 2: M/M/1 queue simulation (due: April 11)
to:
* Assignment 2: M/M/1 queue simulation (due: April 18)
April 03, 2016, at 12:03 PM EST by 114.199.44.103 -
Changed line 51 from:
* [April 4] Transport layer: UDP, and reliable data transfer (regular class + %font color=red%makeup class%font color=black%)
to:
* [April 4] Transport layer: UDP, reliable data transfer (regular class + %font color=red%makeup class%font color=black%)
April 03, 2016, at 12:01 PM EST by 114.199.44.103 -
Changed line 51 from:
* [April 4] Transport layer: UDP and reliable data transfer (regular class + %font color=red%makeup class%font color=black%)
to:
* [April 4] Transport layer: UDP, and reliable data transfer (regular class + %font color=red%makeup class%font color=black%)
April 03, 2016, at 12:00 PM EST by 114.199.44.103 -
Changed line 51 from:
* [April 4] Application layer and transport layer: UDP (regular class + %font color=red%makeup class%font color=black%)
to:
* [April 4] Transport layer: UDP and reliable data transfer (regular class + %font color=red%makeup class%font color=black%)
April 03, 2016, at 11:58 AM EST by 114.199.44.103 -
Changed line 54 from:
* [April 18] Q & A session before the midterm exam (makeup class)
to:
* [April 18] Q&A session before the midterm exam (makeup class)
April 03, 2016, at 11:58 AM EST by 114.199.44.103 -
Changed line 54 from:
* [April 18] Q&A session before the midterm exam (makeup class)
to:
* [April 18] Q & A session before the midterm exam (makeup class)
April 03, 2016, at 11:57 AM EST by 114.199.44.103 -
Changed line 54 from:
* [April 18] makeup class (Q&A session before the midterm exam)
to:
* [April 18] Q&A session before the midterm exam (makeup class)
April 03, 2016, at 11:57 AM EST by 114.199.44.103 -
Changed lines 53-55 from:
* [April 11 & 14] No class ([[http://www.cpsweek.org/2016/ | CPS Week 2016]])
to:
* [April 11 & 14] No class ([[http://www.cpsweek.org/2016/ | CPS Week 2016]])
* [April 18] makeup class (Q&A session before the midterm exam)
* [April 21] Midterm exam
April 03, 2016, at 11:52 AM EST by 114.199.44.103 -
Changed line 51 from:
* [April 4] Application layer and transport layer: UDP (%font color=red%makeup class%font color=black%)
to:
* [April 4] Application layer and transport layer: UDP (regular class + %font color=red%makeup class%font color=black%)
April 03, 2016, at 11:52 AM EST by 114.199.44.103 -
Changed lines 51-52 from:
* [April 4] Application layer (cont'd)
* [April 7] Transport
layer: UDP
to:
* [April 4] Application layer and transport layer: UDP (%font color=red%makeup class%font color=black%)
* [April 7] No class (ONK Spring & DevCon 2016)
April 03, 2016, at 11:49 AM EST by 114.199.44.103 -
Changed line 35 from:
* Assignment 2: One fast server vs. two slow servers (due: April 11)
to:
* Assignment 2: M/M/1 queue simulation (due: April 11)
April 03, 2016, at 11:49 AM EST by 114.199.44.103 -
Added lines 38-39:
* Assignment 3: Problems 9, 10, 23, 24, 31 in Chapter 2 (due: April 18)
March 29, 2016, at 01:56 AM EST by 114.199.44.103 -
Changed line 36 from:
* Compare M/M/1 with M/M/m by simulation. For simplicity, let m = 2, and carry out simulation when the system utilization is 0.1 and 0.9, respectively. Plot the waiting time and the number of customers of each system with respect to simulation time.
to:
* 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.
Changed line 37 from:
--> (Check [[http://pages.cs.wisc.edu/~dsmyers/cs547/simulation_handout.pdf|this]] on how to simulate a queue.)
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 [[ http://blogs.sas.com/content/iml/2013/07/22/the-inverse-cdf-method.html | this]].)
Changed line 37 from:
-> -> (Check [[http://pages.cs.wisc.edu/~dsmyers/cs547/simulation_handout.pdf|this]] on how to simulate a queue.)
to:
--> (Check [[http://pages.cs.wisc.edu/~dsmyers/cs547/simulation_handout.pdf|this]] on how to simulate a queue.)
Changed line 37 from:
-> (Check [[http://pages.cs.wisc.edu/~dsmyers/cs547/simulation_handout.pdf|this]] on how to simulate a queue.)
to:
-> -> (Check [[http://pages.cs.wisc.edu/~dsmyers/cs547/simulation_handout.pdf|this]] on how to simulate a queue.)
Changed line 37 from:
>> (Check [[http://pages.cs.wisc.edu/~dsmyers/cs547/simulation_handout.pdf|this]] on how to simulate a queue.)
to:
-> (Check [[http://pages.cs.wisc.edu/~dsmyers/cs547/simulation_handout.pdf|this]] on how to simulate a queue.)
Changed line 37 from:
(Check [[http://pages.cs.wisc.edu/~dsmyers/cs547/simulation_handout.pdf|this]] on how to simulate a queue.)
to:
>> (Check [[http://pages.cs.wisc.edu/~dsmyers/cs547/simulation_handout.pdf|this]] on how to simulate a queue.)
Changed line 37 from:
(Check [[(Attach:)queuing-theory-revised-kjp.ppt|this]] on how to simulate a queue.)
to:
(Check [[http://pages.cs.wisc.edu/~dsmyers/cs547/simulation_handout.pdf|this]] on how to simulate a queue.)
Changed line 37 from:
(Check this on how to simulate a queue.)
to:
(Check [[(Attach:)queuing-theory-revised-kjp.ppt|this]] on how to simulate a queue.)
Changed line 37 from:
to:
(Check this on how to simulate a queue.)
March 25, 2016, at 06:46 AM EST by 114.199.44.103 -
Changed lines 34-36 from:
to:
* Assignment 1: Problems 2, 3, 5, 6, 8, 13, 19, 24, 25, 31 in Chapter 1 (due: April 4)
* Assignment 2: One fast server vs. two slow servers (due: April 11)
* Compare M/M/1 with M/M/m by simulation. For simplicity, let m = 2, and carry out simulation when the system utilization is 0.1 and 0.9, respectively. Plot the waiting time and the number of customers of each system with respect to simulation time.
March 25, 2016, at 06:39 AM EST by 114.199.44.103 -
Changed lines 43-49 from:
* [March 21] Introduction to queueing theory: Examples
to:
* [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] Application layer (cont'd)
* [April 7] Transport layer: UDP
* [April 11 & 14] No class ([[http://www.cpsweek.org/2016/ | CPS Week 2016]])
Changed line 42 from:
* [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| Machine Learning & IoT Workshop]])
to:
* [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]])
Changed lines 42-43 from:
* [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| Machine Learning & IoT Workshop]])
to:
* [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| Machine Learning & IoT Workshop]])
* [March 21] Introduction to queueing theory: Examples
Changed lines 39-42 from:
* [March 7] Introduction to queueing theory: Definition and basic notation of queues
* [March 10] Introduction to queueing theory: Key components of queues, Little's theorem
* [March 14] Introduction to queueing
theory: Poisson process
* [March 17] Introduction to queueing theory: M/M/1 queue
to:
* [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| Machine Learning & IoT Workshop]])
Added lines 38-42:
* [March 3] Class introduction, modeling of engineering systems
* [March 7] Introduction to queueing theory: Definition and basic notation of queues
* [March 10] Introduction to queueing theory: Key components of queues, Little's theorem
* [March 14] Introduction to queueing theory: Poisson process
* [March 17] Introduction to queueing theory: M/M/1 queue
Added lines 20-21:
* 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]]
Added lines 1-35:
(:Title Spring 2016:)



[++'''IC522: Computer Networks (Spring 2016) '''++]

--------------------------------------------------------------------------------

'''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]]).


'''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:'''



'''Lectures:'''
History - Print - Recent Changes - Search
Page last modified on April 24, 2017, at 10:24 AM EST