Recent Changes - Search:

HomePage

Menu

Site Map

Spring 2011

Lectures.Spring2011 History

Hide minor edits - Show changes to markup

Changed line 51 from:
  * The ppt slide for queueing theory lectures is available here. 
to:
  * The ppt slide for queueing theory lectures is available here 
Changed line 51 from:
  * The ppt slide for queueing theory lectures is available at here. 
to:
  * The ppt slide for queueing theory lectures is available here. 
April 05, 2012, at 07:23 PM EST by 121.181.93.122 -
Changed line 10 from:

Prof. Kyung-Joon Park\\

to:

Kyung-Joon Park\\

March 13, 2012, at 03:54 AM EST by 121.181.93.122 -
Changed line 5 from:

IC531: Computer Networks (Spring 2011)

to:

IC531: Communication Networks (Spring 2011)

Changed lines 28-29 from:
 * C. Dovrolis, P. Ramanathan, D. Moore, "What do packet dispersion techniques measure?," Infocom 2001
 * M. Jain and C. Dovrolis, "End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput," Sigcomm 2002 
to:
  * C. Dovrolis, P. Ramanathan, D. Moore, "What do packet dispersion techniques measure?," Infocom 2001
  * M. Jain and C. Dovrolis, "End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput," Sigcomm 2002 
Changed lines 28-29 from:
  * C. Dovrolis, P. Ramanathan, D. Moore, "What do packet dispersion techniques measure?," Infocom 2001
  * M. Jain and C. Dovrolis, "End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput," Sigcomm 2002 
to:
 * C. Dovrolis, P. Ramanathan, D. Moore, "What do packet dispersion techniques measure?," Infocom 2001
 * M. Jain and C. Dovrolis, "End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput," Sigcomm 2002 
Changed line 14 from:
  • Computer Networking: A Top-down approach featuring the Internet, by J. Kurose and K. Ross, Addison-Wesley
to:
  • Computer Networking: A Top-Down Approach Featuring the Internet, by J. Kurose and K. Ross, Addison-Wesley
Changed line 55 from:
  • [April 22] Paper presentation (makeup class )
to:
  • [April 22] Paper presentation (makeup class)
Changed line 58 from:
  • [May 3] Midterm exam (one A4 cheat sheet allowed)
to:
  • [May 3] Midterm exam (one A4 cheat sheet allowed)
Changed line 65 from:
  • [May 31] No class
to:
  • [May 31] No class
Changed line 67 from:
  • [June 3] Network layer (makeup class )
to:
  • [June 3] Network layer (makeup class)
Changed line 53 from:
  • [April 12, 14] No class (infocom 2011)
to:
  • [April 12, 14] No class (infocom 2011)
Changed line 55 from:
  • [April 22] Paper presentation ( makeup class )
to:
  • [April 22] Paper presentation (makeup class )
Changed line 57 from:
  • [April 29] Transport layer ( makeup class)
to:
  • [April 29] Transport layer (makeup class)
Changed line 67 from:
  • [June 3] Network layer ( makeup class )
to:
  • [June 3] Network layer (makeup class )
Added line 73:
Changed line 49 from:
  • [April 1] Introduction to queueing theory (makeup class)
to:
  • [April 1] Introduction to queueing theory (makeup class)
Changed line 51 from:
  * The ppt slide for queueing theory lectures is available at . 
to:
  * The ppt slide for queueing theory lectures is available at here. 
Changed line 53 from:
  • [April 12, 14] No class (infocom 2011)
to:
  • [April 12, 14] No class (infocom 2011)
Changed line 55 from:
  • [April 22] Paper presentation (makeup class)
to:
  • [April 22] Paper presentation ( makeup class )
Changed line 57 from:
  • [April 29] Transport layer (makeup class)
to:
  • [April 29] Transport layer ( makeup class)
Changed lines 60-62 from:
  • [May 13] Transport layer (makeup class)
  • [May 17] No class
  • [May 19] No class (CPS Day@DGIST with Profs. John Stankovic, Insup Lee, and Rong Zheng)
to:
  • [May 13] Transport layer (makeup class)
  • [May 17] No class
  • [May 19] No class (CPS Day@DGIST with Profs. John Stankovic, Insup Lee, and Rong Zheng)
Changed lines 64-65 from:
  • [May 26] Transport layer, network layer (makeup class)
  • [May 31] ] No class
to:
  • [May 26] Transport layer, network layer (makeup class)
  • [May 31] No class
Changed lines 68-70 from:
  • [June 7] Link layer
  • [June 9] No class
  • [June 13] Link layer (makeup class)
to:
  • [June 7] Link layer
  • [June 9] No class
  • [June 13] Link layer (makeup class)
Changed line 67 from:
  • [June 3] Network layer (makeup class)
to:
  • [June 3] Network layer ( makeup class )
Changed line 45 from:
  • [Mar. 15, 17] [ No class] (reserved forces military training)
to:
  • [Mar. 15, 17] No class (reserved forces military training)
Changed line 45 from:
  • [Mar. 15, 17] No class (reserved forces military training)
to:
  • [Mar. 15, 17] [ No class] (reserved forces military training)
Changed line 45 from:
  • [Mar. 15, 17] No class (reserved forces military training)
to:
  • [Mar. 15, 17] No class (reserved forces military training)
Changed line 51 from:
  * The ppt slide for queueing theory lectures is available at here. 
to:
  * The ppt slide for queueing theory lectures is available at . 
Changed line 10 from:

Prof. Kyung-Joon Park

to:

Prof. Kyung-Joon Park\\

Changed lines 43-86 from:
  • [Sep. 1] Introduction to cyber-physical systems
  • [Sep. 6, 8] Introduction to feedback and control
  • [Sep. 9] System modeling (3-hour makeup class)
  • [Sep. 13] No class (Chuseok!)
  • [Sep. 15] Examples
  • [Sep. 20, 22, 27] No class (MobiCom 2011)
  • [Sep. 29] Examples
  • [Oct. 4, 6] Discrete dynamics, review of Fourier & Laplace transform
  • [Oct. 11, 13] Review of Fourier & Laplace transform
  • [Oct. 18, 20] Hybrid systems
  • [Oct. 25] Review of assignments
  • [Oct. 27] Midterm
  • [Nov. 1, 3] Review of midterm, overview of real-time systems
  • [Nov. 8] No class (graduate school interview)
  • [Nov. 10] Overview of real-time systems
  • [Nov. 15] No class (reserved forces military training)
  • [Nov. 17] No class (IDW 2011)
  • [Nov. 21] Rate monotoic scheduling (presenter: 윤종완, 3-hour makeup class)
  • [Nov. 22] Deadline monotonic scheduling (presenter: 손성화)
  • [Nov. 25] Earliest deadline first (EDF) scheduling (presenter: 나호경)
  • [Nov. 29] Least slack first (LSF) scheduling (presenter: 박호민), priority inversion & priority inheritance protocol (presenter: 윤희정)
  • [Dec. 1] Priority ceiling protocol (presenter: 김진욱)
  • [Dec. 6] Aperiodic scheduling (presenter: 윤솔)
  • [Dec. 8] Aperiodic scheduling cont'd (presenter: 윤솔)
  • [Dec. 13] Rate monotonic scheduling algorithm: Exact characterization and average case behavior (presenter: 신상식)
  • [Dec. 15] Final

Reading List:
Real-time Systems

  • Rate monotonic scheduling
    • C. L. Liu and J.W. Layland, “Scheduling algorithms for multiprogramming in a hard real-time environment”, Journal of the ACM, 1973
    • J. Lehoczky et al, “The Rate Monotonic Scheduling Algorithm: Exact Characterization And Average Case Behavior”, In Proceedings of the IEEE Real-Time Systems Symposium, 1989
  • Deadline monotonic scheduling
    • N. C. Audsley, A. Burns, M. F. Richardson, and A. J. Welling, “Hard Real-Time Scheduling: The Deadline Monotonic Approach”, In the Proceedings of IEEE Workshop on Real-Time Operating Systems, 1992
  • Earliest deadline first / least slack first scheduling
    • C. L. Liu and J. W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment”, Journal of the ACM, 1973
    • S. K. Baruah, L.E.Rosier, and R.R. Howell, “Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor”, Journal of Real-time Systems, 1990
    • K. Jeffay and D.L. Stone, “Accounting for interrupt handling costs in dynamic priority task systems”, RTSS, 1993
  • Priority ceiling protocol
    • L. Sha et. al., “Priority Inheritance Protocols : An Approach to Real-Time Synchronization”, IEEE Transactions on Computers, 39(9), 1990
  • Aperiodic task scheduling
    • J. K. Strosnider, J. P. Lehoczky and L. Sha: “The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments”, IEEE Transactions on Computers, Vol. 44, No. 1, pp. 73-91, January 1995.
    • B. Sprunt, L. Sha, and J. Lehoczky: “Aperiodic Task Scheduling for Hard Real-Time System”, Journal of Real-Time Systems, pp. 27-60, June 1989
to:
  • [Mar. 3] Overview of the state-of-the-art of networking
  • [Mar. 8, 10] Introduction to computer networking
  • [Mar. 15, 17] No class (reserved forces military training)
  • [Mar. 22] Introduction to computer networking
  • [Mar. 24] Application layer
  • [Mar. 29, 31] Introduction to queueing theory
  • [April 1] Introduction to queueing theory (makeup class)
  • [April 5] Introduction to queueing theory
    • The ppt slide for queueing theory lectures is available at here.
  • [April 7] Application layer
  • [April 12, 14] No class (infocom 2011)
  • [April 19, 21] Transport layer
  • [April 22] Paper presentation (makeup class)
  • [April 26, 28] Transport layer
  • [April 29] Transport layer (makeup class)
  • [May 3] Midterm exam (one A4 cheat sheet allowed)
  • [May 12] Transport layer
  • [May 13] Transport layer (makeup class)
  • [May 17] No class
  • [May 19] No class (CPS Day@DGIST with Profs. John Stankovic, Insup Lee, and Rong Zheng)
  • [May 24] Transport layer
  • [May 26] Transport layer, network layer (makeup class)
  • [May 31] ] No class
  • [June 2] Network layer
  • [June 3] Network layer (makeup class)
  • [June 7] Link layer
  • [June 9] No class
  • [June 13] Link layer (makeup class)
  • [June 14] Paper presentation
  • [June 16] Final exam
Changed line 19 from:

Course Description:

to:

Course Description: \\

Changed line 9 from:

Instructor:

to:

Instructor: \\

Changed lines 9-10 from:

Instructor:
Prof. Kyung-Joon Park\\

to:

Instructor: Prof. Kyung-Joon Park

Changed line 19 from:

Course Description: \\

to:

Course Description:

Changed line 22 from:

Announcement:\\

to:

Announcement:

Changed line 27 from:

Paper presentation 1

to:
  • Paper presentation 1
Changed lines 23-32 from:

Exam 60%, Paper Presentation 20%, Homework & Project 20%

Announcement:

  • Assignment 1: Problem 1.4 in Feedback Systems (due: Sep. 29)
  • Assignment 2: Plot Fig. 2.7 in Feedback Systems by using Matlab (due: Sep. 29)
  • Assignment 3: Problems 2.2 and 2.3 in Feedback Systems (due: Oct. 4)
  • Assignment 4: Read Chapters 2 and 3, and solve Problems 2.6 and 3.4 in Introduction to Embedded Systems (due: Oct. 20)
  • The midtem exam is scheduled at 1:00 pm on Oct. 27.
  • The final exam is scheduled at 1:00 pm on Dec. 15. \\\
to:
  • The midtem exam is scheduled at 3:30 pm on May 3.
  • Please read this article before doing your homework.
  • Assignment 1: Discuss the key difference between the transmission delay in circuit-switched networks and that in packet-switched networks (due: Mar. 22)
  • Assignment 2: Problems 2, 3, 5, 6, 10, 11, 15, 17, 24, 26 in Chapter 1 (due: April 7)

Paper presentation 1

  * C. Dovrolis, P. Ramanathan, D. Moore, "What do packet dispersion techniques measure?," Infocom 2001
  * M. Jain and C. Dovrolis, "End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput," Sigcomm 2002 
  * K.-J. Park, H. Lim, and C.-H. Choi, "Stochastic analysis of packet-pair probing for network bandwidth estimation," Computer Networks 2006 
  • Assignment 3: Problems 1, 11, 15, 16, 18 in Chapter 2 (due: April 26)
  • Team project
    • Socket programming assignment 2: Mail client at the end of Chapter 2 (due: May 12)
  • 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.
  • Assignment 4: Problems 4, 6, 12, 32, 33, 38, 40 in Chapter 3 (due: June 7)
  • Assignment 5: Problems 7, 11, 14, 19, 20, 23, 25 in Chapter 4 (due: June 16)
  • The final is scheduled at 3 pm on June 16.
Deleted lines 18-19:

Feedback Systems: An Introduction for Scientists and Engineers, K. J. Åström and R. M. Murray, Princeton University Press, 2008.

Changed lines 20-21 from:

A cyber-physical system (CPS) is a system featuring a tight combination of, and coordination between, the system’s computational and physical elements. Various cyber physical systems (CPS) has been being developed and used such as automobiles, smart grid systems, embedded systems, and robotic systems. The CPS is mainly composed of the physical processing component and the computing devices, and the two components are connected to each other through wired and wireless communication networks. This lecture focuses on three key components of physical system model, real-time computing and scheduling, and communication and networking for CPSs.

Grading policies:\\

to:

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

Changed lines 5-6 from:

IC531: Communication Networks (Spring 2011)

to:

IC531: Computer Networks (Spring 2011)

Changed line 17 from:
  * D. Bertsekas and R. Gallager, Data Networks, 2nd Edition, Prentice-Hall, 1992 (freely available at http://web.mit.edu/dimitrib/www/datanets.html). 
to:
  * D. Bertsekas and R. Gallager, Data Networks, 2nd Edition, Prentice-Hall, 1992 (freely available at http://web.mit.edu/dimitrib/www/datanets.html). 
Changed line 5 from:

IC531: Computer Networks (Spring 2011)

to:

IC531: Communication Networks (Spring 2011)

Added line 17:
  * D. Bertsekas and R. Gallager, Data Networks, 2nd Edition, Prentice-Hall, 1992 (freely available at http://web.mit.edu/dimitrib/www/datanets.html). 
Changed lines 14-15 from:
  • Introduction to Embedded Systems: A Cyber-Physical Systems Approach, E. A. Lee and S. A. Seshia, LeeSeshia.org, ISBN 978-0-557-70857-4, 2011.
  • Feedback Systems: An Introduction for Scientists and Engineers, K. J. Åström and R. M. Murray, Princeton University Press, 2008.\\\
to:
  • 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

Feedback Systems: An Introduction for Scientists and Engineers, K. J. Åström and R. M. Murray, Princeton University Press, 2008.\\\

Added lines 1-75:
History - Print - Recent Changes - Search
Page last modified on March 07, 2013, at 12:25 PM EST