|
Menu Site Map |
Lectures /
Spring 2013Lectures.Spring2013 HistoryHide minor edits - Show changes to output Changed line 60 from:
* [May 2] No class ([[http://2013.jcci.kr/main/]]) to:
* [May 2] No class ([[http://2013.jcci.kr/main/|JCCI 2013]]) Changed line 60 from:
* [May 2] No class ([[http://jcci.kr/main/ to:
* [May 2] No class ([[http://2013.jcci.kr/main/]]) Changed line 39 from:
* Assignment 6: Problems 3, 8, 9, 10, 11, 12 (of the 5th Edition) (due: June 18) to:
* Assignment 6: Problems 3, 8, 9, 10, 11, 12 in Chapter 5 (of the 5th Edition) (due: June 18) Changed line 57 from:
* [April 23] Transport layer: Reliable data to:
* [April 23] Transport layer: Reliable data transfer (makeup class in midterm week) Added line 39:
* Assignment 6: Problems 3, 8, 9, 10, 11, 12 (of the 5th Edition) (due: June 18) Changed lines 69-71 from:
* [June 4] * [June 11] * [June 13 to:
* [June 4] Link Layer: Introduction, error-detection * [June 11] Multiple access, switched LAN (Class begins at 1:00 pm) * [June 13] No class * [June 18] Final exam Added line 38:
* Assignment 5: Problems 7, 11, 14, 19, 20, 23, 25 in Chapter 4 (of the 5th Edition) (due: June 18) Changed lines 67-69 from:
* [May 30] * * [June to:
* [May 30] Routing algorithms * [May 31] Makeup class: Routing algorithms, routing in the Internet, broadcast and multicast (1:30 pm) * [June 4] Changed line 48 from:
* [March 28] Introduction to queueing theory: Little's to:
* [March 28] Introduction to queueing theory: Little's Law Changed line 48 from:
* [March 28] Introduction to queueing theory: Little's to:
* [March 28] Introduction to queueing theory: Little's law Changed lines 67-70 from:
* [May 31] Makeup class (1:30 pm) to:
* [May 31] Makeup class (1:30 pm) * [June 4] * [June 11] * [June 13] Changed lines 38-39 from:
to:
* %font color=red%Final exam is scheduled on June 18 in our class hour.%font color=black% Changed lines 63-64 from:
* [May 21] Network layer: Virtual circuit and datagram networks * to:
* [May 21] Network layer: Virtual circuit and datagram networks * [May 23] No class ([[http://iset2013.iemek.org/main/|ISET 2013]]) * [May 28] Network layer: Inside of a router, IP Changed line 64 from:
* [May 24] No class (ISET 2013) to:
* [May 24] No class ([[http://iset2013.iemek.org/main/|ISET 2013]]) Changed line 37 from:
to:
* Assignment 4: Problems 4, 6, 12, 32, 33, 38, 40 in Chapter 3 (of the 5th Edition) (due: June 6) Added line 63:
* [May 21] Network layer: Virtual circuit and datagram networks, inside of a router Changed lines 36-38 from:
*A. Afanasyev, N. Tilley, P. Reiher, and L. Kleinrock, " to:
*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 63 from:
* [May 31] Makeup class (1:30 pm) to:
* [May 31] Makeup class (1:30 pm) Changed lines 35-38 from:
to:
* Paper reading assignment 2 (%font color=red%There will be related problems in the final exam.%font color=black%) *A. Afanasyev, N. Tilley, P. Reiher, and L. Kleinrock, "Host-to-host congestion control for TCP," IEEE Communications Surveys & Tutorials, vol. 12, no. 3, 2010. http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5462976 Deleted line 62:
Changed lines 59-60 from:
* [May 31] Makeup class (1:30 pm) to:
* [May 31] Makeup class (1:30 pm) Added lines 56-58:
* [May 9] Connection-oriented transport: TCP * [May 14] Connection-oriented transport: TCP (cont'd) * [May 16] TCP congestion control Changed lines 54-55 from:
* [May 2] No class ([[http://jcci.kr/main/|JCCI]]) to:
* [May 2] No class ([[http://jcci.kr/main/|JCCI]]) * [May 31] Makeup class (1:30 pm) Changed line 29 from:
* [[ Assignment 3 | Assignment 3: Socket to:
* [[ Assignment 3 | Assignment 3: Socket programming]] (due: May 7) Changed line 29 from:
* [[ Assignment 3 | Assignment 3: Socket Programming]] to:
* [[ Assignment 3 | Assignment 3: Socket Programming]] (due: May 7) Changed line 29 from:
* [[ Assignment 3 | Assignment 3: Socket to:
* [[ Assignment 3 | Assignment 3: Socket Programming]] Changed line 29 from:
* [[ Assignment 3 | Assignment 3: Socket to:
* [[ Assignment 3 | Assignment 3: Socket programming]] Changed line 29 from:
to:
* [[ Assignment 3 | Assignment 3: Socket programing]] Changed line 28 from:
* Assignment 2: By computer simulation, in M/M/1/2 queue, show that the empirical buffer overflow probability converges to the analytic probability. ( to:
* Assignment 2: By computer simulation, in M/M/1/2 queue, show that the empirical buffer overflow probability converges to the analytic probability. (Due: April 25) Changed line 54 from:
* [May 2] No class () to:
* [May 2] No class ([[http://jcci.kr/main/|JCCI]]) Changed lines 48-54 from:
* [April 11] Buffer overflow probability to:
* [April 11] Buffer overflow probability revisited * [April 16] Queueing examples in the lecture slides * [April 18] Transport layer: UDP * [April 23] Transport layer: Reliable data transfer * [April 25] Midterm exam * [April 30] Transport layer: Reliable data transfer (cont'd) * [May 2] No class () Changed lines 47-48 from:
* [April * [April to:
* [April 9] Application layer (cont'd) * [April 11] Buffer overflow probability revisited Changed lines 46-48 from:
* [April 4] Application to:
* [April 4] Application layer * [April 4] Application layer (cont'd) * [April 4] Buffer overflow probability revisited Added line 28:
* Assignment 2: By computer simulation, in M/M/1/2 queue, show that the empirical buffer overflow probability converges to the analytic probability. (due: April 25) Added line 26:
* %font color=red%Midterm exam is scheduled on April 25 in our class hour.%font color=black% Changed line 28 from:
* Paper reading assignment 1 (%font color=red% to:
* Paper reading assignment 1 (%font color=red%There will be related problems in the final exam.%font color=black%) Changed line 28 from:
* Paper reading assignment 1 (%font color=red% There will be related problems in the final exam.) to:
* Paper reading assignment 1 (%font color=red% There will be related problems in the final exam.%font color=black%) Changed line 28 from:
* Paper reading assignment 1 (There will be related problems in the final exam.) to:
* Paper reading assignment 1 (%font color=red% There will be related problems in the final exam.) Changed line 28 from:
* Paper reading assignment 1 (There will be related problems in the to:
* Paper reading assignment 1 (There will be related problems in the final exam.) Changed lines 43-44 from:
* [April 2] Introduction to queueing theory: M/M/1 to:
* [April 2] Introduction to queueing theory: M/M/1 queue * [April 4] Application layer Changed lines 42-43 from:
* [March 28] Introduction to queueing theory: Little's to:
* [March 28] Introduction to queueing theory: Little's Law * [April 2] Introduction to queueing theory: M/M/1 queue Changed line 26 from:
* Assignment 1: Problems 2, 3, 5, 6, 10, 11, 15, 17, 24, 26 in Chapter 1 (due: April 4) to:
* Assignment 1: Problems 2, 3, 5, 6, 10, 11, 15, 17, 24, 26 in Chapter 1 of the 5th edition (due: April 4) Added lines 26-27:
* Assignment 1: Problems 2, 3, 5, 6, 10, 11, 15, 17, 24, 26 in Chapter 1 (due: April 4) Changed line 27 from:
to:
*S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance," IEEE/ACM Trans. on Networking, vol. 1, no. 1, Aug. 1993. Changed line 27 from:
*S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance," IEEE/ACM Trans. on Networking, vol. 1, no. 1, Aug. 1993. to:
**S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance," IEEE/ACM Trans. on Networking, vol. 1, no. 1, Aug. 1993. Deleted lines 25-26:
Changed line 26 from:
to:
(:* Assignment 1: Problems 2, 3, 5, 6, 10, 11, 15, 17, 24, 26 in Chapter 1 (of the 5th edition) (due: April 4) :) Changed line 26 from:
* Assignment 1: Problems 2, 3, 5, 6, 10, 11, 15, 17, 24, 26 in Chapter 1 (of the 5th edition) (due: April 4) to:
%* Assignment 1: Problems 2, 3, 5, 6, 10, 11, 15, 17, 24, 26 in Chapter 1 (of the 5th edition) (due: April 4) Changed line 28 from:
* Paper to:
* Paper reading assignment 1 (There will be related problems in the midterm.) Changed lines 30-31 from:
to:
*J. Padhye, V. Firoiu, D. Towsley, and J. Kurose, "Modeling TCP throughput: a simple model and its empirical validation," Sigcomm 1998. *M. Christiansen, K. Jeffay, D. Ott, and F. D. Smith, "Tuning RED for web traffic," Sigcomm 2000. *C. V. Hollot, V. Misra, D. Towsley, and W.-B. Gong, "A control theoretic analysis of RED," INFOCOM 2001. Changed line 29 from:
S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance," IEEE/ACM Trans. on Networking, vol. 1, no. 1, Aug. 1993. to:
*S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance," IEEE/ACM Trans. on Networking, vol. 1, no. 1, Aug. 1993. Added lines 27-31:
* Paper presentation 2 S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance," IEEE/ACM Trans. on Networking, vol. 1, no. 1, Aug. 1993. J. Padhye, V. Firoiu, D. Towsley, and J. Kurose, "Modeling TCP throughput: a simple model and its empirical validation," Sigcomm 1998. M. Christiansen, K. Jeffay, D. Ott, and F. D. Smith, "Tuning RED for web traffic," Sigcomm 2000. Changed lines 34-36 from:
* [March 21] Introduction to queueing to:
* [March 21] Introduction to queueing theory: Definition and basic notation of queues * [March 26] Introduction to queueing theory: Key components of queues * [March 28] Introduction to queueing theory: Little's Law Changed lines 26-27 from:
to:
* Assignment 1: Problems 2, 3, 5, 6, 10, 11, 15, 17, 24, 26 in Chapter 1 (of the 5th edition) (due: April 4) Changed line 34 from:
* [March 21] Introduction to queueing theory to:
* [March 21] Introduction to queueing theory Changed lines 29-30 from:
* [March 7] Introduction to computer networking to:
* [March 7] Introduction to computer networking: Network edge * [March 12] No class * [March 14] Introduction to computer networking: Network core * [March 19] Introduction to computer networking: Delay, loss, and throughput & protocol layers * [March 21] Introduction to queueing theory Changed lines 28-29 from:
* [ * [ to:
* [March 5] Overview of the state-of-the-art of networking * [March 7] Introduction to computer networking * [March 12] Introduction to computer networking Changed line 20 from:
* %font color=red% The ppt slides for queueing theory lectures to:
* %font color=red% The ppt slides for queueing theory lectures are available %font color=blue% [[(Attach:)queuing-theory-revised-kjp.ppt|here]] Changed line 15 from:
* %font color=red%Powerpoint slides can be downloaded at to:
* %font color=red%Powerpoint slides can be downloaded at %font color=blue% http://www-net.cs.umass.edu/kurose-ross-ppt-6e/ Changed line 20 from:
* to:
* %font color=red% The ppt slides for queueing theory lectures is available %font color=blue% [[(Attach:)queuing-theory-revised-kjp.ppt|here]] Changed line 20 from:
* to:
* The ppt slides for queueing theory lectures is available [[(Attach:)queuing-theory-revised-kjp.ppt|here]] Changed lines 19-21 from:
to:
* Introduction to queueing theory * %font color=red% The ppt slides for queueing theory lectures is available [[(Attach:)queuing-theory-revised-kjp.ppt|here]] Changed lines 26-27 from:
* The ppt slides for queueing theory lectures is available [[(Attach:)queuing-theory-revised-kjp.ppt|here]] to:
Changed line 25 from:
* The ppt to:
* The ppt slides for queueing theory lectures is available [[(Attach:)queuing-theory-revised-kjp.ppt|here]] Changed line 15 from:
* %font color=red%Powerpoint slides can be downloaded at%font color=black% http://www-net.cs.umass.edu/kurose-ross-ppt-6e/ to:
* %font color=red%Powerpoint slides can be downloaded at%font color=black% %font color=blue% http://www-net.cs.umass.edu/kurose-ross-ppt-6e/ Changed line 15 from:
* %font color=red%Powerpoint to:
* %font color=red%Powerpoint slides can be downloaded at%font color=black% http://www-net.cs.umass.edu/kurose-ross-ppt-6e/ Changed line 15 from:
* to:
* %font color=red%Powerpoint Slides can be downloaded at%font color=black% http://www-net.cs.umass.edu/kurose-ross-ppt-6e/ Changed line 15 from:
* to:
* (%font color=red%Powerpoint Slides can be downloaded at%font color=black%) http://www-net.cs.umass.edu/kurose-ross-ppt-6e/ Changed line 15 from:
* Powerpoint Slides can be downloaded http://www-net.cs.umass.edu/kurose-ross-ppt-6e/ to:
* Powerpoint Slides can be downloaded at http://www-net.cs.umass.edu/kurose-ross-ppt-6e/ Changed line 15 from:
* to:
* Powerpoint Slides can be downloaded http://www-net.cs.umass.edu/kurose-ross-ppt-6e/ Added lines 26-27:
* [Mar. 5] Overview of the state-of-the-art of networking * [Mar. 7] Introduction to computer networking Changed lines 23-24 from:
to:
* Introduction to queueing theory * The ppt slide for queueing theory lectures is available [[(Attach:)queuing-theory-revised-kjp.ppt|here]] Added lines 1-24:
(:Title Spring 2013:) [++'''IC531: Communication Networks (Spring 2013) '''++] -------------------------------------------------------------------------------- '''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 * 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 data 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 read several key research papers to deal with the state-of-the-art research on data 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.\\\ '''Announcement:''' '''Lectures:''' |