|
Menu Site Map |
Lectures /
Spring 2015Lectures.Spring2015 HistoryHide minor edits - Show changes to output Changed line 60 from:
* [April 14 & 16] No class ([[http://www.cpsweek.org/2015/| CPS Week to:
* [April 14 & 16] No class ([[http://www.cpsweek.org/2015/| CPS Week 2015]]) Changed line 74 from:
* [June 9] Link to:
* [June 9] Link layer: Introduction, error-detection Changed line 75 from:
* [June 11] Multiple access to:
* [June 11] Multiple access and wrap up Changed line 75 from:
* [June 11]Multiple access (cont'd) and wrap up to:
* [June 11] Multiple access (cont'd) and wrap up Changed line 72 from:
* [June 2] to:
* [June 2] No class (GRL Workshop) Changed line 74 from:
* [June 9] to:
* [June 9] Link Layer: Introduction, error-detection Changed lines 72-73 from:
* [June * [June 2] Multiple access to:
* [June 2] Link Layer: Introduction, error-detection Changed lines 74-75 from:
* [June 9] Multiple access to:
* [June 9] Multiple access * [June 11]Multiple access (cont'd) and wrap up Changed line 75 from:
* [June 9] Multiple access (cont'd) to:
* [June 9] Multiple access (cont'd) Added lines 40-41:
* 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) Changed lines 71-74 from:
[June 2] Multiple access [June 4] No class ([[http://iset2015.iemek.org/main/| ISET 2015]]) [June 9] Multiple access (cont'd), [June 11] CSMA in wireless networks and wrap up to:
* [June 2] Multiple access * [June 4] No class ([[http://iset2015.iemek.org/main/| ISET 2015]]) * [June 9] Multiple access (cont'd), * [June 11] CSMA in wireless networks and wrap up Added lines 70-74:
* [June 3] Link Layer: Introduction, error-detection [June 2] Multiple access [June 4] No class ([[http://iset2015.iemek.org/main/| ISET 2015]]) [June 9] Multiple access (cont'd), [June 11] CSMA in wireless networks and wrap up Added lines 68-69:
* [May 26] Routing algorithms * [May 28] Routing in the Internet Changed lines 67-68 from:
* [May 21] Network layer: Inside of a router, to:
* [May 21] Network layer: Inside of a router, IP * [June 16] Final exam Changed lines 65-67 from:
* [May 14] TCP congestion to:
* [May 14] TCP congestion control * [May 19] Network layer: Virtual circuit and datagram networks * [May 21] Network layer: Inside of a router, IP Added line 39:
* Assignment 6: Problems 12, 15, 26, 32, 40, 44, 45, 49, 52, 53 in Chapter 3 (due: June 2) Changed lines 63-64 from:
* [May 12] to:
* [May 12] TCP * [May 14] TCP congestion control Changed lines 61-63 from:
* [%font color=red%May 1%font color=black%] Makeup class: Reliable data transfer (Class begins at 1 pm) to:
* [%font color=red%May 1%font color=black%] Makeup class: Reliable data transfer (Class begins at 1 pm) * [May 7] Reliable data transfer * [May 12] TCP Changed line 61 from:
* [%font color=red% to:
* [%font color=red%May 1%font color=black%] Makeup class: Reliable data transfer (Class begins at 1 pm) Changed line 57 from:
* [April 14 & 16] No class ([[http:// to:
* [April 14 & 16] No class ([[http://www.cpsweek.org/2015/| CPS Week 015]]) Changed line 60 from:
* [April 28 & 30] No class ([[http:// to:
* [April 28 & 30] No class ([[http://infocom2015.ieee-infocom.org/| Infocom 2015]]) Changed line 61 from:
* [ to:
* [%font color=red%April 31%font color=black%] Makeup class: Reliable data transfer (Class begins at 1 pm) Changed lines 40-43 from:
to:
* Paper reading assignment 1 (%font color=red%There will be related problems in the final exam.%font color=black%) *A. Afanasyev, N. Tilley, P. Reiher, and L. Kleinrock, "[[ http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5462976 | Host-to-host congestion control for TCP]]," IEEE Communications Surveys & Tutorials, vol. 12, no. 3, 2010. Changed line 57 from:
* [April 14 & 16] No class to:
* [April 14 & 16] No class ([[http://infocom2014.ieee-infocom.org/| CPS Week 015]]) Added lines 59-61:
* [April 23] Transport layer: UDP * [April 28 & 30] No class ([[http://infocom2014.ieee-infocom.org/| Infocom 2015]]) * [April 31] Makeup class: Reliable data transfer (Class begins at 1 pm) Changed lines 54-55 from:
* [April 14 * to:
* [April 14 & 16] No class * [April 21] Midterm exam Changed line 35 from:
* [[ Assignment 3 (Spring 2015) | Assignment to:
* [[ Assignment 3 (Spring 2015) | Assignment 3: Socket programming]] (due: April 23) Changed lines 35-36 from:
* Assignment 3 * Assignment 4: One fast server vs. multiple slow servers (due: April 16) to:
* [[ Assignment 3 (Spring 2015) | Assignment 5: 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) Changed line 39 from:
to:
Changed lines 35-36 from:
* * Assignment 4: to:
* Assignment 3: Problems 9, 10, 23, 24, 31 in Chapter 2 (due: April 16) * Assignment 4: 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 3 (Spring 2015) | Assignment 5: Socket programming]] (due: April 16) Changed lines 50-52 from:
* [April 9] Introduction to queueing theory: M/M/1 to:
* [April 9] Introduction to queueing theory: M/M/1 queue * [April 14] No class (midterm week) * [April 16] Midterm exam Changed lines 46-50 from:
* [March 26] to:
* [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 Changed line 36 from:
to:
* Assignment 4: Problems 9, 10, 23, 24, 31 in Chapter 2 (due: April 16) Changed line 35 from:
* [[ Assignment 3 (Spring 2015) | Assignment 3: Socket programming]] (due: to:
* [[ Assignment 3 (Spring 2015) | Assignment 3: Socket programming]] (due: April 16) Changed line 35 from:
* [[ Assignment 3 | Assignment 3: Socket programming]] (due: ) to:
* [[ Assignment 3 (Spring 2015) | Assignment 3: Socket programming]] (due: ) Added line 35:
* [[ Assignment 3 | Assignment 3: Socket programming]] (due: ) Added line 34:
* Assignment 2: Problems 2, 3, 5, 6, 8, 13, 19, 24, 25, 31 in Chapter 1 (due: March 31) Added line 33:
* Assignment 1: Two questions on Page 30 of lecture slides of Chapter 1 %font color=red% and carry out simulation %font color=black% (due: March 19) Changed lines 39-43 from:
* [March 12] Introduction to computer networking: Network to:
* [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] Application layer (cont'd) Added lines 36-39:
* [March 3] Overview of the state-of-the-art of networking * [March 5] No class ([[http://www.kics.or.kr/Home/UserContents/20150302/150302_172043186.pdf|ICT Convergence Korea 2015]]) * [March 10] Introduction to computer networking: Network edge * [March 12] Introduction to computer networking: Network core Changed lines 11-13 from:
Office hours: By appointment, E3- to:
Office hours: By appointment, E3-513 DGIST Changed lines 33-44 from:
* Assignment 2: Problems 2, 3, 5, 6, 8, 13, 19, 24, 25, 31 in Chapter 1 (due: March 27) * Assignment 3: One fast server vs. multiple slow servers (due: April 10) * 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 4 | Assignment 4: Socket programming]] (due: April 24) * Assignment 5: Problems 12, 15, 26, 32, 40, 44, 45, 49, 52, 53 in Chapter 3 (due: May 29) * Assignment 6: Problems 7, 9, 14, 26, 28, 30 in Chapter 4 (due: June 17) * Assignment 7: Problems 8, 9, 10, 11, 12 in Chapter 5 (due: June 17) * Paper reading assignment 1 (%font color=red%There will be related problems in the {-midterm-} final exam.%font color=black%) *A. Afanasyev, N. Tilley, P. Reiher, and L. Kleinrock, "[[ http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5462976 | Host-to-host congestion control for TCP]]," IEEE Communications Surveys & Tutorials, vol. 12, no. 3, 2010. to:
Deleted lines 35-64:
* [March 6] Introduction to computer networking: Network core * [March 11] Introduction to computer networking: Delay, loss, and throughput & protocol layers * [March 13] Introduction to computer networking: Delay, loss, and throughput & protocol layers (cont'd) * [March 18] Introduction to queueing theory: Definition and basic notation of queues * [March 20] Introduction to queueing theory: Key components of queues, Little's theorem * [March 25] Introduction to queueing theory: Poisson process * [March 27] Introduction to queueing theory: M/M/1 queue * [April 1] No class * [April 3] Application layer * [April 8] Application layer (cont'd) * [April 10] Application layer (cont'd) (Class begins at 1 pm) * [April 15] Transport layer: UDP, reliable data transfer (Class begins at 1 pm) * [April 17] Transport layer: Reliable data transfer (Class begins at 1 pm) * [April 22] Connection-oriented transport: TCP (makeup class in the midterm exam week) * [April 24] Midterm exam * [April 29, May 1] No class ([[http://infocom2014.ieee-infocom.org/| Infocom 2014]]) * [May 6] No class ([[http://en.wikipedia.org/wiki/Buddha's_Birthday| Buddha's Birthday]]) * [May 8] TCP (cont'd) * [May 13] TCP congestion control * [May 15] Network layer: Virtual circuit and datagram networks * [May 20] No class ([[http://www.ieeevtc.org/vtc2014spring/ | VTC 2014-Spring]]) * [May 22] Network layer: Inside of a router, IP * [May 27] Routing algorithms * [May 29] Routing in the Internet * [June 3] Link Layer: Introduction, error-detection * [June 5] Multiple access * [June 10] Multiple access (cont'd), * [June 12] CSMA in wireless networks and wrap up * [June 17] Final exam Changed lines 1-6 from:
(:Title Spring [++'''IC522: Computer Networks (Spring to:
(:Title Spring 2015:) [++'''IC522: Computer Networks (Spring 2015) '''++] Changed line 11 from:
Office hours: By appointment, to:
Office hours: By appointment, E3-322 DGIST Added lines 1-75:
(:Title Spring 2014:) [++'''IC522: Computer Networks (Spring 2014) '''++] -------------------------------------------------------------------------------- '''Instructor: '''\\ Kyung-Joon Park\\ Office hours: By appointment, 3-309 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: Two questions on Page 30 of lecture slides of Chapter 1 %font color=red% and carry out simulation %font color=black% (due: {-March 18-} %font color=red% March 20 %font color=black%) * Assignment 2: Problems 2, 3, 5, 6, 8, 13, 19, 24, 25, 31 in Chapter 1 (due: March 27) * Assignment 3: One fast server vs. multiple slow servers (due: April 10) * 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 4 | Assignment 4: Socket programming]] (due: April 24) * Assignment 5: Problems 12, 15, 26, 32, 40, 44, 45, 49, 52, 53 in Chapter 3 (due: May 29) * Assignment 6: Problems 7, 9, 14, 26, 28, 30 in Chapter 4 (due: June 17) * Assignment 7: Problems 8, 9, 10, 11, 12 in Chapter 5 (due: June 17) * Paper reading assignment 1 (%font color=red%There will be related problems in the {-midterm-} final exam.%font color=black%) *A. Afanasyev, N. Tilley, P. Reiher, and L. Kleinrock, "[[ http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5462976 | Host-to-host congestion control for TCP]]," IEEE Communications Surveys & Tutorials, vol. 12, no. 3, 2010. '''Lectures:''' * [March 4] Introduction to computer networking: Network edge * [March 6] Introduction to computer networking: Network core * [March 11] Introduction to computer networking: Delay, loss, and throughput & protocol layers * [March 13] Introduction to computer networking: Delay, loss, and throughput & protocol layers (cont'd) * [March 18] Introduction to queueing theory: Definition and basic notation of queues * [March 20] Introduction to queueing theory: Key components of queues, Little's theorem * [March 25] Introduction to queueing theory: Poisson process * [March 27] Introduction to queueing theory: M/M/1 queue * [April 1] No class * [April 3] Application layer * [April 8] Application layer (cont'd) * [April 10] Application layer (cont'd) (Class begins at 1 pm) * [April 15] Transport layer: UDP, reliable data transfer (Class begins at 1 pm) * [April 17] Transport layer: Reliable data transfer (Class begins at 1 pm) * [April 22] Connection-oriented transport: TCP (makeup class in the midterm exam week) * [April 24] Midterm exam * [April 29, May 1] No class ([[http://infocom2014.ieee-infocom.org/| Infocom 2014]]) * [May 6] No class ([[http://en.wikipedia.org/wiki/Buddha's_Birthday| Buddha's Birthday]]) * [May 8] TCP (cont'd) * [May 13] TCP congestion control * [May 15] Network layer: Virtual circuit and datagram networks * [May 20] No class ([[http://www.ieeevtc.org/vtc2014spring/ | VTC 2014-Spring]]) * [May 22] Network layer: Inside of a router, IP * [May 27] Routing algorithms * [May 29] Routing in the Internet * [June 3] Link Layer: Introduction, error-detection * [June 5] Multiple access * [June 10] Multiple access (cont'd), * [June 12] CSMA in wireless networks and wrap up * [June 17] Final exam |