Recent Changes - Search:

HomePage

Menu

Site Map

Spring 2014

Lectures.Spring2014 History

Hide minor edits - Show changes to output

Changed lines 73-74 from:
* [June 10] Switched LAN, data center networking
*
[June 12] Wrap up
to:
* [June 10] Multiple access (cont'd),
*
[June 12] CSMA in wireless networks and wrap up
June 06, 2014, at 01:33 PM EST by 114.199.60.69 -
Added lines 39-41:
* 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)
June 06, 2014, at 01:23 PM EST by 114.199.60.69 -
Changed lines 66-72 from:
* [May 27] Routing algorithms
to:
* [May 27] Routing algorithms
* [May 29] Routing in the Internet
* [June 3] Link Layer: Introduction, error-detection
* [June 5] Multiple access
* [June 10] Switched LAN, data center networking
* [June 12] Wrap up
* [June 17] Final exam
Changed lines 64-66 from:
* [May 20] No class ([[http://www.ieeevtc.org/vtc2014spring/ | VTC 2014-Spring]])
to:
* [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 19, 2014, at 12:52 AM EST by 114.199.60.69 -
Changed line 64 from:
%%* [May 20] No class ([[http://www.ieeevtc.org/vtc2014spring/ | VTC 2014-Spring]])
to:
* [May 20] No class ([[http://www.ieeevtc.org/vtc2014spring/ | VTC 2014-Spring]])
May 19, 2014, at 12:52 AM EST by 114.199.60.69 -
Changed line 64 from:
* [May 20] No class ([[http://www.ieeevtc.org/vtc2014spring/ | VTC 2014-Spring]])
to:
%%* [May 20] No class ([[http://www.ieeevtc.org/vtc2014spring/ | VTC 2014-Spring]])
May 19, 2014, at 12:48 AM EST by 114.199.60.69 -
Added line 38:
* Assignment 5: Problems 12, 15, 26, 32, 40, 44, 45, 49, 52, 53 in Chapter 3 (due: May 29)
May 19, 2014, at 12:29 AM EST by 114.199.60.69 -
Changed lines 61-63 from:
* [May 13] TCP congestion control
to:
* [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]])
Changed lines 58-61 from:
* [April 29, May 1] No class ([[http://infocom2014.ieee-infocom.org/| Infocom 2014]])
to:
* [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
Changed line 56 from:
* [April 22] TCP (makeup class in the midterm exam week)
to:
* [April 22] Connection-oriented transport: TCP (makeup class in the midterm exam week)
Changed line 58 from:
* [April 29, May 2] No class ([[http://infocom2014.ieee-infocom.org/| Infocom 2014]])
to:
* [April 29, May 1] No class ([[http://infocom2014.ieee-infocom.org/| Infocom 2014]])
Changed lines 57-58 from:
* [April 24] Midterm exam
to:
* [April 24] Midterm exam
* [April 29, May 2] No class ([[http://infocom2014.ieee-infocom.org/| Infocom 2014]])
Changed line 56 from:
* [April 22] TCP
to:
* [April 22] TCP (makeup class in the midterm exam week)
Changed lines 53-57 from:
* [April 10] Application layer (cont'd) (Class begins at 1 pm)
to:
* [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] TCP
* [April 24] Midterm exam
Changed line 38 from:
* Paper reading assignment 1 (%font color=red%There will be related problems in the {-midterm%font color=red%-} final exam.%font color=black%)
to:
* Paper reading assignment 1 (%font color=red%There will be related problems in the {-midterm-} final exam.%font color=black%)
Changed line 38 from:
* Paper reading assignment 1 (%font color=red%There will be related problems in the {-%font color=black%midterm%font color=red%-} final exam.%font color=black%)
to:
* Paper reading assignment 1 (%font color=red%There will be related problems in the {-midterm%font color=red%-} final exam.%font color=black%)
Changed line 38 from:
* Paper reading assignment 1 (%font color=red%There will be related problems in the {-midterm-} final exam.%font color=black%)
to:
* Paper reading assignment 1 (%font color=red%There will be related problems in the {-%font color=black%midterm%font color=red%-} final exam.%font color=black%)
Changed line 38 from:
* Paper reading assignment 1 (%font color=red%There will be related problems in the midterm exam.%font color=black%)
to:
* Paper reading assignment 1 (%font color=red%There will be related problems in the {-midterm-} final exam.%font color=black%)
Changed line 24 from:
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.\\\
to:
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.\\\
Added line 36:
* 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.
Deleted line 37:
* 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.
Deleted line 36:
Added lines 36-37:
* [[ Assignment 4 | Assignment 4: Socket programming]] (due: April 24)
Deleted line 40:
* [[ Assignment 4 | Assignment 4: Socket programming]] (due: April 24)
Added line 39:
* [[ Assignment 4 | Assignment 4: Socket programming]] (due: April 24)
Changed lines 51-52 from:
* [April 8] Application layer (cont'd)
to:
* [April 8] Application layer (cont'd)
* [April 10] Application layer (cont'd) (Class begins at 1 pm
)
Changed lines 50-51 from:
* [April 3] Application layer
to:
* [April 3] Application layer
* [April 8] Application layer (cont'd)
Changed line 35 from:
* Assignment 3: One fast server vs. multiple slow servers
to:
* Assignment 3: One fast server vs. multiple slow servers (due: April 10)
Changed lines 35-36 from:
* Assignment 3:
*
to:
* Assignment 3: One fast server vs. multiple slow servers
* 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.
Changed line 36 from:
*
to:
*
Added lines 35-36:
* Assignment 3:
*
Changed lines 47-48 from:
* [April 1] No class
to:
* [April 1] No class
* [April 3] Application layer
Changed lines 46-47 from:
* [March 27] Introduction to queueing theory: M/M/1 queue
to:
* [March 27] Introduction to queueing theory: M/M/1 queue
* [April 1] No class
Changed lines 44-46 from:
* [March 20] Introduction to queueing theory: Definition and basic notation of queues & key components of queues
to:
* [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
Changed line 35 from:
* Paper reading assignment 2 (%font color=red%There will be related problems in the midterm exam.%font color=black%)
to:
* Paper reading assignment 1 (%font color=red%There will be related problems in the midterm exam.%font color=black%)
Added lines 35-36:
* Paper reading assignment 2 (%font color=red%There will be related problems in the midterm 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 32 from:
'''Announcement:''' \\
to:
'''Announcement:'''
Changed lines 33-34 from:
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%)
to:
* 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)
Changed lines 39-41 from:
* [March 13] Introduction to computer networking: Delay, loss, and throughput & protocol layers (cont'd)
to:
* [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: Definition and basic notation of queues & key components of queues
Changed line 33 from:
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-} March 20)
to:
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%)
Changed line 33 from:
Assignment 1: Two questions on Page 30 of lecture slides of Chapter 1 and carry out simulation (due: {-March 18-}, March 20)
to:
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-} March 20)
Changed line 33 from:
Assignment 1: Two questions on Page 30 of lecture slides of Chapter 1 (due: March 18)
to:
Assignment 1: Two questions on Page 30 of lecture slides of Chapter 1 and carry out simulation (due: {-March 18-}, March 20)
Changed line 33 from:
Assignment 1: Two questions on Page 30 (lecture slides of Chapter 1) (due: March 18)
to:
Assignment 1: Two questions on Page 30 of lecture slides of Chapter 1 (due: March 18)
Changed line 33 from:
Assignment 1: Two questions on Page 30 (lecture slides of Chapter 1).
to:
Assignment 1: Two questions on Page 30 (lecture slides of Chapter 1) (due: March 18)
Changed line 32 from:
'''Announcement:'''
to:
'''Announcement:''' \\
Changed line 33 from:
to:
Assignment 1: Two questions on Page 30 (lecture slides of Chapter 1).
Added lines 38-39:
* [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)
Changed lines 13-17 from:
'''Grading: '''\\
30% - Midterm exam \\
40% - Final exam \\
30% - Homework
to:
Added lines 25-30:

'''Grading: '''\\
30% - Midterm exam \\
40% - Final exam \\
30% - Homework
Changed lines 14-16 from:
Midterm exam 30% \\
Final
exam 40% \\
Homework
30%
to:
30% - Midterm exam \\
40% - Final exam \\
30% - Homework
Changed lines 14-15 from:
Midterm exam 30%
Final exam 40%
to:
Midterm exam 30% \\
Final
exam 40% \\
Added lines 12-16:

'''Grading: '''\\
Midterm exam 30%
Final exam 40%
Homework 30%
Changed line 23 from:
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.\\\
to:
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.\\\
Changed lines 28-29 from:
'''Lectures:''' \\
* [March 4] Introduction to computer networking: Network edge \\
to:
'''Lectures:'''
* [March 4] Introduction to computer networking: Network edge
Changed lines 29-30 from:
[March 4] Introduction to computer networking: Network edge \\
[March 6] Introduction to computer networking: Network core
to:
* [March 4] Introduction to computer networking: Network edge \\
* [March 6] Introduction to computer networking: Network core
Changed line 28 from:
'''Lectures:'''
to:
'''Lectures:''' \\
Changed line 29 from:
[March 4] Introduction to computer networking: Network edge
to:
[March 4] Introduction to computer networking: Network edge \\
Added lines 29-30:
[March 4] Introduction to computer networking: Network edge
[March 6] Introduction to computer networking: Network core
Added lines 1-28:
(: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 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:'''
History - Print - Recent Changes - Search
Page last modified on March 06, 2016, at 07:08 PM EST