Recent Changes - Search:

HomePage

Menu

Site Map

Spring 2013

Lectures.Spring2013 History

Hide minor edits - Show changes to markup

Changed line 60 from:
  • [May 2] No class (http://2013.jcci.kr/main/)
to:
  • [May 2] No class (JCCI 2013)
Changed line 60 from:
  • [May 2] No class (JCCI)
to:
  • [May 2] No class (http://2013.jcci.kr/main/)
June 08, 2013, at 12:49 PM EST by 121.181.93.122 -
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)
June 08, 2013, at 12:47 PM EST by 121.181.93.122 -
Changed line 57 from:
  • [April 23] Transport layer: Reliable data transfer
to:
  • [April 23] Transport layer: Reliable data transfer (makeup class in midterm week)
June 08, 2013, at 12:43 PM EST by 121.181.93.122 -
Added line 39:
  • Assignment 6: Problems 3, 8, 9, 10, 11, 12 (of the 5th Edition) (due: June 18)
June 08, 2013, at 12:34 PM EST by 121.181.93.122 -
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
June 08, 2013, at 12:31 PM EST by 121.181.93.122 -
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]
  • [May 31] Makeup class (1:30 pm)
  • [June 4]
to:
  • [May 30] Routing algorithms
  • [May 31] Makeup class: Routing algorithms, routing in the Internet, broadcast and multicast (1:30 pm)
  • [June 4]
June 04, 2013, at 12:20 AM EST by 121.181.93.122 -
Changed line 48 from:
  • [March 28] Introduction to queueing theory: Little's law
to:
  • [March 28] Introduction to queueing theory: Little's Law
June 04, 2013, at 12:20 AM EST by 121.181.93.122 -
Changed line 48 from:
  • [March 28] Introduction to queueing theory: Little's Law
to:
  • [March 28] Introduction to queueing theory: Little's law
May 29, 2013, at 11:15 PM EST by 121.181.93.122 -
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]
May 29, 2013, at 11:14 PM EST by 121.181.93.122 -
Added line 66:
  • [May 30]
May 29, 2013, at 11:13 PM EST by 121.181.93.122 -
Changed lines 38-39 from:
to:
  • Final exam is scheduled on June 18 in our class hour.
Changed lines 63-64 from:
  • [May 21] Network layer: Virtual circuit and datagram networks, inside of a router
  • [May 24] No class (ISET 2013)
to:
  • [May 21] Network layer: Virtual circuit and datagram networks
  • [May 23] No class (ISET 2013)
  • [May 28] Network layer: Inside of a router, IP
May 23, 2013, at 03:51 AM EST by 121.181.93.122 -
Changed line 64 from:
  • [May 24] No class (ISET 2013)
to:
  • [May 24] No class (ISET 2013)
May 23, 2013, at 03:51 AM EST by 121.181.93.122 -
Added line 64:
  • [May 24] No class (ISET 2013)
May 23, 2013, at 12:16 AM EST by 121.181.93.122 -
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)
May 23, 2013, at 12:14 AM EST by 121.181.93.122 -
Added line 63:
  • [May 21] Network layer: Virtual circuit and datagram networks, inside of a router
May 23, 2013, at 12:11 AM EST by 121.181.93.122 -
Changed lines 36-38 from:
  *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

to:
  *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.
Changed line 63 from:
  • [May 31] Makeup class (1:30 pm)
to:
  • [May 31] Makeup class (1:30 pm)
May 23, 2013, at 12:10 AM EST by 121.181.93.122 -
Changed lines 35-38 from:
to:
  • Paper reading assignment 2 (There will be related problems in the final exam.)
    • 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:
May 14, 2013, at 09:41 PM EST by 121.181.93.122 -
Changed lines 59-60 from:
  • [May 31] Makeup class (1:30 pm)
to:
  • [May 31] Makeup class (1:30 pm)
May 14, 2013, at 09:38 PM EST by 121.181.93.122 -
Added lines 56-58:
  • [May 9] Connection-oriented transport: TCP
  • [May 14] Connection-oriented transport: TCP (cont'd)
  • [May 16] TCP congestion control
May 07, 2013, at 10:08 PM EST by 121.181.93.122 -
Added line 55:
  • [May 7] Transport layer: rtd3.0 & pipelining
May 07, 2013, at 10:07 PM EST by 121.181.93.122 -
Changed lines 54-55 from:
  • [May 2] No class (JCCI)
to:
  • [May 2] No class (JCCI)
  • [May 31] Makeup class (1:30 pm)
Changed line 29 from:
to:
Changed line 29 from:
to:
April 24, 2013, at 11:13 PM EST by 121.181.93.122 -
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. (due: April 25)
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)
April 24, 2013, at 11:12 PM EST by 121.181.93.122 -
Changed line 54 from:
  • [May 2] No class ()
to:
  • [May 2] No class (JCCI)
April 24, 2013, at 11:11 PM EST by 121.181.93.122 -
Changed lines 48-54 from:
  • [April 11] Buffer overflow probability revisited
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 ()
April 14, 2013, at 06:15 PM EST by 121.181.93.122 -
Changed lines 47-48 from:
  • [April 4] Application layer (cont'd)
  • [April 4] Buffer overflow probability revisited
to:
  • [April 9] Application layer (cont'd)
  • [April 11] Buffer overflow probability revisited
April 14, 2013, at 06:15 PM EST by 121.181.93.122 -
Changed lines 46-48 from:
  • [April 4] Application layer
to:
  • [April 4] Application layer
  • [April 4] Application layer (cont'd)
  • [April 4] Buffer overflow probability revisited
April 14, 2013, at 06:13 PM EST by 121.181.93.122 -
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)
April 14, 2013, at 06:10 PM EST by 121.181.93.122 -
Added line 26:
  • Midterm exam is scheduled on April 25 in our class hour.
April 09, 2013, at 12:49 AM EST by 121.181.93.122 -
April 09, 2013, at 12:49 AM EST by 121.181.93.122 -
Changed line 28 from:
  • Paper reading assignment 1 ( There will be related problems in the final exam.)
to:
  • Paper reading assignment 1 (There will be related problems in the final exam.)
April 09, 2013, at 12:49 AM EST by 121.181.93.122 -
Changed line 28 from:
  • Paper reading assignment 1 ( There will be related problems in the final exam.)
to:
  • Paper reading assignment 1 ( There will be related problems in the final exam.)
April 09, 2013, at 12:48 AM EST by 121.181.93.122 -
Changed line 28 from:
  • Paper reading assignment 1 (There will be related problems in the final exam.)
to:
  • Paper reading assignment 1 ( There will be related problems in the final exam.)
April 09, 2013, at 12:48 AM EST by 121.181.93.122 -
Changed line 28 from:
  • Paper reading assignment 1 (There will be related problems in the midterm.)
to:
  • Paper reading assignment 1 (There will be related problems in the final exam.)
April 09, 2013, at 12:47 AM EST by 121.181.93.122 -
Changed lines 43-44 from:
  • [April 2] Introduction to queueing theory: M/M/1 queue
to:
  • [April 2] Introduction to queueing theory: M/M/1 queue
  • [April 4] Application layer
April 02, 2013, at 06:49 PM EST by 121.181.93.122 -
Changed lines 42-43 from:
  • [March 28] Introduction to queueing theory: Little's Law
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 line 27:
Deleted line 26:
Added lines 26-27:
  • Assignment 1: Problems 2, 3, 5, 6, 10, 11, 15, 17, 24, 26 in Chapter 1 (due: April 4)
March 27, 2013, at 04:04 PM EST by 121.181.93.122 -
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.
March 27, 2013, at 04:04 PM EST by 121.181.93.122 -
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.
March 27, 2013, at 04:04 PM EST by 121.181.93.122 -
Deleted lines 25-26:
March 27, 2013, at 04:02 PM EST by 121.181.93.122 -
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:
March 27, 2013, at 04:01 PM EST by 121.181.93.122 -
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)

March 27, 2013, at 02:56 AM EST by 121.181.93.122 -
Changed line 28 from:
  • Paper presentation 2
to:
  • Paper reading assignment 1 (There will be related problems in the midterm.)
Changed lines 30-31 from:

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.

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. 
March 27, 2013, at 02:50 AM EST by 121.181.93.122 -
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.
March 27, 2013, at 02:49 AM EST by 121.181.93.122 -
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.

March 27, 2013, at 02:48 AM EST by 121.181.93.122 -
Changed lines 34-36 from:
  • [March 21] Introduction to queueing theory
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
March 27, 2013, at 02:46 AM EST by 121.181.93.122 -
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
  • [March 12] 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
March 07, 2013, at 10:37 PM EST by 121.181.93.122 -
Changed lines 28-29 from:
  • [Mar. 5] Overview of the state-of-the-art of networking
  • [Mar. 7] Introduction to computer networking
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:
  *  The ppt slides for queueing theory lectures is available   here
to:
  *  The ppt slides for queueing theory lectures are available   here
Changed line 15 from:
  * Powerpoint slides can be downloaded at    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 20 from:
  * The ppt slides for queueing theory lectures is available here
to:
  *  The ppt slides for queueing theory lectures is available   here
Changed line 20 from:
  *  The ppt slides for queueing theory lectures is available here
to:
  * The ppt slides for queueing theory lectures is available here
Changed lines 19-21 from:
to:
  • Introduction to queueing theory
    • The ppt slides for queueing theory lectures is available here
Changed lines 26-27 from:
  • Introduction to queueing theory
    • The ppt slides for queueing theory lectures is available here
to:
Changed line 25 from:
  * The ppt slide for queueing theory lectures is available here
to:
  * The ppt slides for queueing theory lectures is available here
Changed line 15 from:
  * Powerpoint slides can be downloaded at   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:
  * Powerpoint Slides can be downloaded at   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:
  * (Powerpoint Slides can be downloaded at)   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:
  * Powerpoint Slides can be downloaded at 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:
  * 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:
  * ddd
to:
  * Powerpoint Slides can be downloaded http://www-net.cs.umass.edu/kurose-ross-ppt-6e/
Changed line 15 from:
  • ddd
to:
  * ddd
Added line 15:
  • ddd
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 here
Added lines 1-24:
History - Print - Recent Changes - Search
Page last modified on March 05, 2014, at 02:50 AM EST